Chenhao Zhang , Yaoxin Wu , Tao Feng , Yibei Zhang , Maocan Song , Lin Cheng
{"title":"Benders decomposition for traveling salesman problem with drone: A space-time-state network perspective","authors":"Chenhao Zhang , Yaoxin Wu , Tao Feng , Yibei Zhang , Maocan Song , Lin Cheng","doi":"10.1016/j.trc.2025.105255","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"179 ","pages":"Article 105255"},"PeriodicalIF":7.6000,"publicationDate":"2025-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part C-Emerging Technologies","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0968090X25002591","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TRANSPORTATION SCIENCE & TECHNOLOGY","Score":null,"Total":0}
引用次数: 0
Abstract
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.
期刊介绍:
Transportation Research: Part C (TR_C) is dedicated to showcasing high-quality, scholarly research that delves into the development, applications, and implications of transportation systems and emerging technologies. Our focus lies not solely on individual technologies, but rather on their broader implications for the planning, design, operation, control, maintenance, and rehabilitation of transportation systems, services, and components. In essence, the intellectual core of the journal revolves around the transportation aspect rather than the technology itself. We actively encourage the integration of quantitative methods from diverse fields such as operations research, control systems, complex networks, computer science, and artificial intelligence. Join us in exploring the intersection of transportation systems and emerging technologies to drive innovation and progress in the field.