A Branch-and-Price algorithm for a routing problem with inbound and outbound requests
Maxime Agius  1, 2@  , Nabil Absi  3, 4@  , Dominique Feillet  1, 2@  , Thierry Garaix  1, 5@  
1 : Ecole des Mines de Saint Etienne
Ecole des Mines de Saint Etienne, Ecole des Mines de Saint-Etienne
2 : Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes
CNRS : UMR6158
3 : Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes  (LIMOS)  -  Site web
CNRS : UMR6158
F-13541 Gardanne -  France
4 : Ecole des Mines de Saint-Etienne  (EMSE)  -  Site web
Ecole des Mines de Saint-Etienne
Campus Georges Charpak Provence, F-13451 Gardanne, France -  France
5 : Centre Ingénierie et Santé  (CIS-ENSMSE/ROGI-LIMOS)  -  Site web
École Nationale Supérieure des Mines - Saint-Étienne, CNRS : UMR6158
158, cours Fauriel F-42023 Saint-Étienne cedex 2 -  France

The studied problem arises in the context of non-emergency transportation of patients. We consider a hospital (the depot) and a set of patients with a medical appointment. Patients require either to go from home to hospital (inbound request) or from hospital to home (outbound request). The problem can be addressed either as a Pickup and Delivery Problem or as a special Multi-Trip Vehicle Routing Problem because for any request the depot is either the pickup or the delivery node. The problem is called Multi-Trip Vehicle Routing Problem with Mixed Pickup and Delivery, and Release and Due dates (MTMPD-RD).

Seen as a multi-trip VRP, the problem raises a complex time and vehicle capacity management but we adopt this standpoint and prove that the multi-trip model outperforms the Pickup and Delivery model.


Personnes connectées : 3 Vie privée
Chargement...