Author
Listed:
- Ritesh Ojha
(H. Milton Stewart School of Industrial and Systems Engineering, Georgia Tech, Atlanta, Georgia 30332)
- Wenbo Chen
(H. Milton Stewart School of Industrial and Systems Engineering, Georgia Tech, Atlanta, Georgia 30332)
- Hanyu Zhang
(H. Milton Stewart School of Industrial and Systems Engineering, Georgia Tech, Atlanta, Georgia 30332)
- Reem Khir
(Edwardson School of Industrial Engineering, Purdue University, West Lafayette, Indiana 47907)
- Alan Erera
(H. Milton Stewart School of Industrial and Systems Engineering, Georgia Tech, Atlanta, Georgia 30332)
- Pascal Van Hentenryck
(H. Milton Stewart School of Industrial and Systems Engineering, Georgia Tech, Atlanta, Georgia 30332)
Abstract
The load planning problem is a critical challenge in service network design for parcel carriers: it decides how many trailers (or loads), perhaps of different types, to assign for dispatch over time between pairs of terminals. Another key challenge is to determine a flow plan that specifies how parcel volumes are assigned to planned loads. This paper considers the Outbound Load Planning Problem (OLPP) that considers flow and load planning challenges jointly to adjust loads and flows as demand forecast changes over time before the day of terminal operations. The paper develops a decision support tool to inform planners making these decisions at terminals across the network. It formulates the OLPP as a mixed-integer programming (MIP) model and shows that it admits a large number of symmetries in a network where each commodity can be routed through primary and alternate terminals. As a result, an optimization solver may return fundamentally different solutions to closely related problems (i.e., OLPPs with slightly different inputs), confusing planners and reducing trust in optimization. To remedy this limitation, the first contribution of the paper is to propose a lexicographical optimization approach that eliminates those symmetries by generating optimal solutions while staying close to a reference plan. The second contribution of the paper is the design of an optimization proxy that addresses the computational challenges of the optimization model. The optimization proxy combines a machine learning model and an MIP-based repair procedure to find near-optimal solutions that satisfy real-time constraints imposed by planners in the loop. An extensive computational study on industrial instances shows that the optimization proxy is around 10 times faster than the commercial solver in obtaining solutions of similar quality; the optimization proxy is also orders of magnitude faster for generating solutions that are consistent with each other. The proposed approach also demonstrates the benefits of the OLPP for load consolidation and the significant savings obtained from combining machine learning and optimization.
Suggested Citation
Ritesh Ojha & Wenbo Chen & Hanyu Zhang & Reem Khir & Alan Erera & Pascal Van Hentenryck, 2025.
"Outbound Load Planning in Parcel Delivery Service Networks Using Machine Learning and Optimization,"
Transportation Science, INFORMS, vol. 59(5), pages 1057-1075, September.
Handle:
RePEc:inm:ortrsc:v:59:y:2025:i:5:p:1057-1075
DOI: 10.1287/trsc.2024.0672
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:59:y:2025:i:5:p:1057-1075. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.