A HYBRID PSO ALGORITHM FOR THE CVRP PROBLEM

Yucheng Kao, Mei Chen

Abstract

The Capacitated Vehicle Routing Problem (CVRP) has been studied over five decades. The goal of CVRP is to minimize the total distance travelled by vehicles under the constraints of vehicles’ capacity. Because CVRP is a kind of NP-hard problem, a number of meta-heuristics have been proposed to solve the problem. The objective of this paper is to propose a hybrid algorithm combining Combinatorial Particle Swarm Optimization (CPSO) with Simulated Annealing (SA) for solving CVRP. The experimental results show that the proposed algorithm can be viewed as an effective approach for solving the CVRP.

References

  1. Ai, T. J., Kachitvichyanukul, V., 2009. Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Computers & Industrial Engineering (56), pp. 380- 387.
  2. Baker, B. M. and Ayechew, M. A., 2003. A genetic algorithm for the vehicle routing problem. Computers & Operations Research (30), pp. 787-800.
  3. Bell, J. E. and McMullen, P. R., 2004. Ant Colony Optimization techinques for the vehicle routing problem. Advanced Engineering Informatics (18), pp. 41-48.
  4. Chen, A. L., Yang, G. K. and Wu, Z. M., 2006. Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University SCIENCE A 7(4), pp. 607-614.
  5. Cordeau, J. F., Laporte, G., Savelsbergh, M. W. P. and Vigo, D., 2007. Chapter 6 Vehicle Routing. In: Barnhart, C. and Laporte, G. eds. Handbook in Operations Research and Management Science(14), pp. 367-428.
  6. Jarboui, B., Cheikh, M., Siarry, P. and Rebai, A., 2007. Combinatorial particle swarm optimization (CPSO) for partitional clustering problem. Applied Mathematics and Computation (92), pp. 337-345.
  7. Jozefowiez, N., Semet, F. and Talbi, E. G., 2008. Multiobjective vehicle routing problems. European Journal of Operational Research (189), pp. 293-309.
  8. Kennedy, J. and Eberhart, R., 1995. Particle swarm optimization. Proceedings of IEEE International Conference on Neural Networks, pp. 1942-1948.
  9. Marinakis, Y., Magdalene, M. and Dounias, G., 2010. A hybrid particle swarm optimization algorithm for the vehicle routing problem. Engineering Applications of Artificial Intelligence (23:4), pp. 463-472.
  10. Osman, I. H., 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, pp. 421-451.
  11. Patterson D. A., Hennessy J. L. (Eds.), 2009. Computer organization and design: the hardware/software interface. Burlington, MA: Morgan Kaufmann Publishers.
  12. Solomon, M. M., 1987. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window constraints. Operations Research (35:2), pp. 254-265.
  13. Zhang, X. and Tang, L., 2009. A new hybrid ant colony optimization algorithm for the vehicle routing problem. Pattern Recognition Letters (30), pp. 848- 855.
Download


Paper Citation


in Harvard Style

Kao Y. and Chen M. (2011). A HYBRID PSO ALGORITHM FOR THE CVRP PROBLEM . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FEC, (IJCCI 2011) ISBN 978-989-8425-83-6, pages 539-543. DOI: 10.5220/0003724005390543


in Bibtex Style

@conference{fec11,
author={Yucheng Kao and Mei Chen},
title={A HYBRID PSO ALGORITHM FOR THE CVRP PROBLEM},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FEC, (IJCCI 2011)},
year={2011},
pages={539-543},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003724005390543},
isbn={978-989-8425-83-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FEC, (IJCCI 2011)
TI - A HYBRID PSO ALGORITHM FOR THE CVRP PROBLEM
SN - 978-989-8425-83-6
AU - Kao Y.
AU - Chen M.
PY - 2011
SP - 539
EP - 543
DO - 10.5220/0003724005390543