Solving the CVRP Problem Using a Hybrid PSO Approach
The goal of the capacitated vehicle routing problem (CVRP) is to minimize the total distance of vehicle routes under the constraints of vehicles’ capacity. CVRP is classified as NP-hard problems and a number of meta-heuristic approaches have been proposed to solve the problem. This paper aims to develop a hybrid algorithm combining a discrete Particle Swarm Optimization (PSO) with Simulated Annealing (SA) to solve CVRPs. The two-stage approach of CVRP (cluster first and route second) has been adopted in the algorithm. To save computation time, a short solution representation has been adopted. The computational results demonstrate that our hybrid algorithm can effectively solve CVRPs within reasonable time.
KeywordsVehicle routing problem Particle swarm optimization Simulated annealing
Unable to display preview. Download preview PDF.
- 3.Cordeau, J.F., Laporte, G., Savelsbergh, M.W.P., Vigo, D.: Chapter 6 Vehicle Routing. In: Barnhart, C., Laporte, G. (eds.) Handbook in Operations Research and Management Science, vol. 14, pp. 367–428. Elsevier (2007)Google Scholar
- 7.Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proceedings of IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)Google Scholar
- 11.Shi, Y., Eberhart, R.: A Modified Particle Swarm Optimizer. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 69–73 (1998)Google Scholar