An iterative two-step heuristic for the parallel drone scheduling traveling salesman problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Networks Année : 2018

An iterative two-step heuristic for the parallel drone scheduling traveling salesman problem

Résumé

A recent evolution in urban logistics involves the usage of drones. In this article, we address a heuristic solution of the parallel drone scheduling traveling salesman problem, recently introduced by Murray and Chu. In this problem, deliveries are split between a vehicle and drones. The vehicle performs a classical delivery tour, while the drones are constrained to perform back and forth trips. The objective is to minimize completion time. We propose an iterative two-step heuristic, composed of: a coding step that transforms a solution into a customer sequence, and a decoding step that decomposes the customer sequence into a tour for the vehicle and trips for the drones. Decoding is expressed as a bicriteria shortest path problem and is carried out by dynamic programming. Experiments conducted on benchmark instances confirm the efficiency of the approach and give some insights on this drone delivery system.
Fichier principal
Vignette du fichier
article PDSTSP(1).pdf (807.58 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01952007 , version 1 (07-01-2019)

Identifiants

Citer

Raïssa G Mbiadou Saleu, Laurent Deroussi, Nathalie Grangeon, Alain Quilliot, Dominique Feillet. An iterative two-step heuristic for the parallel drone scheduling traveling salesman problem. Networks, 2018, 72 (4), pp.459-474. ⟨10.1002/net.21846⟩. ⟨hal-01952007⟩
193 Consultations
1161 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More