Fundamental performance limits and efficient polices for Transportation-On-Demand systems

Transportation-On-Demand (TOD) systems, where users generate requests for transportation from a pick-up point to a delivery point, are already very popular and are expected to increase in usage dramatically as the inconvenience of privately-owned cars in metropolitan areas becomes excessive. Routing service vehicles through customers is usually accomplished with heuristic algorithms. In this paper we study TOD systems in a formal setting that allows us to characterize fundamental performance limits and devise dynamic routing policies with provable performance guarantees. Specifically, we study TOD systems in the form of a unit-capacity, multiple-vehicle dynamic pick-up and delivery problem, whereby pick-up requests arrive according to a Poisson process and are randomly located according to a general probability density. Corresponding delivery locations are also randomly distributed according to a general probability density, and a number of unit-capacity vehicles must transport demands from their pick-up locations to their delivery locations. We derive insightful fundamental bounds on the steady-state waiting times for the demands, and we devise constant-factor optimal dynamic routing policies. Simulation results are presented and discussed.

[1]  Micha Sharir,et al.  Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications , 1995, SCG '95.

[2]  J. Michael Steele,et al.  Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space , 1990, Math. Oper. Res..

[3]  Robert G. Gallager,et al.  Discrete Stochastic Processes , 1995 .

[4]  Richard C. Larson,et al.  Urban Operations Research , 1981 .

[5]  J. Munkres ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[6]  Haiping Xu Optimal policies for stochastic and dynamic vehicle routing problems , 1994 .

[7]  Sanjiv Singh,et al.  The DARPA Urban Challenge: Autonomous Vehicles in City Traffic, George Air Force Base, Victorville, California, USA , 2009, The DARPA Urban Challenge.

[8]  P. Midgley The role of smart bike-sharing systems in urban mobility , 2009 .

[9]  J. Papastavrou A stochastic and dynamic routing policy using branching processes with state dependent immigration , 1996 .

[10]  Emilio Frazzoli,et al.  Traveling Salesperson Problems for the Dubins Vehicle , 2008, IEEE Transactions on Automatic Control.

[11]  Jason D. Papastavrou,et al.  A stochastic and dynamic model for the single-vehicle pick-up and delivery problem , 1999, Eur. J. Oper. Res..

[12]  Emilio Frazzoli,et al.  Distributed and Adaptive Algorithms for Vehicle Routing in a Stochastic and Dynamic Environment , 2009, ArXiv.

[13]  Emilio Frazzoli,et al.  Coverage control for nonholonomic agents , 2008, 2008 47th IEEE Conference on Decision and Control.

[14]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[15]  Ronald W. Wolff,et al.  Poisson Arrivals See Time Averages , 1982, Oper. Res..

[16]  Martin,et al.  Finite size and dimensional dependence in the Euclidean traveling salesman problem. , 1996, Physical review letters.

[17]  O. Martin,et al.  Comparing mean field and Euclidean matching problems , 1998, cond-mat/9803195.

[18]  Emilio Frazzoli,et al.  Adaptive and Distributed Algorithms for Vehicle Routing in a Stochastic and Dynamic Environment , 2009, IEEE Transactions on Automatic Control.

[19]  Sanjiv Singh,et al.  The 2005 DARPA Grand Challenge: The Great Robot Race , 2007 .

[20]  G. Laporte,et al.  Transportation Demand , 2019, Energy: Supply and Demand.

[21]  Pankaj K. Agarwal,et al.  A near-linear constant-factor approximation for euclidean bipartite matching? , 2004, SCG '04.

[22]  Sanjiv Singh,et al.  The 2005 DARPA Grand Challenge , 2007 .

[23]  J. Yukich,et al.  Asymptotics for transportation cost in high dimensions , 1995 .

[24]  Gilbert Laporte,et al.  Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..

[25]  D. Bertsimas,et al.  Stochastic and dynamic vehicle routing with general demand and interarrival time distributions , 1993, Advances in Applied Probability.

[26]  Gilbert Laporte,et al.  Chapter 7 Transportation on Demand , 2007, Transportation.

[27]  C. Flavin,et al.  Reinventing the automobile , 1995 .

[28]  Munther A. Dahleh,et al.  A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints , 2008, IEEE Transactions on Automatic Control.

[29]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .