Primal Heuristics for the Vehicle Routing Problem with Synchronized Visits - Laboratoire d'Excellence MS2T - Maîtrise des Systèmes de Systèmes Technologiques
Communication Dans Un Congrès Année : 2015

Primal Heuristics for the Vehicle Routing Problem with Synchronized Visits

Résumé

The aim of the paper is to solve exactly a new variant of the vehicle routing problem with time windows which includes synchronization visits. A new formulation is proposed and solved using boosting methods. We propose some dedicated primal heuristics and node feasibility checks. The results compared to a previous formulation and to a standard solver show the efficiency of this type of combination.
Fichier principal
Vignette du fichier
VRPTWSyn_Mista.pdf (100.75 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01302022 , version 1 (30-10-2023)

Identifiants

  • HAL Id : hal-01302022 , version 1

Citer

Sohaib Afifi, Aziz Moukrim. Primal Heuristics for the Vehicle Routing Problem with Synchronized Visits. Multidisciplinary International Conference on Scheduling : Theory and Applications, Aug 2015, Prague, Czech Republic. ⟨hal-01302022⟩
294 Consultations
29 Téléchargements

Partager

More