Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01131888
Contributor : Sohaib Afifi Connect in order to contact the contributor
Submitted on : Monday, March 16, 2015 - 12:10:29 PM
Last modification on : Wednesday, January 12, 2022 - 2:26:02 PM
Long-term archiving on: : Sunday, September 13, 2015 - 10:10:28 PM

File

AFIFI_VRPTWSyn_OptimLet.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

327

Files downloads

2483