{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:05:55Z","timestamp":1761620755014},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5890,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0166-218x(96)00123-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"165-181","source":"Crossref","is-referenced-by-count":38,"title":["TSP ejection chains"],"prefix":"10.1016","volume":"76","author":[{"given":"Erwin","family":"Pesch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00123-0_BIB1","article-title":"Finding cuts in the TSP","author":"Applegate","year":"1994"},{"key":"10.1016\/S0166-218X(96)00123-0_BIB2","series-title":"Theory of Graphs and its Applications","author":"Berge","year":"1962"},{"key":"10.1016\/S0166-218X(96)00123-0_BIB3","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."},{"key":"10.1016\/S0166-218X(96)00123-0_BIB4","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","article-title":"New insertion and postoptimization procedures for the traveling salesman problem","volume":"40","author":"Gendreau","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00123-0_BIB5","series-title":"Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem","author":"Glover","year":"1991"},{"key":"10.1016\/S0166-218X(96)00123-0_BIB6","series-title":"Ejection chains, reference structures and alternating path methods for the traveling salesman problem","author":"Glover","year":"1992"},{"key":"10.1016\/S0166-218X(96)00123-0_BIB7","series-title":"Ejection chains and graph-related applications","author":"Glover","year":"1995"},{"key":"10.1016\/S0166-218X(96)00123-0_BIB8","series-title":"Proceedings of the 17th Colloquim on Automata, Languages, and Programming","first-page":"446","article-title":"Local optimization and the traveling salesman problem","author":"Johnson","year":"1990"},{"key":"10.1016\/S0166-218X(96)00123-0_BIB9","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1016\/0305-0548(94)90018-3","article-title":"A study of diversification strategies for the quadratic assignment problem","volume":"21","author":"Kelly","year":"1994","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(96)00123-0_BIB10","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0166-218X(92)00180-T","article-title":"Genetic local search in combinatorial optimization","volume":"48","author":"Kolen","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00123-0_BIB11","doi-asserted-by":"crossref","DOI":"10.1016\/0377-2217(93)E0174-V","article-title":"Tabu search for the multilevel generalized assignment problem","author":"Laguna","year":"1991"},{"key":"10.1016\/S0166-218X(96)00123-0_BIB12","series-title":"The traveling salesman problem","author":"Lawler","year":"1985"},{"key":"10.1016\/S0166-218X(96)00123-0_BIB13","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00123-0_BIB14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0167-6377(93)90001-W","article-title":"A modified Lin-Kernighan traveling-salesman heuristic","volume":"13","author":"Mak","year":"1993","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(96)00123-0_BIB15","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0166-218X(96)00123-0_BIB16","series-title":"Learning in Automated Manufacturing","author":"Pesch","year":"1994"},{"key":"10.1016\/S0166-218X(96)00123-0_BIB17","article-title":"An efficient implementation of ejection chain procedures for the vehicle routing problem","author":"Rego","year":"1994"},{"key":"10.1016\/S0166-218X(96)00123-0_BIB18","series-title":"The Traveling Salesman","author":"Reinelt","year":"1994"},{"key":"10.1016\/S0166-218X(96)00123-0_BIB19","series-title":"Solving vehicle routing problems using generalized assignments and tabu search","author":"Stewart","year":"1994"},{"key":"10.1016\/S0166-218X(96)00123-0_BIB20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BFb0029740","article-title":"Genetic local search algorithms for the traveling salesman problem","volume":"Vol. 496","author":"Ulder","year":"1991","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S0166-218X(96)00123-0_BIB21","series-title":"A robust network flow-based tabu search approach for the vehicle routing problem","author":"Xu","year":"1995"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96001230?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96001230?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:29:01Z","timestamp":1556130541000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96001230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0166218X96001230"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00123-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}