Online Routing Optimization at a Very Large Scale

Slides:



Advertisements
Similar presentations
Airline Schedule Optimization (Fleet Assignment I)
Advertisements

Impact of Interference on Multi-hop Wireless Network Performance Kamal Jain, Jitu Padhye, Venkat Padmanabhan and Lili Qiu Microsoft Research Redmond.
Lindsey Bleimes Charlie Garrod Adam Meyerson
Reducibility Class of problems A can be reduced to the class of problems B Take any instance of problem A Show how you can construct an instance of problem.
1 The TSP : Approximation and Hardness of Approximation All exact science is dominated by the idea of approximation. -- Bertrand Russell ( )
ANDREW MAO, STACY WONG Regrets and Kidneys. Intro to Online Stochastic Optimization Data revealed over time Distribution of future events is known Under.
An Exact Algorithm for the Vehicle Routing Problem with Backhauls
Online Scheduling with Known Arrival Times Nicholas G Hall (Ohio State University) Marc E Posner (Ohio State University) Chris N Potts (University of Southampton)
Yu Stephanie Sun 1, Lei Xie 1, Qi Alfred Chen 2, Sanglu Lu 1, Daoxu Chen 1 1 State Key Laboratory for Novel Software Technology, Nanjing University, China.
Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.
Modeling Rich Vehicle Routing Problems TIEJ601 Postgraduate Seminar Tuukka Puranen October 19 th 2009.
Vehicle Routing & Scheduling: Part 1
Vehicle Routing & Scheduling Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
Theoretical Maximum Capacity as a Benchmark for Empty Vehicle Redistribution in Personal Rapid Transit John D. Lees-Miller 1,2 Dr. John C. Hammersley 2.
Computational problems, algorithms, runtime, hardness
The Min-Max Split Delivery Multi- Depot Vehicle Routing Problem with Minimum Delivery Amounts X. Wang, B. Golden, and E. Wasil INFORMS San Francisco November.
1 The Dynamic Vehicle Routing Problem with A-priori Information ROUTE2000 Thursday August 17th 2000 Allan Larsen The Department of Mathematical Modelling,
Vehicle Routing & Scheduling
Online Oblivious Routing Nikhil Bansal, Avrim Blum, Shuchi Chawla & Adam Meyerson Carnegie Mellon University 6/7/2003.
CISS Princeton, March Optimization via Communication Networks Matthew Andrews Alcatel-Lucent Bell Labs.
Decision Support Systems for Supply Chain Management Chap 10 王仁宏 助理教授 國立中正大學企業管理學系 ©Copyright 2001 製商整合科技中心.
Facility Location with Nonuniform Hard Capacities Tom Wexler Martin Pál Éva Tardos Cornell University ( A 9-Approximation)
1 Integrality constraints Integrality constraints are often crucial when modeling optimizayion problems as linear programs. We have seen that if our linear.
Vehicle Routing & Scheduling: Part 2 Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
Package Transportation Scheduling Albert Lee Robert Z. Lee.
Lecture: 5 Optimization Methods & Heuristic Strategies Ajmal Muhammad, Robert Forchheimer Information Coding Group ISY Department.
LOGO AAIA’2012 \ WCO’ – 12 september, 2012 S. Deleplanque, A. Quilliot. LIMOS, CNRS, BLAISE PASCAL UNIVERSITY, Clermont-Ferrand (FRANCE) Wrocław,
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Ann Melissa Campbell, Jan Fabian Ehmke 2013 Service Management and Science Forum Decision.
The Traveling Salesperson Problem Algorithms and Networks.
Online Oblivious Routing Nikhil Bansal, Avrim Blum, Shuchi Chawla & Adam Meyerson Carnegie Mellon University 6/7/2003.
Fair Allocation with Succinct Representation Azarakhsh Malekian (NWU) Joint Work with Saeed Alaei, Ravi Kumar, Erik Vee UMDYahoo! Research.
Scott Perryman Jordan Williams.  NP-completeness is a class of unsolved decision problems in Computer Science.  A decision problem is a YES or NO answer.
Combinatorial Optimization Chapter 1. Problems and Algorithms  1.1 Two Problems (representative problems)  The Traveling Salesman Problem 47 drilling.
Dynamic network evolution in ridesharing Abdulaziz Alhassan Shakiba Enayati Francis Niestemski Sabine Durand.
A dynamic optimization model for power and performance management of virtualized clusters Vinicius Petrucci, Orlando Loques Univ. Federal Fluminense Niteroi,
Heuristic is a technique designed to solve a problem that ignores whether the solution can be proven to be correct, but which usually produces a good solution.
NP-COMPLETE PROBLEMS. Admin  Two more assignments…  No office hours on tomorrow.
CPS Computational problems, algorithms, runtime, hardness (a ridiculously brief introduction to theoretical computer science) Vincent Conitzer.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.
Computational problems, algorithms, runtime, hardness
T-Share: A Large-Scale Dynamic Taxi Ridesharing Service
Distributed Vehicle Routing Approximation
Strategies to integrate third-party service providers
Local Container Truck Routing Problem with its Operational Flexibility Kyungsoo Jeong, Ph.D. Candidate University of California, Irvine Local container.
Disruption Or Decline, What’s Next For The Black Cab?
Insert your company logo here OVERVIEW
ISP and Egress Path Selection for Multihomed Networks
Strategies to integrate third-party service providers
1.3 Modeling with exponentially many constr.
1.206J/16.77J/ESD.215J Airline Schedule Planning
Integer Programming (정수계획법)
TransCAD Vehicle Routing 2018/11/29.
Using GIS to Create Demand Response Service Schedule Zones and Times
Heuristic Algorithms via VBA
Linear Programming Duality, Reductions, and Bipartite Matching
1.3 Modeling with exponentially many constr.
Planning the transportation of elderly to a daycare center
CPS 173 Computational problems, algorithms, runtime, hardness
Integer Programming (정수계획법)
Generating and Solving Very Large-Scale Vehicle Routing Problems
Chapter 6 Network Flow Models.
Efficiently Estimating Travel Time
Heuristic Algorithms via VBA
Heuristic Algorithms via VBA
Alan Kuhnle*, Victoria G. Crawford, and My T. Thai
Leveraging AI for Disaster Preparedness and Response
REVIEW FOR EXAM 1 Chapters 3, 4, 5 & 6.
A Neural Network for Car-Passenger matching in Ride Hailing Services.
Presentation transcript:

