主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2024, Vol. 32 ›› Issue (12): 153-163.doi: 10.16381/j.cnki.issn1003-207x.2022.1519

Previous Articles     Next Articles

A Bilevel Heuristic for the Contactless Delivery Problem Coordinated with Trucks and Drones

Li Jiang(), Changyong Liang, Xiaoning Zang   

  1. School of Management,Hefei University of Technology,Hefei 230009,China
  • Received:2022-07-11 Revised:2022-09-23 Online:2024-12-25 Published:2025-01-02
  • Contact: Li Jiang E-mail:jiangli@hfut.edu.cn

Abstract:

In this paper, a contactless delivery problem coordinated with trucks and drones (CDP-TD) is introduced, in which trucks depart from the depot, facilities in the delivery network are visited, and then drones start from the facilities to provide customers with contactless delivery services. The goal of the problem is to minimize the two-level delivery cost. The problem has application in the urban contactless delivery during the pandemic, such as COVID-19. A mixed integer programming model is proposed for the problem, and the problem is reformulated to a bilevel programming model by Benders Decomposition. Inspired by the ideas of the bilevel programming model, a bilevel heuristic is developed to solve the problem. Finally, two classes of problems are generated, including 144 instances, to test the formulation and BH algorithm. The results show that as the number of nodes increases, the performance of the CPLEX deteriorates significantly, whereas the BH has good performance for solving the CDP-TD.

Key words: urban logistics, contactless delivery, bilevel programming, bilevel heuristic

CLC Number: