A hybrid genetic – Particle Swarm Optimization Algorithm for the vehicle routing problem
Authors:
- 1 March 2010
- journal article
- Published by Elsevier in Expert Systems with Applications
- Vol. 37 (2) , 1446-1455
Abstract
No abstract availableKeywords
This publication has 46 references indexed in Scilit:
- Expanding Neighborhood GRASP for the Traveling Salesman ProblemComputational Optimization and Applications, 2005
- A guide to vehicle routing heuristicsJournal of the Operational Research Society, 2002
- A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing ProblemInternational Journal of Computer Mathematics, 2002
- Classical and modern heuristics for the vehicle routing problemInternational Transactions in Operational Research, 2000
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- A Repeated Matching Heuristic for the Vehicle Routeing ProblemJournal of the Operational Research Society, 1994
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- Parallel iterative search methods for vehicle routing problemsNetworks, 1993
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- An Integer Programming Approach to the Vehicle Scheduling ProblemJournal of the Operational Research Society, 1976