A machine learning optimization approach for last-mile delivery and third-party logistics

被引:22
作者
Bruni, Maria Elena [1 ]
Fadda, Edoardo [2 ]
Fedorov, Stanislav [3 ,4 ]
Perboli, Guido [4 ,5 ,6 ]
机构
[1] Univ Calabria, DIMEG, Arcavacata Di Rende, Italy
[2] Politecn Torino, DISMA, Turin, Italy
[3] Politecn Torino, DAUIN, Turin, Italy
[4] Politecn Torino, CARSPolito, Turin, Italy
[5] DIGEP, Politecn Torino, Turin, Italy
[6] Arisk SpA, Milan, Italy
关键词
Metaheuristics; Machine learning; Variable cost and size bin packing; Third-party logistics; Last-mile delivery; Capacity planning; PROGRESSIVE HEDGING METHOD; TRAVELING SALESMAN PROBLEM; PACKING PROBLEMS; UNCERTAINTY;
D O I
10.1016/j.cor.2023.106262
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Third-party logistics is now an essential component of efficient delivery systems, enabling companies to purchase carrier services instead of an expensive fleet of vehicles. However, carrier contracts have to be booked in advance without exact knowledge of what orders will be available for dispatch. The model describing this problem is the variable cost and size bin packing problem with stochastic items. Since it cannot be solved for realistic instances by means of exact solvers, in this paper, we present a new heuristic algorithm able to do so based on machine learning techniques. Several numerical experiments show that the proposed heuristics achieve good performance in a short computational time, thus enabling its real-world usage. Moreover, the comparison against a new and efficient version of progressive hedging proves that the proposed heuristic achieves better results. Finally, we present managerial insights for a case study on parcel delivery in Turin, Italy.
引用
收藏
页数:14
相关论文
共 54 条
[1]  
5T Web Site, 2019, 5T SRL
[2]   Solving inventory routing with transshipment and substitution under dynamic and stochastic demands using genetic algorithm and deep reinforcement learning [J].
Achamrah, Fatima Ezzahra ;
Riane, Fouad ;
Limbourg, Sabine .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2022, 60 (20) :6187-6204
[3]  
[Anonymous], 1979, COMPUT INTRACTABILIT
[4]   The polynomial robust knapsack problem [J].
Baldo, Alessandro ;
Boffa, Matteo ;
Cascioli, Lorenzo ;
Fadda, Edoardo ;
Lanza, Chiara ;
Ravera, Arianna .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 305 (03) :1424-1434
[5]   A Learning-Based Algorithm to Quickly Compute Good Primal Solutions for Stochastic Integer Programs [J].
Bengio, Yoshua ;
Frejinger, Emma ;
Lodi, Andrea ;
Patel, Rahul ;
Sankaranarayanan, Sriram .
INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2020, 2020, 12296 :99-111
[6]  
Birge J.R., 1997, SPRINGER SERIES OPER
[7]   A Managerial Analysis of Urban Parcel Delivery: A Lean Business Approach [J].
Brotcorne, Luce ;
Perboli, Guido ;
Rosano, Mariangela ;
Wei, Qu .
SUSTAINABILITY, 2019, 11 (12)
[8]   Improving the effectiveness of SQL learning practice: a data-driven approach [J].
Cagliero, Luca ;
De Russis, Luigi ;
Farinetti, Laura ;
Montanaro, Teodoro .
2018 IEEE 42ND ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), VOL 1, 2018, :980-989
[9]   A Blockchain, 5G and IoT-based transaction management system for Smart Logistics: an Hyperledger framework [J].
Capocasale, Vittorio ;
Gotta, Danilo ;
Musso, Stefano ;
Perboli, Guido .
2021 IEEE 45TH ANNUAL COMPUTERS, SOFTWARE, AND APPLICATIONS CONFERENCE (COMPSAC 2021), 2021, :1285-1290
[10]  
Chen Tianlong, 2021, arXiv