A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7997)


This paper focuses on solving a variant of the vehicle routing problem (VRP) in which a time window is associated with each customer service and some services require simultaneous visits from different vehicles to be accomplished. The problem is therefore called the VRP with time windows and synchronization constraints (VRPTWSyn). We present a simulated annealing algorithm (SA) that incorporates several local search techniques to deal with this problem. Experiments on the instances from the literature show that our SA is fast and outperforms the existing approaches. To the best of our knowledge, this is the first time that dedicated local search methods have been proposed and evaluated on this variant of VRP.


Vehicle routing Synchronization Destruction/repair Simulated annealing 


  1. 1.
    Bouly, H., Moukrim, A., Chanteur, D., Simon, L.: An iterative destruction/construction heuristic for solving a specific vehicle routing problem. In: MOSIM’08 (2008) (in French)Google Scholar
  2. 2.
    Bredström, D., Rönnqvist, M.: A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints (Feb 2007)Google Scholar
  3. 3.
    Bredström, D., Rönnqvist, M.: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur. J. Oper. Res. 191(1), 19–31 (2008)CrossRefzbMATHGoogle Scholar
  4. 4.
    Drexl, M.: Synchronization in vehicle routing a survey of vrps with multiple synchronization constraints. Transp. Sci. 46(3), 297–316 (2012)CrossRefGoogle Scholar
  5. 5.
    Fischetti, M., Lodi, A.: Local branching. Math. Program. 98(1–3), 23–47 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Potvin, J.Y., Kervahut, T., Garcia, B.L., Rousseau, J.M.: The vehicle routing problem with time windows part I: tabu search. INFORMS J. Comput. 8(2), 158–164 (1996)CrossRefzbMATHGoogle Scholar
  8. 8.
    Solomon, M.M., Desrosiers, J.: Time window constrained routing and scheduling problems. Transp. Sci. 22, 1–13 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Toth, P., Vigo, D.: The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Université de Technologie de Compiègne, Laboratoire Heudiasyc, UMR 7253 CNRSCompiègneFrance
  2. 2.School of Computer Science, ASAP Research GroupUniversity of NottinghamNottinghamUK

Personalised recommendations