{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T16:11:10Z","timestamp":1776355870494,"version":"3.51.2"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1007\/s10732-005-1997-2","type":"journal-article","created":{"date-parts":[[2005,9,4]],"date-time":"2005-09-04T08:24:56Z","timestamp":1125822296000},"page":"267-306","source":"Crossref","is-referenced-by-count":83,"title":["Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration"],"prefix":"10.1007","volume":"11","author":[{"given":"Birger","family":"Funke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tore","family":"Gr\u00fcnert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Irnich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1997_CR1","unstructured":"Aarts, E. and J. Lenstra. (1997). Local Search in Combinatorial Optimization. Wiley, Chichester."},{"key":"1997_CR2","unstructured":"Ahuja, R., N. Boland, and I. Dumitrescu. (2001a). \u201cExact and Heuristic Algorithms for the Subset Disjoint Minimum Cost Cycle Problem.\u201d Technical report, MIT, Boston."},{"key":"1997_CR3","unstructured":"Ahuja, R., O. Ergun, J. Orlin, and A. Punnen. (1999). \u201cA Survey of Very Large-Scale Neighborhood Search Techniques.\u201d Technical report, Department of Industrial & Systems Engineering, University of Florida, Gainesville, FL 32611."},{"issue":"(1)","key":"1997_CR4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","volume":"91","author":"R. Ahuja","year":"2001b","unstructured":"Ahuja, R., J. Orlin, and D. Sharma. (2001b). \u201cMulti-Exchange Neighborhood Structures for the Capacitated Minimum Spanning Tree Problem.\u201d Mathematical Programming, Series A 91(1), 71\u201397.","journal-title":"Mathematical Programming, Series A"},{"issue":"(1)","key":"1997_CR5","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1287\/ijoc.13.1.56.9748","volume":"13","author":"E. Balas","year":"2001","unstructured":"Balas, E. and N. Simonetti. (2001). \u201cLinear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study.\u201d INFORMS Journal on Computing 13(1), 56\u201375.","journal-title":"INFORMS Journal on Computing"},{"key":"1997_CR6","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1023\/A:1018939709890","volume":"86","author":"E. Balas","year":"1999","unstructured":"Balas, E. (1999). \u201cNew Classes of Efficiently Solvable Generalized Traveling Salesman Problems.\u201d Annals of Operations Research 86, 529\u2013558.","journal-title":"Annals of Operations Research"},{"issue":"(4)","key":"1997_CR7","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","volume":"11","author":"J. Beasley","year":"1983","unstructured":"Beasley, J. (1983). \u201cRoute First\u2014Cluster Second Methods for Vehicle Routing. OMEGA International Journal of Management Science 11(4), 403\u2013408.","journal-title":"OMEGA International Journal of Management Science"},{"issue":"(4)","key":"1997_CR8","first-page":"387","volume":"4","author":"J. Bentley","year":"1992","unstructured":"Bentley, J. (1992). \u201cFast Algorithms for Geometric Traveling Salesman Problems.\u201d Operations Research Society of America 4(4), 387\u2013411.","journal-title":"Operations Research Society of America"},{"key":"1997_CR9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"L.D. Bodin","year":"1983","unstructured":"Bodin, L.D., B. Golden, A. Assad, and M. Ball. (1983). \u201cRouting and Scheduling of Vehicles and Crews\u2014The State of the Art.\u201d Computers & Operations Research 10, 63\u2013211.","journal-title":"Computers & Operations Research"},{"issue":"(1)","key":"1997_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O. Br\u00e4ysy","year":"2005a","unstructured":"Br\u00e4ysy, O. and M. Gendreau. (2005a). \u201cVehicle Routing with Time Windows, Part II: Metaheuristics.\u201d Transportation Science 39(1), 119\u2013139.","journal-title":"Transportation Science"},{"issue":"(1)","key":"1997_CR11","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O. Br\u00e4ysy","year":"2005b","unstructured":"Br\u00e4ysy, O. and M. Gendreau. (2005b). \u201cVehicle Routing with Time Windows, Part I: Route Construction and Local Search Algorithms.\u201d Transportation Science 39(1), 104\u2013118.","journal-title":"Transportation Science"},{"key":"1997_CR12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-45365-2_21","volume-title":"Applications of Evolutionary Computing","author":"E. Burke","year":"2001","unstructured":"Burke, E., P. Cowling, and R. Keuthen. (2001). \u201cEffective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem.\u201d In E. Boers, J. Gottlieb, P. Lanzi, R. Smith, S. Cagnoni, E. Hart, G. Raidl, and H. Tijink, (eds.), Applications of Evolutionary Computing, Springer Verlag, Berlin, pp. 203\u2013212."},{"issue":"(3)","key":"1997_CR13","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1051\/ro\/1990240302451","volume":"24","author":"J. Carlier","year":"1990","unstructured":"Carlier, J. and P. Villon. (1990). \u201cA New Heuristic for the Traveling Salesman Problem.\u201d RAIRO\u2014Recherche op\u00e9rationelle\/Operations Research 24(3), 245\u2013253.","journal-title":"RAIRO\u2014Recherche op\u00e9rationelle\/Operations Research"},{"issue":"(3)","key":"1997_CR14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N. Christofides","year":"1969","unstructured":"Christofides, N. and S. Eilon. (1969). \u201cAn Algorithm for the Vehicle-Dispatching Problem.\u201d Operational Research Quarterly 20(3), 309\u2013318.","journal-title":"Operational Research Quarterly"},{"issue":"(1)","key":"1997_CR15","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"R. Congram","year":"2002","unstructured":"Congram, R., C. Potts, and S. van de Velde. (2002). \u201cAn Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Sceduling Problem.\u201d INFORMS Journal on Computing 14(1), 52\u201367.","journal-title":"INFORMS Journal on Computing"},{"key":"1997_CR16","doi-asserted-by":"crossref","unstructured":"Cordeau, J., G. Desaulniers, J. Desrosiers, M. Solomon, and F. Soumis. (2002a). \u201cVRP with Time Windows.\u201d In Toth and Vigo (eds.), (2002c), chapter 7, pp. 155\u2013194.","DOI":"10.1137\/1.9780898718515.ch7"},{"key":"1997_CR17","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J. Cordeau","year":"2002b","unstructured":"Cordeau, J., M. Gendreau, G. Laporte, J. Potvin, and F. Semet. (2002b). \u201cA Guide to Vehicle Routing Heuristics.\u201d Journal of the Operational Research Society 53, 512\u2013522.","journal-title":"Journal of the Operational Research Society"},{"key":"1997_CR18","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1011301019184","volume":"7","author":"R. Cordone","year":"2001","unstructured":"Cordone, R. and R. Wolfer Calvo. (2001). \u201cA Heuristic for the Vehicle Routing Problem with Time Windows.\u201d Journal of Heuristics 7, 107\u2013129.","journal-title":"Journal of Heuristics"},{"key":"1997_CR19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02591867","volume":"26","author":"G. Cornu\u00e9jols","year":"1983","unstructured":"Cornu\u00e9jols, G., D. Naddef, and W. Pulleyblank. (1983). \u201cHalin Graphs and the Traveling Salesman Problem.\u201d Mathematical Programming 26, 287\u2013294.","journal-title":"Mathematical Programming"},{"key":"1997_CR20","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G. Croes","year":"1958","unstructured":"Croes, G. (1958). \u201cA Method for Solving Traveling-Salesman Problems.\u201d Operations Research 6, 791\u2013812.","journal-title":"Operations Research"},{"key":"1997_CR21","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., J. Desrosiers, A. Erdmann, M. Solomon, and F. Soumis. (2002). \u201cVRP with Pickup and Delivery.\u201d In Toth and Vigo (eds.), (2002c) chapter 9, pp. 225\u2013242.","DOI":"10.1137\/1.9780898718515.ch9"},{"key":"1997_CR22","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-1-4615-5755-5_3","volume-title":"Fleet Management and Logistics, chapter 3","author":"G. Desaulniers","year":"1998","unstructured":"Desaulniers, G., J. Desrosiers, I. Ioachim, M. Solomon, F. Soumis, and D. Villeneuve. (1998). \u201cA Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems.\u201d In T. Crainic and G. Laporte (eds.), Fleet Management and Logistics, chapter 3. Boston, Dordrecht, London: Kluwer Academic Publisher, pp. 57\u201393."},{"issue":"(3)","key":"1997_CR23","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1287\/trsc.34.3.312.12298","volume":"34","author":"G. Desaulniers","year":"2000","unstructured":"Desaulniers, G. and D. Villeneuve. (2000). \u201cThe Shortest Path Problem with Time Windows and Linear Waiting Costs.\u201d Transportation Science 34(3), 312\u2013319.","journal-title":"Transportation Science"},{"key":"1997_CR24","first-page":"35","volume-title":"Handbooks in Operations Research and Management Science, Vol. 8, Network Routing, chapter 2","author":"J. Desrosiers","year":"1995","unstructured":"Desrosiers, J., Y. Dumas, M. Solomon, and F. Soumis. (1995). \u201cTime Constrained Routing and Scheduling.\u201d In M. Ball, T. Magnanti, C. Monma, and G. Nemhauser (eds.), Handbooks in Operations Research and Management Science, Vol. 8, Network Routing, chapter 2. Amsterdam: Elsevier, pp. 35\u2013139."},{"issue":"(3)","key":"1997_CR25","first-page":"519","volume":"87","author":"V. De#x0311;neko","year":"2000","unstructured":"De#x0311;neko, V. and Woeginger, G. (2000). \u201cA Study of Exponential Neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem.\u201d Mathematical Programming 87(3), 519\u2013542.","journal-title":"Mathematical Programming"},{"key":"1997_CR26","unstructured":"Ergun, O., J. Orlin, and A. Steele-Feldman. (2002). \u201cCreating Very Large Scale Neighborhoods Out of Smaller Ones by Compounding Moves: A Study on the Vehicle Routing Problem.\u201d Technical report, Department of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 30332-0205, USA."},{"key":"1997_CR27","unstructured":"Funke, B., T. Gr\u00fcnert, and S. Irnich. (2004). \u201cA Note on Single Alternating Cycle Neighborhoods for the TSP.\u201d Journal of Heuristics (to appear)."},{"key":"1997_CR28","unstructured":"Funke, B. (2003). \u201cEffiziente Lokale Suche f\u00fcr Vehicle Routing und Scheduling Probleme mit Ressourcenbeschr\u00e4nkungen.\u201d PhD thesis, Fakult\u00e4t f\u00fcr Wirtschaftswissenschaften, RWTH Aachen, Templergraben 64, 52062 Aachen."},{"key":"1997_CR29","unstructured":"Gambardella, L., \u00c9. Taillard, and G. Agazzi. (1999). \u201cMACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows.\u201d In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization, chapter 5. London: McGraw-Hill, pp. 63\u201376."},{"issue":"(3)","key":"1997_CR30","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/opre.46.3.330","volume":"43","author":"M. Gendreau","year":"1998","unstructured":"Gendreau, M., A. Hertz, G. Laporte, and M. Stan. (1998). \u201cA Generalized Insertion Heuristics for the Traveling Salesman Problem with Time Windows.\u201d Operations Research 43(3), 330\u2013335.","journal-title":"Operations Research"},{"issue":"(6)","key":"1997_CR31","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M. Gendreau","year":"1992","unstructured":"Gendreau, M., A. Hertz, and G. Laporte (1992). \u201cNew Insertion and Postoptimization Procedures for the Traveling Salesman Problem.\u201d Operations Research 40(6), 1086\u20131094.","journal-title":"Operations Research"},{"key":"1997_CR32","unstructured":"Gilmore, P., E. Lawler, and D. Shmoys. (1985). \u201cWell-Solved Special Cases.\u201d In Lawler et al., (eds.), (1985), chapter 4. pp. 87\u2013143."},{"key":"1997_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F. and M. Laguna. (1997). Tabu Search. Dortrecht: Kluwer."},{"key":"1997_CR34","unstructured":"Glover, F. and A. Punnen. (1994). \u201cThe Traveling Salesman Problem: Linear Time Heuristics with Exponential Combinatorial Leverage.\u201d Technical report, US West Chair in Systems Science, University of Colorado, Boulder, School of Business, Campus Box 419, Boulder, CO, 80309."},{"key":"1997_CR35","unstructured":"Glover, F. (1991). \u201cMultilevel Tabu Search and Embedded Search Neighborhoods for the Travling Salesman Problem.\u201d Technical report, US West Chair in Systems Science, University of Colorado, Boulder, School of Business, Campus Box 419, Boulder, CO, 80309."},{"key":"1997_CR36","doi-asserted-by":"crossref","unstructured":"Glover, F. (1992). \u201cNew Ejection Chain and Alternating Path Methods for Traveling Salesman Problems.\u201d In O. Balci, R. Sharda, and S. Zenios (eds.), Computer Science and Operations Research\u2014New Developments in their Interfaces. Pergamon Press, pp. 491\u2013508.","DOI":"10.1016\/B978-0-08-040806-4.50037-X"},{"key":"1997_CR37","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F. Glover","year":"1996a","unstructured":"Glover, F. (1996a). \u201cEjection Chains, Reference Structures and Alternating Path Structures for Traveling Salesman Problems.\u201d Discrete Applied Mathematics 65, 223\u2013253.","journal-title":"Discrete Applied Mathematics"},{"key":"1997_CR38","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF00247211","volume":"2","author":"F. Glover","year":"1996b","unstructured":"Glover, F. (1996b).\u201cFinding a Best Traveling Salesman 4-opt Move in the Same Time as a Best 2-opt Move.\u201d Journal of Heuristics 2, 169\u2013179.","journal-title":"Journal of Heuristics"},{"key":"1997_CR39","volume-title":"The Traveling Salesman Problem and Its Variations, Vol. 12 of Combinatorial Optimization","year":"2002","unstructured":"Gutin, G. and A. Punnen (eds.). (2002). The Traveling Salesman Problem and Its Variations, Vol. 12 of Combinatorial Optimization. Dordrecht: Kluwer."},{"key":"1997_CR40","unstructured":"Irnich, S. and G. Desaulniers. (2004). \u201cShortest Path Problems with Resource Constraints.\u201d Technical Report G-2004-11, Les Cahiers du GERAD, HEC Montr\u00e9al, Montr\u00e9al, Quebec, Canada."},{"key":"1997_CR41","unstructured":"Irnich, S., B. Funke, and T. Gr\u00fcnert. (2004). \u201cSequential Search and Its Aplication to Vehicle-Routing Problems.\u201d Computers & Operations Research (to appear)."},{"key":"1997_CR42","first-page":"215","volume-title":"Local Search in Combinatorial Optimization, chapter 8","author":"D. Johnson","year":"1997","unstructured":"Johnson, D. and L. McGeoch. (1997). \u201cThe Traveling Salesman Problem: A Case Study in Local Optimization.\u201d In E. Aarts and J. Lenstra (eds.), Local Search in Combinatorial Optimization, chapter 8. Chichester: Wiley, pp. 215\u2013310."},{"key":"1997_CR43","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. Kernighan","year":"1970","unstructured":"Kernighan, B. and S. Lin. (1970). \u201cAn Efficient Heuristic Procedure for Partitioning Graphs.\u201d Bell Syst. Tech. J. 49, 291\u2013307.","journal-title":"Bell Syst. Tech. J."},{"key":"1997_CR44","first-page":"337","volume-title":"Local Search in Combinatorial Optimization, chapter 10","author":"G. Kindervater","year":"1997","unstructured":"Kindervater, G. and M. Savelsbergh. (1997). \u201cVehicle Routing: Handling Edge Exchanges.\u201d In E. Aarts and J. Lenstra (eds.), Local Search in Combinatorial Optimization, chapter 10. Chichester: Wiley, pp. 337\u2013360."},{"key":"1997_CR45","volume-title":"\u201cThe Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization.\u201d Wiley-Interscience Series in Discrete Mathematics","year":"1985","unstructured":"Lawler, E., J. Lenstra, A. Rinnooy Kan, and D. Shmoys, (eds.). (1985). \u201cThe Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization.\u201d Wiley-Interscience Series in Discrete Mathematics. Chichester: Wiley."},{"key":"1997_CR46","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S. and B. Kernighan. (1973). \u201cAn Effective Heuristic Algorithm for the Traveling-Salesman Problem.\u201d Operations Research 21, 498\u2013516.","journal-title":"Operations Research"},{"key":"1997_CR47","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S. (1965). \u201cComputer Solutions of the Traveling Salesman Problem.\u201d Bell System Technical Journal 44, 2245\u20132269.","journal-title":"Bell System Technical Journal"},{"issue":"(1)","key":"1997_CR48","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0377-2217(94)90034-5","volume":"77","author":"D. Magos","year":"1994","unstructured":"Magos, D. and T. Miliotis. (1994). \u201cAn Algorithm for the Planar Three-Index Assignment Problem.\u201d European Journal of Operational Research 77(1), 141\u2013153.","journal-title":"European Journal of Operational Research"},{"key":"1997_CR49","unstructured":"Or, I. (1976). \u201cTraveling Salesman-Type Problems and their Relation to the Logistics of Regional Blood Banking.\u201d PhD thesis, Department of Industrial Engineering and Management Sciences. Northwestern University, Evanston, IL."},{"key":"1997_CR50","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I. Osman","year":"1993","unstructured":"Osman, I. (1993). \u201cMetastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem.\u201d Annals of Operations Research 41, 421\u2013451.","journal-title":"Annals of Operations Research"},{"issue":"(4)","key":"1997_CR51","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1080\/03155986.1989.11732113","volume":"27","author":"J. Potvin","year":"1989","unstructured":"Potvin, J., G. Lapalme, and J. Rousseau (1989). \u201cA Generalized k-opt Exchange Procedure for the MTSP.\u201d Information Systems and Operations Research 27(4), 474\u2013481.","journal-title":"Information Systems and Operations Research"},{"key":"1997_CR52","unstructured":"Prins, C. (2003). \u201cA Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem.\u201d Computers & Operations Research 1\u201318 (to appear)."},{"key":"1997_CR53","first-page":"309","volume-title":"The Traveling Salesman Problem and Its Variations, volume 12 of Combinatorial Optimization, chapter 8","author":"C. Rego","year":"2002","unstructured":"Rego, C. and F. Glover. (2002). \u201cLocal Search and Metaheuristics.\u201d In G. Gutin and A. Punnen (eds.), The Traveling Salesman Problem and Its Variations, volume 12 of Combinatorial Optimization, chapter 8. Dordrecht: Kluwer, pp. 309\u2013368."},{"issue":"(10)","key":"1997_CR54","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1287\/mnsc.44.10.1447","volume":"44","author":"C. Rego","year":"1998","unstructured":"Rego, C. (1998). \u201cA Subpath Ejection Method for the Vehicle Routing Problem.\u201d Management Science 44(10), 1447\u20131459.","journal-title":"Management Science"},{"issue":"(2)","key":"1997_CR55","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/trsc.29.2.156","volume":"29","author":"R. Russell","year":"1995","unstructured":"Russell, R. (1995). \u201cHybrid Heuristics for the Vehicle Routing Problem with Time Windows.\u201d Transportation Science 29(2), 156\u2013166.","journal-title":"Transportation Science"},{"key":"1997_CR56","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1002\/net.3230210704","volume":"21","author":"R. Russell","year":"1991","unstructured":"Russell, R. and D. Gribbin. (1991). \u201cA Multiphase Approach to the Period Routing Problem.\u201d Networks 21, 747\u2013765.","journal-title":"Networks"},{"issue":"(1)","key":"1997_CR57","first-page":"17","volume":"29","author":"M. Savelsbergh","year":"1985","unstructured":"Savelsbergh, M. and M. Sol. (1985). \u201cThe General Pickup and Delivery Problem.\u201d Transportation Science 29(1), 17\u201329.","journal-title":"Transportation Science"},{"key":"1997_CR58","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G. Schrimpf","year":"2000","unstructured":"Schrimpf, G., J. Schneider, H. Stamm-Wilbrandt, and G. Dueck. (2000). \u201cRecord Breaking Optimization Results Using the Ruin and Recreate Principle.\u201d Journal of Computational Physics 159, 139\u2013171.","journal-title":"Journal of Computational Physics"},{"key":"1997_CR59","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"\u00c9. Taillard","year":"1993","unstructured":"Taillard, \u00c9. (1993). \u201cParallel Iterative Search Methods for Vehicle Routing Problems.\u201d Networks 23, 661\u2013676.","journal-title":"Networks"},{"issue":"(5)","key":"1997_CR60","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"P. Thompson","year":"1993","unstructured":"Thompson, P. and H. Psaraftis. (1993). \u201cCyclic Transfer Algorithms for Multivehicle Routing and Scheduling Problems.\u201d Operations Research 41(5), 935\u2013946.","journal-title":"Operations Research"},{"key":"1997_CR61","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1007\/978-1-4613-1361-8_41","volume-title":"Meta-Heuristics: Theory & Application, chapter 41","author":"P. Toth","year":"1996","unstructured":"Toth, P. and D. Vigo. (1996). \u201cFast Local Search Algorithms for the Handicapped Persons Transportation Problem.\u201d In I. Osman and J. Kelly (eds.), Meta-Heuristics: Theory & Application, chapter 41. Boston: Kluwer Academic, pp. 677\u2013690."},{"key":"1997_CR62","doi-asserted-by":"crossref","unstructured":"Toth, P. and D. Vigo. (2002a). \u201cBranch-and-Bound Algorithms for the Capacitated VRP.\u201d In Toth and Vigo (eds.), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications (2002c), chapter 2, pp. 29\u201351.","DOI":"10.1137\/1.9780898718515.ch2"},{"key":"1997_CR63","doi-asserted-by":"crossref","unstructured":"Toth, P. and D. Vigo. (2002b). \u201cAn Overview of Vehicle Routing Problems.\u201d In Toth and Vigo (eds.), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications (2002c), chapter 1, pp. 1\u201323.","DOI":"10.1137\/1.9780898718515.ch1"},{"key":"1997_CR64","volume-title":"The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications","year":"2002c","unstructured":"Toth, P. and D. Vigo (eds.). (2002c). The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications. Philadelphia: Society for Industrial and Applied Mathematics."},{"key":"1997_CR65","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"S. Vo\u00df","year":"1999","unstructured":"Vo\u00df, S., S. Martello, I. Osman, and C. Roucairol. (1999). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston: Kluwer Academic."},{"issue":"(5)","key":"1997_CR66","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1287\/opre.50.5.862.373","volume":"50","author":"C. Walshaw","year":"2002","unstructured":"Walshaw, C. (2002). \u201cA Multilevel Approach to the Travelling Salesman Problem.\u201d Operations Research 50(5), 862\u2013877.","journal-title":"Operations Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-1997-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-005-1997-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-1997-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:26Z","timestamp":1559242466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-005-1997-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":66,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["1997"],"URL":"https:\/\/doi.org\/10.1007\/s10732-005-1997-2","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}