HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Modèles et Algorithmes pour les Problèmes de Livraison du Dernier Kilomètre avec Plusieurs Options d'Expédition

Abstract : In this thesis, we study routing problems that arise in the context of last mile delivery when multiple delivery options are proposed to the customers. The most common option to deliver packages is home/workplace delivery. Besides, the delivery can be made to pick-up points such as dedicated lockers or stores. In recent years, a new concept called trunk/in-car delivery has been proposed. Here, customers' packages can be delivered to the trunks of cars. Our goal is to model and develop efficient solution approaches for routing problems in this context, in which each customer can have multiple shipping locations. First, we survey non-Hamiltonian routing problems. Then, we study the single-vehicle case in the considered context, which is modeled as a Generalized Traveling Salesman Problem with Time Windows (GTSPTW). Four mixed integer linear programming formulations and an efficient branch-and-cut algorithm are proposed. Finally, we study the multi-vehicle case which is denoted Generalized Vehicle Routing Problem with Time Windows (GVRPTW). An efficient column generation based heuristic is proposed to solve it
Document type :
Complete list of metadata

Contributor : Abes Star :  Contact
Submitted on : Wednesday, May 19, 2021 - 3:18:46 AM
Last modification on : Thursday, March 24, 2022 - 3:42:53 AM
Long-term archiving on: : Friday, August 20, 2021 - 6:04:53 PM


Version validated by the jury (STAR)


  • HAL Id : tel-03229424, version 1



Yuan Yuan. Modèles et Algorithmes pour les Problèmes de Livraison du Dernier Kilomètre avec Plusieurs Options d'Expédition. Other [cs.OH]. Ecole Centrale de Lille, 2019. English. ⟨NNT : 2019ECLI0011⟩. ⟨tel-03229424⟩



Record views


Files downloads