Adaptive local search for a pickup and delivery problem applied to large parcel distribution - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Adaptive local search for a pickup and delivery problem applied to large parcel distribution

Résumé

This paper introduces an Adaptive Large Neighborhood Search algorithm that uses an epsilon-greedy movement selection strategy to solve a pickup and delivery problem for Smile Pickup, a real-life business. The algorithm also takes into account multiple time windows, heterogeneous fleets, and multiple depots as additional constraints. The algorithm utilises two diversification processes: a simulated annealing technique to update the current solution, and an epsilon-greedy strategy to balance between exploration and exploitation for the selection of neighbourhoods. We evaluated the algorithm’s performance using our own benchmark PickOptBench and Li & Lim benchmarks, and found that it shows great promise in solving Smile Pickup’s problem. Moreover, combining both the epsilon-greedy and simulated annealing restart strategies resulted in a 1% improvement in ALNS performance on both benchmarks. We also discovered that the algorithm found more than 70% of the best-known solutions for 4 out of the 6 classes of instances in the Li & Lim benchmark.
Fichier principal
Vignette du fichier
OLA_matthieu-2.pdf (655.63 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04461557 , version 1 (16-02-2024)

Identifiants

  • HAL Id : hal-04461557 , version 1

Citer

Matthieu Fagot, Laure Brisoux Devendeville, Corinne Lucet. Adaptive local search for a pickup and delivery problem applied to large parcel distribution. International Conference on Optimization and Learning (OLA2023), 2023, Malaga, Espagne, Spain. ⟨hal-04461557⟩
1 Consultations
3 Téléchargements

Partager

Gmail Facebook X LinkedIn More