Dynamic vehicle routing problem with drone resupply for same-day delivery

被引:5
作者
Pina-Pardo, Juan C. [1 ,2 ]
Silva, Daniel F. [3 ]
Smith, Alice E. [3 ]
Gatica, Ricardo A. [1 ]
机构
[1] Pontificia Univ Catolica Valparaiso, Sch Ind Engn, Valparaiso, Chile
[2] MIT, Ctr Transportat & Logist, Cambridge, MA USA
[3] Auburn Univ, Dept Ind & Syst Engn, Auburn, AL 36849 USA
关键词
Same-day delivery; Drone resupply; Dynamic vehicle routing; Last-mile logistics; TRAVELING SALESMAN PROBLEM; TIME-WINDOW; SEARCH; TRUCK; MODEL;
D O I
10.1016/j.trc.2024.104611
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
We study a same -day delivery problem where customer orders arrive dynamically throughout the day and the service operator must determine, in real-time, whether to accept the orders and how to adjust the ongoing distribution plan. We develop a route -based Markov Decision Process and an efficient online policy to dynamically route a truck that can receive newly arrived orders along its route via drones dispatched from a depot. Numerical experiments show that our online policy has an average fill rate decrease of at most 20% over the perfect -information counterpart. Further, this online policy has a fill rate increase of up to 8% over a na & iuml;ve greedy policy. We also show that drone resupply increases fill rates by up to 21% compared to a conventional truck -only resupply system. Computational times to make each decision are in the hundredths of a second, thus allowing real-time feedback to customers regarding their eligibility for same -day delivery.
引用
收藏
页数:20
相关论文
共 49 条
  • [1] Ahmed S., 2002, SIAM Journal on optimization, P1, DOI DOI 10.1137/S1052623499363220
  • [2] [Anonymous], 2020, The Future of the Last-Mile Ecosystem
  • [3] Dynamic traveling salesman problem with stochastic release dates
    Archetti, C.
    Feillet, D.
    Mor, A.
    Speranza, M. G.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 280 (03) : 832 - 844
  • [4] Reoptimizing the traveling salesman problem
    Archetti, C
    Bertazzi, L
    Speranza, MG
    [J]. NETWORKS, 2003, 42 (03) : 154 - 159
  • [5] An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization
    Archetti, Claudia
    Feillet, Dominique
    Mor, Andrea
    Speranza, M. Grazia
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2018, 98 : 24 - 37
  • [6] Avidrone Aerospace, 2021, ABOUT US
  • [7] A dynamic vehicle routing problem with multiple delivery routes
    Azi, Nabila
    Gendreau, Michel
    Potvin, Jean-Yves
    [J]. ANNALS OF OPERATIONS RESEARCH, 2012, 199 (01) : 103 - 112
  • [8] Banerjee D., 2023, Customer satisfaction and pricing in E-Retail delivery
  • [9] Business Insider, 2018, The challenges of last-mile delivery logistics & the technology solutions cutting costs
  • [10] Maximum coverage capacitated facility location problem with range constrained drones
    Chauhan, Darshan
    Unnikrishnan, Avinash
    Figliozzi, Miguel
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2019, 99 : 1 - 18