A branch-and-price-and-cut algorithm for the truck-drone routing problem with simultaneously delivery and pickup

被引:16
作者
Li, Dongwei [1 ]
Ignatius, Joshua [2 ]
Wang, Dujuan [3 ]
Yin, Yunqiang [1 ,5 ]
Cheng, T. C. E. [4 ]
机构
[1] Univ Elect Sci & Technol China, Sch Management & Econ, Chengdu, Peoples R China
[2] Aston Univ, Aston Business Sch, Birmingham, England
[3] Sichuan Univ, Business Sch, Chengdu, Peoples R China
[4] Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Hong Kong, Peoples R China
[5] Univ Elect Sci & Technol China, Sch Management & Econ, Chengdu 611731, Peoples R China
基金
中国国家自然科学基金;
关键词
branch-and-price-and-cut algorithm; delivery and pickup; scheduling; transportation; truck-drone routing; TRAVELING SALESMAN PROBLEM; TABU SEARCH; TIME-WINDOW; INEQUALITIES; OPTIMIZATION; CONSTRAINTS;
D O I
10.1002/nav.22151
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Increasing environmental concerns and e-commerce has attracted a growing focus on reverse logistics that not only delivers some goods to customers but also picks up other goods from customers. To achieve cost-efficient and fast deliveries, integrating drones into the delivery and pickup services provides a competitive advantage, which however increases the operational challenges. We consider a truck-drone routing problem with simultaneous delivery and pickup, where each truck carries a set of heterogeneous drones. Each truck can simultaneously perform its own delivery and pickup, and serve as an intermediate movable depot from which multiple drones can be dispatched to serve customers when the truck arrives at a customer, and the truck must wait until all the drones return. The energy consumption of drones is considered during their flights. All the delivery services must be performed, whereas the pickup services are optional with certain rewards. The objective is to find the synthetic-routes of the truck-drone combinations so as to minimize the sum of the assignment cost and the transport cost of the trucks and drones minus the total pickup revenue. To solve the problem, we devise a tailored branch-and-price-and-cut algorithm incorporating a specialized two-stage bidirectional labeling algorithm to solve the challenging pricing problem. To enhance the efficiency of the algorithm, we use the subset-row inequalities to tighten the lower bound, and apply some heuristic pricing strategies to quickly solve the pricing problem. We perform extensive numerical studies to assess the performance of the developed algorithm, analyze the merit of the truck-drone cooperative service mode over the truck-only service mode and the superiority of the configuration with heterogeneous drones, and ascertain the impacts of the key model parameters to generate managerial insights. We also show how our model would perform should it be used for the medical supply delivery and pickup in Shenzhen, China.
引用
收藏
页码:241 / 285
页数:45
相关论文
共 58 条
[1]   Optimization Approaches for the Traveling Salesman Problem with Drone [J].
Agatz, Niels ;
Bouman, Paul ;
Schmidt, Marie .
TRANSPORTATION SCIENCE, 2018, 52 (04) :965-981
[2]   COLOR-CODING [J].
ALON, N ;
YUSTER, R ;
ZWICK, U .
JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, 1995, 42 (04) :844-856
[3]  
Amazon, 2022, AM CUST LOCK CAL WIL
[4]  
[Anonymous], 2017, Xinhua
[5]   Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows [J].
Archetti, C. ;
Bouchard, M. ;
Desaulniers, G. .
TRANSPORTATION SCIENCE, 2011, 45 (03) :285-298
[6]   Drone delivery from trucks: Drone scheduling for given truck routes [J].
Boysen, Nils ;
Briskorn, Dirk ;
Fedtke, Stefan ;
Schwerdfeger, Stefan .
NETWORKS, 2018, 72 (04) :506-527
[7]   Exact methods for the traveling salesman problem with multiple drones [J].
Cavani, Sara ;
Iori, Manuel ;
Roberti, Roberto .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2021, 130
[8]   Synchronized Truck and Drone Routing in Package Delivery Logistics [J].
Das, Dyutimoy Nirupam ;
Sewani, Rohan ;
Wang, Junwei ;
Tiwari, Manoj Kumar .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2021, 22 (09) :5772-5782
[9]   A branch-and-price approach for a multi-period vehicle routing problem [J].
Dayarian, Iman ;
Crainic, Teodor Gabriel ;
Gendreau, Michel ;
Rei, Walter .
COMPUTERS & OPERATIONS RESEARCH, 2015, 55 :167-184
[10]   A variable neighborhood search for flying sidekick traveling salesman problem [J].
de Freitas, Julia Carta ;
Vaz Penna, Puca Huachi .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2020, 27 (01) :267-290