Optimization Letters

, Volume 10, Issue 3, pp 511–525

Heuristic solutions for the vehicle routing problem with time windows and synchronized visits

Original Paper

DOI: 10.1007/s11590-015-0878-3

Cite this article as:
Afifi, S., Dang, DC. & Moukrim, A. Optim Lett (2016) 10: 511. doi:10.1007/s11590-015-0878-3

Abstract

We present a simulated annealing based algorithm for a variant of the vehicle routing problem (VRP), in which a time window is associated with each client service and some services require simultaneous visits from different vehicles to be accomplished. The problem is called the VRP with time windows and synchronized visits. The algorithm features a set of local improvement methods to deal with various objectives of the problem. Experiments conducted on the benchmark instances from the literature clearly show that our method is fast and outperforms the existing approaches. It produces all known optimal solutions of the benchmark in very short computational times, and improves the best results for the rest of the instances.

Keywords

Vehicle routing Synchronization Destruction/repair Local search Simulated annealing 

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.Sorbonne universités, Université de Technologie de Compiègne, CNRS, Heudiasyc UMR 7253, CS 60319Compiègne cedexFrance
  2. 2.ASAP Research Group, School of Computer ScienceUniversity of NottinghamNottinghamUK

Personalised recommendations