Advertisement

Memetic Differential Evolution for Vehicle Routing Problem with Time Windows

  • Wanfeng Liu
  • Xu Wang
  • Xia Li
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7331)

Abstract

In this paper, an improved memetic differential evolution algorithm with generalized fitness (MDEGF) is proposed for vehicle routing problem with time windows (VRPTW). A generalized fitness strategy is designed to evaluate the quality of source-individuals, which incorporates three simple local search techniques and helps to improve the convergent performance. Experimental results show that the novel algorithm can solve the VRPTW and obtain better solution in short time.

Keywords

Vehicle Routing Problem Optimization Differential Evolution Local Search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Management Science 6, 80–91 (1959)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35, 254–265 (1987)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A Hybrid Genetic Algorithm with Adaptive Diversity Management for a Large Class of Vehicle Routing Problems with Time Windows. Tech. Rep. 61, CIRRELT (2011)Google Scholar
  4. 4.
    Potvin, J.Y., Rousseau, J.M.: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research 66, 331–340 (1993)zbMATHCrossRefGoogle Scholar
  5. 5.
    Mao, Y., Deng, Y.: Solving Vehicle Routing Problem with Time Windows with Hybrid Evolutionary Algorithm. In: 2010 Second WRI Global Congress on Intelligent Systems (GCIS), Wuhan, pp. 335–339. IEEE Press, New York (2010)CrossRefGoogle Scholar
  6. 6.
    Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation Science 39, 104–118 (2005)CrossRefGoogle Scholar
  7. 7.
    Qian, B., Wang, L., Huang, D.X., Wang, X.: Scheduling multi-objective job shops using a memetic algorithm based on differential evolution. The International Journal of Advanced Manufacturing Technology 35, 1014–1027 (2008)CrossRefGoogle Scholar
  8. 8.
    Storn, R., Price, K.: Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces. International Computer Science Institute-Publications-TR (1995)Google Scholar
  9. 9.
    Sauer, J., dos Santos Coelho, L., Mariani, V., de Macedo Mourelle, L., Nedjah, N.: A Discrete Differential Evolution Approach with Local Search for Traveling Salesman Problems. Innovative Computing Methods and Their Applications to Engineering Problems 357, 1–12 (2011)CrossRefGoogle Scholar
  10. 10.
    Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Computers & Industrial Engineering 55, 795–816 (2008)CrossRefGoogle Scholar
  11. 11.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Wanfeng Liu
    • 1
  • Xu Wang
    • 1
  • Xia Li
    • 1
  1. 1.Department of Electrical Engineering College of Information EngineeringShenzhen UniversityShenzhenChina

Personalised recommendations