The matching problem of empty vehicle redistribution in autonomous taxi systems

Abstract This article discusses empty vehicle redistribution algorithms for PRT and autonomous taxi services from a passenger service perspective. In modern literature reactive methods such as nearest neighbours are commonly used. In this article we first formulate the general matching problem on a bipartite graph of available vehicles and stations. In addition, we propose a new index-based proactive redistribution (IBR) algorithm based on predicted near-future demand at stations. Test results of six variations of combined proactive and reactive strategies on a test case in Saclay, France with 20 stations and 100 vehicles are given. The combined Nearest Neighbour / IBR provides a promising solution for both peak and off-peak demand, significantly outperforming all other methods considered, in terms of passenger waiting time (both average and maximum) as well as in terms of station queue lengths.

[1]  Kara M. Kockelman,et al.  Dynamic ride-sharing and fleet sizing for a system of shared autonomous vehicles in Austin, Texas , 2018 .

[2]  Ingmar Andréasson.  Ride-Sharing on PRT , 2005 .

[3]  Ezzeddine Fatnassi,et al.  Dealing with the Empty Vehicle Movements in Personal Rapid Transit System with Batteries Constraints in a Dynamic Context , 2017 .

[4]  Ingmar Andreasson.  Reallocation of Empty Personal Rapid Transit Vehicles en Route , 2003 .

[5]  Warren B. Powell,et al.  A network recourse decomposition method for dynamic networks with random arc capacities , 1994, Networks.

[6]  Wilco Burghout,et al.  Empty vehicle redistribution and fleet size in autonomous taxi systems , 2019 .

[7]  I Andreasson.  Quasi-Optimum Redistribution of Empty PRT Vehicles , 1997 .

[8]  Matthieu van der Heijden,et al.  Scheduling vehicles in automated transportation systems Algorithms and case study , 2002, OR Spectr..

[9]  Wilco Burghout,et al.  The matching problem of empty vehicle redistribution in autonomous taxi systems , 2019 .

[10]  Kara M. Kockelman,et al.  The Travel and Environmental Implications of Shared Autonomous Vehicles, Using Agent-Based Model Scenarios , 2014 .

[11]  Ingmar Andreasson.  Operational Strategies from Personal to Mass Transit , 2016 .

[12]  J. Edward Anderson,et al.  Control of personal rapid transit systems , 1998 .

[13]  K. I. Wong,et al.  A Rolling Horizon Approach to the Optimal Dispatching of Taxis , 2005 .

[14]  Ruey Long Cheu,et al.  Relocation Simulation Model for Multiple-Station Shared-Use Vehicle Systems: , 2006 .

[15]  Peter Stone,et al.  Minimum Cost Matching for Autonomous Carsharing , 2016 .

[16]  John D. Lees-Miller,et al.  Theoretical Maximum Capacity as Benchmark for Empty Vehicle Redistribution in Personal Rapid Transit , 2010 .

[17]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[18]  Daniel J. Fagnant,et al.  An Assessment of Autonomous Vehicles: Traffic Impacts and Infrastructure Needs—Final Report , 2017 .

[19]  Warren B. Powell,et al.  Stochastic Programming in Transportation and Logistics , 2003 .

[20]  Waldemar Grabski,et al.  Empty vehicles management as a method for reducing passenger waiting time in Personal Rapid Transit networks , 2015 .

[21]  Jun-Ho Lee,et al.  Control of Personal Rapid Transit System and Configuration of an Apparatus to Evaluate its Control Scheme , 2007, 2007 IEEE Vehicle Power and Propulsion Conference.

[22]  Mark A. Turnquist,et al.  A Model for Fleet Sizing and Vehicle Allocation , 1991, Transp. Sci..

[23]  Jouhaina Chaouachi Siala,et al.  Two strategies for real time empty vehicle redistribution for the Personal Rapid Transit system , 2013, 16th International IEEE Conference on Intelligent Transportation Systems (ITSC 2013).

[24]  John D. Lees-Miller.  Minimising average passenger waiting time in personal rapid transit systems , 2016, Ann. Oper. Res..

[25]  John D. Lees-Miller,et al.  Proactive empty vehicle redistribution for personal rapid transit and taxis , 2012 .