A Convex Programming Approach for Ridesharing User Equilibrium Under Fixed Driver/Rider Demand

With the proliferation of smartphone-based ridesharing apps around the world, traffic assignment with ridesharing is drawing increasing attentions in recent years. A number of ridesharing user equilibrium (RUE) models have been proposed, but most of them are formulated as mixed complementary problems based on presumed ridesharing price and inconvenience functions, thus are inconvenient to implement in reality. In this study, we propose an alternative approach to modeling the RUE when the driver- and rider-demand for each OD pair are fixed and given. By redefining the set of feasible driver trajectories, and introducing market clearing conditions to characterize drivers’ net income at market equilibrium, we show that the resulting RUE conditions can be equivalently transformed into a convex programming problem, and establish the existence and uniqueness of RUE link flows under mild conditions. A subgradient algorithm with averaging is proposed to solve the problem. The dual subproblem has a similar structure as Beckmann’s formulation, therefore enables the application of classical traffic assignment algorithms such as Frank-Wolfe. Numerical examples are provided to demonstrate the effectiveness of the model and algorithm.

[1]  Hai Yang,et al.  Ridesharing User Equilibrium and Its Implications for High-Occupancy Toll Lane Pricing , 2017 .

[2]  Chi Xie,et al.  New insights and improvements of using paired alternative segments for traffic assignment , 2016 .

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

[4]  Hillel Bar-Gera,et al.  Origin-Based Algorithm for the Traffic Assignment Problem , 2002, Transp. Sci..

[5]  Haijun Huang,et al.  Mathematical and Economic Theory of Road Pricing , 2005 .

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

[7]  Meng Li,et al.  A restricted path-based ridesharing user equilibrium , 2020, J. Intell. Transp. Syst..

[8]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[9]  Xiaolei Wang,et al.  Driver-Rider Cost-Sharing Strategies and Equilibria in a Ridesharing Program , 2018, Transp. Sci..

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

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

[12]  Hong Kam Lo,et al.  A Self-Adaptive Projection and Contraction Algorithm for the Traffic Equilibrium Problem with Path-Specific Costs , 1998 .

[13]  Chi Xie,et al.  Origin-Based Algorithms for Traffic Assignment , 2015 .

[14]  Yu Nie,et al.  Quadratic approximation and convergence of some bush-based algorithms for the traffic assignment problem , 2013 .

[15]  Michael Patriksson,et al.  Ergodic, primal convergence in dual subgradient schemes for convex programming , 1999, Mathematical programming.

[16]  Yu Nie,et al.  A class of bush-based algorithms for the traffic assignment problem , 2009 .

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

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

[19]  Min Xu,et al.  Ridesharing user equilibrium problem under OD-based surge pricing strategy , 2020 .

[20]  Maged Dessouky,et al.  Complementarity models for traffic equilibrium with ridesharing , 2015 .

[21]  Yuanyuan Li,et al.  Pricing scheme design of ridesharing program in morning commute problem , 2017 .

[22]  A. Banerjee.  Convex Analysis and Optimization , 2006 .

[23]  Yang Liu,et al.  A path-based equilibrium model for ridesharing matching , 2020 .

[24]  Robert B. Dial,et al.  A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration , 2006 .

[25]  Hai Yang,et al.  Managing network mobility with tradable credits , 2011 .

[26]  Michael Patriksson,et al.  Primal convergence from dual subgradient methods for convex optimization , 2014, Mathematical Programming.

[27]  T F Golob,et al.  THE EFFECTIVENESS OF RIDESHARING INCENTIVES: DISCRETE-CHOICE MODELS OF COMMUTING IN SOUTHERN CALIFORNIA. REVISED EDITION , 1991 .

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

[29]  Mary Lynn Tischer,et al.  An empirical analysis of behavioral intentions of single-occupant auto drivers to shift to high occupancy vehicles , 1979 .