{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T23:24:22Z","timestamp":1768433062725,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,4,8]],"date-time":"2010-04-08T00:00:00Z","timestamp":1270684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s12532-010-0013-5","type":"journal-article","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T10:14:02Z","timestamp":1270635242000},"page":"79-101","source":"Crossref","is-referenced-by-count":124,"title":["A library of local search heuristics for the vehicle routing problem"],"prefix":"10.1007","volume":"2","author":[{"given":"Chris","family":"Gro\u00ebr","sequence":"first","affiliation":[]},{"given":"Bruce","family":"Golden","sequence":"additional","affiliation":[]},{"given":"Edward","family":"Wasil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,8]]},"reference":[{"key":"13_CR1","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W., Espinoza, D., Goycoolea, M., Helsgaun K.: The Concorde source code. http:\/\/www.tsp.gatech.edu\/concorde.html (2010)"},{"key":"13_CR2","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"D. Applegate","year":"2006","unstructured":"Applegate D., Bixby R., Chvd\u0301ftal V., Cook W.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton, NJ (2006)"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy O., Gendreau M.: VRPTW, part I: Route construction and local search algorithms. Transp. Sci. 39, 104\u2013118 (2005)","journal-title":"Transp. Sci."},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy O., Gendreau M.: VRPTW, part II: Metaheuristics. Transp. Sci. 39, 119\u2013139 (2005)","journal-title":"Transp. Sci."},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N. Christofides","year":"1969","unstructured":"Christofides N., Eilon S.: An algorithm for the vehicle dispatching problem. Oper. Res. Q. 20, 309\u2013318 (1969)","journal-title":"Oper. Res. Q."},{"key":"13_CR6","first-page":"315","volume-title":"Combinatorial Optimization","author":"N. Christofides","year":"1979","unstructured":"Christofides N., Mingozzi A., Toth P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds) Combinatorial Optimization, pp. 315\u2013338. Wiley, Chichester, UK (1979)"},{"key":"13_CR7","unstructured":"COIN-OR. Open Solver Interface (OSI). https:\/\/projects.coin-or.org\/Osi\/ (2010)"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G. Dueck","year":"1993","unstructured":"Dueck G.: New optimization heuristics: the great-deluge algorithm and the record-to-record travel. J. Comput. Phys. 104, 86\u201392 (1993)","journal-title":"J. Comput. Phys."},{"issue":"3","key":"13_CR9","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R. Fukasawa","year":"2006","unstructured":"Fukasawa R., Longo H., Lysgaard J., Poggi D., Reis M., Uchoa E., Werneck R.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Program. 106(3), 491\u2013511 (2006)","journal-title":"Math. Program."},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/978-0-387-77778-8_7","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"M. Gendreau","year":"2008","unstructured":"Gendreau M., Potvin J-Y., Br\u00e4ysy O., Hasle G., L\u00f8kketangen A.: Metaheuristics for the vehicle routing problem and its extensions: a categorized bibliography. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 143\u2013169. Springer, New York (2008)"},{"issue":"1","key":"13_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02078647","volume":"41","author":"F. Glover","year":"1993","unstructured":"Glover F., Taillard E.: A user\u2019s guide to tabu search. Ann. Oper. Res. 41(1), 1\u201328 (1993)","journal-title":"Ann. Oper. Res."},{"key":"13_CR12","unstructured":"GLPK, The GNU Linear Programming Kit. http:\/\/www.gnu.org\/software\/glpk\/ (2010)"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-1-4615-5755-5_2","volume-title":"Fleet Management and Logistics","author":"B. Golden","year":"1998","unstructured":"Golden B., Wasil E., Kelly J., Chao I.-M.: The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic, T., Laporte, G. (eds) Fleet Management and Logistics, pp. 33\u201356. Kluwer, Boston (1998)"},{"key":"13_CR14","unstructured":"Gro\u00ebr, C.: Parallel and serial algorithms for vehicle routing problems. Ph.D thesis, University of Maryland, College Park, MD (2008)"},{"key":"13_CR15","unstructured":"Gro\u00ebr, C.: The VRPH software. http:\/\/sites.google.com\/site\/vrphlibrary\/ (2010)"},{"issue":"2","key":"13_CR16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.orl.2007.05.001","volume":"36","author":"R. Hassin","year":"2008","unstructured":"Hassin R., Keinan A.: Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP. Oper. Res. Lett. 36(2), 243\u2013246 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"13_CR17","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K. Helsgaun","year":"2000","unstructured":"Helsgaun K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Euro. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Euro. J. Oper. Res."},{"key":"13_CR18","unstructured":"Helsgaun, K.: The LKH source code. http:\/\/www.akira.ruc.dk\/~keld\/research\/LKH\/ (2010)"},{"key":"13_CR19","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1515\/9780691187563-013","volume-title":"Local Search in Combinatorial Optimization","author":"G. Kindervater","year":"2003","unstructured":"Kindervater G., Savelsbergh M.: Vehicle routing: handling edge exchanges. In: Aarts, E., Lenstra, J.K. (eds) Local Search in Combinatorial Optimization, pp. 337\u2013360. Princeton University Press, Princeton, NJ (2003)"},{"issue":"4598","key":"13_CR20","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S., Gelatt C., Vecchi M.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"2","key":"13_CR21","first-page":"329","volume":"47","author":"J. Kyt\u00f6joki","year":"2005","unstructured":"Kyt\u00f6joki J., Nuortio T., Br\u00e4ysy O., Gendreau M.: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput. Oper. Res. 47(2), 329\u2013336 (2005)","journal-title":"Comput. Oper. Res."},{"key":"13_CR22","doi-asserted-by":"crossref","first-page":"1685","DOI":"10.1016\/j.cor.2003.11.023","volume":"32","author":"A. Le Bouthillier","year":"2005","unstructured":"Le Bouthillier A., Crainic T.: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Comput. Oper. Res. 32, 1685\u20131708 (2005)","journal-title":"Comput. Oper. Res."},{"key":"13_CR23","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1016\/j.cor.2003.10.002","volume":"32","author":"F. Li","year":"2005","unstructured":"Li F., Golden B., Wasil E.: Very large-scale vehicle routing: new test problems, algorithms, and results. Comput. Oper. Res. 32, 1165\u20131179 (2005)","journal-title":"Comput. Oper. Res."},{"key":"13_CR24","first-page":"2245","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin S., Kernighan B.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21, 2245\u20132269 (1973)","journal-title":"Oper. Res."},{"key":"13_CR25","first-page":"737","volume-title":"The Traveling Salesman Problem and its Variations","author":"A. Lodi","year":"2002","unstructured":"Lodi A., Punnen A.: TSP software. In: Gutin, G., Punnen, A. (eds) The Traveling Salesman Problem and its Variations, pp. 737\u2013749. Kluwer, Dordrecht (2002)"},{"key":"13_CR26","unstructured":"Lysgaard, J.: CVRPSP: A package of separation routines for the capacitated vehicle routing problem. Working Paper 03\u201304 (2004)"},{"key":"13_CR27","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1016\/j.cor.2003.11.017","volume":"32","author":"D. Mester","year":"2005","unstructured":"Mester D., Br\u00e4ysy O.: Active guided evolution strategies for the large scale vehicle routing problem with time windows. Comput. Oper. Res. 32, 1593\u20131614 (2005)","journal-title":"Comput. Oper. Res."},{"key":"13_CR28","doi-asserted-by":"crossref","first-page":"2964","DOI":"10.1016\/j.cor.2005.11.006","volume":"34","author":"D. Mester","year":"2007","unstructured":"Mester D., Br\u00e4ysy O.: Active-guided evolution strategies for large-scale vehicle routing problems. Comput. Oper. Res. 34, 2964\u20132975 (2007)","journal-title":"Comput. Oper. Res."},{"key":"13_CR29","first-page":"48","volume-title":"EvoCOP, Volume 4972 of Lecture Notes in Computer Science","author":"Y. Nagata","year":"2008","unstructured":"Nagata Y., Br\u00e4ysy O.: Efficient local search limitation strategies for vehicle routing problems. In: Hemert, J., Cotta, C. (eds) EvoCOP, Volume 4972 of Lecture Notes in Computer Science, pp. 48\u201360. Springer, Berlin (2008)"},{"key":"13_CR30","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.20333","volume":"54","author":"Y. Nagata","year":"2009","unstructured":"Nagata Y., Br\u00e4ysy O.: Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. Networks 54, 205\u2013215 (2009)","journal-title":"Networks"},{"key":"13_CR31","unstructured":"PLPlot: The PLPlot software package. http:\/\/plplot.sourceforge.net\/ (2010)"},{"key":"13_CR32","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-540-85152-3_2","volume-title":"Bio-Inspired Algorithms for the Vehicle Routing Problem","author":"C. Prins","year":"2009","unstructured":"Prins C.: A GRASP evolutionary local search hybrid for the vehicle routing problem. In: Pereira, F., Tavares, J. (eds) Bio-Inspired Algorithms for the Vehicle Routing Problem, pp. 35\u201353. Springer, Berlin (2009)"},{"key":"13_CR33","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0167-8191(03)00045-0","volume":"29","author":"T. Ralphs","year":"2003","unstructured":"Ralphs T.: Parallel branch and cut for capacitated vehicle routing. Parallel Comput. 29, 607\u2013620 (2003)","journal-title":"Parallel Comput."},{"key":"13_CR34","unstructured":"Ralphs, T., Guzelsoy, M., Mahajan, A.: The SYMPHONY source code. https:\/\/projects.coin-or.org\/SYMPHONY (2010)"},{"key":"13_CR35","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"T. Ralphs","year":"2003","unstructured":"Ralphs T., Kopman L., Pulleyblank W., Trotter L.: On the capacitated vehicle routing problem. Math. Program. 94, 343\u2013359 (2003)","journal-title":"Math. Program."},{"key":"13_CR36","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"13_CR37","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat Y., Taillard E.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147\u2013167 (1995)","journal-title":"J. Heuristics"},{"key":"13_CR38","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E. Taillard","year":"1993","unstructured":"Taillard E.: Parallel iterative search methods for vehicle routing problems. Networks 23, 661\u2013676 (1993)","journal-title":"Networks"},{"key":"13_CR39","unstructured":"Taillard, E.: VRP benchmarks. http:\/\/mistic.heig-vd.ch\/taillard\/problemes.dir\/vrp.dir\/vrp.html (1993)"},{"key":"13_CR40","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1057\/jors.1970.52","volume":"21","author":"P.C. Yellow","year":"1970","unstructured":"Yellow P.C.: A computational modification to the savings method of vehicle scheduling. Oper. Res. Q. 21, 281\u2013293 (1970)","journal-title":"Oper. Res. Q."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-010-0013-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-010-0013-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-010-0013-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T12:15:56Z","timestamp":1559477756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-010-0013-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,8]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["13"],"URL":"https:\/\/doi.org\/10.1007\/s12532-010-0013-5","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,8]]}}}