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

Conference paper

DOI: 10.1007/978-3-642-44973-4_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7997)
Cite this paper as:
Afifi S., Dang DC., Moukrim A. (2013) A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints. In: Nicosia G., Pardalos P. (eds) Learning and Intelligent Optimization. LION 2013. Lecture Notes in Computer Science, vol 7997. Springer, Berlin, Heidelberg

Abstract

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.

Keywords

Vehicle routing Synchronization Destruction/repair Simulated annealing 

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