Stochastic ridesharing user equilibrium in transport networks
From MaRDI portal
Publication:2005886
DOI10.1007/s11067-019-9442-5OpenAlexW2913364224WikidataQ128430826 ScholiaQ128430826MaRDI QIDQ2005886
Hao-Xiang Liu, Rui Jiang, Chen-Yang Yan, Mao-Bin Hu, Jiancheng Long, Jin-Yong Chen
Publication date: 8 October 2020
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-019-9442-5
Operations research, mathematical programming (90-XX) Game theory, economics, finance, and other social and behavioral sciences (91-XX)
Related Items (2)
A dynamic tree algorithm for peer-to-peer ridesharing matching ⋮ A combinatorial auction‐based approach for ridesharing in a student transportation system
Cites Work
- Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS
- Maximizing network throughput under stochastic user equilibrium with elastic demand
- Method of successive weighted averages (MSWA) and self-regulated averaging schemes for solving stochastic user equilibrium problem
- User equilibrium with recourse
- A turning restriction design problem in urban road networks
- On the uniqueness of user equilibrium flow with speed limit
- On the equivalence between SUE and fixed-point states of day-to-day assignment processes with serially-correlated route choice
- A review of urban transportation network design problems
- Incorporating ridesharing in the static traffic assignment model
- A bi-objective turning restriction design problem in urban road networks
- Continuity of Optimal Solution Functions and their Conditions on Objective Functions
- Equilibria on a Congested Transportation Network
This page was built for publication: Stochastic ridesharing user equilibrium in transport networks
