Exact solution approaches for the traveling salesman problem with a drone station

The rapid growth of e-commerce has posed significant challenges for urban last-mile delivery. In this paper, we study a truck–drone collaborative delivery problem, referred to as the traveling salesman problem with a drone station (TSP-DS), which is well-suited for densely populated urban environmen...

Celý popis

Podrobná bibliografie

Vydáno v:	European journal of operational research Ročník 328; číslo 3; s. 845 - 861
Hlavní autoři:	Shi, Zhiyuan, Hong, Shaozhi, Wang, Zeling, Li, Ang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.02.2026
Témata:	Drone parallel scheduling Logic-based benders decomposition Logistics Mixed-integer linear programming Traveling salesman problem Drone parallel scheduling Traveling salesman problem Logic-based benders decomposition Mixed-integer linear programming Logistics
ISSN:	0377-2217
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!