{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T23:57:44Z","timestamp":1774915064911,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":82,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642160530","type":"print"},{"value":"9783642160547","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16054-7_15","type":"book-chapter","created":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T02:07:50Z","timestamp":1285898870000},"page":"206-221","source":"Crossref","is-referenced-by-count":41,"title":["Survey: Matheuristics for Rich Vehicle Routing Problems"],"prefix":"10.1007","author":[{"given":"Karl F.","family":"Doerner","sequence":"first","affiliation":[]},{"given":"Verena","family":"Schmid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1016\/j.ejor.2005.03.063","volume":"179","author":"J. Alegre","year":"2007","unstructured":"Alegre, J., Laguna, M., Pacheco, J.: Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. European Journal of Operational Research\u00a0179(3), 736\u2013746 (2007)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/trsc.1040.0103","volume":"40","author":"C. Archetti","year":"2006","unstructured":"Archetti, C., Speranza, M.G., Hertz, A.: A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science\u00a040(1), 64\u201373 (2006)","journal-title":"Transportation Science"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/trsc.1070.0204","volume":"42","author":"C. Archetti","year":"2008","unstructured":"Archetti, C., Speranza, M.G., Savelsbergh, M.W.P.: An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Science\u00a042(1), 22\u201331 (2008)","journal-title":"Transportation Science"},{"issue":"5","key":"15_CR4","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/opre.1040.0111","volume":"52","author":"R. Baldacci","year":"2004","unstructured":"Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Operations Research\u00a052(5), 723\u2013738 (2004)","journal-title":"Operations Research"},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10287-009-0118-3","volume":"7","author":"R. Baldacci","year":"2010","unstructured":"Baldacci, R., Bartolini, E., Mingozzi, A., Roberti, R.: An exact solution framework for a broad class of vehicle routing problems. Computational Management Science\u00a07(3), 229\u2013268 (2010)","journal-title":"Computational Management Science"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","volume":"115","author":"R. Baldacci","year":"2008","unstructured":"Baldacci, R., Christofides, N., Mingozzi, A.: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming\u00a0115(2), 351\u2013385 (2008)","journal-title":"Mathematical Programming"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"M.L. Balinski","year":"1964","unstructured":"Balinski, M.L., Quandt, R.E.: On an integer program for a delivery problem. Operations Research\u00a012(2), 300\u2013304 (1964)","journal-title":"Operations Research"},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/trsc.36.2.250.565","volume":"36","author":"J.F. Bard","year":"2002","unstructured":"Bard, J.F., Kontoravdis, G., Yu, G.: A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science\u00a036(2), 250\u2013269 (2002)","journal-title":"Transportation Science"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1287\/trsc.1030.0049","volume":"38","author":"R. Bent","year":"2004","unstructured":"Bent, R., Van Hentenryck, P.: A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science\u00a038(4), 515\u2013530 (2004)","journal-title":"Transportation Science"},{"key":"15_CR10","series-title":"The Vehicle Routing Problem","first-page":"85","volume-title":"Set-covering-based algorithms for the capacitated VRP","author":"J. Bramel","year":"2001","unstructured":"Bramel, J., Simchi-Levi, D.: Set-covering-based algorithms for the capacitated VRP. The Vehicle Routing Problem, pp. 85\u2013108. SIAM, Philadelphia (2001)"},{"issue":"4","key":"15_CR11","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1287\/ijoc.15.4.347.24896","volume":"15","author":"O. Br\u00e4ysy","year":"2003","unstructured":"Br\u00e4ysy, O.: A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS Journal on Computing\u00a015(4), 347\u2013368 (2003)","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, part i: Route construction and local search algorithms. Transportation Science\u00a039(1), 104\u2013118 (2005)","journal-title":"Transportation Science"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, part ii: Metaheuristics. Transportation Science\u00a039(1), 119\u2013139 (2005)","journal-title":"Transportation Science"},{"issue":"5","key":"15_CR14","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A. Caprara","year":"1999","unstructured":"Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Operations Research\u00a047(5), 730\u2013743 (1999)","journal-title":"Operations Research"},{"key":"15_CR15","series-title":"The Vehicle Routing Problem","first-page":"157","volume-title":"VRP with Time Windows","author":"J.F. Cordeau","year":"2001","unstructured":"Cordeau, J.F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F.: VRP with Time Windows. The Vehicle Routing Problem, pp. 157\u2013193. SIAM, Philadelphia (2001)"},{"issue":"2","key":"15_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J.F. Cordeau","year":"1997","unstructured":"Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks\u00a030(2), 105\u2013119 (1997)","journal-title":"Networks"},{"key":"15_CR17","series-title":"Metaheuristic Optimization via Memory and Evolution","first-page":"145","volume-title":"Tabu Search Heuristics for the Vehicle Routing Problem","author":"J.F. Cordeau","year":"2005","unstructured":"Cordeau, J.F., Laporte, G.: Tabu Search Heuristics for the Vehicle Routing Problem. Metaheuristic Optimization via Memory and Evolution, pp. 145\u2013163. Springer, Heidelberg (2005)"},{"issue":"8","key":"15_CR18","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J.F. Cordeau","year":"2001","unstructured":"Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society\u00a052(8), 928\u2013936 (2001)","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"15_CR19","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1057\/palgrave.jors.2601707","volume":"55","author":"J.F. Cordeau","year":"2004","unstructured":"Cordeau, J.F., Laporte, G., Mercier, A.: Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. The Journal of the Operational Research Society\u00a055(5), 542\u2013546 (2004)","journal-title":"The Journal of the Operational Research Society"},{"issue":"9","key":"15_CR20","doi-asserted-by":"publisher","first-page":"2602","DOI":"10.1016\/j.cor.2005.07.015","volume":"33","author":"T.G. Crainic","year":"2006","unstructured":"Crainic, T.G., Li, Y., Toulouse, M.: A first multilevel cooperative algorithm for capacitated multicommodity network design. Computers & Operations Research\u00a033(9), 2602\u20132622 (2006)","journal-title":"Computers & Operations Research"},{"key":"15_CR21","series-title":"Column Generation","first-page":"99","volume-title":"Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows","author":"E. Danna","year":"2005","unstructured":"Danna, E., Le Pape, C.: Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows. Column Generation, pp. 99\u2013129. Springer, Heidelberg (2005)"},{"issue":"2-3","key":"15_CR22","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10107-005-0662-8","volume":"105","author":"R. Franceschi De","year":"2006","unstructured":"De Franceschi, R., Fischetti, M., Toth, P.: A new ILP-based refinement heuristic for vehicle routing problems. Mathematical Programming\u00a0105(2-3), 471\u2013499 (2006)","journal-title":"Mathematical Programming"},{"issue":"4","key":"15_CR23","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1002\/net.20179","volume":"49","author":"K.F. Doerner","year":"2007","unstructured":"Doerner, K.F., Fuellerer, G., Hartl, R.F., Gronalt, M., Iori, M.: Metaheuristics for the vehicle routing problem with loading constraints. Networks\u00a049(4), 294\u2013307 (2007)","journal-title":"Networks"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11546245_4","volume-title":"Hybrid Metaheuristics","author":"M. El-Abd","year":"2005","unstructured":"El-Abd, M., Kamel, M.: A taxonomy of cooperative search algorithms. In: Blesa, M.J., Blum, C., Roli, A., Sampels, M. (eds.) HM 2005. LNCS, vol.\u00a03636, pp. 32\u201341. Springer, Heidelberg (2005)"},{"issue":"1-3","key":"15_CR25","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Mathematical Programming\u00a098(1-3), 23\u201347 (2003)","journal-title":"Mathematical Programming"},{"issue":"2","key":"15_CR26","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for vehicle routing. Networks\u00a011(2), 109\u2013124 (1981)","journal-title":"Networks"},{"issue":"2","key":"15_CR27","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1057\/jors.1976.63","volume":"27","author":"B.A. Foster","year":"1976","unstructured":"Foster, B.A., Ryan, D.M.: An integer programming approach to the vehicle scheduling problem. Operational Research Quarterly\u00a027(2), 367\u2013384 (1976)","journal-title":"Operational Research Quarterly"},{"issue":"3","key":"15_CR28","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/j.cor.2007.10.021","volume":"36","author":"G. Fuellerer","year":"2009","unstructured":"Fuellerer, G., Doerner, K.F., Hartl, R.F., Iori, M.: Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers & Operations Research\u00a036(3), 655\u2013673 (2009)","journal-title":"Computers & Operations Research"},{"issue":"3","key":"15_CR29","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/j.ejor.2009.03.046","volume":"201","author":"G. Fuellerer","year":"2010","unstructured":"Fuellerer, G., Doerner, K.F., Hartl, R.F., Iori, M.: Metaheuristics for vehicle routing problems with three-dimensional loading constraints. European Journal of Operational Research\u00a0201(3), 751\u2013759 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"15_CR30","doi-asserted-by":"publisher","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 de Arag\u00e3o, M., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming\u00a0106(3), 491\u2013511 (2006)","journal-title":"Mathematical Programming"},{"issue":"6","key":"15_CR31","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M. Gendreau","year":"1992","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: New insertion and postoptimization procedures for the traveling salesman problem. Operations Research\u00a040(6), 1086\u20131094 (1992)","journal-title":"Operations Research"},{"issue":"3","key":"15_CR32","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/trsc.1050.0145","volume":"40","author":"M. Gendreau","year":"2006","unstructured":"Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search algorithm for a routing and container loading problem. Transportation Science\u00a040(3), 342\u2013350 (2006)","journal-title":"Transportation Science"},{"issue":"1","key":"15_CR33","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1002\/net.20192","volume":"51","author":"M. Gendreau","year":"2008","unstructured":"Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks\u00a051(1), 4\u201318 (2008)","journal-title":"Networks"},{"key":"15_CR34","series-title":"The Vehicle Routing Problem","first-page":"129","volume-title":"Metaheuristics for the capacitated VRP","author":"M. Gendreau","year":"2001","unstructured":"Gendreau, M., Laporte, G., Potvin, J.Y.: Metaheuristics for the capacitated VRP. The Vehicle Routing Problem, pp. 129\u2013154. SIAM, Philadelphia (2001)"},{"issue":"10","key":"15_CR35","doi-asserted-by":"publisher","first-page":"3034","DOI":"10.1016\/j.cor.2005.02.033","volume":"33","author":"P. Hansen","year":"2006","unstructured":"Hansen, P., Mladenovi\u0107, N., Uro\u0161evi\u0107, D.: Variable neighborhood search and local branching. Computers & Operations Research\u00a033(10), 3034\u20133045 (2006)","journal-title":"Computers & Operations Research"},{"issue":"2","key":"15_CR36","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.disopt.2007.05.004","volume":"5","author":"H. Hashimoto","year":"2008","unstructured":"Hashimoto, H., Yagiura, M., Ibaraki, T.: An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optimization\u00a05(2), 434\u2013456 (2008)","journal-title":"Discrete Optimization"},{"issue":"2","key":"15_CR37","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1287\/trsc.1030.0085","volume":"39","author":"T. Ibaraki","year":"2005","unstructured":"Ibaraki, T., Imahori, S., Kubo, M., Masuda, T., Uno, T., Yagiura, M.: Effective local search algorithms for routing and scheduling problems with general time-window constraints. Transportation Science\u00a039(2), 206\u2013232 (2005)","journal-title":"Transportation Science"},{"issue":"2","key":"15_CR38","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1287\/ijoc.11.2.161","volume":"11","author":"J.P. Kelly","year":"1999","unstructured":"Kelly, J.P., Xu, J.: A set-partitioning-based heuristic for the vehicle routing problem. INFORMS Journal on Computing\u00a011(2), 161\u2013172 (1999)","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"15_CR39","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.45.3.395","volume":"45","author":"N. Kohl","year":"1997","unstructured":"Kohl, N., Madsen, O.B.G.: An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation. Operations Research\u00a045(3), 395\u2013406 (1997)","journal-title":"Operations Research"},{"issue":"2","key":"15_CR40","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1287\/trsc.26.2.69","volume":"26","author":"Y.A. Koskosidis","year":"1992","unstructured":"Koskosidis, Y.A., Powell, W.B., Solomon, M.M.: An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints. Transportation Science\u00a026(2), 69\u201385 (1992)","journal-title":"Transportation Science"},{"issue":"8","key":"15_CR41","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1002\/nav.20261","volume":"54","author":"G. Laporte","year":"2007","unstructured":"Laporte, G.: What you should know about the vehicle routing problem. Naval Research Logistics\u00a054(8), 811\u2013819 (2007)","journal-title":"Naval Research Logistics"},{"issue":"4","key":"15_CR42","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G. Laporte","year":"2009","unstructured":"Laporte, G.: Fifty years of vehicle routing. Transportation Science\u00a043(4), 408\u2013416 (2009)","journal-title":"Transportation Science"},{"key":"15_CR43","series-title":"North-Holland Mathematics Studies","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0304-0208(08)73235-3","volume-title":"Surveys in Combinatorial Optimization","author":"G. Laporte","year":"1987","unstructured":"Laporte, G., Nobert, Y.: Exact solution of the vehicle routing problem. In: Martello, S., Laporte, G., Minoux, M., Ribeiro, C.C. (eds.) Surveys in Combinatorial Optimization. North-Holland Mathematics Studies, vol.\u00a0132, pp. 147\u2013184. North-Holland, Amsterdam (1987)"},{"key":"15_CR44","series-title":"The Vehicle Routing Problem","first-page":"109","volume-title":"Classical heuristics for the capacitated VRP","author":"G. Laporte","year":"2001","unstructured":"Laporte, G., Semet, F.: Classical heuristics for the capacitated VRP. The Vehicle Routing Problem, pp. 109\u2013128. SIAM, Philadelphia (2001)"},{"issue":"7","key":"15_CR45","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/j.cor.2003.11.023","volume":"32","author":"A. Bouthillier Le","year":"2005","unstructured":"Le Bouthillier, A., Crainic, T.G.: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers & Operations Research\u00a032(7), 1685\u20131708 (2005)","journal-title":"Computers & Operations Research"},{"issue":"2-3","key":"15_CR46","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10107-005-0652-x","volume":"105","author":"A.N. Letchford","year":"2006","unstructured":"Letchford, A.N., Salazar-Gonz\u00e1lez, J.J.: Projection results for vehicle routing. Mathematical Programming\u00a0105(2-3), 251\u2013274 (2006)","journal-title":"Mathematical Programming"},{"key":"15_CR47","series-title":"Annals of Information Systems","volume-title":"Matheuristics. Hybridizing Metaheuristics and Mathematical Programming","year":"2009","unstructured":"Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. (eds.): Matheuristics. Hybridizing Metaheuristics and Mathematical Programming. Annals of Information Systems, vol.\u00a010. Springer, Heidelberg (2009)"},{"issue":"10","key":"15_CR48","doi-asserted-by":"publisher","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 capacitated vehicle routing problems. Computers & Operations Research\u00a034(10), 2964\u20132975 (2007)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"15_CR49","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1287\/ijoc.1040.0089","volume":"18","author":"M. Monaci","year":"2006","unstructured":"Monaci, M., Toth, P.: A set-covering-based heuristic approach for bin-packing problems. INFORMS Journal on Computing\u00a018(1), 71\u201385 (2006)","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"15_CR50","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1016\/j.ejor.2006.02.030","volume":"183","author":"M. Mourgaya","year":"2007","unstructured":"Mourgaya, M., Vanderbeck, F.: Column generation based heuristic for tactical planning in multi-period vehicle routing. European Journal of Operational Research\u00a0183(3), 1028\u20131041 (2007)","journal-title":"European Journal of Operational Research"},{"key":"15_CR51","series-title":"The Vehicle Routing Problem","first-page":"53","volume-title":"Branch-and-cut algorithms for the capacitated VRP","author":"D. Naddef","year":"2001","unstructured":"Naddef, D., Rinaldi, G.: Branch-and-cut algorithms for the capacitated VRP. The Vehicle Routing Problem, pp. 53\u201384. SIAM, Philadelphia (2001)"},{"key":"15_CR52","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/978-1-4419-1306-7_11","volume-title":"Hybridizing Metaheuristics and Mathematical Programming","author":"S.U. Ngueveu","year":"2009","unstructured":"Ngueveu, S.U., Prins, C., Calvo, R.W.: A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem, Matheuristics. In: Hybridizing Metaheuristics and Mathematical Programming, vol.\u00a010, pp. 253\u2013266. Springer, Heidelberg (2009)"},{"key":"15_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-88439-2_3","volume-title":"Hybrid Metaheuristics","author":"A. Ostertag","year":"2008","unstructured":"Ostertag, A., Doerner, K.F., Hartl, R.F.: Variable neighborhood search integrated in the POPMUSIC framework for a large scale vehicle routing problem. In: Blesa, M.J., Blum, C., Cotta, C., Fern\u00e1ndez, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) HM 2008. LNCS, vol.\u00a05296, pp. 29\u201342. Springer, Heidelberg (2008)"},{"key":"15_CR54","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1057\/palgrave.jors.2602633","volume":"60","author":"A. Ostertag","year":"2009","unstructured":"Ostertag, A., Doerner, K.F., Hartl, R.F., Taillard, E.D., Waelti, P.: POPMUSIC for a real-world large-scale vehicle routing problem with time windows. Journal of the Operational Research Society\u00a060, 934\u2013943 (2009)","journal-title":"Journal of the Operational Research Society"},{"key":"15_CR55","doi-asserted-by":"crossref","unstructured":"Parragh, S.N., Cordeau, J.F., Doerner, K.F., Hartl, R.F.: Models and algorithms for the heterogeneous dial-a-ride problem with driver related constraints, Technical report (2009)","DOI":"10.1007\/s00291-010-0229-9"},{"key":"15_CR56","doi-asserted-by":"crossref","unstructured":"Pirkwieser, S., Raidl, G.R.: Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques. In: Proceedings of the 8th Metaheuristic International Conference (MIC 2009), Hamburg, Germany, July 13-16 (2009)","DOI":"10.1007\/978-3-642-04918-7_4"},{"key":"15_CR57","unstructured":"Pirkwieser, S., Raidl, G.R.: A column generation approach for the periodic vehicle routing problem with time windows. In: Proceedings of the International Network Optimization Conference (INOC 2009), Pisa, Italy, April 26-29 (2009)"},{"key":"15_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-04918-7_4","volume-title":"Hybrid Metaheuristics","author":"S. Pirkwieser","year":"2009","unstructured":"Pirkwieser, S., Raidl, G.R.: Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows. In: Blesa, M., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol.\u00a05818, pp. 45\u201359. Springer, Heidelberg (2009)"},{"key":"15_CR59","unstructured":"Pirkwieser, S., Raidl, G.R.: Matheuristics for the periodic vehicle routing problem with time windows. In: Proceedings of Matheuristics 2010 - Third International Workshop on Model-based Metaheuristics, Vienna, Austria, June 28-30 (2010)"},{"issue":"2","key":"15_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03343534","volume":"1","author":"M. Polacek","year":"2008","unstructured":"Polacek, M., Benkner, S., Doerner, K.F., Hartl, R.F.: A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows. Business Research\u00a01(2), 1\u201312 (2008)","journal-title":"Business Research"},{"issue":"6","key":"15_CR61","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","volume":"10","author":"M. Polacek","year":"2004","unstructured":"Polacek, M., Hartl, R.F., Doerner, K., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics\u00a010(6), 613\u2013627 (2004)","journal-title":"Journal of Heuristics"},{"issue":"12","key":"15_CR62","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C. Prins","year":"2004","unstructured":"Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research\u00a031(12), 1985\u20132002 (2004)","journal-title":"Computers & Operations Research"},{"issue":"4","key":"15_CR63","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/trsc.1060.0187","volume":"41","author":"C. Prins","year":"2007","unstructured":"Prins, C., Prodhon, C., Ruiz, A., Soriano, P., Calvo, R.W.: Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science\u00a041(4), 470\u2013483 (2007)","journal-title":"Transportation Science"},{"key":"15_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11499305_5","volume-title":"Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach","author":"J. Puchinger","year":"2005","unstructured":"Puchinger, J., Raidl, G.R.: Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In: Mira, J., \u00c1lvarez, J.R. (eds.) IWINAC 2005. LNCS, vol.\u00a03562, pp. 41\u201353. Springer, Heidelberg (2005)"},{"key":"15_CR65","doi-asserted-by":"crossref","unstructured":"Raidl, G.R., Puchinger, J., Blum, C.: Metaheuristic hybrids (2010) (to appear)","DOI":"10.1007\/978-1-4419-1665-5_16"},{"issue":"1","key":"15_CR66","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1287\/trsc.1090.0295","volume":"44","author":"W. Rei","year":"2010","unstructured":"Rei, W., Gendreau, M., Soriano, P.: A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands. Transportation Science\u00a044(1), 136\u2013146 (2010)","journal-title":"Transportation Science"},{"issue":"4","key":"15_CR67","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","volume":"31","author":"M. Reimann","year":"2004","unstructured":"Reimann, M., Doerner, K.F., Hartl, R.F.: D-ants: Savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research\u00a031(4), 563\u2013591 (2004)","journal-title":"Computers & Operations Research"},{"issue":"2","key":"15_CR68","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1057\/jors.1996.29","volume":"47","author":"J. Renaud","year":"1996","unstructured":"Renaud, J., Boctor, F.F., Laporte, G.: An improved petal heuristic for the vehicle routeing problem. The Journal of the Operational Research Society\u00a047(2), 329\u2013336 (1996)","journal-title":"The Journal of the Operational Research Society"},{"issue":"3","key":"15_CR69","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1057\/jors.1993.54","volume":"44","author":"D.M. Ryan","year":"1993","unstructured":"Ryan, D.M., Hjorring, C., Glover, F.: Extensions of the petal method for vehicle routeing. The Journal of the Operational Research Society\u00a044(3), 289\u2013296 (1993)","journal-title":"The Journal of the Operational Research Society"},{"issue":"12","key":"15_CR70","doi-asserted-by":"publisher","first-page":"2106","DOI":"10.1016\/j.cor.2010.02.010","volume":"37","author":"M. Salari","year":"2010","unstructured":"Salari, M., Toth, P., Tramontani, A.: An ILP improvement procedure for the open vehicle routing problem. Computers & Operations Research\u00a037(12), 2106\u20132120 (2010)","journal-title":"Computers & Operations Research"},{"key":"15_CR71","unstructured":"Schmid, V.: Trucks in Movement: Hybridization of Exact Approaches and Variable Neighborhood Search for the Delivery of Ready-Mixed Concrete. Ph.D. thesis, University of Vienna (2007)"},{"issue":"3","key":"15_CR72","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.cor.2008.07.010","volume":"37","author":"V. Schmid","year":"2010","unstructured":"Schmid, V., Doerner, K.F., Hartl, R.F., Salazar-Gonz\u00e1lez, J.J.: Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. Computers & Operations Research\u00a037(3), 559\u2013574 (2010)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"15_CR73","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/trsc.1080.0249","volume":"43","author":"V. Schmid","year":"2009","unstructured":"Schmid, V., Doerner, K.F., Hartl, R.F., Savelsbergh, M.W.P., Stoecher, W.: A hybrid solution approach for ready-mixed concrete delivery. Transportation Science\u00a043(1), 70\u201385 (2009)","journal-title":"Transportation Science"},{"key":"15_CR74","series-title":"Lecture Notes in Computer Science","volume-title":"Hybrid Metaheuristics","author":"J. Strodl","year":"2010","unstructured":"Strodl, J., Doerner, K.F., Tricoire, F., Hartl, R.F.: On index structures in hybrid metaheuristics for routing problems with hard feasibility checks: an application to the 2-dimensional loading vehicle routing problem. In: Hybrid Metaheuristics. LNCS. Springer, Heidelberg (2010)"},{"key":"15_CR75","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4_27","volume-title":"Essays and Surveys in Metaheuristics, 3rd Metaheuristics International Conference (MIC 1999)","author":"E.D. Taillard","year":"2002","unstructured":"Taillard, E.D., Vo\u00df, S.: Partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, 3rd Metaheuristics International Conference (MIC 1999), July 18-22, pp. 613\u2013629. Kluwer, Dordrecht (2002)"},{"key":"15_CR76","first-page":"1","volume-title":"Fleet Management and Logistics","author":"P. Toth","year":"1998","unstructured":"Toth, P., Vigo, D.: Exact algorithms for vehicle routing. In: Crainic, T.G., Laporte, G. (eds.) Fleet Management and Logistics, pp. 1\u201331. Kluwer, Dordrecht (1998)"},{"key":"15_CR77","series-title":"The Vehicle Routing Problem","first-page":"29","volume-title":"Branch-and-bound algorithms for the capacitated VRP","author":"P. Toth","year":"2001","unstructured":"Toth, P., Vigo, D.: Branch-and-bound algorithms for the capacitated VRP. The Vehicle Routing Problem, pp. 29\u201351. SIAM, Philadelphia (2001)"},{"key":"15_CR78","series-title":"The Vehicle Routing Problem","first-page":"1","volume-title":"An overview of vehicle routing problems","author":"P. Toth","year":"2001","unstructured":"Toth, P., Vigo, D.: An overview of vehicle routing problems. The Vehicle Routing Problem, pp. 1\u201326. SIAM, Philadelphia (2001)"},{"key":"15_CR79","series-title":"SIAM Monographs on Discrete Mathematics and Applications","volume-title":"The Vehicle Routing Problem","year":"2001","unstructured":"Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2001)"},{"issue":"4","key":"15_CR80","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P. Toth","year":"2003","unstructured":"Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle-routing problem. INFORMS Journal on Computing\u00a015(4), 333\u2013346 (2003)","journal-title":"INFORMS Journal on Computing"},{"key":"15_CR81","doi-asserted-by":"crossref","unstructured":"Tricoire, F., Doerner, K.F., Hartl, R.F., Iori, M.: Heuristic and exact algorithms for the multi-pile vehicle routing problem. OR Spectrum (2009) (published online)","DOI":"10.1007\/s00291-009-0179-2"},{"issue":"2","key":"15_CR82","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.cor.2009.05.012","volume":"37","author":"F. Tricoire","year":"2010","unstructured":"Tricoire, F., Romauch, M., Doerner, K.F., Hartl, R.F.: Heuristics for the multi-period orienteering problem with multiple time windows. Computers & Operations Research\u00a037(2), 351\u2013367 (2010)","journal-title":"Computers & Operations Research"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16054-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T15:14:49Z","timestamp":1685805289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16054-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160530","9783642160547"],"references-count":82,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16054-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}