Markov-based redistribution policy model for future urban mobility networks

In this paper we present a Markov-based urban transportation model that captures the operation of a fleet of taxis in response to incident customer arrivals throughout the city. We consider three different evaluation criteria: (1) minimizing the number of transportation resources for urban planning; (2) minimizing fuel consumption for the drivers; and (3) minimizing customer waiting time increase the overall quality of service. We present a practical policy and evaluate it by comparing against the actual observed redistribution of taxi drivers in Singapore. We show through simulation that our proposed policy is stable and improves substantially upon the default unmanaged redistribution of taxi drivers in Singapore with respect to the three evaluation criteria.

[1]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[2]  Emilio Frazzoli,et al.  Robotic load balancing for mobility-on-demand systems , 2012, Int. J. Robotics Res..

[3]  George L. Nemhauser,et al.  Optimality Conditions for a Dynamic Traffic Assignment Model , 1978 .

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

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

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

[7]  Athanasios K. Ziliaskopoulos,et al.  Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future , 2001 .

[8]  Jonathan Reades,et al.  Reinventing the automobile: personal urban mobility for the 21st century , 2013 .

[9]  Athanasios K. Ziliaskopoulos,et al.  A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem , 2000, Transp. Sci..

[10]  Haris N. Koutsopoulos,et al.  Offline Calibration of Dynamic Traffic Assignment , 2007 .

[11]  Hari Balakrishnan,et al.  Stochastic Motion Planning and Applications to Traffic , 2008, WAFR.

[12]  Terry L. Friesz,et al.  A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem , 1993, Oper. Res..

[13]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[14]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[15]  Terry L. Friesz,et al.  Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem , 1989, Oper. Res..

[16]  Emilio Frazzoli,et al.  Load Balancing for Mobility-on-Demand Systems , 2011, Robotics: Science and Systems.