Primal Heuristics for the Vehicle Routing Problem with Synchronized Visits

Sohaib Afifi (1, 2) , Aziz Moukrim (1, 2)

1 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]
2 Labex MS2T - Laboratoire d'Excellence "Maîtrise des Systèmes de Systèmes Technologiques"

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.

Mots clés: Vehicle Routing Problem; hybrid methods; Branch and bound

Domaines: Recherche opérationnelle [math.OC]

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⟩