A Branch-Cut-And-Price approach for the Two-Echelon Vehicle Routing Problem with Drones - Laboratoire de l'intégration, du matériau au système TOUS LABOS Accéder directement au contenu
Pré-Publication, Document De Travail (Preprint/Prepublication) Année : 2023

A Branch-Cut-And-Price approach for the Two-Echelon Vehicle Routing Problem with Drones

Résumé

In this paper, we propose a new set-partitioning model for the two-echelon vehicle routing problem with drones (2E-VRP-D), where partial routes corresponding to drone movements are enumerated using an efficient dynamic program. To solve the model we use an exact branch-cut-and-price algorithm, and a labelling algorithm for the pricing problem both based on state-of-the art literature. We also propose an adaptation of the wellknown rounded capacity cuts for this problem, as well as pre-processing methods to reduce the size of the problem. In addition, this paper presents an effective heuristic branch-cut-and-price, based on the exact branch-cut-and-price algorithm. Extensive computational experiments are presented, showing that the exact algorithm can solve all the instances from the literature on the 2E-VRP-D, and almost multiply by four the size of the clustered instances solved optimally. Sensitivity analysis is also conducted for the proposed improvements.
Fichier principal
Vignette du fichier
Branch_Cut_and_Price_model_for_2E_VRP_D 210524.pdf (456.52 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04584429 , version 1 (23-05-2024)

Licence

Identifiants

  • HAL Id : hal-04584429 , version 1

Citer

Sylvain Lichau, Ruslan Sadykov, Julien François, Rémy Dupas. A Branch-Cut-And-Price approach for the Two-Echelon Vehicle Routing Problem with Drones. 2024. ⟨hal-04584429⟩
1 Consultations
1 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More