Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 165476, 11 pages
http://dx.doi.org/10.1155/2015/165476
Research Article

A Problem-Reduction Evolutionary Algorithm for Solving the Capacitated Vehicle Routing Problem

Wanfeng Liu1,2 and Xia Li1,2

1College of Information Engineering, Shenzhen University, Shenzhen 518060, China
2Shenzhen Key Lab of Communication and Information Processing, Shenzhen 518060, China

Received 30 April 2014; Accepted 13 October 2014

Academic Editor: Pandian Vasant

Copyright © 2015 Wanfeng Liu and Xia Li. 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. J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Mich, USA, 1975. View at MathSciNet
  2. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks. Part 1 (of 6), vol. 4, pp. 1942–1948, December 1995. View at Scopus
  3. M. Eusuff, K. Lansey, and F. Pasha, “Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization,” Engineering Optimization, vol. 38, no. 2, pp. 129–154, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. P. Moscato and M. G. Norman, “A “memetic” approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems,” in Proceedings of the International Conference on Parallel Computing and Transputer Applications, vol. 1, pp. 177–186.
  5. R. Storn and K. Price, “Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 26, no. 1, pp. 29–41, 1996. View at Publisher · View at Google Scholar · View at Scopus
  7. S. Boettcher and A. G. Percus, “Extremal optimization: methods derived from co-evolution,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 825–832, Morgan Kaufmann, San Francisco, Calif, USA, 1999.
  8. J. Schneider, “Searching for backbones—a high-performance parallel algorithm for solving combinatorial optimization problems,” Future Generation Computer Systems, vol. 19, no. 1, pp. 121–131, 2003. View at Publisher · View at Google Scholar · View at Scopus
  9. G. B. Dantzig and J. H. Ramser, “The truck dispatching problem,” Management Science, vol. 6, pp. 80–91, 1959. View at Google Scholar · View at MathSciNet
  10. R. Baldacci, A. Mingozzi, and R. Roberti, “Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints,” European Journal of Operational Research, vol. 218, no. 1, pp. 1–6, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  11. F. Li, B. Golden, and E. Wasil, “Very large-scale vehicle routing: new test problems, algorithms, and results,” Computers and Operations Research, vol. 32, no. 5, pp. 1165–1179, 2005. View at Publisher · View at Google Scholar · View at Scopus
  12. P. Chen, H.-K. Huang, and X.-Y. Dong, “Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem,” Expert Systems with Applications, vol. 37, no. 2, pp. 1620–1627, 2010. View at Publisher · View at Google Scholar · View at Scopus
  13. A. Subramanian, E. Uchoa, and L. S. Ochi, “A hybrid algorithm for a class of vehicle routing problems,” Computers & Operations Research, vol. 40, no. 10, pp. 2519–2531, 2013. View at Publisher · View at Google Scholar · View at Scopus
  14. J.-P. Luo, X. Li, and M.-R. Chen, “Improved shuffled frog leaping algorithm for solving CVRP,” Journal of Electronics & Information Technology, vol. 33, no. 2, pp. 429–434, 2011. View at Publisher · View at Google Scholar · View at Scopus
  15. Y. Nagata and O. Bräysy, “Edge assembly-based memetic algorithm for the capacitated vehicle routing problem,” Networks, vol. 54, no. 4, pp. 205–215, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. E. E. Zachariadis and C. T. Kiranoudis, “A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem,” Computers & Operations Research, vol. 37, no. 12, pp. 2089–2105, 2010. View at Publisher · View at Google Scholar · View at Scopus
  17. W. F. Liu and X. Li, “A fast iterated local searching algorithm for capacitated vehicle routing problem,” Science Paper Online, 2012. View at Google Scholar
  18. W. Liu, X. Li, N. Luo, and X. Chen, “Common grounding optimization for CVRP,” in Proceedings of the IEEE 8th Conference on Industrial Electronics and Applications (ICIEA '13), pp. 1755–1758, June 2013. View at Publisher · View at Google Scholar · View at Scopus
  19. E. B. Baum, “Towards practical ‘neural’ computation for combinatorial optimization problems,” in Neural Networks for Computing, vol. 151 of AIP Conference Proceedings, pp. 53–58, Snowbird, Utah, USA, 1986. View at Publisher · View at Google Scholar
  20. N. Christofides and S. Eilon, “An algorithm for the vehicle-dispatching problem,” OR, vol. 20, pp. 309–318, 1969. View at Google Scholar
  21. B. L. Golden, E. A. Wasil, J. P. Kelly, and I. M. Chao, “The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results,” in Fleet Management and Logistics, T. G. Crainic and G. Laporte, Eds., Centre for Research on Transportation, pp. 33–56, Springer, New York, NY, USA, 1998. View at Publisher · View at Google Scholar
  22. T. Vidal, T. G. Crainic, M. Gendreau, N. Lahrichi, and W. Rei, “A hybrid genetic algorithm for multidepot and periodic vehicle routing problems,” Operations Research, vol. 60, no. 3, pp. 611–624, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  23. S. Wink, T. Bäck, and M. Emmerich, “A meta-genetic algorithm for solving the capacitated vehicle routing problem,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '12), pp. 1–8, Brisbane, Australia, June 2012. View at Publisher · View at Google Scholar · View at Scopus