Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
- First Online:
- Cite this article as:
- Chen, A., Yang, G. & Wu, Z. J. Zhejiang Univ. - Sci. A (2006) 7: 607. doi:10.1631/jzus.2006.A0607
- 588 Views
Capacitated vehicle routing problem (CVRP) is an NP-hard problem. For large-scale problems, it is quite difficult to achieve an optimal solution with traditional optimization methods due to the high computational complexity. A new hybrid approximation algorithm is developed in this work to solve the problem. In the hybrid algorithm, discrete particle swarm optimization (DPSO) combines global search and local search to search for the optimal results and simulated annealing (SA) uses certain probability to avoid being trapped in a local optimum. The computational study showed that the proposed algorithm is a feasible and effective approach for capacitated vehicle routing problem, especially for large scale problems.