乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T05:09:12Z","timestamp":1734066552089,"version":"3.30.2"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1016\/j.asoc.2024.112494","type":"journal-article","created":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T23:28:25Z","timestamp":1732663705000},"page":"112494","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["GRASP with Evolutionary Path Relinking for the conditional p<\/mml:mi><\/mml:math>-Dispersion problem"],"prefix":"10.1016","volume":"168","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1702-4941","authenticated-orcid":false,"given":"Jes\u00fas","family":"S\u00e1nchez-Oro","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9995-010X","authenticated-orcid":false,"given":"Anna","family":"Mart\u00ednez-Gavara","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3022-3865","authenticated-orcid":false,"given":"Ana D.","family":"L\u00f3pez-S\u00e1nchez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7265-823X","authenticated-orcid":false,"given":"Rafael","family":"Mart\u00ed","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4532-3124","authenticated-orcid":false,"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.asoc.2024.112494_b1","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/j.ejor.2021.07.044","article-title":"A review on discrete diversity and dispersion maximization from an OR perspective","volume":"299","author":"Mart\u00ed","year":"2022","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.asoc.2024.112494_b2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1111\/j.1538-4632.1987.tb00133.x","article-title":"Programming models for facility dispersion: The p-Dispersion and maxisum dispersion problems","volume":"19","author":"Kuby","year":"1987","journal-title":"Geogr. Anal."},{"issue":"1","key":"10.1016\/j.asoc.2024.112494_b3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0377-2217(90)90297-O","article-title":"The discrete p-Dispersion problem","volume":"46","author":"Erkut","year":"1990","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2024.112494_b4","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/j.ejor.2020.07.053","article-title":"Measuring diversity. A review and an empirical analysis","volume":"289","author":"Parre\u00f1o","year":"2021","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.asoc.2024.112494_b5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10898-020-00962-4","article-title":"The conditional p-Dispersion problem","volume":"81","author":"Cherkesly","year":"2021","journal-title":"J. Global Optim."},{"issue":"3","key":"10.1016\/j.asoc.2024.112494_b6","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0377-2217(89)90420-7","article-title":"Analytical models for locating undesirable facilities","volume":"40","author":"Erkut","year":"1989","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2024.112494_b7","first-page":"34","article-title":"A multiobjective model for locating solid waste transfer facilities using an empirical opposition function","volume":"33","author":"Rahman","year":"1995","journal-title":"INFOR Inf. Syst. Oper. Res."},{"key":"10.1016\/j.asoc.2024.112494_b8","doi-asserted-by":"crossref","first-page":"149402","DOI":"10.1109\/ACCESS.2020.3016724","article-title":"Social distancing as p-Dispersion problem","volume":"8","author":"Kudela","year":"2020","journal-title":"IEEE Access"},{"issue":"2","key":"10.1016\/j.asoc.2024.112494_b9","first-page":"134","article-title":"Decremental clustering for the solution of p-Dispersion problems to proven optimality","volume":"2","author":"Contardo","year":"2020","journal-title":"Inf. J. Optim."},{"issue":"11","key":"10.1016\/j.asoc.2024.112494_b10","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1016\/0307-904X(95)00083-V","article-title":"A discrete optimization model for preserving biological diversity","volume":"19","author":"Glover","year":"1995","journal-title":"Appl. Math. Model."},{"issue":"1","key":"10.1016\/j.asoc.2024.112494_b11","first-page":"109","article-title":"Heuristic algorithms for the maximum diversity problem","volume":"19","author":"Glover","year":"1998","journal-title":"J. Inf. Optim. Sci."},{"issue":"3","key":"10.1016\/j.asoc.2024.112494_b12","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1111\/j.1475-3995.2005.497_1.x","article-title":"Maximum diversity\/similarity models with extension to part grouping","volume":"12","author":"Adil","year":"2005","journal-title":"Int. Trans. Oper. Res."},{"issue":"6","key":"10.1016\/j.asoc.2024.112494_b13","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1057\/palgrave.jors.2600510","article-title":"An empirical comparison of heuristic methods for creating maximally diverse groups","volume":"49","author":"Weitz","year":"1998","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"10.1016\/j.asoc.2024.112494_b14","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/S0305-0483(97)00007-8","article-title":"An empirical comparison of heuristic and graph theoretic methods for creating maximally diverse groups, VLSI design, and exam scheduling","volume":"25","author":"Weitz","year":"1997","journal-title":"Omega"},{"key":"10.1016\/j.asoc.2024.112494_b15","first-page":"1","article-title":"A reactive path relinking algorithm for solving the bi-objective p-Median and p-Dispersion problem","author":"Lozano-Osorio","year":"2023","journal-title":"Soft Comput."},{"year":"1997","series-title":"Tabu Search","author":"Glover","key":"10.1016\/j.asoc.2024.112494_b16"},{"issue":"3","key":"10.1016\/j.asoc.2024.112494_b17","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","article-title":"GRASP and path relinking for the max\u2013min diversity problem","volume":"37","author":"Resende","year":"2010","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2024.112494_b18","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","article-title":"GRASP and path relinking for 2-layer straight line crossing minimization","volume":"11","author":"Laguna","year":"1999","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"10.1016\/j.asoc.2024.112494_b19","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","article-title":"A hybrid heuristic for the p-Median problem","volume":"10","author":"Resende","year":"2004","journal-title":"J. Heuristics"},{"issue":"3","key":"10.1016\/j.asoc.2024.112494_b20","doi-asserted-by":"crossref","first-page":"8","DOI":"10.4018\/ijamc.2014070101","article-title":"Exterior path relinking for zero-one optimization","volume":"5","author":"Glover","year":"2014","journal-title":"Int. J. Appl. Metaheuristic Comput."},{"issue":"5","key":"10.1016\/j.asoc.2024.112494_b21","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","article-title":"A greedy randomized adaptive search procedure for maximum independent set","volume":"42","author":"Feo","year":"1994","journal-title":"Oper. Res."},{"key":"10.1016\/j.asoc.2024.112494_b22","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.116899","article-title":"Max\u2013min dispersion with capacity and cost for a practical location problem","volume":"200","author":"Lozano-Osorio","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2024.112494_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.119856","article-title":"Solution-based tabu search for the capacitated dispersion problem","volume":"223","author":"Lu","year":"2023","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"10.1016\/j.asoc.2024.112494_b24","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB \u2014 A traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA J. Comput."},{"key":"10.1016\/j.asoc.2024.112494_b25","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"Dem\u0161ar","year":"2006","journal-title":"J. Mach. Learn. Res."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494624012687?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494624012687?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T04:27:19Z","timestamp":1733977639000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494624012687"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":25,"alternative-id":["S1568494624012687"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2024.112494","relation":{},"ISSN":["1568-4946"],"issn-type":[{"type":"print","value":"1568-4946"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"GRASP with Evolutionary Path Relinking for the conditional -Dispersion problem","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2024.112494","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"112494"}}