Online Routing Optimization at a Very Large Scale Patrick Jaillet EECS/LIDS/ORC Joint work with Dimitris Bertsimas, Sloan ORC, and Sébastien Martin, ORC Massachusetts Institute of Technology Online Taxi Routing, Bertsimas, Jaillet, Martin

The taxi routing problem Customer 1 Customer 2 Taxi 2 Online Taxi Routing, Bertsimas, Jaillet, Martin

The taxi routing problem Taxi Routing, Bertsimas, Jaillet, Martin

Online Taxi Routing, Bertsimas, Jaillet, Martin Motivation “Wisdom” has been that such taxi routing problems leave very little room for the use of optimization (e.g., Pillac et al., 2011): Online problem. Not enough control. Simple heuristics are good enough. Real world applications are untractable. But with the growing on-demand ride matching platforms: Smartphone-based, more information is available Centralized: more “control” on vehicle actions In high-demand situations, simple heuristics are not enough (“price surge”...), and with optimization solvers ever more powerful, we may revisit this …. Online Taxi Routing, Bertsimas, Jaillet, Martin

Online Taxi Routing, Bertsimas, Jaillet, Martin Setting Formally, we consider here a variant of the so-called dynamic pick-up and delivery problem with time-windows, as first described in (Savelsbergh, 95) Online setting: customers origin and destination information is made available when they request the ride. The customers have to be picked-up within a time-window. We control which taxi will pick-up which customer. We study how we can use optimization to leverage prior information, and improve the efficiency of the system (more customers served, more revenue…). Online Taxi Routing, Bertsimas, Jaillet, Martin

