Heuristic solutions for the vehicle routing problem with time windows and synchronized visits
- 393 Downloads
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.
KeywordsVehicle routing Synchronization Destruction/repair Local search Simulated annealing
- 1.Afifi, S., Dang, D.C., Moukrim, A.: A simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints. In: Proceedings of LION-7, Lecture Notes in Computer Science, vol. 7997, pp. 259–265 (2013)Google Scholar
- 6.Bredström, D., Rönnqvist, M.: A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints. NHH Dept of Finance and Management Science Discussion Paper (2007)Google Scholar
- 9.Czech, Z., Czarnas, P.: Parallel simulated annealing for the vehicle routing problem with time windows. In: Proceedings of 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing (2002)Google Scholar