旅行商问题
无人机
透视图(图形)
分解
2-选项
旅行购买者问题
状态空间
国家(计算机科学)
计算机科学
数学优化
运筹学
流量网络
工程类
航空航天工程
数学
人工智能
算法
遗传学
生物
统计
生态学
作者
Chenhao Zhang,Yaoxin Wu,Tao Feng,Yibei Zhang,Maocan Song,Lin Cheng
标识
DOI:10.1016/j.trc.2025.105255
摘要
As technology advances, the integration of diverse transportation modes is accelerating, with truck-drone collaboration emerging as a promising solution to urban last-mile delivery challenges. While prior research has extensively covered spatial synchronization in customer service networks, studies on temporal synchronization and time-dependence in real transportation networks remains limited, as does the consideration of candidate rendezvous points. To address this gap, we propose a novel modeling approach to the Traveling Salesman Problem with Drone, utilizing a Space-Time-State network framework, termed TSPD-STS. An arc-based integer linear programming (ILP) model is presented for single-truck single-drone delivery, incorporating time-dependent travel time influenced by varying speeds, candidate rendezvous, drone capacity, payload-dependent endurance and time windows. We solve the problem by a branch-and-Benders-cut approach based on generalized Benders decomposition, dividing it into an assignment problem (i.e., the master problem) and a coupled scheduling problem (i.e., the subproblem). The master problem is solved only once, while the subproblem dynamically provides cuts along the branching. To improve computational efficiency, we design five classes valid inequalities to strengthen the relaxed master problem, and propose a dynamically tightened optimal cut and a novel valid cut which, unlike traditional no-good cut, can handle clusters of variables in a single step. Extensive computational experiments on 170 instances with 4 to 20 space nodes, tested under four time-dependent patterns and compared against ten algorithms using branch-and-bound and operation-based dynamic programming as baselines, demonstrate the superior performance of the proposed method. Our approach reduces computation time by 38.15% to 79.43% and yields smaller optimality gaps, with an average of 0.46%. Sensitivity analyses provide practical insights for logistics planning and strategic decision-making.
科研通智能强力驱动
Strongly Powered by AbleSci AI