{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:19:57Z","timestamp":1765545597971},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T00:00:00Z","timestamp":1265846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s00291-010-0194-3","type":"journal-article","created":{"date-parts":[[2010,2,10]],"date-time":"2010-02-10T09:33:46Z","timestamp":1265794426000},"page":"885-914","source":"Crossref","is-referenced-by-count":98,"title":["Vehicle routing with compartments: applications, modelling and heuristics"],"prefix":"10.1007","volume":"33","author":[{"given":"Ulrich","family":"Derigs","sequence":"first","affiliation":[]},{"given":"Jens","family":"Gottlieb","sequence":"additional","affiliation":[]},{"given":"Jochen","family":"Kalkoff","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Piesche","sequence":"additional","affiliation":[]},{"given":"Franz","family":"Rothlauf","sequence":"additional","affiliation":[]},{"given":"Ulrich","family":"Vogel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,11]]},"reference":[{"issue":"1","key":"194_CR1","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/trsc.1040.0103","volume":"40","author":"C Archetti","year":"2006","unstructured":"Archetti C, Speranza M, Hertz A (2006) A tabu search algorithm for the split delivery vehicle routing problem. Transp Sci 40(1): 64\u201373","journal-title":"Transp Sci"},{"issue":"1","key":"194_CR2","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/S0377-2217(02)00676-8","volume":"152","author":"P Avella","year":"2004","unstructured":"Avella P, Boccia M, Sforza A (2004) Solving a fuel delivery problem by heuristic and exact approaches. Eur J Oper Res 152(1): 170\u2013179","journal-title":"Eur J Oper Res"},{"issue":"2","key":"194_CR3","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 (2009) 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","journal-title":"OR Spectr"},{"issue":"1","key":"194_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/mnsc.27.1.19","volume":"27","author":"G Brown","year":"1981","unstructured":"Brown G, Graves G (1981) Real-time dispatch of petroleum tank trucks. Manag Sci 27(1): 19\u201332","journal-title":"Manag Sci"},{"issue":"1","key":"194_CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1023067016014","volume":"26","author":"E Chajakis","year":"2003","unstructured":"Chajakis E, Guignard M (2003) Scheduling deliveries in vehicles with multiple compartments. J Glob Optim 26(1): 43\u201378","journal-title":"J Glob Optim"},{"key":"194_CR6","first-page":"315","volume-title":"Combinatorial optimization","author":"N Christofides","year":"1979","unstructured":"Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization. Wiley, Chichester, pp 315\u2013338"},{"key":"194_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 (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12: 568\u2013581","journal-title":"Oper Res"},{"key":"194_CR8","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J-F Cordeau","year":"2002","unstructured":"Cordeau J-F, Gendreau M, Laporte G, Potvin J-Y, Semet F (2002) A guide to vehicle routing heuristics. J Oper Res Soc 53: 512\u2013522","journal-title":"J Oper Res Soc"},{"key":"194_CR9","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/0-387-24977-X_9","volume-title":"Logistic systems: design and optimization","author":"J-F Cordeau","year":"2005","unstructured":"Cordeau J-F, Gendreau M, Hertz A, Laporte G, Sormany J (2005) New heuristics for the vehicle routing problem. In: Langevin A, Riopel D (eds) Logistic systems: design and optimization. Wiley, Chichester, pp 279\u2013298"},{"issue":"2","key":"194_CR10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.ejor.2007.08.016","volume":"191","author":"F Cornillier","year":"2008","unstructured":"Cornillier F, Boctor F, Laporte G, Renaud J (2008) A heuristic for the multi-period petrol station replenishment problem. Eur J Oper Res 191(2): 295\u2013305","journal-title":"Eur J Oper Res"},{"issue":"2","key":"194_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 (2007) Applying the attribute based hill climber heuristic to the vehicle routing problem. Eur J Oper Res 177(2): 719\u2013732","journal-title":"Eur J Oper Res"},{"key":"194_CR12","doi-asserted-by":"crossref","unstructured":"Derigs U, Li B, Vogel U (2009) Local search-based metaheuristics for the split delivery vehicle routing problem. J Oper Res Soc. doi: 10.1057\/jors.2009.100","DOI":"10.1057\/jors.2009.100"},{"key":"194_CR13","doi-asserted-by":"crossref","first-page":"1658","DOI":"10.1057\/jors.2008.107","volume":"60","author":"U Derigs","year":"2009","unstructured":"Derigs U, Reuter K (2009) A simple and efficient tabu search heuristic for solving the open vehicle routing problem. J Oper Res Soc 60: 1658\u20131669","journal-title":"J Oper Res Soc"},{"key":"194_CR14","unstructured":"Derigs U, Vogel U (2009) A computational study on neighborhood search heuristics for the open vehicle routing problem with time windows. In: MIC 2009: the VIII metaheuristics international conference"},{"issue":"2","key":"194_CR15","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 (1989) Savings by split delivery routing. Transp Sci 23(2): 141\u2013145","journal-title":"Transp Sci"},{"issue":"1","key":"194_CR16","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G Dueck","year":"1993","unstructured":"Dueck G (1993) New optimization heuristics. J Comput Phys 104(1): 86\u201392","journal-title":"J Comput Phys"},{"key":"194_CR17","volume-title":"Distribution management: mathematical modelling and practical analysis","author":"S Eilon","year":"1971","unstructured":"Eilon S, Watson-Gandy C, Christofides N (1971) Distribution management: mathematical modelling and practical analysis. Griffin, London"},{"issue":"5","key":"194_CR18","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1016\/j.cor.2006.10.006","volume":"35","author":"A El Fallahi","year":"2008","unstructured":"El Fallahi A, Prins C, Wolfler Calvo R (2008) A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Comput Oper Res 35(5): 1725\u20131741","journal-title":"Comput Oper Res"},{"issue":"7","key":"194_CR19","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1057\/palgrave.jors.2600973","volume":"51","author":"K Fagerholt","year":"2000","unstructured":"Fagerholt K, Christiansen M (2000) A combined ship scheduling and allocation problem. J Oper Res Soc 51(7): 834\u2013842","journal-title":"J Oper Res Soc"},{"issue":"2","key":"194_CR20","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillett","year":"1974","unstructured":"Gillett BE, Miller LR (1974) A heuristic algorithm for the vehicle-dispatch problem. Oper Res 22(2): 340\u2013349","journal-title":"Oper Res"},{"issue":"3","key":"194_CR21","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014part I. ORSA J Comput 1(3): 190\u2013206","journal-title":"ORSA J Comput"},{"issue":"1","key":"194_CR22","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search\u2014part II. ORSA J Comput 2(1): 4\u201332","journal-title":"ORSA J Comput"},{"issue":"3","key":"194_CR23","first-page":"653","volume":"39","author":"F Glover","year":"2000","unstructured":"Glover F, Laguna M, Marti R (2000) Fundamentals of scatter search and path relinking. Control Cybern 39(3): 653\u2013684","journal-title":"Control Cybern"},{"key":"194_CR24","volume-title":"Stochastic local search. Foundations and applications","author":"HH Hoos","year":"2004","unstructured":"Hoos HH, St\u00fctzle T (2004) Stochastic local search. Foundations and applications. Elsevier\/Morgan Kaufmann, San Francisco"},{"key":"194_CR25","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1016\/j.compchemeng.2003.08.009","volume":"28","author":"AS Jetlund","year":"2004","unstructured":"Jetlund AS, Karimi IA (2004) Improving the logistics of multi-compartment chemical tankers. Comput Chem Eng 28: 1267\u20131283","journal-title":"Comput Chem Eng"},{"key":"194_CR26","unstructured":"Kalkoff J (2006) Generierung von Benchmarks und empirische Analyse von Metaheuristiken f\u00fcr Tourenplanungsprobleme mit teilbaren Frachtr\u00e4umen. Diplomarbeit, Lehrstuhl f\u00fcr Wirtschaftsinformatik I, Universit\u00e4t Mannheim"},{"key":"194_CR27","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 CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220: 671\u2013680","journal-title":"Science"},{"issue":"2","key":"194_CR28","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan B (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2): 498\u2013516","journal-title":"Oper Res"},{"key":"194_CR29","first-page":"321","volume-title":"Handbook of metaheuristics","author":"H Louren\u00e7o","year":"2002","unstructured":"Louren\u00e7o H, Martin O, St\u00fctzle T (2002) Iterated local search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer, Norwell, pp 321\u2013353"},{"key":"194_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic algorithms + data structures = evolution programs","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z (1996) Genetic algorithms + data structures = evolution programs, 3rd edn. Springer, Berlin","edition":"3"},{"issue":"11","key":"194_CR31","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11): 1097\u20131100","journal-title":"Comput Oper Res"},{"key":"194_CR32","first-page":"219","volume-title":"New ideas in optimization","author":"P Moscato","year":"1999","unstructured":"Moscato P (1999) Memetic algorithms: a short introduction. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, London, pp 219\u2013234"},{"key":"194_CR33","unstructured":"Muyldermans L, Pang G (2007) On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm (submitted)"},{"key":"194_CR34","unstructured":"Or I (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. Ph.D. thesis, Department of Industrial Engineering and Management Sciences, Northwestern University"},{"key":"194_CR35","unstructured":"Piesche M (2007) Entwicklung und Praxistest leistungsf\u00e4higer Meta-Heuristiken f\u00fcr das Vehicle Routing Problem mit teilbaren Frachtr\u00e4umen. Diplomarbeit, Seminar f\u00fcr Wirtschaftsinformatik und Operations Research, Universit\u00e4t zu K\u00f6ln"},{"issue":"8","key":"194_CR36","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 (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34(8): 2403\u20132435","journal-title":"Comput Oper Res"},{"issue":"12","key":"194_CR37","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"J-Y Potvin","year":"1995","unstructured":"Potvin J-Y, Rousseau J-M (1995) An exchange heuristic for routing problems with time windows. J Oper Res Soc 46(12): 1433\u20131446","journal-title":"J Oper Res Soc"},{"issue":"4","key":"194_CR38","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 (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4): 455\u2013472","journal-title":"Transp Sci"},{"key":"194_CR39","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 (2000) Record breaking optimization results using the ruin and recreate principle. J Comput Phys 159: 139\u2013171","journal-title":"J Comput Phys"},{"key":"194_CR40","unstructured":"Shaw P (1998a) A new local search algorithm providing high quality solutions to vehicle routing problems. Technical report, APES group"},{"key":"194_CR41","doi-asserted-by":"crossref","unstructured":"Shaw P (1998b) Using constraint programming and local search methods to solve vehicle routing problems. In: Proceedings CP-98 fourth international conference on principles and practice of constraint programming","DOI":"10.1007\/3-540-49481-2_30"},{"key":"194_CR42","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem. SIAM","DOI":"10.1137\/1.9780898718515"},{"issue":"3","key":"194_CR43","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1016\/0377-2217(94)00189-J","volume":"81","author":"L Bruggen Van der","year":"1995","unstructured":"Van der Bruggen L, Gruson R, Salomon M (1995) Reconsidering the distribution structure of gasoline products for a large oil company. Eur J Oper Res 81(3): 460\u2013473","journal-title":"Eur J Oper Res"},{"issue":"2","key":"194_CR44","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1023\/B:JMMA.0000036583.17284.02","volume":"3","author":"I Whittley","year":"2004","unstructured":"Whittley I, Smith G (2004) The attribute based hill climber. J Math Model Algorithm 3(2): 167\u2013178","journal-title":"J Math Model Algorithm"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-010-0194-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-010-0194-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-010-0194-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:59Z","timestamp":1559041199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-010-0194-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,11]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["194"],"URL":"https:\/\/doi.org\/10.1007\/s00291-010-0194-3","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,11]]}}}