{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T03:56:41Z","timestamp":1782187001436,"version":"3.54.5"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"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":[[2014,2]]},"DOI":"10.1007\/s10732-013-9232-z","type":"journal-article","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T07:22:26Z","timestamp":1376637746000},"page":"75-106","source":"Crossref","is-referenced-by-count":13,"title":["Experience with a framework for developing heuristics for solving rich vehicle routing problems"],"prefix":"10.1007","volume":"20","author":[{"given":"Ulrich","family":"Derigs","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ulrich","family":"Vogel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,8,17]]},"reference":[{"issue":"1","key":"9232_CR1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/trsc.1070.0204","volume":"42","author":"C Archetti","year":"2008","unstructured":"Archetti, C., Speranza, M.G., Savelsbergh, M.: An optimization-based heuristic for the split delivery vehicle routing problem. Transp. Sci. 42(1), 22\u201331 (2008)","journal-title":"Transp. Sci."},{"issue":"2","key":"9232_CR2","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s00291-007-0110-7","volume":"31","author":"P Bartodziej","year":"2009","unstructured":"Bartodziej, P., Derigs, U., Malcherek, D., Vogel, U.: Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints: an application to road feeder service planning in air cargo transportation. OR Spectr. 31(2), 405\u2013429 (2009)","journal-title":"OR Spectr."},{"issue":"4","key":"9232_CR3","doi-asserted-by":"crossref","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. Transp. Sci. 38(4), 515\u2013530 (2004)","journal-title":"Transp. Sci."},{"issue":"3","key":"9232_CR4","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1287\/trsc.1030.0046","volume":"38","author":"AM Campbell","year":"2004","unstructured":"Campbell, A.M., Savelsbergh, M.: Efficient insertion heuristics for vehicle routing and scheduling problems. Transp. Sci. 38(3), 369\u2013378 (2004)","journal-title":"Transp. Sci."},{"issue":"1","key":"9232_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0305-0548(00)00056-3","volume":"29","author":"IM Chao","year":"2002","unstructured":"Chao, I.M.: A tabu search method for the truck and trailer routing problem. Comput. Oper. Res. 29(1), 33\u201351 (2002)","journal-title":"Comput. Oper. Res."},{"key":"9232_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 (1979)"},{"key":"9232_CR7","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"9232_CR8","unstructured":"Cordeau, J.F., Gendreau, M., Laporte, G., Potvin, J.Y., Semet, F.: A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53(5), 512\u2013522 (2002)"},{"issue":"1","key":"9232_CR9","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manag. Sci."},{"key":"9232_CR10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00291-006-0072-1","volume":"30","author":"U Derigs","year":"2008","unstructured":"Derigs, U., D\u00f6hmer, T.: Indirect search for the vehicle routing problem with pickup and delivery and time windows. OR Spectr. 30, 149\u2013165 (2008)","journal-title":"OR Spectr."},{"issue":"2","key":"9232_CR11","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/j.ejor.2005.11.038","volume":"177","author":"U Derigs","year":"2007","unstructured":"Derigs, U., Kaiser, R.: Applying the attribute based hill climber heuristic to the vehicle routing problem. Eur. J. Oper. Res. 177(2), 719\u2013732 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9232_CR12","unstructured":"Derigs, U., Vogel, U.: A computational study on neighborhood search heuristics for the open vehicle routing problem with time windows. In: Proceedings of the 8th Metaheuristic International Conference (MIC 2009), pp 109\u2013122 (2009)"},{"key":"9232_CR13","doi-asserted-by":"crossref","first-page":"1356","DOI":"10.1057\/jors.2009.100","volume":"61","author":"U Derigs","year":"2010","unstructured":"Derigs, U., Li, B., Vogel, U.: Local search-based metaheuristics for the split delivery vehicle routing problem. J. Oper. Res. Soc. 61, 1356\u20131364 (2010)","journal-title":"J. Oper. Res. Soc."},{"key":"9232_CR14","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1007\/s00291-010-0194-3","volume":"33","author":"U Derigs","year":"2011","unstructured":"Derigs, U., Gottlieb, J., Kalkoff, J., Piesche, M., Rothlauf, F., Vogel, U.: Vehicle routing with compartments: applications, modelling and heuristics. OR Spectr. 33, 885\u2013914 (2011)","journal-title":"OR Spectr."},{"issue":"1\u20132","key":"9232_CR15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s12159-012-0080-2","volume":"5","author":"M Drexl","year":"2012","unstructured":"Drexl, M.: Rich vehicle routing in thory and practice. Logist. Res. 5(1\u20132), 47\u201363 (2012)","journal-title":"Logist. Res."},{"issue":"2","key":"9232_CR16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/trsc.23.2.141","volume":"23","author":"M Dror","year":"1989","unstructured":"Dror, M., Trudeau, P.: Savings by split delivery routing. Transp. Sci. 23(2), 141\u2013145 (1989)","journal-title":"Transp. Sci."},{"issue":"1","key":"9232_CR17","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. J. Comput. Phys. 104(1), 86\u201392 (1993)","journal-title":"J. Comput. Phys."},{"issue":"5","key":"9232_CR18","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1016\/j.cor.2006.10.006","volume":"35","author":"A Fallahi El","year":"2008","unstructured":"El Fallahi, A., Prins, C., Wolfler Calvo, R.: A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Comput. Oper. Res. 35(5), 1725\u20131741 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9232_CR19","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillett","year":"1974","unstructured":"Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2), 340\u2013349 (1974)","journal-title":"Oper. Res."},{"issue":"3","key":"9232_CR20","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search\u2014Part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"9232_CR21","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover, F.: Tabu search\u2013Part II. ORSA J. Comput. 2(1), 4\u201332 (1990)","journal-title":"ORSA J. Comput."},{"key":"9232_CR22","unstructured":"Glover, F.: Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem, working paper. College of Business and Administration, University of Colorado, Boulder, CO (1991)."},{"key":"9232_CR23","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.A., Kelly, J.P., Chao, I.M.: Metaheuristics in vehicle routing. In: Crainic, T.G., Laporte, G. (eds.) Fleet Management and Logistics, pp. 33\u201356. Kluwer Academic Publishers, Boston (1998)"},{"key":"9232_CR24","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s12532-010-0013-5","volume":"2","author":"C Gro\u00ebr","year":"2010","unstructured":"Gro\u00ebr, C., Golden, B., Wasil, E.: A library of local search heuristics for the vehicle routing problem. Math. Program. Comput. 2, 79\u2013101 (2010)","journal-title":"Math. Program. Comput."},{"key":"9232_CR25","unstructured":"Hasle, G., Kloster, O.: Industrial vehicle routing problems. In: Hasle, G., Lie, K.A., Quak, E. (eds.) Geometric Modelling, Numerical Simulation, and Optimization, Operations Research\/Computer Science Interfaces Series, pp 397\u2013432. Springer, Heidelberg (2007)."},{"issue":"3","key":"9232_CR26","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.ejor.2007.08.048","volume":"195","author":"VC Hemmelmayr","year":"2009","unstructured":"Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195(3), 791\u2013802 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9232_CR27","first-page":"270","volume":"20","author":"S Irnich","year":"2008","unstructured":"Irnich, S.: A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. J. Comput. 20(2), 270\u2013287 (2008)","journal-title":"J. Comput."},{"issue":"4","key":"9232_CR28","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte, G.: Fifty years of vehicle routing. Transp. Sci. 43(4), 408\u2013416 (2009)","journal-title":"Transp. Sci."},{"issue":"5","key":"9232_CR29","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1016\/j.cor.2008.04.005","volume":"36","author":"SW Lin","year":"2009","unstructured":"Lin, S.W., Yu, V.F., Chou, S.Y.: Solving the truck and trailer routing problem based on a simulated annealing heuristic. Comput. Oper. Res. 36(5), 1683\u20131692 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9232_CR30","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ejor.2010.02.020","volume":"206","author":"L Muyldermans","year":"2010","unstructured":"Muyldermans, L., Pang, G.: On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm. Eur. J. Oper. Res. 206(1), 93\u2013103 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"9232_CR31","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403\u20132435 (2007)","journal-title":"Comput. Oper. Res."},{"key":"9232_CR32","unstructured":"Ropke, S.: Heuristic solutions for the CVRP. http:\/\/www.diku.dk\/sropke\/ (2011). Accessed 9 Jan 2011"},{"issue":"4","key":"9232_CR33","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"key":"9232_CR34","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. 159, 139\u2013171 (2000)","journal-title":"J. Comput. Phys."},{"key":"9232_CR35","unstructured":"Shaw, P.: A new local search algorithm providing high quality solutions to vehicle routing problems. Technical report, APES group (1998a)"},{"key":"9232_CR36","doi-asserted-by":"crossref","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: CP-98 Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming, Pisa, Italy (1998b)","DOI":"10.1007\/3-540-49481-2_30"},{"key":"9232_CR37","unstructured":"SINTEF: Transportation optimization portal of SINTEF applied mathematics. http:\/\/www.sintef.no\/projectweb\/top\/ (2011). Accessed 12 Aug 2011"},{"key":"9232_CR38","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254\u2013265 (1987)","journal-title":"Oper. Res."},{"key":"9232_CR39","doi-asserted-by":"crossref","unstructured":"Sorensen, K., Seveaux, M., Schittekat, P.: Multiple neighbourhood search in commerial vrp packages: evolving towards self-adapting methods. In: Cotta, C., et al. (eds.) Adaptive and Multilevel Metaheuristics. SCI, vol. 136, pp. 65\u201388. Springer, New York (2008)","DOI":"10.1007\/978-3-540-79438-7_12"},{"key":"9232_CR40","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","volume-title":"The Vehicle Routing Problem","author":"P Toth","year":"2002","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM, Philadelphia (2002)"},{"key":"9232_CR41","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems. Technical Report, CIRRELT-2011-05, University of Montreal (2011)"},{"issue":"9","key":"9232_CR42","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1016\/j.cor.2010.11.011","volume":"38","author":"JG Villegas","year":"2011","unstructured":"Villegas, J.G., Prins, C., Prodhon, C., Medaglia, A.L., Velasco, N.: A GRASP with evolutionary path relinking for the truck and trailer routing problem. Comput. Oper. Res. 38(9), 1319\u20131334 (2011)","journal-title":"Comput. Oper. Res."},{"key":"9232_CR43","unstructured":"Vogel, U.: A flexible metaheuristic framework for solving rich vehicle routing problems. PhD thesis, University of Cologne, Germany (2011)"},{"key":"9232_CR44","volume-title":"Optimization Software Class Libraries","year":"2002","unstructured":"Voss, S., Woodruff, D. (eds.): Optimization Software Class Libraries. Kluwer Academic Publishers, Boston (2002)"},{"key":"9232_CR45","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","year":"1999","unstructured":"Voss, S., Osman, I.H., Roucairol, C. (eds.): Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Norwell (1999)"},{"issue":"2","key":"9232_CR46","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1023\/B:JMMA.0000036583.17284.02","volume":"3","author":"IM Whittley","year":"2004","unstructured":"Whittley, I.M., Smith, G.D.: The attribute based hill climber. J. Math. Model. Algorithm. 3(2), 167\u2013178 (2004)","journal-title":"J. Math. Model. Algorithm."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9232-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-013-9232-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9232-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,21]],"date-time":"2019-07-21T03:51:57Z","timestamp":1563681117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-013-9232-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,17]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9232"],"URL":"https:\/\/doi.org\/10.1007\/s10732-013-9232-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,17]]}}}