Abstract
Particle swam optimization (PSO) is a relatively new metaheuristic that has recently drawn much attention from researchers in various optimization areas. However, application of PSO for the capacitated vehicle routing problem (CVRP) is very limited. This paper proposes a simple PSO approach for solving the CVRP. The proposed PSO approach uses a probability matrix as the main device for particle encoding and decoding. While existing research used the PSO solely for assignment of customers to routes and used other algorithms to sequence customers within the routes, the proposed approach applies the PSO approach to both simultaneously. The computational results show the effectiveness of the proposed PSO approach compared to the previous approaches.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ai T. J., Kachitvichyanukul V. (2007) A particle swarm optimization for the capacitated vehicle routing problem. International Journal of Logistics and SCM Systems 2: 50–55
Ai T. J., Kachitvichyanukul V. (2009) Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Computers & Industrial Engineering 56: 380–387
Bachlaus M., Randey M. K., Mahajan C., Shankar R., Tiwari M. K. (2008) Designing an integrated multi-echelon agile supply chain network: a hybrid taguchi-particle swarm optimization approach. Journal of Intelligent Manufacturing 19: 747–761
Banks A., Vincent J., Anyakoha C. (2007) A review of particle swarm optimization. Part I: background and development. Natural Computing 6(4): 467–484
Banks A., Vincent J., Anyakoha C. (2008) A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Natural Computing 7(1): 109–124
Berger J., Barkaoui M. (2003) A new hybrid genetic algorithm for the capacitated vehicle routing problem. Journal of the Operational Research Society 54: 1254–1262
Bullnheimer R., Hartl R. F., Strauss C. (1999) An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89: 319–328
Chen A. L., Yang G. K., Wu Z. M. (2006) Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University Science A 7: 607–614
Chen A. I., Yang G. K., Wu Z. M. (2008) Production scheduling optimization algorithm for the hot rolling processes. International Journal of Production Research 46(7): 1955–1973
Christofides N., Mingozzi A., Toth P. (1979) The vehicle routing problem. In: Christofides N., Mingozzi A., Toth P., Sandi C. (eds) Combinatorial optimization. Wiley, Chichester, pp 315–338
Dantzig G. B., Ramser J. H. (1959) The truck dispatching problem. Management Science 6: 80–91
Eberhart, R., & Kennedy, J. (1995). A new optimizer using particle swarm theory. In Proceedings of the sixth international symposium on micro machine and human science (pp. 39–43).
Eberhart, R., & Shi, Y. (2001). Particle swarm optimization: developments, applications and resources. In Proceedings of the 2001 congress on evolutionary computation (CEC 2001) (pp. 81–86), Seoul, Korea.
Gendreau M., Hertz A., Laporte G. (1994) A tabu search heuristic for the vehicle routing problem. Management Science 40: 1276–1290
Gendreau M., Laporte G., Musaraganyi C., Tailard E. D. (1999) A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers & Operation Research 26: 1153–1173
Gillett B. E., Miller L. R. (1974) A heuristic algorithm for the vehicle dispatch problem. Operations Research 22: 340–349
Kennedy, J., & Eberthart, R. (1995). Particle swarm optimization. In Proceedings of the IEEE international conference on neural networks (pp. 1942–1948).
Kumar, V. V., Pandey, M. K., Tiwari, M. K., & Ben-Arieh, D. (2009). Simultaneous optimization of parts and operations sequences in SSMS: a chaos embedded Taguchi particle swarm optimization approach. Journal of Intelligent Manufacturing (in press). doi:10.1007/s10845-008-0175-4.
Or, I. (1976). Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking, Ph.D. thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL.
Pang, W., Wang, K.-P., Zhou, C.-G., & Dong, L.-J. (2004). Fuzzy discrete particle swarm optimization for solving traveling salesman problem. In Proceedings of the fourth international conference on computer and information technology (pp. 796–800).
Toth P., Vigo D. (2002) The vehicle routing problem. SIAM, Philadelphia, PA
Wang, C.-H., & Lu, J.-Z. (2009). An effective evolutionary algorithms for the practical capacitated vehicle routing problems. Journal of Intelligent Manufacturing (in press). doi:10.1007/s10845-008-0185-2.
Wu C.-H., Wang D.-Z., Ip A., Wang D.-W., Chan C.-Y., Wang H.-F. (2009) A particle swarm optimization approach for components placement inspection on printed circuit boards. Journal of Intelligent Manufacturing 20: 535–549
Zhang G., Shao X., Li P., Gao L. (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Computers & Industrial Engineering 56: 1309–1318
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kim, BI., Son, SJ. A probability matrix based particle swarm optimization for the capacitated vehicle routing problem. J Intell Manuf 23, 1119–1126 (2012). https://doi.org/10.1007/s10845-010-0455-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-010-0455-7