Optimal Route Planning for Truck–Drone Delivery Using Variable Neighborhood Tabu Search Algorithm

The optimal delivery route problem for truck–drone delivery is defined as a traveling salesman problem with drone (TSP-D), which has been studied in a wide range of previous literature. However, most of the existing studies ignore truck waiting time at rendezvous points. To fill this gap, this paper...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Applied sciences Jg. 12; H. 1; S. 529
Hauptverfasser:	Tong, Bao, Wang, Jianwei, Wang, Xue, Zhou, Feihao, Mao, Xinhua, Zheng, Wenlong
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Basel MDPI AG 01.01.2022
Schlagworte:	Algorithms Cost control Customers Drones Efficiency Heuristic Integer programming Logistics Mathematical models mixed-integer nonlinear programming model optimal route problem Traveling salesman problem Trucks truck–drone delivery variable neighborhood tabu search algorithm
ISSN:	2076-3417, 2076-3417
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!