Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01302022
Contributor : Sohaib Afifi <>
Submitted on : Wednesday, April 13, 2016 - 2:52:10 PM
Last modification on : Wednesday, July 4, 2018 - 4:44:02 PM

Identifiers

  • 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. ⟨hal-01302022⟩

Share

Metrics

Record views

213