A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints

Résumé

This paper focuses on solving a variant of the vehicle routing problem (VRP) in which a time window is associated with each customer service and some services require simultaneous visits from different vehicles to be accomplished. The problem is therefore called the VRP with time windows and synchronization constraints (VRPTWSyn). We present a simulated annealing algorithm (SA) that incorporates several local search techniques to deal with this problem. Experiments on the instances from the literature show that our SA is fast and outperforms the existing approaches. To the best of our knowledge, this is the first time that dedicated local search methods have been proposed and evaluated on this variant of VRP.
Fichier principal
Vignette du fichier
SA_VRPTWSyn_AFIFI.pdf (105.33 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00916972 , version 1 (12-12-2013)

Identifiants

Citer

Sohaib Afifi, Duc-Cuong Dang, Aziz Moukrim. A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints. 7th International Conference, Learning and Intelligent Optimization (LION 7), Jan 2013, Catania, Italy. pp.259-265, ⟨10.1007/978-3-642-44973-4_27⟩. ⟨hal-00916972⟩
404 Consultations
5266 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More