{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T12:36:42Z","timestamp":1778243802458,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s10589-005-4798-5","type":"journal-article","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T17:03:45Z","timestamp":1127840625000},"page":"231-257","source":"Crossref","is-referenced-by-count":70,"title":["Expanding Neighborhood GRASP for the Traveling Salesman Problem"],"prefix":"10.1007","volume":"32","author":[{"given":"Yannis","family":"Marinakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios","family":"Migdalas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4798_CR1","unstructured":"E. Aarts and J.K. Lenstra, Local Search in Combinatorial Optimization, Wiley and Sons, 1997."},{"key":"4798_CR2","first-page":"645","volume":"3","author":"D. Applegate","year":"1998","unstructured":"D. Applegate, R. Bixby, V. Chvatal, and W. Cook, \u201cOn the solution of traveling salesman problem,\u201d Documenta Mathematica: Proc. Int. Cogr. Mathematica, vol. 3, pp. 645\u2013656, 1998.","journal-title":"Documenta Mathematica: Proc. Int. Cogr. Mathematica"},{"key":"4798_CR3","doi-asserted-by":"crossref","unstructured":"D. Applegate, R. Bixby, V. Chvatal, and W. Cook, \u201cChained Lin-Kernighan for large traveling salesman problems,\u201d Informs Journal on Computing, (to appear).","DOI":"10.1287\/ijoc.15.1.82.15157"},{"issue":"6","key":"4798_CR4","first-page":"1","volume":"5","author":"R. Baralia","year":"2001","unstructured":"R. Baralia, J.I. Hildago, and R. Perego, \u201cA hybrid heuristic for the traveling salesman problem,\u201d IEEE Transactions on Evolutionary Computation, vol. 5, no. 6, pp. 1\u201341, 2001.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"4798_CR5","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"J.L. Bentley","year":"1992","unstructured":"J.L. Bentley, \u201cFast algorithms for geometric traveling salesman problems,\u201d ORSA J. Computing, vol. 4, pp. 387\u2013411, 1992.","journal-title":"ORSA J. Computing"},{"key":"4798_CR6","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"G. Clarke and J.W. Wright, \u201cScheduling of vehicles from a central depot to a number of delivery points\u201d, Operations Research, vol. 12, pp. 568\u2013581, 1964.","journal-title":"Operations Research"},{"key":"4798_CR7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"T.A. Feo and M.G.C. Resende, \u201cGreedy randomized adaptive search procedure,\u201d Journal of Global Optimization, vol. 6, pp. 109\u2013133, 1995.","journal-title":"Journal of Global Optimization"},{"key":"4798_CR8","volume-title":"Essays and Surveys on Metaheuristics","author":"P. Festa","year":"2001","unstructured":"P. Festa and M.G.C. Resende, \u201cGRASP: An annotated bibliography,\u201d in Essays and Surveys on Metaheuristics, C.C. Ribeiro and P. Hansen (Eds.), Kluwer Academic Publishers: Norwell, MA, 2001."},{"key":"4798_CR9","unstructured":"R. Garfinkel and G. Nemhauser, Integer Programming, Wiley and Sons, 1972."},{"key":"4798_CR10","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M. Gendreau","year":"1992","unstructured":"M. Gendreau, A. Hertz, and G. Laporte, \u201cNew insertion and postoptimization procedures for the traveling salesman problem,\u201d Operations Research, vol. 40, pp. 1086\u20131094, 1992.","journal-title":"Operations Research"},{"key":"4798_CR11","unstructured":"B.L. Golden and W.R. Stewart, \u201cEmpirical analysis of heuristics,\u201d in the Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E.L. Lawer, J.K. Lenstra, A.H.G. Rinnoy Kan and D.B. Shmoys (Eds.), Wiley and Sons, 1985, pp. 207\u2013249."},{"key":"4798_CR12","unstructured":"G. Gutin and A. Punnen, The Traveling Salesman Problem and Its Variations, Kluwer Academic Publishers Dordrecht, 2002."},{"key":"4798_CR13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"P. Hansen and N. Mladenovic, \u201cVariable neighborhood search: Principles and applications,\u201d European Journal of Operational Research, vol. 130, pp. 449\u2013467, 2001.","journal-title":"European Journal of Operational Research"},{"key":"4798_CR14","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K. Helsgaun","year":"2000","unstructured":"K. Helsgaun, \u201cAn effective implementation of the lin-Kernighan traveling salesman heuristic,\u201d European Journal of Operational Research, vol. 126, pp. 106\u2013130, 2000.","journal-title":"European Journal of Operational Research"},{"key":"4798_CR15","doi-asserted-by":"crossref","unstructured":"K. Holmqvist, A. Migdalas, and P.M. Pardalos, \u201cParallel continuous non-convex optimization,\u201d in Parallel Computing in Optimization, A. Migdalas, P.M. Pardalos, and S. Stor\u00f8y (Eds.), Kluwer Academic Publishers, 1997, pp. 471\u2013528.","DOI":"10.1007\/978-1-4613-3400-2_12"},{"key":"4798_CR16","doi-asserted-by":"crossref","unstructured":"K. Holmqvist, A. Migdalas, and P.M. Pardalos, \u201cParallelized heuristics for combinatorial search,\u201d in Parallel Computing in Optimization, A. Migdalas, P.M. Pardalos, and S. Stor\u00f8y (Eds.), Kluwer Academic Publishers, 1997, pp. 269\u2013294.","DOI":"10.1007\/978-1-4613-3400-2_8"},{"key":"4798_CR17","doi-asserted-by":"crossref","unstructured":"D.S. Johnson and L.A. McGeoch, \u201cThe traveling salesman problem: A case study,\u201d in Local Search in Combinatorial Optimization, E. Aarts and J.K. Lenstra (Eds.), Wiley and Sons, 1997, pp. 215\u2013310.","DOI":"10.2307\/j.ctv346t9c.13"},{"key":"4798_CR18","doi-asserted-by":"crossref","unstructured":"D.S. Johnson and L.A. McGeoch, \u201cExperimental Analysis of the STSP,\u201d in the Traveling Salesman Problem and Its Variations, G. Gutin and A. Punnen (Eds.), Kluwer Academic Publishers Dordrecht, 2002, pp. 369\u2013 444.","DOI":"10.1007\/0-306-48213-4_9"},{"key":"4798_CR19","doi-asserted-by":"crossref","unstructured":"D.S. Johnson and C.H. Papadimitriou, \u201cComputational complexity,\u201d in the Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E.L. Lawer, J.K. Lenstra, A.H.D. Rinnoy Kan and D.B. Shmoys (Eds.), Wiley and Sons, 1985, pp. 37\u201385.","DOI":"10.2307\/2582681"},{"key":"4798_CR20","doi-asserted-by":"crossref","unstructured":"M. Junger, G. Reinhelt, and G. Rinaldi, \u201cThe traveling salesman problem,\u201d in Networks Models, Handbooks in OR and MS, M. Ball et al. (Eds.), Elsevier Science B.V, 1995, vol. 7, pp. 225\u2013330.","DOI":"10.1016\/S0927-0507(05)80121-5"},{"key":"4798_CR21","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G. Laporte","year":"1992","unstructured":"G. Laporte, \u201cThe traveling salesman problem: An overview of exact and approximate algorithms,\u201d European Journal of Operational Research, vol. 59, pp. 231\u2013247, 1992.","journal-title":"European Journal of Operational Research"},{"key":"4798_CR22","doi-asserted-by":"crossref","unstructured":"E.L. Lawer, J.K. Lenstra, A.H.G. Rinnoy Kan, and D.B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley and Sons, 1985.","DOI":"10.2307\/2582681"},{"key":"4798_CR23","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"S. Lin, \u201cComputer solutions of the traveling salesman problem,\u201d Bell System Technical Journal, vol. 44, pp. 2245\u20132269, 1965.","journal-title":"Bell System Technical Journal"},{"key":"4798_CR24","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"S. Lin and B.W. Kernighan, \u201cAn effective heuristic algorithm for the traveling salesman problem,\u201d Operation Research, vol. 21, pp. 498\u2013516, 1973.","journal-title":"Operation Research"},{"key":"4798_CR25","doi-asserted-by":"crossref","unstructured":"Y. Marinakis and A. Migdalas, \u201cHeuristic solutions of vehicle routing problems in supply chain management,\u201d in Combinatorial and Global Optimization, P.M. Pardalos, A. Migdalas, and R. Burkard (Eds.), World Scientific Publishing Co, 2002, pp. 205\u2013236.","DOI":"10.1142\/9789812778215_0014"},{"key":"4798_CR26","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1111\/j.1475-3995.1999.tb00175.x","volume":"6","author":"A. Modares","year":"1999","unstructured":"A. Modares, S. Somhom, and T. Enwaka, \u201cA self - organizing neural network approach for multiple traveling salesman and vehicle routing problems,\u201d International Transactions in Operational Research, vol. 6, 1999, pp. 591\u2013606.","journal-title":"International Transactions in Operational Research"},{"key":"4798_CR27","unstructured":"D. Neto, \u201cEfficient cluster compensation for Lin\u2013Kernighan heuristics,\u201d PhD Thesis, Computer Science University of Toronto, 1999."},{"key":"4798_CR28","doi-asserted-by":"crossref","unstructured":"P.M. Pardalos, L. Pitsoulis, and M.G.C. Resende, \u201cA parallel GRASP implementation for the quadratic assignment problem,\u201d in Solving Irregular Problems in Parallel\u2013-State of the Art, A. Ferreira and J. Rolim (Eds.), Kluwer Academic Publishers Dordrecht, 1995.","DOI":"10.1007\/978-1-4757-6130-6_6"},{"key":"4798_CR29","doi-asserted-by":"crossref","unstructured":"P.M. Pardalos, L. Pitsoulis, T. Mavridou, and M.G.C. Resende, \u201cParallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP,\u201d in Solving Irregular Problems in Parallel - State of the Art, A. Ferreira and J. Rolim (Eds.), Kluwer Academic Publishers Dordrecht, 1995, pp. 317\u2013331.","DOI":"10.1007\/3-540-60321-2_26"},{"key":"4798_CR30","unstructured":"G. Reinhelt, The Traveling Salesman Problem, Computational solutions for TSP Applications, Springer-Verlag, 1994."},{"key":"4798_CR31","doi-asserted-by":"crossref","unstructured":"C. Rego and F. Glover, \u201cLocal search and metaheuristics,\u201d in the Traveling Salesman Problem and Its Variations, G. Gutin and A. Punnen (Eds.), Kluwer Academic Publishers Dordrecht, 2002, pp. 309\u2013367.","DOI":"10.1007\/0-306-48213-4_8"},{"key":"4798_CR32","doi-asserted-by":"crossref","unstructured":"M.G.C. Resende and C.C. Ribeiro, \u201cGreedy randomized adaptive search procedures,\u201d in Handbooks of Metaheuristics, F. Glover and G.A. Kochenberger (Eds.), Kluwer Academic Publishers Dordrecht, 2003, pp. 219\u2013249.","DOI":"10.1007\/0-306-48056-5_8"},{"key":"4798_CR33","doi-asserted-by":"crossref","unstructured":"R. Tarjan, \u201cData structures and network algorithms,\u201d Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, 1983.","DOI":"10.1137\/1.9781611970265"},{"key":"4798_CR34","unstructured":"C. Walshaw, \u201cA multilevel approach to the traveling salesman problem,\u201d Operations Research, (to appear)."},{"key":"4798_CR35","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/978-1-4613-1361-8_34","volume-title":"Meta-heuristics: Theory and Applications","author":"M. Zachariasen","year":"1996","unstructured":"M. Zachariasen and M. Dam, \u201cTabu search on the geometric traveling salesman problem,\u201d in Meta-heuristics: Theory and Applications, I.H. Osman and J.P. Kelly (Eds.), Kluwer Academic Publishers: Boston, 1996, pp. 571\u2013587."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-4798-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-4798-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-4798-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T19:55:49Z","timestamp":1683230149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-4798-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["4798"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-4798-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}