Deep reinforcement learning for stochastic last-mile delivery with crowdshipping

被引:9
作者
Silva, Marco [1 ]
Pedroso, Joao Pedro [1 ,2 ]
Viana, Ana [1 ,3 ]
机构
[1] INESC TEC, Porto, Portugal
[2] Univ Porto, Porto, Portugal
[3] Polithecn Porto, Porto, Portugal
关键词
Last-mile delivery; Crowdshipping; Deep reinforcement learning; Data-driven optimization; Integer optimization; TRAVELING SALESMAN PROBLEM; VEHICLE-ROUTING PROBLEM;
D O I
10.1016/j.ejtl.2023.100105
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We study a setting in which a company not only has a fleet of capacitated vehicles and drivers available to make deliveries but may also use the services of occasional drivers (ODs) willing to make deliveries using their own vehicles in return for a small fee. Under such a business model, a.k.a crowdshipping, the company seeks to make all the deliveries at the minimum total cost, i.e., the cost associated with their vehicles plus the compensation paid to the ODs.We consider a stochastic and dynamic last-mile delivery environment in which customer delivery orders, as well as ODs available for deliveries, arrive randomly throughout the day, within fixed time windows.We present a novel deep reinforcement learning (DRL) approach to the problem that can deal with large problem instances. We formulate the action selection problem as a mixed-integer optimization program.The DRL approach is compared against other optimization under uncertainty approaches, namely, sample -average approximation (SAA) and distributionally robust optimization (DRO). The results show the effective-ness of the DRL approach by examining out-of-sample performance.
引用
收藏
页数:13
相关论文
共 37 条
  • [1] A Parallel Branch and Bound Algorithm for the Probabilistic TSP
    Amar, Mohamed Abdellahi
    Khaznaji, Walid
    Bellalouna, Monia
    [J]. ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2018, PT I, 2018, 11334 : 437 - 448
  • [2] An Exact Resolution for the Probabilistic Traveling Salesman Problem under the A Priori Strategy
    Amar, Mohamed Abdellahi
    Khaznaji, Walid
    Bellalouna, Monia
    [J]. INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE (ICCS 2017), 2017, 108 : 1414 - 1423
  • [3] Strong mixed-integer programming formulations for trained neural networks
    Anderson, Ross
    Huchette, Joey
    Ma, Will
    Tjandraatmadja, Christian
    Vielma, Juan Pablo
    [J]. MATHEMATICAL PROGRAMMING, 2020, 183 (1-2) : 3 - 39
  • [4] The online vehicle routing problem with occasional drivers
    Archetti, Claudia
    Guerriero, Francesca
    Macrina, Giusy
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2021, 127
  • [5] The Vehicle Routing Problem with Occasional Drivers
    Archetti, Claudia
    Savelsbergh, Martin
    Speranza, M. Grazia
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 254 (02) : 472 - 480
  • [6] Crowdsourced Delivery-A Dynamic Pickup and Delivery Problem with Ad Hoc drivers
    Arslan, Alp M.
    Agatz, Niels
    Kroon, Leo
    Zuidwijk, Rob
    [J]. TRANSPORTATION SCIENCE, 2019, 53 (01) : 222 - 235
  • [7] Bello I., 2016, arXiv, DOI 10.48550/arXiv.1611.09940
  • [8] A VEHICLE-ROUTING PROBLEM WITH STOCHASTIC DEMAND
    BERTSIMAS, DJ
    [J]. OPERATIONS RESEARCH, 1992, 40 (03) : 574 - 586
  • [9] Chen XW, 2021, Arxiv, DOI arXiv:1910.11901
  • [10] Chen YJ, 2019, Arxiv, DOI arXiv:1903.02716