Heuristic Solutions for the Vehicle Routing Problem with Time Windows and Synchronized Visits - Archive ouverte HAL Access content directly
Journal Articles Optimization Letters Year : 2016

Heuristic Solutions for the Vehicle Routing Problem with Time Windows and Synchronized Visits

Abstract

We present a simulated annealing based algorithm (SAILS) 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 (VRPTWSyn). 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.
Fichier principal
Vignette du fichier
AFIFI_VRPTWSyn_OptimLet.pdf (336.67 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01131888 , version 1 (16-03-2015)

Identifiers

Cite

Sohaib Afifi, Duc-Cuong Dang, Aziz Moukrim. Heuristic Solutions for the Vehicle Routing Problem with Time Windows and Synchronized Visits. Optimization Letters, 2016, 10 (3), pp.511-525. ⟨10.1007/s11590-015-0878-3⟩. ⟨hal-01131888⟩
356 View
2870 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More