Complementarity models for traffic equilibrium with ridesharing

It is estimated that 76% of commuters are driving to work alone while each of them experiences a 38-h delay annually due to traffic congestion. Ridesharing is an efficient way to utilize the unused capacity and help with congestion reduction, and it has recently become more and more popular due to new communication technologies. Understanding the complex relations between ridesharing and traffic congestion is a critical step in the evaluation of a ridesharing enterprise or of the effectiveness of regulatory policies or incentives to promote ridesharing. The objective of this paper is to introduce a mathematical framework for the study of the ridesharing impacts on traffic congestion and to pave the way for the analysis of how people can be motivated to participate in ridesharing, and conversely, how congestion influences ridesharing activities. We accomplish this objective by developing a new traffic equilibrium model with ridesharing, and formulating the model as a mixed complementarity problem (MiCP). We provide conditions on the model parameters under which there exists one and only one solution to this model. The computational results show that when the congestion cost decreases or the ridesharing inconvenience cost increases, more travelers would become solo drivers and thus less people would participate in ridesharing. On the other hand, when the ridesharing price increases, more travelers would become ridesharing drivers.

[1]  T. Magnanti,et al.  Equilibria on a Congested Transportation Network , 1981 .

[2]  Mark W Burris,et al.  Slugging in Houston: Casual Carpool Passenger Characteristics , 2006 .

[3]  Andrew M Amey Real-time ridesharing : exploring the opportunities and challenges of designing a technology-based rideshare trial for the MIT community , 2010 .

[4]  D. Schrank,et al.  2001 Urban Mobility Report , 2001 .

[5]  Jorge Nocedal,et al.  Knitro: An Integrated Package for Nonlinear Optimization , 2006 .

[6]  Susan Shaheen,et al.  Ridesharing in North America: Past, Present, and Future , 2012 .

[7]  C. Morency The ambivalence of ridesharing , 2007 .

[8]  Shu Lu,et al.  Sensitivity of Static Traffic User Equilibria with Perturbations in Arc Cost Function and Travel Demand , 2008, Transp. Sci..

[9]  Michael C. Ferris,et al.  Interfaces to PATH 3.0: Design, Implementation and Usage , 1999, Comput. Optim. Appl..

[10]  R. Jayakrishnan,et al.  A FASTER PATH-BASED ALGORITHM FOR TRAFFIC ASSIGNMENT , 1994 .

[11]  Michael Patriksson,et al.  The Traffic Assignment Problem: Models and Methods , 2015 .

[12]  Donald J Dailey,et al.  Seattle smart traveler: dynamic ridematching on the World Wide Web , 1999 .

[13]  Jan Vlcek,et al.  Interior point methods for large-scale nonlinear programming , 2005, Optim. Methods Softw..

[14]  William Gropp,et al.  Optimization environments and the NEOS server , 1997 .

[15]  C Y David Yang Trends in transit bus accidents and promising collision countermeasures , 2007 .

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

[17]  J. Wardrop ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[18]  Hai Yang,et al.  Carpooling and congestion pricing in a multilane highway with high-occupancy-vehicle lanes , 1999 .

[19]  Masao Fukushima,et al.  The traffic equilibrium problem with nonadditive costs and its monotone mixed complementarity problem formulation , 2007 .

[20]  D. Schrank,et al.  2012 Urban Mobility Report , 2002 .

[21]  Kalon L Kelley Casual carpooling—enhanced , 2007 .

[22]  E. Ferguson The rise and fall of the American carpool: 1970–1990 , 1997 .

[23]  Bin Ran,et al.  for dynamic user equilibria with exact flow propagations , 2008 .

[24]  Fernando Ordóñez,et al.  Ridesharing: The state-of-the-art and future directions , 2013 .

[25]  Elizabeth D. Dolan,et al.  NEOS Server 4.0 Administrative Guide , 2001, ArXiv.

[26]  Jorge Nocedal,et al.  An Interior Point Algorithm for Large-Scale Nonlinear Programming , 1999, SIAM J. Optim..

[27]  Stella Dafermos,et al.  Traffic Equilibrium and Variational Inequalities , 1980 .

[28]  Frank Spielberg,et al.  Mating Habits of Slugs: Dynamic Carpool Formation in the I-95/I-395 Corridor of Northern Virginia , 2000 .

[29]  Allen Greenberg,et al.  ORGANIZED DYNAMIC RIDE SHARING: THE POTENTIAL ENVIRONMENTAL BENEFITS AND THE OPPORTUNITY FOR ADVANCING THE CONCEPT , 2001 .

[30]  M. Patriksson,et al.  Equilibrium characterizations of solutions to side constrained asymmetric traffic assignment models , 1995 .

[31]  Torbjörn Larsson,et al.  Side constrained traffic equilibrium models: analysis, computation and applications , 1999 .

[32]  Jorge J. Moré,et al.  The NEOS Server , 1998 .

[33]  Maged Dessouky,et al.  A traffic assignment model for a ridesharing transportation market , 2015 .

[34]  Ali Haghani,et al.  Real-Time Rideshare Matching Problem , 2010 .

[35]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[36]  Yu Nie,et al.  A Note on Bar-Gera's Algorithm for the Origin-Based Traffic Assignment Problem , 2012, Transp. Sci..

[37]  Zhen Sean Qian,et al.  Modeling Multi-Modal Morning Commute in a One-to-One Corridor Network , 2011 .

[38]  Susan Heinrich Implementing Real-time Ridesharing in the San Francisco Bay Area , 2010 .