A Hybrid Algorithm for Vehicle Routing Problem with Time Windows

  • Dengying Jiang
  • Wenxia Jiang
  • Zhangcan Huang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5370)


The VRPTW is a well-known and complex combinatorial problem which has considerable attention in recent years. Combinatorial optimization problems of this kind are NP-hard and are best solved to near optimum by heuristics. Here, we propose a two-stage optimization strategy for VRPTW. Firstly, for constructing a good initial solution, we use the stochastic PFIH, guaranteeing the diversity of the initial solution. And then a hybrid system based on the combination of SA and LNS is proposed to optimize the initial solution. Secondly, tune time windows for the customers using a regression iterative strategy which is put forward to and figure out the optimum time for each vehicle departing. It can make the total waiting time zero. The test of this work is executed over the type C101 in Solomon’s VRPTW instances. It is proved by the experiment that our algorithm can solve VRPTW efficiently and quickly.


stochastic PFIH iterative strategy 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alvarenga, G.B., Mateus, G.R.: Hierarchical Tournament Selection Genetic Algorithm for the vehicle Routing Problem with Time Windows. In: HIS 2004, Fourth International Conference, pp. 410–415 (2004)Google Scholar
  2. 2.
    Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35(2), 254–265 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Oliveira, H.C.B., Vasconcelos, G.C., Alvarenga, G.B.: Reducing traveled distance in the vehicle routing problem with time windows using a multi-start simulated annealing. In: IJCNN 2006, pp. 3013–3020, July 16-21 (2006)Google Scholar
  4. 4.
    Alvarenga, G.B., Mateus, G.R.: A two-phase genetic and set partitioning approach for the vehicle routing problem with time windows. In: Proc. 4th International Conference on Hybrid Intelligent Systems, pp. 428–433 (2004)Google Scholar
  5. 5.
    Lim, A., Zhang, X.: A two-stage heuristic for the vehicle routing problem with time windows and a limited number of vehicles. In: Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS 2005), p. 82c (2007)Google Scholar
  6. 6.
  7. 7.
    Shaw, P.: Using constraint Programming and local search methods to solve vehicle routing problems. In: Proceeding of the 4th International Conference on Principle and practice of Constrant Programming, pp. 417–431 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Dengying Jiang
    • 1
  • Wenxia Jiang
    • 1
  • Zhangcan Huang
    • 1
  1. 1.School of ScienceWuhan University of TechnologyWuhanChina

Personalised recommendations