A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints
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.
KeywordsVehicle routing Synchronization Destruction/repair Simulated annealing
- 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.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