Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications
Name
online-routing-18.pdf
Description
Accepted version
Size
1.24 MB
Format
Adobe PDF
Checksum (MD5)
3897c4a1f2fb9acfc6c1fc22cdbb1de7
Author(s)
Bertsimas, Dimitris
Jaillet, Patrick
Martin, Sébastien
Date Issued
2019
Journal
Operations Research
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Version
Author's final manuscript
Abstract
© 2019 INFORM. With the emergence of ride-sharing companies that offer transportation on demand at a large scale and the increasing availability of corresponding demand data sets, new challenges arise to develop routing optimization algorithms that can solve massive problems in real time. In this paper, we develop an optimization framework, coupled with a novel and generalizable backbone algorithm, that allows us to dispatch in real time thousands of taxis serving more than 25,000 customers per hour. We provide evidence from historical simulations using New York City routing network and yellow cab data to show that our algorithms improve upon the performance of existing heuristics in such real-world settings.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1287/opre.2018.1763
