Author
Listed:
- Pedro Zattoni Scroccaro
(Delft Center for Systems and Control, Delft University of Technology, 2628CD Delft, Netherlands)
- Piet van Beek
(Delft Center for Systems and Control, Delft University of Technology, 2628CD Delft, Netherlands)
- Peyman Mohajerin Esfahani
(Delft Center for Systems and Control, Delft University of Technology, 2628CD Delft, Netherlands)
- Bilge Atasoy
(Department of Maritime and Transport Technology, Delft University of Technology, 2628CD Delft, Netherlands)
Abstract
We propose a method for learning decision makers’ behavior in routing problems using inverse optimization (IO). The IO framework falls into the supervised learning category and builds on the premise that the target behavior is an optimizer of an unknown cost function. This cost function is to be learned through historical data, and in the context of routing problems, can be interpreted as the routing preferences of the decision makers. In this view, the main contributions of this study are to propose an IO methodology with a hypothesis function, loss function, and stochastic first-order algorithm tailored to routing problems. We further test our IO approach in the Amazon Last Mile Routing Research Challenge, where the goal is to learn models that replicate the routing preferences of human drivers, using thousands of real-world routing examples. Our final IO-learned routing model achieves a score that ranks second compared with the 48 models that qualified for the final round of the challenge. Our examples and results showcase the flexibility and real-world potential of the proposed IO methodology to learn from decision-makers’ decisions in routing problems.
Suggested Citation
Pedro Zattoni Scroccaro & Piet van Beek & Peyman Mohajerin Esfahani & Bilge Atasoy, 2025.
"Inverse Optimization for Routing Problems,"
Transportation Science, INFORMS, vol. 59(2), pages 301-321, March.
Handle:
RePEc:inm:ortrsc:v:59:y:2025:i:2:p:301-321
DOI: 10.1287/trsc.2023.0241
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:2:p:301-321. 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.