Primal Heuristics for the Vehicle Routing Problem with Synchronized Visits

Abstract : 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.
Type de document :
Communication dans un congrès
Multidisciplinary International Conference on Scheduling : Theory and Applications, Aug 2015, Prague, Czech Republic. 2015, 〈http://www.schedulingconference.org/〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01302022
Contributeur : Sohaib Afifi <>
Soumis le : mercredi 13 avril 2016 - 14:52:10
Dernière modification le : mercredi 29 novembre 2017 - 09:22:29

Identifiants

  • HAL Id : hal-01302022, version 1

Collections

Citation

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. 2015, 〈http://www.schedulingconference.org/〉. 〈hal-01302022〉

Partager

Métriques

Consultations de la notice

80