검색 상세

Last-Mile Delivery Route Optimization with the Integration of Public Transportation and Drones

드론과 대중교통 연계를 활용한 라스트 마일 배송 경로 최적화

초록/요약

The rapid growth of the e-commerce industry has led to a significant increase in last mile delivery volumes. To address this issue, drones have been recognized as a promising means to efficiently handle the growing demand in last-mile logistics. Accordingly, recent studies have explored hybrid delivery models that integrate drones with either public transportation or trucks. However, each hybrid model still has inherent limitations. In the public transportation–based model, the drone’ s service range can be extended through existing transit infrastructure, but its applicability depends heavily on the density of drone stations. In contrast, the truck-based model uses trucks as mobile stations, yet the drone’ s delivery area remains constrained by the truck’ s operating zone. To overcome these limitations, this study proposes a mathematical optimization model of the Flying Sidekick Traveling Salesman Problem with Public Transportation (FSTSP-PT), which combines the advantages of both hybrid models. In the FSTSP-PT model, a truck and drones start their deliveries simultaneously, and the drones extend their delivery routes by utilizing public transportation during the delivery process. Since the mixed-integer programming formulation of the FSTSP-PT model features high computational complexity, a Logic-Based Benders Decomposition(LBBD) heuristic algorithm is developed. Numerical experiments demonstrate that the proposed LBBD heuristic algorithm efficiently obtains near-optimal solutions within a short computation time.

more

목차

제1장 서론 1
제2장 Literature review 5
제1절 Models using drones as a sole delivery mode 5
제2절 Models integrating drones with other transportation modes 7
제3절 Differences between existing studies and our research 9
제3장 Problem description and mathematical model 11
제1절 Problem description 11
제2절 Mixed-integer linear programming formulation 13
제4장 LBBD heuristic algorithm 18
제1절 Preprocessing 19
1. Minimum drone cost: Cdi 19
2. Lower bound on the number of truck-visited nodes: p 20
3. Upper bound on the number of truck-visited nodes and minimum truck cost: p and Cti 20
4. Increase in the minimum truck cost per number of visited nodes: I i . 22
제2절 Benders master problem (BMP) 23
제3절 Benders sub problem (BSP) 25
1. Benders feasibility cut 30
2. Benders optimality cut 30
제5장 Computational experiments 32
제1절 Performance evaluation of LBBD heuristic algorithm 32
제2절 Realistic data based case study 35
1. Comparison between TSP and FSTSP-PT models 36
2. Sensitivity analysis 39
제6장 Conclusions 45
Bibliography 47
Appendix 51

more