{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T16:28:09Z","timestamp":1706200089375},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,7,8]],"date-time":"2008-07-08T00:00:00Z","timestamp":1215475200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s00186-008-0236-7","type":"journal-article","created":{"date-parts":[[2008,7,7]],"date-time":"2008-07-07T16:31:41Z","timestamp":1215448301000},"page":"361-382","source":"Crossref","is-referenced-by-count":25,"title":["EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem"],"prefix":"10.1007","volume":"68","author":[{"given":"Guido","family":"Perboli","sequence":"first","affiliation":[]},{"given":"Ferdinando","family":"Pezzella","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tadei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,7,8]]},"reference":[{"issue":"3","key":"236_CR1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0305-0548(98)00047-1","volume":"26","author":"G Barbaroso\u011flu","year":"1999","unstructured":"Barbaroso\u011flu G, Ozgur D (1999) A tabu search algorithm for the vehicle routing problem. Comput Oper Res 26(3): 255\u2013270","journal-title":"Comput Oper Res"},{"issue":"12","key":"236_CR2","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1057\/palgrave.jors.2601635","volume":"54","author":"J Berger","year":"2003","unstructured":"Berger J, Barkaoui M (2003) A new hybrid genetic algorithm for the capacitated vehicle routing problem. J Oper Res Soc 54(12): 1254\u20131262","journal-title":"J Oper Res Soc"},{"issue":"3","key":"236_CR3","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35(3): 268\u2013308","journal-title":"ACM Comput Surv"},{"key":"236_CR4","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"},{"issue":"4","key":"236_CR5","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 JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4): 568\u2013581","journal-title":"Oper Res"},{"key":"236_CR6","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/0-387-24977-X_9","volume-title":"Logistics systems: design and optimization","author":"J-F Cordeau","year":"2005","unstructured":"Cordeau J-F, Gendreau M, Hertz A, Laporte G, Sormany J-S (2005) New heuristics for the vehicle routing problem. In: Langevin A, Riopel D (eds) Logistics systems: design and optimization. Springer, New York, pp 279\u2013297"},{"issue":"5","key":"236_CR7","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(5): 512\u2013522","journal-title":"J Oper Res Soc"},{"issue":"8","key":"236_CR8","doi-asserted-by":"crossref","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 (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc 52(8): 928\u2013936","journal-title":"J Oper Res Soc"},{"key":"236_CR9","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0927-0507(06)14006-2","volume-title":"Transportation","author":"J-F Cordeau","year":"2007","unstructured":"Cordeau J-F, Laporte G, Savelsbergh MWP, Vigo D (2007) Vehicle Routing. In: Barnhart C, Laporte G (eds) Transportation. North Holland, Amsterdam, pp 367\u2013428"},{"key":"236_CR10","doi-asserted-by":"crossref","unstructured":"Crainic TG, Perboli G, Tadei R (2007) TS2 PACK: A two-stage tabu search heuristic for the three-dimensional bin packing problem. Eur J Oper Res (in press). doi: 10.1016\/j.ejor.2007.06.063","DOI":"10.1016\/j.ejor.2007.06.063"},{"issue":"1\u20132","key":"236_CR11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10732-006-5561-5","volume":"12","author":"O Ergun","year":"2006","unstructured":"Ergun O, Orlin JB, Steele-Feldman A (2006) Creating very large scale neighborhoods out of smaller ones by compounding moves. J Heuristics 12(1\u20132): 115\u2013140","journal-title":"J Heuristics"},{"key":"236_CR12","unstructured":"European Commission (2006) Energy and Transport, European energy and transport-Trends to 2030, Office for Official Publications of the European Communities"},{"issue":"3","key":"236_CR13","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R Fukasawa","year":"2005","unstructured":"Fukasawa R, Lysgaard J, Poggide Aragao M, Reis M, Uchoa E, Werneck RF (2005) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program 106(3): 491\u2013511","journal-title":"Math Program"},{"issue":"10","key":"236_CR14","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manage Sci 40(10): 1276\u20131290","journal-title":"Manage Sci"},{"key":"236_CR15","first-page":"829","volume-title":"Artificial neural networks","author":"H Ghaziri","year":"1991","unstructured":"Ghaziri H (1991) Solving routing problems by a self-organizing map. In: Kohonen T, Makisara K, Simula O, Kangas J (eds) Artificial neural networks. North-Holland, Amsterdam, pp 829\u2013834"},{"key":"236_CR16","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1007\/978-1-4613-1361-8_39","volume-title":"Meta-heuristics: theory and applications","author":"H Ghaziri","year":"1996","unstructured":"Ghaziri H (1996) Supervision in the self-organizing feature map: application to the vehicle routing problem. In: Osman IH, Kelly JP (eds) Meta-heuristics: theory and applications. Kluwer, Boston, pp 651\u2013660"},{"issue":"3","key":"236_CR17","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":"236_CR18","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"},{"key":"236_CR19","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-1-4615-5755-5_2","volume-title":"Fleet management and logistics","author":"BL Golden","year":"1998","unstructured":"Golden BL, Wasil EA, Kelly JP, Chao I-M (1998) Metaheuristics in vehicle routing. In: Crainic TG, Laporte G (eds) Fleet management and logistics. Kluwer, Boston, pp 33\u201356"},{"issue":"5","key":"236_CR20","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1016\/j.cor.2003.10.002","volume":"32","author":"F Li","year":"2005","unstructured":"Li F, Golden BL, Wasil EA (2005) Very large-scale vehicle routing: New test problems, algorithms, and results. Comput Oper Res 32(5): 1165\u20131179","journal-title":"Comput Oper Res"},{"issue":"2","key":"236_CR21","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm forthe capacitated vehicle routing problem. Math Program 100(2): 423\u2013445","journal-title":"Math Program"},{"key":"236_CR22","doi-asserted-by":"crossref","unstructured":"Matsuyama Y (1991) Self-organization via competition, cooperation and categorization applied to extended vehicle routing problems. In: Proceedings of the International Joint Conference on Neural Networks, Seattle, pp 385\u2013390","DOI":"10.1109\/IJCNN.1991.155208"},{"issue":"6","key":"236_CR23","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1016\/j.cor.2003.11.017","volume":"32","author":"D Mester","year":"2005","unstructured":"Mester D, Br\u00e4ysy O (2005) Active guided evolution strategies for the large scale vehicle routing problems with time windows. Comput Oper Res 32(6): 1593\u20131614","journal-title":"Comput Oper Res"},{"key":"236_CR24","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An introduction to genetic algorithms","author":"M Mitchell","year":"1998","unstructured":"Mitchell M (1998) An introduction to genetic algorithms. MIT Press, Cambridge"},{"issue":"1\u20134","key":"236_CR25","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41(1\u20134): 421\u2013451","journal-title":"Ann Oper Res"},{"key":"236_CR26","unstructured":"Perboli G (2002) Bounds and heuristics for the packing problems. Ph.D. thesis, Politecnico di Torino"},{"issue":"12","key":"236_CR27","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31(12): 1985\u20132002","journal-title":"Comput Oper Res"},{"key":"236_CR28","volume-title":"Shipping costs, manufactured exports and economic growth","author":"S Radelet","year":"1999","unstructured":"Radelet S, Sachs J-D (1999) Shipping costs, manufactured exports and economic growth. Harvard Institute for International Development, Cambridge"},{"issue":"10","key":"236_CR29","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) A subpath ejection method for the vehicle routing problem. Manage Sci 44(10): 1447\u20131459","journal-title":"Manage Sci"},{"key":"236_CR30","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/978-1-4613-1361-8_40","volume-title":"Meta-heuristics: theory and applications","author":"C Rego","year":"1996","unstructured":"Rego C, Roucairol C (1996) A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In: Osman IH, Kelly JP (eds) Meta-heuristics: theory and applications. Kluwer, Boston, pp 661\u2013675"},{"issue":"4","key":"236_CR31","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","volume":"31","author":"M Reimann","year":"2004","unstructured":"Reimann M, Doerner K, Hartl RF (2004) D-ants: savings based ants divide and conquer the vehicle routing problem. Comput Oper Res 31(4): 563\u2013591","journal-title":"Comput Oper Res"},{"issue":"1","key":"236_CR32","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat Y, Taillard ED (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1(1): 147\u2013167","journal-title":"J Heuristics"},{"key":"236_CR33","unstructured":"Schumann M, Retzko R (1995) Self-organizing maps for vehicle routing problems-minimizing an explicit cost function. In: Fogelman-SouliT F, Gallinari P (eds) Proceedings of the International Conference on Artificial Neural Networks, Paris, pp 401\u2013406"},{"issue":"5","key":"236_CR34","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"E-G Talbi","year":"2002","unstructured":"Talbi E-G (2002) A taxonomy of hybrid metaheuristics. J Heuristics 8(5): 541\u2013564","journal-title":"J Heuristics"},{"issue":"1\u20134","key":"236_CR35","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1021157406318","volume":"115","author":"CD Tarantilis","year":"2002","unstructured":"Tarantilis CD, Kiranoudis CT (2002) BoneRoute: an adaptive memory-based method for effective fleet management. Ann Oper Res 115(1\u20134): 227\u2013241","journal-title":"Ann Oper Res"},{"key":"236_CR36","unstructured":"Thompson PM, Orlin JB (1989) The theory of cyclic transfers, Tech. rep., Operations Research Center, MIT, Cambridge, MA, Working Paper No. OR 200-89"},{"issue":"5","key":"236_CR37","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"PM Thompson","year":"1993","unstructured":"Thompson PM, Psaraftis HN (1993) Cyclic transfer algorithms for multi-vehicle routing and scheduling problems. Oper Res 41(5): 935\u2013946","journal-title":"Oper Res"},{"key":"236_CR38","volume-title":"The vehicle routing problem","year":"2001","unstructured":"Toth P, Vigo D (eds) (2001) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelpia"},{"issue":"1","key":"236_CR39","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P Toth","year":"2003","unstructured":"Toth P, Vigo D (2003) The granular tabu search and its application to the vehicle routing problem. INFORMS J Comput 15(1): 333\u2013346","journal-title":"INFORMS J Comput"},{"issue":"4","key":"236_CR40","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/trsc.30.4.379","volume":"30","author":"J Xu","year":"1996","unstructured":"Xu J, Kelly JP (1996) A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Sci 30(4): 379\u2013393","journal-title":"Transportation Sci"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-008-0236-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-008-0236-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-008-0236-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,12]],"date-time":"2021-09-12T23:16:51Z","timestamp":1631488611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-008-0236-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,8]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["236"],"URL":"https:\/\/doi.org\/10.1007\/s00186-008-0236-7","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,8]]}}}