{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:14:18Z","timestamp":1780766058591,"version":"3.54.1"},"reference-count":38,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0167-8191(00)00102-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:01:26Z","timestamp":1027609286000},"page":"201-222","source":"Crossref","is-referenced-by-count":68,"title":["Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms"],"prefix":"10.1016","volume":"27","author":[{"given":"C\u00e9sar","family":"Rego","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(00)00102-2_BIB1","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/opre.39.3.456","article-title":"Parallel savings based heuristic for the delivery problem","volume":"39","author":"Altinkemer","year":"1991","journal-title":"Oper. Res."},{"issue":"7","key":"10.1016\/S0167-8191(00)00102-2_BIB2","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1287\/mnsc.43.7.908","article-title":"Tabu search and ejection chains \u2013 application to a node weighted version of the cardinality-constrained TSP","volume":"43","author":"Cao","year":"1997","journal-title":"Manage. Sci."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB3","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02022999","article-title":"Massively parallel Tabu search for the quadratic assignment problem","volume":"41","author":"Chakrapani","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB4","unstructured":"N. Christofides, A. Mingozzi, P. Toth, in: N. Christofides, A. Mingozzi, P. Toth, C. Sandi (Eds.), The Vehicle Routing Problem. Combinatorial Optimisation, Wiley, Chichester, 1979, pp. 315\u2013338 (Chapter 11)"},{"key":"10.1016\/S0167-8191(00)00102-2_BIB5","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB6","unstructured":"T. Crainic, M. Toulouse, M. Gendreau, Towards a taxonomy of parallel Tabu search algorithms, Technical Report CRT-933, Centre de Recherche sur les Transports, Universit\u00e9 de Montr\u00e9al, 1993"},{"key":"10.1016\/S0167-8191(00)00102-2_BIB7","unstructured":"M. Desrochers, T. Verhoog, A matching based algorithm for the vehicle routing problem, Technical Report Cahier du GERAD G-89-04, Ecole de Haultes Etudes Commerciales de Montr\u00e9al, 1989"},{"key":"10.1016\/S0167-8191(00)00102-2_BIB8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/ijoc.6.2.141","article-title":"Fast clustering algorithms","volume":"6","author":"Dorndorf","year":"1994","journal-title":"ORSA J. Comput."},{"issue":"4","key":"10.1016\/S0167-8191(00)00102-2_BIB9","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","article-title":"Optimal solution of vehicle routing problems using minimum k-trees","volume":"42","author":"Fisher","year":"1994","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","article-title":"A generalized assignment heuristic for vehicle routing","volume":"11","author":"Fisher","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0167-8191(00)00102-2_BIB11","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","article-title":"Tabu search heuristic for the vehicle routing problem","volume":"40","author":"Gendreau","year":"1994","journal-title":"Manage. Sci."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB12","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","article-title":"A heuristic algorithm for the vehicle dispatch problem","volume":"22","author":"Gillett","year":"1974","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB13","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"5","author":"Glover","year":"1986","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/S0167-8191(00)00102-2_BIB14","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2013 part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"issue":"1","key":"10.1016\/S0167-8191(00)00102-2_BIB15","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search \u2013 part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","article-title":"Ejection chains, reference structures and alternating path methods for traveling salesman problems","volume":"65","author":"Glover","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB17","doi-asserted-by":"crossref","unstructured":"F. Glover, New ejection chain and alternating path methods for traveling salesman problems, Computer Science and Operations Research, 1992, pp. 449\u2013509","DOI":"10.1016\/B978-0-08-040806-4.50037-X"},{"key":"10.1016\/S0167-8191(00)00102-2_BIB18","unstructured":"F. Glover, Tabu search fundamentals and uses, Technical report, Graduate School of Business and Administration, University of Colorado at Boulder, 1995"},{"key":"10.1016\/S0167-8191(00)00102-2_BIB19","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.7.4.426","article-title":"Tabu thresholding: Improved search by nonmonotonic trajectories","volume":"7","author":"Glover","year":"1995","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB20","unstructured":"F. Glover, Multilevel Tabu search and embedded search neighborhoods for the traveling salesman problem, Technical Report, Graduate School of Business and Administration, University of Colorado at Boulder, 1996"},{"key":"10.1016\/S0167-8191(00)00102-2_BIB21","unstructured":"F. Glover, M. Laguna, in: C. Reeves (Ed.), Tabu Search, Blackwell Scientific Publications, Oxford, 1993, pp. 71\u2013140"},{"key":"10.1016\/S0167-8191(00)00102-2_BIB22","series-title":"Tabu Search","author":"Glover","year":"1997"},{"issue":"2","key":"10.1016\/S0167-8191(00)00102-2_BIB23","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1080\/002075499191760","article-title":"Efficient facility layout planning","volume":"37","author":"Glover","year":"1999","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB24","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02098280","article-title":"A new exact algorithm for the vehicle routing problem based on q-path and k-shortest path relaxations","volume":"61","author":"Hadjiconstantinou","year":"1996","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB25","unstructured":"F. Harche, P. Raghavan, A generalised exchange heuristic for the capacited vehicle routing problem, Technical report, Sterm School of Business, New York University, 1991"},{"key":"10.1016\/S0167-8191(00)00102-2_BIB26","unstructured":"R. Hubscher, F. Glover, Ejection chain methods and Tabu search for clustering, Technical report, Graduate School of Business and Administration, University of Colorado at Boulder, 1992"},{"key":"10.1016\/S0167-8191(00)00102-2_BIB27","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0377-2217(93)E0174-V","article-title":"Tabu search for multilevel generalized assignment problems","volume":"82","author":"Laguna","year":"1995","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB28","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02098290","article-title":"Routing problems: A bibliography","volume":"61","author":"Laporte","year":"1995","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB29","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1057\/jors.1976.95","article-title":"A sequential route-building algorithm employing a generalised savings criterion","volume":"27","author":"Mole","year":"1976","journal-title":"Oper. Res. Q."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB30","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","article-title":"Metastrategy simulated annealing and Tabu search algorithms for the vehicle routing problem","volume":"41","author":"Osman","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB31","unstructured":"C. Rego, Local search and neighborhood structures for vehicle routing problems: Sequential and parallel algorithms, Ph.D. thesis, PRiSM Laboratory, University of Versailles, 1996"},{"key":"10.1016\/S0167-8191(00)00102-2_BIB32","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/S0377-2217(97)00288-9","article-title":"Relaxed tours and path ejections for the traveling salesman problem","volume":"106","author":"Rego","year":"1998","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"10.1016\/S0167-8191(00)00102-2_BIB33","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1287\/mnsc.44.10.1447","article-title":"A subpath ejection method for the vehicle routing problem","volume":"44","author":"Rego","year":"1998","journal-title":"Manage. Sci."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB34","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1057\/jors.1996.29","article-title":"An improved petal heuristic for the vehicle routing problem","volume":"17","author":"Renaud","year":"1996","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB35","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","article-title":"Probabilistic diversification and intensification in local search for vehicle routing","volume":"1","author":"Rochat","year":"1995","journal-title":"J. Heuristics"},{"key":"10.1016\/S0167-8191(00)00102-2_BIB36","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0377-2217(84)90050-X","article-title":"A Lagrangian relaxation heuristic for vehicle routing","volume":"15","author":"Stewart","year":"1984","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0167-8191(00)00102-2_BIB37","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","article-title":"Parallel iterative search methods for vehicle routing problems","volume":"23","author":"Taillard","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0167-8191(00)00102-2_BIB38","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/trsc.30.4.379","article-title":"A network flow-based Tabu search heuristic for the vehicle routing problem","volume":"30","author":"Xu","year":"1996","journal-title":"Transp. Sci."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819100001022?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819100001022?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:21:22Z","timestamp":1556385682000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819100001022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0167819100001022"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(00)00102-2","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}