Equilibrium network design of shared-vehicle systems

An equilibrium network design model is formulated to determine the optimal configuration of a vehicle sharing program (VSP). A VSP involves a fleet of vehicles (bicycles, cars, or electric vehicles) positioned strategically across a network. In a flexible VSP, users are permitted to check out vehicles to perform trips and return the vehicles to stations close to their destinations. VSP operators need to determine an optimal configuration in terms of station locations, vehicle inventories, and station capacities, that maximizes revenue. Since users are likely to use the VSP resources only if their travel utilities improve, a generalized equilibrium based approach is adopted to design the system. The model takes the form of a bi-level, mixed-integer program. Model properties of uniqueness, inefficiency of equilibrium, and transformations that lead to an exact solution approach are presented. Computational tests on several synthetic instances demonstrate the nature of the equilibrium configuration, the trade-offs between operator and user objectives, and insights for deploying such systems.

[1]  Giorgio Gallo,et al.  Directed Hypergraphs and Applications , 1993, Discret. Appl. Math..

[2]  Caroline J Rodier,et al.  Improving Bay Area Rapid Transit (BART) District Connectivity and Access with the Segway Human Transporter and Other Low Speed Mobility Devices , 2004 .

[3]  P. DeMaio Bike-sharing: History, Impacts, Models of Provision, and Future , 2009 .

[4]  Jia Hao Wu,et al.  Transit Equilibrium Assignment: A Model and Solution Algorithms , 1994, Transp. Sci..

[5]  I Constantin,et al.  Some Variants of the Optimal Strategy Transit Assignment Method , 2010 .

[6]  Qiang Meng,et al.  A decision support system for vehicle relocation operations in carsharing systems , 2009 .

[7]  Michael Florian,et al.  Optimal strategies: A new assignment model for transit networks , 1989 .

[8]  Giovanni Storchi,et al.  Shortest viable path algorithm in multimodal networks , 2001 .

[9]  Nuria Oliver,et al.  Sensing and predicting the pulse of the city through shared bicycling , 2009, IJCAI 2009.

[10]  Martine Labbé,et al.  Joint Design and Pricing on a Network , 2008, Oper. Res..

[11]  Elise Miller-Hooks,et al.  Fleet Management for Vehicle Sharing Operations , 2011, Transp. Sci..

[12]  Iris A. Forma,et al.  A 3-step math heuristic for the static repositioning problem in bike-sharing systems , 2015 .

[13]  Ta-Hui Yang,et al.  Strategic design of public bicycle sharing systems with service level constraints , 2011 .

[14]  Chaitanya Swamy,et al.  The effectiveness of Stackelberg strategies and tolls for network congestion games , 2007, SODA '07.

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

[16]  Enrique Fernández,et al.  Transit Assignment for Congested Public Transport Systems: An Equilibrium Model , 1993, Transp. Sci..

[17]  Jon E. Froehlich,et al.  Measuring the Pulse of the City through Shared Bicycle Programs , 2008 .

[18]  Anjali Awasthi,et al.  An Analytical Hierarchical Process-based decision-making approach for selecting car-sharing stations in medium size agglomerations , 2008, Int. J. Inf. Decis. Sci..

[19]  Thomas L. Magnanti,et al.  Working Paper Alfred P. Sloan School of Management "models for Planning Capacity Expansion in Local Access Telecommunication Networks" "models for Planning Capacity Expansion in Local Access Telecommunication Networks" Models for Planning Capacity Expansion in Local Access Telecommunication Networks , 2008 .

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

[21]  Susan Shaheen,et al.  U.S. Shared-Use Vehicle Survey Findings on Carsharing and Station Car Growth: Obstacles and Opportunities , 2003 .

[22]  Roberto Cominetti,et al.  A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria , 2006 .

[23]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[24]  Patrice Marcotte,et al.  An overview of bilevel optimization , 2007, Ann. Oper. Res..

[25]  Pierre Hansen,et al.  Links Between Linear Bilevel and Mixed 0–1 Programming Problems , 1995 .

[26]  Ruey Long Cheu,et al.  Relocation issues in multiple-station carsharing systems , 2004 .

[27]  Matthew Barth,et al.  Simulation model performance analysis of a multiple station shared vehicle system , 1999 .

[28]  P. McGregor,et al.  Network Design: An Algorithm for the Access Facility Location Problem , 1977, IEEE Trans. Commun..

[29]  M. Baucus Transportation Research Board , 1982 .

[30]  Stefano Pallottino,et al.  Equilibrium traffic assignment for large scale transit networks , 1988 .

[31]  Elise Miller-Hooks,et al.  Equilibrium design of bicycle sharing systems: the case of Washington D.C. , 2016, EURO J. Transp. Logist..

[32]  Amer Shalaby,et al.  MILATRAS: a new modeling framework for the transit assignment problem , 2009 .

[33]  Tomás Eiró,et al.  An Optimisation Algorithm to Establish the Location of Stations of a Mixed Fleet Biking System: An Application to the City of Lisbon , 2012 .

[34]  José R. Correa,et al.  Stackelberg Routing in Atomic Network Games , 2007 .

[35]  Athanasios K. Ziliaskopoulos,et al.  An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays , 2000, Eur. J. Oper. Res..

[36]  Eric J. Miller,et al.  Comparison of Agent-Based Transit Assignment Procedure with Conventional Approaches , 2010 .

[37]  Patrice Marcotte,et al.  A note on the Pareto optimality of solutions to the linear bilevel programming problem , 1991, Comput. Oper. Res..

[38]  Michel Parent,et al.  A Multicriteria Decision Making Approach for Carsharing Stations Selection , 2007, J. Decis. Syst..

[39]  Torbjörn Larsson,et al.  Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem , 1992, Transp. Sci..

[40]  José R. Correa,et al.  Common-Lines and Passenger Assignment in Congested Transit Networks , 2001, Transp. Sci..

[41]  Gregory R Krykewycz,et al.  Defining a Primary Market and Estimating Demand for Major Bicycle-Sharing Program in Philadelphia, Pennsylvania , 2010 .

[42]  Patrice Marcotte,et al.  A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks , 2004, Oper. Res..

[43]  Fumitaka Kurauchi,et al.  A quasi-dynamic capacity constrained frequency-based transit assignment model , 2008 .

[44]  António Pais Antunes,et al.  Optimization Approach to Depot Location and Trip Selection in One-Way Carsharing Systems , 2012 .

[45]  Caroline J Rodier,et al.  EasyConnect II: Integrating Transportation, Information, and Energy Technologies at Transit Oriented Developments , 2005 .

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

[47]  S. Raghavan,et al.  Long-Distance Access Network Design , 2004, Manag. Sci..

[48]  Ta-Hui Yang,et al.  A hub location inventory model for bicycle sharing system design: Formulation and solution , 2013, Comput. Ind. Eng..

[49]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[50]  Susan A. Shaheen,et al.  EasyConnect: low-speed modes linked to transit planning project: interim working paper , 2006 .

[51]  Richard Katzev,et al.  Car Sharing: A New Approach to Urban Transportation Problems , 2003 .

[52]  Elise Miller-Hooks,et al.  Large-Scale Vehicle Sharing Systems: Analysis of Vélib' , 2013 .

[53]  Rafael E. Banchs,et al.  Article in Press Pervasive and Mobile Computing ( ) – Pervasive and Mobile Computing Urban Cycles and Mobility Patterns: Exploring and Predicting Trends in a Bicycle-based Public Transport System , 2022 .