{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T03:48:13Z","timestamp":1727063293703},"reference-count":75,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Expert Systems with Applications"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1016\/j.eswa.2009.06.085","type":"journal-article","created":{"date-parts":[[2009,7,6]],"date-time":"2009-07-06T04:27:23Z","timestamp":1246854443000},"page":"1446-1455","source":"Crossref","is-referenced-by-count":174,"title":["A hybrid genetic \u2013 Particle Swarm Optimization Algorithm for the vehicle routing problem"],"prefix":"10.1016","volume":"37","author":[{"given":"Yannis","family":"Marinakis","sequence":"first","affiliation":[]},{"given":"Magdalene","family":"Marinaki","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.eswa.2009.06.085_bib1","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/opre.39.3.456","article-title":"Parallel savings based heuristics for the delivery problem","volume":"39","author":"Altinkemer","year":"1991","journal-title":"Operations Research"},{"issue":"5","key":"10.1016\/j.eswa.2009.06.085_bib2","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","article-title":"A genetic algorithm for the vehicle routing problem","volume":"30","author":"Baker","year":"2003","journal-title":"Computers and Operations Research"},{"issue":"4","key":"10.1016\/j.eswa.2009.06.085_bib3","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s11047-007-9049-5","article-title":"A review of particle swarm optimization. Part I: Background and development","volume":"6","author":"Banks","year":"2007","journal-title":"Natural Computing"},{"key":"10.1016\/j.eswa.2009.06.085_bib4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0305-0548(98)00047-1","article-title":"A tabu search algorithm for the vehicle routing problem","volume":"26","author":"Barbarosoglu","year":"1999","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib5","series-title":"Swarm intelligence, focus on ant and particle swarm optimization","first-page":"113","article-title":"Artificial bee colony algorithm and its application to generalized assignment problem","author":"Baykasoglu","year":"2007"},{"key":"10.1016\/j.eswa.2009.06.085_bib6","doi-asserted-by":"crossref","unstructured":"Berger, J., & Barkaoui, M. (2003). A hybrid genetic algorithm for the capacitated vehicle routing problem. In Proceedings of the genetic and evolutionary computation conference (pp. 646\u2013656). Chicago.","DOI":"10.1007\/3-540-45105-6_80"},{"key":"10.1016\/j.eswa.2009.06.085_bib7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230110204","article-title":"Classification in vehicle routing and scheduling","volume":"11","author":"Bodin","year":"1981","journal-title":"Networks"},{"key":"10.1016\/j.eswa.2009.06.085_bib8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","article-title":"The state of the art in the routing and scheduling of vehicles and crews","volume":"10","author":"Bodin","year":"1983","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1018940026670","article-title":"An improved ant system algorithm for the vehicle routing problem","volume":"89","author":"Bullnheimer","year":"1999","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib10","series-title":"Combinatorial optimization","article-title":"The vehicle routing problem","author":"Christofides","year":"1979"},{"key":"10.1016\/j.eswa.2009.06.085_bib11","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib12","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","article-title":"A guide to vehicle routing heuristics","volume":"53","author":"Cordeau","year":"2002","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.eswa.2009.06.085_bib13","series-title":"Logistics systems: Design and optimization","first-page":"279","article-title":"New heuristics for the vehicle routing problem","author":"Cordeau","year":"2005"},{"issue":"1","key":"10.1016\/j.eswa.2009.06.085_bib14","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Management Science"},{"key":"10.1016\/j.eswa.2009.06.085_bib15","series-title":"Artificial immune systems and their application","year":"1998"},{"key":"10.1016\/j.eswa.2009.06.085_bib16","series-title":"Artificial immune systems: A new computational intelligence approach","author":"De Castro","year":"2002"},{"key":"10.1016\/j.eswa.2009.06.085_bib17","unstructured":"Desrochers, M., & Verhoog, T. W. (1989). A matching based savings algorithm for the vehicle routing problem. Les Cahiers du GERAD G-89-04. Ecole des Hautes Etudes Commerciales de Montreal."},{"key":"10.1016\/j.eswa.2009.06.085_bib18","series-title":"Ant colony optimization","author":"Dorigo","year":"2004"},{"key":"10.1016\/j.eswa.2009.06.085_bib19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptive search procedure","volume":"6","author":"Feo","year":"1995","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/j.eswa.2009.06.085_bib20","series-title":"Network routing","first-page":"1","volume":"Vol. 8","author":"Fisher","year":"1995"},{"key":"10.1016\/j.eswa.2009.06.085_bib21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","article-title":"A generalized assignment heuristic for vehicle routing","volume":"11","author":"Fisher","year":"1981","journal-title":"Networks"},{"key":"10.1016\/j.eswa.2009.06.085_bib22","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1057\/jors.1976.63","article-title":"An integer programming approach to the vehicle scheduling problem","volume":"27","author":"Foster","year":"1976","journal-title":"Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib23","series-title":"Integer programming","author":"Garfinkel","year":"1972"},{"key":"10.1016\/j.eswa.2009.06.085_bib24","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","article-title":"A tabu search heuristic for the vehicle routing problem","volume":"40","author":"Gendreau","year":"1994","journal-title":"Management Science"},{"key":"10.1016\/j.eswa.2009.06.085_bib25","series-title":"Local search in combinatorial optimization","first-page":"311","article-title":"Vehicle routing: Modern heuristics","author":"Gendreau","year":"1997"},{"key":"10.1016\/j.eswa.2009.06.085_bib26","series-title":"The vehicle routing problem","first-page":"129","article-title":"Metaheuristics for the capacitated VRP","author":"Gendreau","year":"2002"},{"key":"10.1016\/j.eswa.2009.06.085_bib27","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1287\/opre.22.2.340","article-title":"A heuristic algorithm for the vehicle dispatch problem","volume":"22","author":"Gillett","year":"1974","journal-title":"Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib28","series-title":"Handbook of metaheuristics","first-page":"1","article-title":"Scatter search and path relinking: Advances and applications","author":"Glover","year":"2003"},{"key":"10.1016\/j.eswa.2009.06.085_bib29","series-title":"Genetic algorithms in search, optimization, and machine learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/j.eswa.2009.06.085_bib30","series-title":"Vehicle routing: Methods and studies","author":"Golden","year":"1988"},{"key":"10.1016\/j.eswa.2009.06.085_bib31","series-title":"Fleet management and logistics","first-page":"33","article-title":"The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results","author":"Golden","year":"1998"},{"key":"10.1016\/j.eswa.2009.06.085_bib32","series-title":"The vehicle routing problem: Latest advances and new challenges","author":"Golden","year":"2008"},{"key":"10.1016\/j.eswa.2009.06.085_bib33","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","article-title":"Variable neighborhood search: Principles and applications","volume":"130","author":"Hansen","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib34","series-title":"Adaptation in natural and artificial systems","author":"Holland","year":"1975"},{"key":"10.1016\/j.eswa.2009.06.085_bib35","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of 1995 IEEE international conference on neural networks (Vol. 4, pp. 1942\u20131948).","DOI":"10.1109\/ICNN.1995.488968"},{"key":"10.1016\/j.eswa.2009.06.085_bib36","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Eberhart, R. (1997). A discrete binary version of the particle swarm algorithm. In Proceedings of 1997 IEEE international conference on systems, man, and cybernetics (Vol. 5, pp. 4104\u20134108).","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"10.1016\/j.eswa.2009.06.085_bib37","series-title":"Swarm intelligence","author":"Kennedy","year":"2001"},{"key":"10.1016\/j.eswa.2009.06.085_bib38","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","article-title":"Classical and modern heuristics for the vehicle routing problem","volume":"7","author":"Laporte","year":"2000","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib39","series-title":"The vehicle routing problem, monographs on discrete mathematics and applications","first-page":"109","article-title":"Classical heuristics for the capacitated VRP","author":"Laporte","year":"2002"},{"issue":"5","key":"10.1016\/j.eswa.2009.06.085_bib40","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1016\/j.cor.2003.10.002","article-title":"Very large-scale vehicle routing: New test problems, algorithms and results","volume":"32","author":"Li","year":"2005","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib41","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell Systems Technical Journal"},{"key":"10.1016\/j.eswa.2009.06.085_bib42","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operation Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib43","series-title":"Combinatorial and global optimization","first-page":"205","article-title":"Heuristic solutions of vehicle routing problems in supply chain management","author":"Marinakis","year":"2002"},{"key":"10.1016\/j.eswa.2009.06.085_bib44","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10589-005-4798-5","article-title":"Expanding neighborhood GRASP for the traveling salesman problem","volume":"32","author":"Marinakis","year":"2005","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/j.eswa.2009.06.085_bib45","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10878-005-4921-7","article-title":"A hybrid genetic-GRASP algorithm using Langrangean relaxation for the traveling salesman problem","volume":"10","author":"Marinakis","year":"2005","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/j.eswa.2009.06.085_bib46","unstructured":"Marinakis, Y., Migdalas, A., & Pardalos, P. M. (2007a). Multiple phase neighborhood search GRASP based on Lagrangean relaxation and random backtracking Lin Kernighan for the traveling salesman problem. Journal of Combinatorial Optimization. (Available on line doi: 10.1007\/s10878-007-9104-2)."},{"key":"10.1016\/j.eswa.2009.06.085_bib47","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s10898-006-9094-0","article-title":"A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm","volume":"38","author":"Marinakis","year":"2007","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/j.eswa.2009.06.085_bib48","series-title":"Nature inspired cooperative strategies for optimization \u2013 NICSO 2007","first-page":"139","article-title":"Honey bees mating optimization algorithm for the vehicle routing problem","volume":"Vol. 129","author":"Marinakis","year":"2008"},{"key":"10.1016\/j.eswa.2009.06.085_bib49","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1016\/j.cor.2003.11.017","article-title":"Active guided evolution strategies for the large scale vehicle routing problems with time windows","volume":"32","author":"Mester","year":"2005","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib50","doi-asserted-by":"crossref","first-page":"2964","DOI":"10.1016\/j.cor.2005.11.006","article-title":"Active guided evolution strategies for large scale capacitated vehicle routing problems","volume":"34","author":"Mester","year":"2007","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib51","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1057\/jors.1976.95","article-title":"A sequential route-building algorithm employing a generalized savings criterion","volume":"27","author":"Mole","year":"1976","journal-title":"Operational Research Quarterly"},{"key":"10.1016\/j.eswa.2009.06.085_bib52","series-title":"Handbooks of metaheuristics","first-page":"105","article-title":"A gentle introduction to memetic algorithms","author":"Moscato","year":"2003"},{"key":"10.1016\/j.eswa.2009.06.085_bib53","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","article-title":"Metastrategy simulated annealing and tabu search algorithms for combinatorial optimization problems","volume":"41","author":"Osman","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib54","article-title":"Bio-inspired algorithms for the vehicle routing problem","volume":"Vol. 161","author":"Pereira","year":"2008"},{"key":"10.1016\/j.eswa.2009.06.085_bib55","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","author":"Pisinger","year":"2007","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib56","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","article-title":"Particle swarm optimization. An overview","volume":"1","author":"Poli","year":"2007","journal-title":"Swarm Intelligence"},{"key":"10.1016\/j.eswa.2009.06.085_bib57","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF02125403","article-title":"Genetic algorithms for the traveling salesman problem","volume":"63","author":"Potvin","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib58","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","article-title":"A simple and effective evolutionary algorithm for the vehicle routing problem","volume":"31","author":"Prins","year":"2004","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib59","series-title":"Bio-inspired algorithms for the vehicle routing problem, SCI 161","first-page":"35","article-title":"A GRASP \u00d7 evolutionary local search hybrid for the vehicle routing problem","author":"Prins","year":"2008"},{"key":"10.1016\/j.eswa.2009.06.085_bib60","unstructured":"Reimann, M., Stummer, M., & Doerner, K. (2002). A savings based ant system for the vehicle routing problem. In Proceedings of the genetic and evolutionary computation conference (pp. 1317\u20131326). New York."},{"issue":"4","key":"10.1016\/j.eswa.2009.06.085_bib61","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","article-title":"D-Ants: Savings based ants divide and conquer the vehicle routing problem","volume":"31","author":"Reimann","year":"2004","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib62","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1287\/mnsc.44.10.1447","article-title":"A subpath ejection method for the vehicle routing problem","volume":"44","author":"Rego","year":"1998","journal-title":"Management Science"},{"issue":"3","key":"10.1016\/j.eswa.2009.06.085_bib63","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0167-8191(00)00102-2","article-title":"Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms","volume":"27","author":"Rego","year":"2001","journal-title":"Parallel Computing"},{"key":"10.1016\/j.eswa.2009.06.085_bib64","series-title":"Handbook of metaheuristics","first-page":"219","article-title":"Greedy randomized adaptive search procedures","author":"Resende","year":"2003"},{"key":"10.1016\/j.eswa.2009.06.085_bib65","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","article-title":"Probabilistic diversification and intensification in local search for vehicle routing","volume":"1","author":"Rochat","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/j.eswa.2009.06.085_bib66","doi-asserted-by":"crossref","unstructured":"Shi, Y., & Eberhart, R. (1998). A modified particle swarm optimizer. In Proceedings of 1998 IEEE world congress on computational intelligence (pp. 69\u201373).","DOI":"10.1109\/ICEC.1998.699146"},{"key":"10.1016\/j.eswa.2009.06.085_bib67","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","article-title":"Parallel iterative search methods for vehicle routing problems","volume":"23","author":"Taillard","year":"1993","journal-title":"Networks"},{"issue":"9","key":"10.1016\/j.eswa.2009.06.085_bib68","doi-asserted-by":"crossref","first-page":"2309","DOI":"10.1016\/j.cor.2004.03.005","article-title":"Solving the vehicle routing problem with adaptive memory programming methodology","volume":"32","author":"Tarantilis","year":"2005","journal-title":"Computers and Operations Research"},{"issue":"5","key":"10.1016\/j.eswa.2009.06.085_bib69","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1080\/716067183","article-title":"A backtracking adaptive threshold accepting metaheuristic method for the Vehicle Routing Problem","volume":"42","author":"Tarantilis","year":"2002","journal-title":"System Analysis Modeling Simulation (SAMS)"},{"issue":"5","key":"10.1016\/j.eswa.2009.06.085_bib70","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/00207160210948","article-title":"A list based threshold accepting algorithm for the capacitated vehicle routing problem","volume":"79","author":"Tarantilis","year":"2002","journal-title":"International Journal of Computer Mathematics"},{"issue":"1","key":"10.1016\/j.eswa.2009.06.085_bib71","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1021157406318","article-title":"BoneRoute: An adaptive memory-based method for effective fleet management","volume":"115","author":"Tarantilis","year":"2002","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.eswa.2009.06.085_bib72","series-title":"The vehicle routing problem","author":"Toth","year":"2002"},{"issue":"4","key":"10.1016\/j.eswa.2009.06.085_bib73","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","article-title":"The granular tabu search (and its application to the vehicle routing problem)","volume":"15","author":"Toth","year":"2003","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.eswa.2009.06.085_bib74","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1057\/jors.1994.185","article-title":"A repeated matching heuristic for the vehicle routing problem","volume":"45","author":"Wark","year":"1994","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.eswa.2009.06.085_bib75","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/trsc.30.4.379","article-title":"A new network flow-based tabu search heuristic for the vehicle routing problem","volume":"30","author":"Xu","year":"1996","journal-title":"Transportation Science"}],"container-title":["Expert Systems with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417409006460?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417409006460?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T03:30:52Z","timestamp":1558409452000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417409006460"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":75,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["S0957417409006460"],"URL":"https:\/\/doi.org\/10.1016\/j.eswa.2009.06.085","relation":{},"ISSN":["0957-4174"],"issn-type":[{"value":"0957-4174","type":"print"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}