Heuristic Solutions for the Vehicle Routing Problem with Time Windows and Synchronized Visits - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Optimization Letters Année : 2016

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

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

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⟩
355 Consultations
2809 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More