{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T20:22:57Z","timestamp":1776284577856,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2007,6,22]]},"DOI":"10.1007\/s10898-006-9094-0","type":"journal-article","created":{"date-parts":[[2006,10,26]],"date-time":"2006-10-26T08:01:58Z","timestamp":1161849718000},"page":"555-580","source":"Crossref","is-referenced-by-count":77,"title":["A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm"],"prefix":"10.1007","volume":"38","author":[{"given":"Yannis","family":"Marinakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios","family":"Migdalas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"issue":"5","key":"9094_CR1","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","volume":"30","author":"B.M. Baker","year":"2003","unstructured":"Baker B.M., Ayechew M.A. (2003) A genetic algorithm for the vehicle routing problem. Comput. Oper. Res. 30(5): 787\u2013800","journal-title":"Comput. Oper. Res."},{"key":"9094_CR2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0305-0548(98)00047-1","volume":"26","author":"G. Barbarosoglu","year":"1999","unstructured":"Barbarosoglu G., Ozgur D. (1999) A tabu search algorithm for the vehicle routing problem. Comput. Oper. Res. 26, 255\u2013270","journal-title":"Comput. Oper. Res."},{"key":"9094_CR3","doi-asserted-by":"crossref","unstructured":"Berger J., Mohamed B.: A hybrid genetic algorithm for the capacitated vehicle routing problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 646\u2013656. Chicago (2003)","DOI":"10.1007\/3-540-45105-6_80"},{"key":"9094_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230110204","volume":"11","author":"L. Bodin","year":"1981","unstructured":"Bodin L., Golden B. (1981) Classification in vehicle routing and scheduling. Networks 11, 97\u2013108","journal-title":"Networks"},{"key":"9094_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"L. Bodin","year":"1983","unstructured":"Bodin L., Golden B., Assad A., Ball M. (1983) The state of the art in the routing and scheduling of vehicles and crews. Comput. and Oper. Res. 10, 63\u2013212","journal-title":"Comput. and Oper. Res."},{"key":"9094_CR6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1018940026670","volume":"89","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer B., Hartl P.F., Strauss C. (1999) An improved ant system algorithm for the vehicle routing problem. Ann. Oper. Res. 89, 319\u2013328","journal-title":"Ann. Oper. Res."},{"key":"9094_CR7","unstructured":"Christofides N.: Vehicle routing. In: Lawer E.L., Lenstra J.K., Rinnoy Kan A.H.G., (ed.) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pp. 431\u2013448. New York (1985)"},{"key":"9094_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."},{"issue":"1","key":"9094_CR9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1023\/A:1026569813391","volume":"7","author":"S.P. Coy","year":"2001","unstructured":"Coy S.P., Golden B.L., Runger G.C., Wasil E.A. (2001) Using experimental design to effective parameter settings for heuristics. J. Heuristics 7(1): 77\u201397","journal-title":"J. Heuristics"},{"key":"9094_CR10","first-page":"109","volume-title":"Proceedings of the International Workshop on Current and Future Directions in the Routing and Scheduling of Vehicles and Crews.","author":"M.L. Fisher","year":"1979","unstructured":"Fisher M.L., Jaikumar R. (1979) A generalized assignment heuristic for vehicle routing. In: Golden B., Bodin L.(ed) Proceedings of the International Workshop on Current and Future Directions in the Routing and Scheduling of Vehicles and Crews. New York, Wiley, pp. 109\u2013124"},{"key":"9094_CR11","doi-asserted-by":"crossref","unstructured":"Fisher M.L.: Vehicle routing. In: Ball M.O., Magnanti T.L., Momma C.L., Nemhauser G.L. (eds.) Network Routing, Handbooks in Operations Research and Management Science, vol. 8, pp. 1\u201333 (1995)","DOI":"10.1016\/S0927-0507(05)80105-7"},{"key":"9094_CR12","volume-title":"Integer Programming","author":"R. Garfinkel","year":"1972","unstructured":"Garfinkel R., Nemhauser G. (1972) Integer Programming. J Wiley, New York"},{"key":"9094_CR13","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, 1276\u20131290","journal-title":"Manage. Sci."},{"key":"9094_CR14","first-page":"311","volume-title":"Local Search in Combinatorial Optimization.","author":"M. Gendreau","year":"1997","unstructured":"Gendreau M., Laporte G., Potvin, J-Y. (1997) Vehicle routing: modern heuristics. In: Aarts E.H.L., Lenstra J.K. (eds) Local Search in Combinatorial Optimization. Wiley, Chichester, pp. 311\u2013336"},{"key":"9094_CR15","doi-asserted-by":"crossref","unstructured":"Gendreau M., Laporte G., Potvin J.Y.: Metaheuristics for the capacitated VRP. In: Toth P., Vigo. D. The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications, Philadelphia, MA SIAM, pp.129\u2013154.","DOI":"10.1137\/1.9780898718515.ch6"},{"key":"9094_CR16","volume-title":"Vehicle Routing: Methods and Studies","author":"B.L. Golden","year":"1988","unstructured":"Golden B.L., Assad A.A. (1988) Vehicle Routing: Methods and Studies. North Holland, Amsterdam"},{"key":"9094_CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-1-4615-5755-5_2","volume-title":"Fleet Management and Logistics.","author":"B.L. Golden","year":"1998","unstructured":"Golden B.L., Wasil E.A., Kelly J.P., Chao I.M. (1998) The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic T.G., Laporte G. (eds) Fleet Management and Logistics. Kluwer Academic Publishers, Boston, pp. 33\u201356"},{"key":"9094_CR18","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen P., Mladenovic N. (2001) Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449\u2013467","journal-title":"Eur. J. Oper. Res."},{"key":"9094_CR19","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"Held M., Karp R.M. (1970) The traveling salesman problem and minimum spanning trees. Oper. Res. 18, 1138\u20131162","journal-title":"Oper. Res."},{"key":"9094_CR20","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","volume":"7","author":"G. Laporte","year":"2000","unstructured":"Laporte G., Gendreau M., Potvin J.-Y., Semet F. (2000) Classical and modern heuristics for the vehicle routing problem. Int. Trans. Oper. Res. 7, 285\u2013300","journal-title":"Int. Trans. Oper. Res."},{"key":"9094_CR21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/1.9780898718515.ch5","volume-title":"The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications.","author":"G. Laporte","year":"2002","unstructured":"Laporte G., Semet F. (2002) Classical heuristics for the capacitated VRP. In: Toth P., Vigo D. (eds) The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia PA, pp. 109\u2013128"},{"key":"9094_CR22","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E.L. Lawer","year":"1985","unstructured":"Lawer E.L., Lenstra J.K., Rinnoy Kan A.H.G., Shmoys D.B. (1985) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York"},{"issue":"5","key":"9094_CR23","first-page":"1165","volume":"32","author":"F. Li","year":"2005","unstructured":"Li F., Golden B., Wasil E. (2005) Very large-scale vehicle routing: new test problems, algorithms and results, Comput. Oper. Res. 32(5): 1165\u20131179","journal-title":"Oper. Res."},{"key":"9094_CR24","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) Computer solutions of the traveling salesman problem. Bell Sys. Tech. J. 44, 2245\u20132269","journal-title":"Bell Sys. Tech. J."},{"key":"9094_CR25","unstructured":"Marinakis Y.: Vehicle Routing in Distribution Problems. Ph. D. Thesis. Department of Production Engineering and Management, Technical University of Crete, Chania, Greece (2005)"},{"key":"9094_CR26","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1142\/9789812778215_0014","volume-title":"Combinatorial and Global Optimization.","author":"Y. Marinakis","year":"2002","unstructured":"Marinakis Y., Migdalas A., (2002) Heuristic Solutions of Vehicle Routing Problems in Supply Chain Management. In: Pardalos P.M., Migdalas A., Burkard R. (eds) Combinatorial and Global Optimization. World Scientific Publishing Co, Singapore, pp. 205\u2013236"},{"key":"9094_CR27","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10589-005-4798-5","volume":"32","author":"Y. Marinakis","year":"2005","unstructured":"Marinakis Y., Migdalas A., Pardalos P.M. (2005) Expanding neighborhood GRASP for the traveling salesman problem. Comput. Optim. Appl. 32, 231\u2013257","journal-title":"Comput. Optim. Appl."},{"key":"9094_CR28","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10878-005-4921-7","volume":"10","author":"Y. Marinakis","year":"2005","unstructured":"Marinakis Y., Migdalas A., Pardalos P.M. (2005) A Hybrid Genetic-GRASP algortihm using langrangean relaxation for the traveling salesman problem. J. Comb. Optim. 10, 311\u2013326","journal-title":"J. Comb. Optim."},{"key":"9094_CR29","doi-asserted-by":"crossref","unstructured":"Marinakis Y., Migdalas A., Pardalos P.M.: Multiple phase neighborhood search GRASP based on Lagrangian relaxation and random backtracking Lin\u2013Kernighan for the traveling salesman problem (submitted in Optimization Methods and Software (2006))","DOI":"10.1007\/s10878-007-9104-2"},{"key":"9094_CR30","first-page":"194","volume-title":"Operations Research and its Application.","author":"A. Migdalas","year":"1995","unstructured":"Migdalas A., Pardalos P. (1995) Nonlinear bilevel problems with convex second level problem\u2014Heuristics and descent methods. In: Du D.-Z. et\u00a0al., (eds) Operations Research and its Application. World Scientific, Singapore, pp. 194\u2013204"},{"key":"9094_CR31","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I.H. Osman","year":"1993","unstructured":"Osman I.H. (1993) Metastrategy simulated annealing and tabu search algorithms for combinatorial optimization problems. Ann. Oper. Res. 41, 421\u2013451","journal-title":"Ann. Oper. Res."},{"key":"9094_CR32","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, 1985\u20132002","journal-title":"Comput. Oper. Res."},{"key":"9094_CR33","unstructured":"Reimann M., Stummer M., Doerner K.: A savings based ant system for the vehicle routing problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, 1317\u20131326. New York (2002)"},{"issue":"4","key":"9094_CR34","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 R.F. (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."},{"key":"9094_CR35","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, 1447\u20131459","journal-title":"Manage Sci."},{"issue":"3","key":"9094_CR36","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0167-8191(00)00102-2","volume":"27","author":"C. Rego","year":"2001","unstructured":"Rego C. (2001) Node-ejection chains for the vehicle routing problem: sequential and parallel algorithms. Parallel Comput. 27(3): 201\u2013222","journal-title":"Parallel Comput."},{"key":"9094_CR37","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of Metaheuristics.","author":"M.G.C. Resende","year":"2003","unstructured":"Resende M.G.C., Ribeiro C.C. (2003) Greedy Randomized Adaptive Search Procedures. In: Glover F., Kochenberger G.A. (eds) Handbook of Metaheuristics. Kluwer Academic Publishers, Boston, pp. 219\u2013249"},{"key":"9094_CR38","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat Y., Taillard E.D. (1995) Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147\u2013167","journal-title":"J. Heuristics"},{"key":"9094_CR39","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E.D. Taillard","year":"1993","unstructured":"Taillard E.D. (1993) Parallel iterative search methods for vehicle routing problems. Networks 23, 661\u2013672","journal-title":"Networks"},{"issue":"9","key":"9094_CR40","doi-asserted-by":"crossref","first-page":"2309","DOI":"10.1016\/j.cor.2004.03.005","volume":"32","author":"C.D. Tarantilis","year":"2005","unstructured":"Tarantilis C.D. (2005) Solving the vehicle routing problem with adaptive memory programming methodology. Comput. Oper. Res. 32(9): 2309\u20132327","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"9094_CR41","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1080\/716067183","volume":"42","author":"C.D. Tarantilis","year":"2002","unstructured":"Tarantilis C.D., Kiranoudis C.T., Vassiliadis V.S. (2002) A backtracking adaptive threshold accepting metaheuristic method for the Vehicle Routing Problem. Sys. Anal. Model. Simul. (SAMS) 42(5): 631\u2013644","journal-title":"Sys. Anal. Model. Simul. (SAMS)"},{"issue":"5","key":"9094_CR42","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/00207160210948","volume":"79","author":"C.D. Tarantilis","year":"2002","unstructured":"Tarantilis C.D., Kiranoudis C.T., Vassiliadis V.S. (2002) A list based threshold accepting algorithm for the capacitated vehicle routing problem. Int. J. Comput. Math. 79(5): 537\u2013553","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"9094_CR43","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1021157406318","volume":"115","author":"C.D. Tarantilis","year":"2002","unstructured":"Tarantilis C.D., Kiranoudis C.T. (2002) BoneRoute: an adaptive memory-based method for effective fleet management. Ann. Oper. Res. 115(1): 227\u2013241","journal-title":"Ann. Oper. Res."},{"key":"9094_CR44","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","volume-title":"The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications","author":"P. Toth","year":"2002a","unstructured":"Toth P., Vigo D. (2002a) The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications. SIAM Philadelphia, PA"},{"key":"9094_CR45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1.9780898718515","volume-title":"The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications.","author":"P. Toth","year":"2002b","unstructured":"Toth P., Vigo D. (2002b) An overview of Vehicle Routing Problems. In: Toth P., Vigo D. (eds) The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia MA, pp. 1\u201326"},{"issue":"4","key":"9094_CR46","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(4): 333\u2013348","journal-title":"INFORMS J. Comput."},{"key":"9094_CR47","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 J.P. (1996) A new network flow-based tabu search heuristic for the vehicle routing problem. Transportation Sci. 30, 379\u2013393","journal-title":"Transportation Sci."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9094-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-006-9094-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9094-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T19:41:37Z","timestamp":1587238897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-006-9094-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,27]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,6,22]]}},"alternative-id":["9094"],"URL":"https:\/\/doi.org\/10.1007\/s10898-006-9094-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,27]]}}}