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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Applied sciences Ročník 12; číslo 1; s. 529
Hlavní autori:	Tong, Bao, Wang, Jianwei, Wang, Xue, Zhou, Feihao, Mao, Xinhua, Zheng, Wenlong
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel MDPI AG 01.01.2022
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!