Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications

Published Online:https://doi.org/10.1287/opre.2018.1763

References

  • Baldacci R, Mingozzi A, Roberti R (2012) Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218(1):1–6.CrossrefGoogle Scholar
  • Bent R, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. 52(6):977–987.LinkGoogle Scholar
  • Bent R, Van Hentenryck P (2007) Waiting and relocation strategies in online stochastic vehicle routing. Sangal R, Mehta H, Bagga RK, eds. Proc. 20th International Joint Conf. Artificial Intelligence 2007 (Morgan Kaufmann Publishers, San Francisco), 1816–1821.Google Scholar
  • Berbeglia G, Cordeau JF, Laporte G (2010) Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1):8–15.CrossrefGoogle Scholar
  • Berbeglia G, Cordeau JF, Laporte G (2012) A hybrid Tabu Search and constraint programming algorithm for the dynamic dial-a-ride problem. J. Comput. 24(3):343–355.AbstractGoogle Scholar
  • Bertsimas D, Delarue A, Jaillet P, Martin S (2019) Traffic estimation in the age of big data. Oper. Res. Forthcoming.Google Scholar
  • Bezanson J, Edelman A, Karpinski S, Shah VB (2014) Julia: A fresh approach to numerical computing. SIAM Review 59(1):65–98.CrossrefGoogle Scholar
  • Bräysy O, Gendreau M (2005) Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transportation Sci. 39(1):104–118.LinkGoogle Scholar
  • Chen ZL, Xu H (2006) Dynamic column generation for dynamic vehicle routing with time windows. Transportation Sci. 40(1):74–88.LinkGoogle Scholar
  • Croes GA (1958) A method for solving traveling-salesman problems. Oper. Res. 6(6):791–812.LinkGoogle Scholar
  • Desaulniers G, Errico F, Irnich S, Schneider M (2016) Exact algorithms for electric vehicle-routing problems with time windows. Oper. Res. 64(6):1388–1405.LinkGoogle Scholar
  • Gendreau M, Hertz A, Laporte G (1994) A Tabu Search heuristic for the vehicle routing problem. Management Sci. 40(10):1276–1290.LinkGoogle Scholar
  • Gutiérrez-Jarpa G, Desaulniers G, Laporte G, Marianov V (2010) A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows. Eur. J. Oper. Res. 206(2):341–349.CrossrefGoogle Scholar
  • Haklay M, Weber P (2008) OpenStreetMap: User-generated street maps. IEEE Pervasive Comput. 7(4):12–18.CrossrefGoogle Scholar
  • Hashimoto H, Ibaraki T, Imahori S, Yagiura M (2006) The vehicle routing problem with flexible time windows and traveling times. Discrete Appl. Math. 154(16):2271–2290.CrossrefGoogle Scholar
  • Horn M (2002) Fleet scheduling and dispatching for demand-responsive passenger services. Transportation Res. Part C: Emerging Tech. 10(1):35–63.CrossrefGoogle Scholar
  • Jaillet P, Wagner M (2008) Generalized online routing: New competitive ratios, resource augmentation, and asymptotic analyses. Oper. Res. 56(3):745–757.LinkGoogle Scholar
  • Lubin M, Dunning I (2015) Computing in operations research using Julia. INFORMS J. Comput. 27(2):238–248.LinkGoogle Scholar
  • Ma S, Zheng Y, Wolfson O (2015) Real-time city-scale taxi ridesharing. IEEE Trans. Knowledge Data Engrg. 27(7):1782–1795.CrossrefGoogle Scholar
  • Martin S (2017) TaxiSimulation Julia package. Accessed January 23, 2018, https://github.com/sebmart/TaxiSimulation.Google Scholar
  • Miao F, Han S, Lin S, Stankovic JA, Zhang D, Munir S, Huang H, He T, Pappas G (2016) Taxi dispatch with real-time sensing data in metropolitan areas: A receding horizon control approach. IEEE Trans. Automation Sci. Engrg. 13(2):463–478.CrossrefGoogle Scholar
  • Mitrović-Minić S, Krishnamurti R, Laporte G (2004) Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B: Methodological 38(8):669–685.CrossrefGoogle Scholar
  • New York City (2017) New York City Taxi & Limousine Commission - trip record data. Accessed February 12, 2017, http://www.nyc.gov/html/tlc/html/about/trip_record_data.shtml.Google Scholar
  • OpenStreetMap (2017) OpenStreetMap project database. Accessed May 30, 2018, http://planet.openstreetmap.org.Google Scholar
  • Ota M, Vo H, Silva C, Freire J (2015) A scalable approach for data-driven taxi ride-sharing simulation. Proc. 2015 IEEE Internat. Conf. Big Data 2015 (IEEE Computer Society, Washington, DC), 888–897.CrossrefGoogle Scholar
  • Ota M, Vo H, Silva C, Freire J (2016) STaRS: Simulating taxi ride sharing at scale. IEEE Trans. Big Data 3(3):349–361.CrossrefGoogle Scholar
  • Pillac V, Gendreau M, Guéret C, Medaglia A (2013) A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1):1–11.CrossrefGoogle Scholar
  • Potvin JY, Rousseau JM (1995) An exchange heuristic for routing problems with time windows. J. Oper. Res. Soc. 46(12):1433–1446.CrossrefGoogle Scholar
  • Rossi F, Zhang R, Hindy Y, Pavone M (2018) Routing autonomous vehicles in congested transportation networks: Structural properties and coordination algorithms. Autonomous Robots 42(7):1427–1442.CrossrefGoogle Scholar
  • Santi P, Resta G, Szell M, Sobolevsky S, Strogatz S, Ratti C (2014) Quantifying the benefits of vehicle pooling with shareability networks. Proc. Natl. Acad. Sci. USA 111(37):13290–13294.CrossrefGoogle Scholar
  • Schneider J, Froschhammer C, Morgenstern I, Husslein T, Singer JM (1996) Searching for backbones–An efficient parallel algorithm for the traveling salesman problem. Comput. Phys. Comm. 96(2–3):173–188.CrossrefGoogle Scholar
  • Wong K, Bell M (2005) The optimal dispatching of taxis under congestion: A rolling horizon approach. Adv. Transportation 40(2):203–220.CrossrefGoogle Scholar
  • Xiang Z, Chu C, Chen H (2006) A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. Eur. J. Oper. Res. 174(2):1117–1139.CrossrefGoogle Scholar
  • Yang C (2015) Data-driven modeling of taxi trip demand and supply in New York City. PhD thesis, Rutgers University, NB, Canada.Google Scholar
  • Yang J, Jaillet P, Mahmassani H (2004) Real-time multivehicle truckload pickup and delivery problems. Transportation Sci. 38(2):135–148.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.