Copyright © 2012 Yucheng Kao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

1. G. Laporte, “The vehicle routing problem: an overview of exact and approximate algorithms,” European Journal of Operational Research, vol. 59, no. 3, pp. 345–358, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
2. I. H. Osman, “Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem,” Annals of Operations Research, vol. 41, no. 4, pp. 421–451, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
3. J. F. Cordeau, G. Laporte, M. W. P. Savelsbergh, and D. Vigo, “Vehicle routing,” in Handbook in Operations Research and Management Science, C. Barnhart and G. Laporte, Eds., vol. 14, pp. 367–428, 2007.
4. J. K. Lenstra and A. H. G. Rinnooy Kan, “Complexity of vehicle routing and scheduling problems,” Networks, vol. 11, no. 2, pp. 221–228, 1981. View at Publisher · View at Google Scholar · View at Scopus
5. G. Barbarosoglu and D. Ozgur, “A tabu search algorithm for the vehicle routing problem,” Computers and Operations Research, vol. 26, no. 3, pp. 255–270, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
6. B. M. Baker and M. A. Ayechew, “A genetic algorithm for the vehicle routing problem,” Computers and Operations Research, vol. 30, no. 5, pp. 787–800, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
7. S. W. Lin, Z. J. Lee, K. C. Ying, and C. Y. Lee, “Applying hybrid meta-heuristics for capacitated vehicle routing problem,” Expert Systems with Applications, vol. 36, no. 2, pp. 1505–1512, 2009. View at Publisher · View at Google Scholar · View at Scopus
8. W. Y. Szeto, Y. Wu, and S. C. Ho, “An artificial bee colony algorithm for the capacitated vehicle routing problem,” European Journal of Operational Research, vol. 215, no. 1, pp. 126–135, 2011. View at Publisher · View at Google Scholar · View at Scopus
9. M. Dorigo and L. M. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53–66, 1997. View at Publisher · View at Google Scholar · View at Scopus
10. J. E. Bell and P. R. McMullen, “Ant colony optimization techniques for the vehicle routing problem,” Advanced Engineering Informatics, vol. 18, no. 1, pp. 41–48, 2004. View at Publisher · View at Google Scholar · View at Scopus
11. Z. Liu and Y. Cai, “Sweep based multiple ant colonies algorithm for capacitated vehicle routing problem,” in Proceedings of the IEEE International Conference on e-Business Engineering (ICEBE '05), pp. 387–394, October 2005. View at Publisher · View at Google Scholar · View at Scopus
12. C. H. Chen and C. J. Ting, “An improved ant colony system algorithm for the vehicle routing problem,” Journal of the Chinese Institute of Industrial Engineers, vol. 23, no. 2, pp. 115–126, 2006. View at Publisher · View at Google Scholar · View at Scopus
13. X. Zhang and L. Tang, “A new hybrid ant colony optimization algorithm for the vehicle routing problem,” Pattern Recognition Letters, vol. 30, no. 9, pp. 848–855, 2009. View at Publisher · View at Google Scholar · View at Scopus
14. B. Yu, Z. Z. Yang, and B. Yao, “An improved ant colony optimization for vehicle routing problem,” European Journal of Operational Research, vol. 196, no. 1, pp. 171–176, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
15. C. Y. Lee, Z. J. Lee, S. W. Lin, and K. C. Ying, “An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem,” Applied Intelligence, vol. 32, no. 1, pp. 88–95, 2010. View at Publisher · View at Google Scholar · View at Scopus
16. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948, December 1995. View at Scopus
17. Y. Shi and R. Eberhart, “Modified particle swarm optimizer,” in Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC'98), pp. 69–73, May 1998. View at Scopus
18. A. L. Chen, G. K. Yang, and Z. M. Wu, “Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem,” Journal of Zhejiang University: Science, vol. 7, no. 4, pp. 607–614, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
19. Y. Kao and M. Chen, “A hybrid PSO algorithm for the CVRP problem,” in Proceedings of the International Conference on Evolutionary Computation Theory and Applications (ECTA '11), pp. 539–543, Paris, France, October 2011. View at Publisher · View at Google Scholar
20. T. J. Ai and V. Kachitvichyanukul, “Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem,” Computers and Industrial Engineering, vol. 56, no. 1, pp. 380–387, 2009. View at Publisher · View at Google Scholar · View at Scopus
21. Y. Marinakis, M. Marinaki, and G. Dounias, “A hybrid particle swarm optimization algorithm for the vehicle routing problem,” Engineering Applications of Artificial Intelligence, vol. 23, no. 4, pp. 463–472, 2010. View at Publisher · View at Google Scholar · View at Scopus
22. B. Shuang, J. Chen, and Z. Li, “Study on hybrid PS-ACO algorithm,” Applied Intelligence, vol. 34, no. 1, pp. 64–73, 2011. View at Publisher · View at Google Scholar · View at Scopus
23. N. Christofides, A. Mingozzi, and P. Toth, “The vehicle routing problem,” in Combinatorial Optimization, N. Christofides, A. Mingozzi, P. Toth, and C. Sandi, Eds., Wiley, Chichester, UK, 1979.