{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T12:13:11Z","timestamp":1771330391334,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,2,20]],"date-time":"2018-02-20T00:00:00Z","timestamp":1519084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,2,20]],"date-time":"2018-02-20T00:00:00Z","timestamp":1519084800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Social Science Foundation of China","award":["16CGL016"],"award-info":[{"award-number":["16CGL016"]}]},{"name":"Humanities and Social Science Foundation of Ministry of Education of China","award":["15YJC630103"],"award-info":[{"award-number":["15YJC630103"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2017M611575"],"award-info":[{"award-number":["2017M611575"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s12351-018-0386-1","type":"journal-article","created":{"date-parts":[[2018,2,20]],"date-time":"2018-02-20T19:22:31Z","timestamp":1519154551000},"page":"1505-1542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A distance matrix based algorithm for solving the\u00a0traveling salesman problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Shengbin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weizhen","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,20]]},"reference":[{"key":"386_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.cor.2014.02.010","volume":"48","author":"M Albareda-Sambola","year":"2014","unstructured":"Albareda-Sambola M, Fern\u00e1ndez E, Laporte G (2014) The dynamic multiperiod vehicle routing problem with probabilistic information. Comput Oper Res 48:31\u201332","journal-title":"Comput Oper Res"},{"key":"386_CR2","unstructured":"Applegate D, Bixby R, Chvatal V (1999) Finding tours in the TSP, vol 12. Technical report TR99-05, Department of Computational and Applied Mathematics, Rice University, pp 369\u2013433"},{"key":"386_CR3","volume-title":"The traveling salesman problem: a computational study","author":"D Applegate","year":"2006","unstructured":"Applegate D, Bixby R, Chvatal V (2006) The traveling salesman problem: a computational study. Princeton University Press, Princeton"},{"key":"386_CR4","unstructured":"Arthur JL, Frendeway JO (1985) A computational study of tour construction procedures for the traveling salesman problem, vol 12. Research report, Oregon State University, Corvallis, pp 568\u2013581"},{"key":"386_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100034095","volume-title":"The shortest path through many points","author":"J Beardwood","year":"1959","unstructured":"Beardwood J, Hammersley JM (1959) The shortest path through many points. Cambridge Philosophical Society, Cambridge"},{"key":"386_CR6","doi-asserted-by":"crossref","unstructured":"Bentley JL (1990) K-d trees for semidynamic point sets. In: Proceedings of 6th annual ACM symposium on computational geometry, vol 126, pp 187\u2013197","DOI":"10.1145\/98524.98564"},{"key":"386_CR7","first-page":"387","volume":"4","author":"JL Bentley","year":"1992","unstructured":"Bentley JL (1992) Fast algorithm for geometric traveling salesman problem. Oper Res Soc Am 4:387\u2013412","journal-title":"Oper Res Soc Am"},{"key":"386_CR8","unstructured":"Bentley JL, Saxe JB (1980) An analysis of two heuristic for the Euclidean traveling salesman problem. In: 18th annual Allerton conference on communication, vol 12, pp 369\u2013433"},{"key":"386_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6377(89)90047-3","volume":"8","author":"D Bertsimas","year":"1989","unstructured":"Bertsimas D, Grigni M (1989) Worst-case examples for the space-filling curve heuristic for the Euclidean traveling salesman problem. Oper Res Lett 8:241\u2013244","journal-title":"Oper Res Lett"},{"key":"386_CR10","first-page":"125","volume":"8","author":"RG Bland","year":"1989","unstructured":"Bland RG, Shallcross DF (1989) Large traveling salesman problems arising from experiments in X-ray crystallography: a preliminary report on computation. Oper Res 8:125\u2013128","journal-title":"Oper Res"},{"key":"386_CR11","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1007\/s00500-013-1203-7","volume":"18","author":"H Chiang","year":"2014","unstructured":"Chiang H, Chou Y, Chiu C, Kuo S, Huang Y (2014) A quantum-inspired tabu search algorithm for solving combinatorial optimization problems. Soft Comput 18:1771\u20131781","journal-title":"Soft Comput"},{"key":"386_CR12","unstructured":"Christofides N (1976) Worst-case analysis of a new heuristic for the traveling salesman problem, vol 4. Technical report 388, GSIA, CarnegieMellon University, pp 387\u2013412"},{"key":"386_CR13","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568\u2013581","journal-title":"Oper Res"},{"key":"386_CR14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515.ch7","volume-title":"The VRP with time windows","author":"JF Cordeau","year":"2002","unstructured":"Cordeau JF, Desaulniers G, Desrosiers J, Solomon MM (2002) The VRP with time windows. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"386_CR15","first-page":"80","volume":"12","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramzer KB (1959) The truck dispatch problem. Oper Res 12:80\u201391","journal-title":"Oper Res"},{"key":"386_CR16","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1007\/s00500-012-0855-z","volume":"16","author":"W Deng","year":"2012","unstructured":"Deng W, Chen R, He B, Liu Y, Yin L, Guo J (2012) A novel two-stage hybrid swarm intelligence optimization algorithm and application. Soft Comput 16:1707\u20131722","journal-title":"Soft Comput"},{"key":"386_CR17","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1016\/j.cor.2005.06.014","volume":"33","author":"D Gamboa","year":"2006","unstructured":"Gamboa D, Rego C, Glover F (2006) Implementation analysis of efficient heuristic algorithms for the traveling salesman problem. Comput Oper Res 33:1154\u20131172","journal-title":"Comput Oper Res"},{"key":"386_CR18","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held M, Karp RM (1970) The traveling salesman problem and minimum spanning trees. Oper Res 18:1138\u20131162","journal-title":"Oper Res"},{"key":"386_CR19","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun K (2000) An effective implementation of the Lin\u2013Kernighan traveling salesman heuristic. Eur J Oper Res 126:106\u2013130","journal-title":"Eur J Oper Res"},{"key":"386_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10732-013-9233-y","volume":"20","author":"G Jager","year":"2014","unstructured":"Jager G, Dong C, Goldengorin B, Molitor P, Richter D (2014) A backbone based TSP heuristic for large instances. J Heuristics 20:107\u2013124","journal-title":"J Heuristics"},{"key":"386_CR21","volume-title":"The traveling salesman problem: a case study in local optimization","author":"DS Johnson","year":"1997","unstructured":"Johnson DS, McGeoch LA (1997) The traveling salesman problem: a case study in local optimization. Wiley, New York"},{"key":"386_CR22","volume-title":"Experimental analysis of heuristics for the STSP","author":"DS Johnson","year":"2002","unstructured":"Johnson DS, McGeoch LA (2002) Experimental analysis of heuristics for the STSP. Kluwer Academic Publishers, Dordrecht"},{"key":"386_CR23","volume-title":"Handbooks in OR and MS: the traveling salesman problem, chapter 4","author":"M Junger","year":"1995","unstructured":"Junger M, Reinelt G (1995) Handbooks in OR and MS: the traveling salesman problem, chapter 4. Elsevier, Amsterdam"},{"key":"386_CR24","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York"},{"key":"386_CR25","unstructured":"Korte B (1988) Applications of combinatorial optimization. In: The 13th international mathematical programming symposium, vol 50, pp 862\u2013877"},{"key":"386_CR26","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59:345\u2013358","journal-title":"Eur J Oper Res"},{"key":"386_CR27","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43:408\u2013416","journal-title":"Transp Sci"},{"key":"386_CR28","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10732-012-9194-6","volume":"18","author":"J Larusic","year":"2012","unstructured":"Larusic J, Punnen A, Aubanel E (2012) Experimental analysis of heuristics for the bottleneck traveling salesman problem. J Heuristics 18:473\u2013503","journal-title":"J Heuristics"},{"key":"386_CR29","doi-asserted-by":"publisher","first-page":"2161","DOI":"10.1007\/s00500-013-1191-7","volume":"18","author":"C Li","year":"2014","unstructured":"Li C, Hu G (2014) Global migration strategy with moving colony for hierarchical distributed evolutionary algorithms. Soft Comput 18:2161\u20132176","journal-title":"Soft Comput"},{"key":"386_CR30","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1007\/s00500-010-0680-1","volume":"15","author":"M Mavrovouniotis","year":"2011","unstructured":"Mavrovouniotis M, Yang S (2011) A memetic ant colony optimization algorithm for the dynamic travelling salesman problem. Soft Comput 15:1405\u20131425","journal-title":"Soft Comput"},{"key":"386_CR31","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1080\/00207540310001614150","volume":"42","author":"GC Onwubolu","year":"2004","unstructured":"Onwubolu GC, Clerc M (2004) Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization. Int J Prod Res 42:473\u2013491","journal-title":"Int J Prod Res"},{"key":"386_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac V, Gendreau M, Gu\u00e9ret C (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225:1\u201311","journal-title":"Eur J Oper Res"},{"key":"386_CR33","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1145\/76359.76361","volume":"36","author":"LK Platzman","year":"1989","unstructured":"Platzman LK, Bartholdi JJ (1989) Spacefilling curves and the planar traveling salesman problem. J ACM 36:719\u2013737","journal-title":"J ACM"},{"key":"386_CR34","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2010.09.010","volume":"211","author":"C Rego","year":"2011","unstructured":"Rego C, Gamboa D, Glover F, Osterman C (2011) Traveling salesman problem heuristics: leading methods, implementations and latest advances. Eur J Oper Res 211:427\u2013441","journal-title":"Eur J Oper Res"},{"key":"386_CR35","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s10732-012-9210-x","volume":"18","author":"I Rodriguez-Martin","year":"2012","unstructured":"Rodriguez-Martin I, Salazar-Gonzalez J Jose (2012) A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem. J Heuristics 18:849\u2013867","journal-title":"J Heuristics"},{"key":"386_CR36","unstructured":"Steiglitz K, Weiner P (1997) Some improved algorithms for computer solution of the traveling salesman problem. In: 6th annual Allerton conference on circuit and systems theory, vol 126, pp 814\u2013821"},{"key":"386_CR37","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1287\/opre.50.5.862.373","volume":"50","author":"C Walshaw","year":"2002","unstructured":"Walshaw C (2002) A multilevel approach to the traveling salesman problem. Oper Res 50:862\u2013877","journal-title":"Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-018-0386-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0386-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0386-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T18:32:20Z","timestamp":1595874740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-018-0386-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,20]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["386"],"URL":"https:\/\/doi.org\/10.1007\/s12351-018-0386-1","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,20]]},"assertion":[{"value":"8 October 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}