Online Taxi Routing, Bertsimas, Jaillet, Martin Roadmap A network-flow formulation Scaling to real-world problems Application: NYC Yellow Cabs Online Taxi Routing, Bertsimas, Jaillet, Martin

Re-optimization and offline problem Rolling-horizon with re-optimization strategies have worked well in practice when applied to online routing problems (Yang et al., 2004). Known future customers OFFLINE SOLUTION Current Time Time horizon Cite Patrick’s paper here, reformulate, take more for granted, start with online and go to offline Time OFFLINE SOLUTION update 30s Online Taxi Routing, Bertsimas, Jaillet, Martin

The offline taxi-routing problem Revenue Travel–time Customer c’ Customer c Pick-up time and time-window Feasibility Maximize Revenue Pick-up Decision Online Taxi Routing, Bertsimas, Jaillet, Martin 8

Network flow formulation No cycles (pick-up time-windows are typically smaller than the duration of a ride) Taxi 1 origin Taxi 2 origin Time Online Taxi Routing, Bertsimas, Jaillet, Martin

Network flow formulation We add flow constraints to obtain the optimal solution: Taxi 1 origin Taxi 2 origin Time Online Taxi Routing, Bertsimas, Jaillet, Martin

What makes the problem hard Large Time-windows Combinatorial Optimization Easy to solve: most taxis are free, closest taxi gets customer No time window = TSP, NP-complete High demand/supply Low demand/supply “Simple” Optimization No Optimization Fixed-Pickup time = network max-flow problem (Polynomial) Small Time-Windows Online Taxi Routing, Bertsimas, Jaillet, Martin

Optimization local heuristics (2-OPT…) Max-Flow Formulation (LP) What solver ? Large Time-windows Optimal solvers (MIP) Optimization local heuristics (2-OPT…) High demand/supply Low demand/supply Simple heuristics Max-Flow Formulation (LP) Small Time-Windows Online Taxi Routing, Bertsimas, Jaillet, Martin

New York City yellow cabs NYC Taxi & Limousine commission 2010-2016 : 1.4 billion rides. Pick-up and drop-off time/coordinates, fares, timings, # passengers… Instance of taxi – routing: 5000 cabs Demand on 04/15/16 12-1:30pm in Manhattan: 26,109 customers. LP (without time windows) MIP (with time windows) Online Taxi Routing, Bertsimas, Jaillet, Martin

Trimming the flow graph Trimming the graph using time and distance between customers Taxi 1 origin Taxi 2 origin Time LP (without time windows) MIP (with time windows) Online Taxi Routing, Bertsimas, Jaillet, Martin

Finding the backbone LP MIP We use the tractable LP solver with random pick-up times within the time window to provide “good solutions” and find the edges that are likely to be in optimal solutions (backbone). Taxi 1 origin Taxi 2 origin Time LP (without time windows) MIP (with time windows) Online Taxi Routing, Bertsimas, Jaillet, Martin

Online Taxi Routing, Bertsimas, Jaillet, Martin Manhattan experiment Talk about all simulations difficulties and what we built Online Taxi Routing, Bertsimas, Jaillet, Martin

Online Taxi Routing, Bertsimas, Jaillet, Martin Results Online Taxi Routing, Bertsimas, Jaillet, Martin

Technical challenges that needed to be solved Creating the road network from map data. Getting the real demand data and format it. Estimating travel-times from taxi data. Writing a fast large-scale online routing simulation tool. Using state-of-the-art MIP solvers to re- optimize the fleet actions. Making everything communicate and run in real-time. Online Taxi Routing, Bertsimas, Jaillet, Martin

Online Taxi Routing, Bertsimas, Jaillet, Martin The end …. Thank you! Online Taxi Routing, Bertsimas, Jaillet, Martin