REVIEW 3 major objections 7 minor 50 references
Integrating optimal ridesharing matching into multimodal traffic model: Implications for policy and sustainable transport system
T0 review · 3 major / 7 minor · reviewed 2026-08-12 · deepseek-v4-flash
Pith's one-line read The paper's integrated model of optimal ridesharing matching within day-to-day multimodal traffic assignment shows that vehicle restrictions and pricing policies have uneven, sometimes non-monotonic effects on mode split, cost, and…
desk verdict A genuinely new integration of ridesharing matching into a DTD multimodal model, with honest numerical convergence but a few loose ends in the equilibrium interpretation and emissions accounting. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing mechanism is the coupling of the ridesharing matching optimization with the day-to-day updating loop. The matching step is a two-stage process: direct matching for identical origin-destination pairs, followed by a binary integer program (BIPM) that selects driver-passenger pairs to maximize total in-vehicle time savings S_kp, with each driver at most one passenger and vice versa; matched rides use the shortest path between origin and destination that day. Cancellations occur when the empty pick-up distance exceeds a threshold, sending unmatched drivers and car-owning passengers back to solo driving and non-owner passengers to bus or metro. The matched and adjusted flows enter the BPR congestion function, producing experienced costs; a weighted-average learning operator with memory N and weight λ forms perceived mode and path costs, and logit models convert these into next-day mode and route shares. The steady state is the fixed point C* = C(h_p*), h_p* = Λ(C*), where perceived cost equals experienced cost and path flows are constant. This integration is what allows the model to represent interactions between matching outcomes, congestion, mode substitution, and emissions.
What would settle it
Run the day-to-day dynamics on the same Sioux Falls network from many random initial flow vectors with fixed parameters (N=30, θ1=θ2=0.004); if the path flows do not converge to the same fixed point (gap metrics below $10^{-4}$ within, say, 500 days), the uniqueness and stability needed to attribute the sensitivity results to the policies is falsified.
Extended reading notes
Core claim
The paper's central claim is that a path-based deterministic day-to-day traffic assignment model can be extended to include a centralized optimal ridesharing matching step, with cancellation and mode adjustment, and still reach a fixed-point steady state in which perceived and experienced costs coincide and path flows are constant. The model covers five travel modes (solo driving, ridesharing as driver, ridesharing as passenger, bus, and metro) and two traveler groups (vehicle owners and non-owners). On each day, ridesharing requests are matched first directly when origins and destinations coincide, then by a binary integer program that maximizes total in-vehicle time savings subject to one-to-one matching constraints; matched pairs whose empty pick-up distance exceeds a threshold cancel and switch modes. The resulting flows feed a BPR link cost function, and perceived costs are updated by a weighted-average learning operator, with next-day mode and route choices given by logit models. The numerical experiments on the Sioux Falls network with 24 nodes and 76 links show convergence to a stable state under different memory lengths (N=3,6,30) and logit sensitivities (θ=0.001,0.004,0.01). Sensitivity analyses then show that ownership bans lower road load and emissions but raise trip time and, at moderate restriction levels, monetary cost; bus-fare increases shift travelers toward metro, ridesharing, and solo driving; and ridesharing-fare increases produce non-monotonic shifts in modal split and PCU that differ between owners and non-owners and between mass-transit and all OD pairs.
Load-bearing premise
The load-bearing premise is that the day-to-day process converges to a fixed-point steady state; the matching optimization can jump discontinuously with costs, and convergence is only demonstrated numerically for a few parameter settings on the Sioux Falls network, with the authors conceding it may fail on larger networks or with highly cost-sensitive travelers.
Editorial extensions
If this is right
- Vehicle ownership restrictions on mass-transit OD pairs reduce total road load and network emissions, but increase average travel time and, at 30–50% restriction levels, raise average monetary cost before it falls at 70%.
- Changing the bus fare has the smallest effect on emissions and travel time among the tested policies, while strongly affecting the bus-versus-metro split.
- Ridesharing fare increases first attract non-owners to ridesharing and then, above 10 yuan/km, push them back to public transit, producing inflection points in PCU and modal split that differ between mass-transit and all OD pairs.
- Because the same policy affects owners and non-owners, and mass-transit and non-mass-transit OD pairs, differently, policy evaluation that only looks at aggregate mode split can miss distributional or equity consequences.
Reading between the lines
- The paper leaves implicit that the cancellation threshold d_cancel is a policy lever: lowering it would reduce successful matches and push more car owners back to solo driving, which the model would predict to raise PCU and emissions; this is a testable extension of the sensitivity analysis.
- Because the matching step is a discrete optimization embedded in a continuous day-to-day process, the fixed-point condition (2.29) may admit multiple equilibria; the paper's convergence results do not rule this out, so policy comparisons should be re-examined for uniqueness.
- The link-level emission map the paper reports could be combined with population exposure data to quantify health impacts rather than just total emissions, turning the stated equity concern into a measurable quantity.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes a path-based deterministic day-to-day (DTD) multimodal traffic assignment model that embeds a centralized ridesharing matching optimization (direct matching followed by a binary integer program, BIPM) with match cancellation and mode-adjustment rules. The model includes five travel modes (solo driving, ridesharing driver, ridesharing passenger, bus, metro) and two traveler groups (vehicle owners and non-owners). A weighted-average learning rule updates perceived costs, and a logit model governs mode and route choices. The steady state is characterized by the fixed-point condition C* = C(h_p*), h_p* = Λ(C*), and is investigated numerically on the Sioux-Falls network. Sensitivity analyses vary car-ownership bans, bus fares, and ridesharing fares, reporting effects on mode split, PCU, travel costs, and emissions, and drawing policy implications about trade-offs and social equity.
Significance. If the modeling framework is accepted, it provides a useful integration of an explicit ridesharing matching mechanism into a multimodal DTD assignment model, going beyond earlier studies that treated matching as a probability or capacity constraint. The paper is commendable for including cancellations and mode adjustment after failed matches, and for examining policy impacts separately for all OD pairs and mass-transit OD pairs, as well as by ownership group. It also reports numerical convergence over several parameter combinations and states its limitations candidly. However, the central policy conclusions all rely on comparing stable states of the DTD process, and the analysis is carried out on a single synthetic network with many hand-set parameters and no empirical validation. The main gaps are theoretical: the fixed point is assumed rather than proven under a discrete matching map, and the final mode shares are not consistent with the logit choice probabilities because unmatched travelers are reassigned after mode choice. These issues must be addressed before the policy implications can be regarded as robust.
major comments (3)
- [§2.3.3, Eq. (2.29) and §3.2] The steady state is defined by the fixed-point condition C* = C(h_p*), h_p* = Λ(C*), but no existence, uniqueness, or stability proof is given for this DTD process. The loading map Λ embeds the BIPM ridesharing matching of Section 2.2.1.1, an integer program whose optimal solution can change discontinuously with travel times and costs. Section 3.2 only reports numerical convergence toward gaps below 10^-4 for six parameter settings, and the authors explicitly concede that convergence may fail on large networks or with highly sensitive travelers (small N, large θ). Because Sections 4 and 5 compare stable states under different policies, all policy conclusions are conditional on an unverified attractor. At minimum, the paper should prove existence (e.g., by showing the composite map C → Λ(C) → C is continuous or has a fixed point under the particular finite choice sets used) or restrict the policy claims to a stated convergence region and provide additional robustness checks over a wider parameter grid.
- [§2.2.1.2 and §2.3.2, Eqs. (2.25)–(2.28)] The logit mode-choice model in Eq. (2.25) is based on the perceived costs of the five modes, including ridesharing modes, as if all announced ridesharing trips are successful. However, after the BIPM matching solution and the cancellation threshold are applied, unmatched drivers and car-owning passengers are reassigned to solo driving and unmatched non-owners to bus or metro (Section 2.2.1.2). These fallback flows are added to the mode shares and path flows, so the final mode split is not the one predicted by the logit model. The steady state therefore cannot be interpreted as a stochastic user equilibrium over the five modes. This inconsistency should be addressed explicitly, for example by modeling the choice as a two-stage process (announcement followed by fallback) or by iterating between the matching and the mode-choice adjustment until the flows used in costs are the flows that generate those costs.
- [Table 2, note c] The matching cost rate β is set to 0 in the numerical study, and the authors state that this 'does not affect the analysis results.' This assertion is not supported by any sensitivity test. In Eq. (2.11), β scales the driver's net revenue from the passenger fare, so it directly changes the generalized cost of ridesharing driving and hence the supply of drivers and the matching outcomes. Since the paper later draws policy conclusions about ridesharing fare changes, the setting β=0 is not innocuous without demonstration. The claim should be removed or replaced by a brief sensitivity analysis over β.
minor comments (7)
- [Section 2.3.2] The phrase 'stranding for the mode choice' should read 'standing for the mode choice' or 'denoting the mode choice.'
- [Section 3.1] The solver name is misspelled: 'Gorubi' should be 'Gurobi.'
- [Section 2.3.3, Eq. (2.29)] There is a duplicated Chinese comma in the sentence defining the fixed point; the notation could be cleaned up for readability.
- [Section 4] Several minor typographical errors appear: 'moda split' should be 'modal split,' and 'mass transit ODs' appears inconsistently as 'mass-transit ODs.'
- [Section 4.1] The phrase 'with the highest SPRL is 1541424.8g' should read 'the highest SPRL is...' for grammatical consistency.
- [Section 2.4] In Eq. (2.30), the emission factors for modes 1, 2, and 4 are used, but the text does not explain whether bus emissions are assumed to be zero because buses are electrified; this should be stated explicitly near the emission model.
- [Section 6] The limitations paragraph is helpful, but it could also mention that the mode-choice inconsistency identified in Major Comment 2 is a modeling limitation worth acknowledging in future work.
Circularity Check
No circular derivation: model outputs are simulated from explicit behavioral and cost assumptions; the only author-overlapping citation is a standard DTD learning operator and is not load-bearing.
full rationale
The paper's derivation chain is self-contained rather than circular. Exogenous inputs (OD demand, BPR parameters, fares, emission factors) enter the generalized cost equations (2.6)-(2.19); the logit rules (2.25)-(2.28) convert those costs into mode and route flows; the ridesharing matching problem (2.1)-(2.5) is a separate optimization loaded onto the network; and the day-to-day learning rule (2.21)-(2.22) updates perceived costs from experienced costs. No quantity that is later called a prediction is fitted to the model's own outputs. The fixed-point condition (2.29) is a consistency requirement, not a constructed equivalence: the paper checks it numerically via gap1 and gap2 and explicitly concedes in Section 3.2 that convergence may fail on large networks or with highly sensitive travelers. This is an acknowledged limitation of the numerical method, not a circular argument. The one author-overlapping citation, Yu et al. (2020) (which includes current authors K. Han and Y. Yu), supplies the standard weighted-average learning operator and Frank-Wolfe route generation; it is also supported by Cascetta (1989) and other external references, and it does not carry the central policy conclusions. The sensitivity analyses in Section 4 are counterfactual simulations under changed ownership and fare inputs; they are not derived from the model's own fitted values. Accordingly, no step reduces by definition to its own inputs, and the paper exhibits no significant circularity.
Assumptions & free parameters
free parameters (12)
- Value of time eta_VOT =
0.3 yuan/min
- BPR coefficients alpha1, alpha2 =
0.15, 4
- Fuel cost c_fuel =
0.5 yuan/km
- Fixed car cost c_fixed =
1 yuan
- Ridesharing fare c_r-fare =
2 yuan/km (base)
- Bus and metro fares =
5 yuan each
- Transit frequencies rho_lb, rho_lm =
20 veh/h
- Car-bus conversion factors gamma, sigma =
4.5, 1.5
- Logit coefficients theta1, theta2 =
0.004 each
- Memory N and decay lambda =
30 days, 0.7
- Cancellation threshold =
10 km
- Matching cost rate beta =
0
assumptions (9)
- standard math Travelers choose modes and routes via logit on perceived costs from a weighted average of past days' experienced costs (Eqs. 2.21-2.26)
- standard math BPR link cost function captures congestion for mixed car and bus flow (Eq. 2.6)
- domain assumption Fixed-point condition (2.29) has a solution and the DTD process converges to it
- domain assumption Travelers are partitioned into car owners and non-owners with restricted mode availability (Table 1)
- ad hoc to paper Unmatched ridesharing drivers and car-owning passengers switch to solo driving, while non-owner unmatched passengers choose between bus and metro by cost (Section 2.2.1.2)
- ad hoc to paper Drivers cancel BIPM matches when empty mileage exceeds a 10 km threshold (Section 2.2.1.2)
- ad hoc to paper Matching cost rate beta is zero in numerical study (Table 2)
- domain assumption Buses and metro are fully electrified with zero on-road emissions (Section 3.1)
- domain assumption Ridesharing matching is centralized, one-to-one, and uses pre-announced trips with shortest-path routing (Section 2.2.1)
Cite this review
Pith. "Pith review of Integrating optimal ridesharing matching into multimodal traffic model: Implications for policy and sustainable transport system." pith.science (2026). https://pith.science/paper/GO2YGSIQ
@misc{pith2026241115427,
author = {Pith},
title = {Pith review of: Integrating optimal ridesharing matching into multimodal traffic model: Implications for policy and sustainable transport system},
year = {2026},
howpublished = {\url{https://pith.science/paper/GO2YGSIQ}},
note = {Machine review of arXiv:2411.15427}
}
read the original abstract
Integrating ridesharing matching explicitly into multimodal traffic models is crucial for accurately assessing the impacts of multimodal transport (MT) on urban economic and environmental aspects. This paper integrates an optimal ridesharing matching method into a path-based deterministic day-to-day traffic assignment framework, considers match cancellations, and captures the interactions between various modes on the road. The model incorporates five traffic modes (solo driving, ridesharing as a driver, ridesharing as a passenger, bus travel, and metro travel) and two groups of travelers based on their ownership status. Its steady state is determined through numerical experiments. The sensitivity analyses reveal that the MT system's performance varies with changes in ownership, bus fare, and ridesharing fare, demonstrating diverse impacts on mode split, travel cost, and emissions across different groups, road links, and regions. Our findings suggest that vehicle restrictions and pricing strategies have both benefits and drawbacks in managing MT system, emphasizing the need for careful consideration of trade-offs and social equity implications in policy-making and implementation. This study not only enhances the theoretical understanding of MT system but also provides valuable support for urban transportation policy-making aimed at achieving efficient, sustainable, and socially equitable transport systems.
Reference graph
Works this paper leans on
-
[7]
Transportation Research Part C: Emerging Technologies, 124, 102890
On the inefficiency of ride-sourcing services towards urban 20 congestion. Transportation Research Part C: Emerging Technologies, 124, 102890. doi:10.1016/j.trc.2020.102890 BROWN, A. E
-
[9]
Transportation Research Part C: Emerging Technologies, 134, 103429
Multi-vehicle assignment with elastic vehicle choice behaviour: Fixed-point, deterministic process and stochastic process models. Transportation Research Part C: Emerging Technologies, 134, 103429. doi:10.1016/j.trc.2021.103429 CANTARELLA, G. E. & WATLING, D. P
-
[10]
Transportation Research Part B: Methodological, 92, 3-21
A general stochastic process for day -to-day dynamic traffic assignment: Formulation, asymptotic behaviour, and stability analysis. Transportation Research Part B: Methodological, 92, 3-21. doi:10.1016/j.trb.2016.05.005 CASCETTA, E
-
[13]
Transportation Research Part C: Emerging Technologies, 129, 103233
Ridesharing user equilibrium with nodal matching cost and its implications for congestion tolling and platform pricing. Transportation Research Part C: Emerging Technologies, 129, 103233. doi:10.1016/j.trc.2021.103233 CHENG, Q., WANG, S., LIU, Z. & YUAN, Y
-
[18]
Science of The Total Environment, 785, 147264
Vehicle mix evaluation in Beijing's passenger-car sector: From air pollution control perspective. Science of The Total Environment, 785, 147264. doi: 10.1016/j.scitotenv.2021.147264 GUO, R.-Y ., YANG, H., HUANG, H.-J. & TAN, Z
-
[24]
IF AC Proceedings Volumes, 27, 535-540
A Study on Formulation of a Combined Modal Split and Assignment Equilibrium Model: — with Analysis on Practical Application. IF AC Proceedings Volumes, 27, 535-540. doi:10.1016/S1474-6670(17)47526-4 LIU, R., JIANG, Y ., SESHADRI, R., BEN-AKIV A, M. & AZEVEDO, C. L. 2024a. Contextual Bayesian optimization of congestion pricing with day -to-day dynamics. Tr...
-
[25]
Transportation Research Part B: Methodological, 102, 162-179
Doubly dynamics for multi-modal networks with park-and-ride and adaptive pricing. Transportation Research Part B: Methodological, 102, 162-179. doi:10.1016/j.trb.2017.05.010 LIU, Z., HU, Y ., QIU, Z. & REN, F. 2024b. Characteristics and prediction of traffic-related PMs and CO2 at the urban neighborhood scale. Atmospheric Pollution Research, 15, 101985. d...
-
[26]
Transportation Research Part B: Methodological, 162, 162-194
General stochastic ridesharing user equilibrium problem with elastic demand. Transportation Research Part B: Methodological, 162, 162-194. doi:10.1016/j.trb.2022.06.001 MA, J., XU, M., MENG, Q. & CHENG, L
Show all 50 references
-
[27]
Transportation Research Part B: Methodological, 134, 1-24
Ridesharing user equilibrium problem under OD -based surge pricing strategy. Transportation Research Part B: Methodological, 134, 1-24. doi:10.1016/j.trb.2020.02.001 MA, R. & ZHANG, H. M
2020 doi
-
[28]
Transportation Research Part B: Methodological, 106, 345-374
The morning commute problem with ridesharing and dynamic parking charges. Transportation Research Part B: Methodological, 106, 345-374. doi:10.1016/j.trb.2017.07.002 MEPC (Ministry of Environmental Protection of China) ,
2017 doi
-
[29]
https://www.researchgate.net/publication/276027534_daolujidongchedaqiwuranwupaifangqingda nbianzhijishuzhinanshixing
Technical Guidelines for the Preparation of Air Pollutant Emission Inventories for Road Motor Vehicles (Trial). https://www.researchgate.net/publication/276027534_daolujidongchedaqiwuranwupaifangqingda nbianzhijishuzhinanshixing. Accessed January, 2015 NAJMI, A., REY , D. & RA...
2015
-
[30]
Transportation Research Part E: Logistics and Transportation Review, 108, 122-140
Novel dynamic formulations for real -time ride-sharing systems. Transportation Research Part E: Logistics and Transportation Review, 108, 122-140. doi:10.1016/j.tre.2017.10.009 NAOUM-SAWAYA, J., COGILL, R., GHADDAR, B., SAJJA, S., SHORTEN, R., TAHERI, N., TOMMASI, P., VERAGO, ...
2017 doi
-
[31]
Transportation Research Part B: Methodological, 80, 173-184
Stochastic optimization approach for the car placement problem in ridesharing systems. Transportation Research Part B: Methodological, 80, 173-184. doi:10.1016/j.trb.2015.07.001 NIE, Y
2015 doi
-
[32]
Transportation Research Part C: Emerging Technologies, 79, 242-256
How can the taxi industry survive the tide of ridesourcing? Evidence from Shenzhen, China. Transportation Research Part C: Emerging Technologies, 79, 242-256. doi:10.1016/j.trc.2017.03.017 NOURINEJAD, M. & ROORDA, M. J
2017 doi
-
[33]
Transportation Research Part C: Emerging Technologies, 64, 117-132
Agent based model for dynamic ridesharing. Transportation Research Part C: Emerging Technologies, 64, 117-132. doi:10.1016/j.trc.2015.07.016 PI, X., MA, W. & QIAN, Z
2015 doi
-
[34]
Transportation Research Part C: Emerging Technologies, 104, 369-389
A general formulation for multi -modal dynamic traffic assignment considering multi -class vehicles, public transit and parking. Transportation Research Part C: Emerging Technologies, 104, 369-389. doi:doi.org/10.1016/j.trc.2019.05.011 QIN, Z., ZHU, H. & YE, J
-
[35]
Transportation Research Part C: Emerging Technologies, 144, 103852
Reinforcement learning for ridesharing: An extended survey. Transportation Research Part C: Emerging Technologies, 144, 103852. doi:10.1016/j.trc.2022.103852 SMITH, M. J
2022
-
[36]
18, 245-252
The Stability of a Dynamic Model of Traffic Assignment—An Application of a Method of Lyapunov. 18, 245-252. doi:10.1287/trsc.18.3.245 SUN, M
-
[38]
Transportation Research Part A: Policy and Practice, 145, 203-227
Multi-class stochastic user equilibrium assignment model with ridesharing: Formulation and policy implications. Transportation Research Part A: Policy and Practice, 145, 203-227. doi:10.1016/j.tra.2020.12.011 TIKOUDIS, I., MARTINEZ, L., FARROW, K., GARCíA BOUYSSOU, C., PETRIK,...
2020 doi
-
[39]
Transportation Research Part D: Transport and Environment, 97, 102923
Ridesharing services and urban transport CO2 emissions: Simulation -based evidence from 247 cities. Transportation Research Part D: Transport and Environment, 97, 102923. doi:10.1016/j.trd.2021.102923 WANG, Z., CHEN, X. & CHEN, X
2021
-
[40]
Transportation Research Part D: 22 Transport and Environment, 75, 57-71
Ridesplitting is shaping young people’s travel behavior: Evidence from comparative survey via ride -sourcing platform. Transportation Research Part D: 22 Transport and Environment, 75, 57-71. doi:10.1016/j.trd.2019.08.017 WEI, B., SABERI, M., ZHANG, F., LIU, W. & WALLER, S. T
2019 doi
-
[41]
Transportation Research Part C: Emerging Technologies, 117, 102670
Modeling and managing ridesharing in a multi-modal network with an aggregate traffic representation: A doubly dynamical approach. Transportation Research Part C: Emerging Technologies, 117, 102670. doi:10.1016/j.trc.2020.102670 XU, H., PANG, J. -S., ORDóñEZ, F. & DESSOUKY , M
2020
-
[42]
Transportation Research Part B: Methodological, 81, 161-182
Complementarity models for traffic equilibrium with ridesharing. Transportation Research Part B: Methodological, 81, 161-182. doi:10.1016/j.trb.2015.08.013 YANG, F. & ZHANG, D
2015 doi
-
[44]
Transportation Research Part B: Methodological, 175, 102775
A general equilibrium model for multi-passenger ridesharing systems with stable matching. Transportation Research Part B: Methodological, 175, 102775. doi:10.1016/j.trb.2023.05.012 YE, H., XIAO, F. & YANG, H
2023 doi
-
[45]
Transportation Research Part B: Methodological, 144, 23-44
Day -to-day dynamics with advanced traveler information. Transportation Research Part B: Methodological, 144, 23-44. doi:10.1016/j.trb.2020.09.005 YU, Y ., HAN, K. & OCHIENG, W
2020 doi
-
[46]
Transportation Research Part C: Emerging Technologies, 114, 59-83
Day -to-day dynamic traffic assignment with imperfect information, bounded rationality and information sharing. Transportation Research Part C: Emerging Technologies, 114, 59-83. doi:10.1016/j.trc.2020.02.004 ZHANG, X., ZHONG, S., JIA, N., LING, S., YAO, W. & MA, S
2020 doi
-
[48]
Journal of Transport Geography, 104, 103449
Exploring the nonlinear effects of ridesharing on public transit usage: A case study of San Diego. Journal of Transport Geography, 104, 103449. doi:10.1016/j.jtrangeo.2022.103449 ZHAO, L., XU, X., GAO, H. O., WANG, J. & XIE, Y
2022
-
[49]
Transportation Research Part D: Transport and Environment, 47, 371-382
A bi-level model for GHG emission charge based on a continuous distribution of travelers’ value of time (VOT). Transportation Research Part D: Transport and Environment, 47, 371-382. doi:10.1016/j.trd.2016.07.002 ZOU, C., WU, L., WANG, Y ., SUN, S., WEI, N., SUN, B., NI, J., H...
2016 doi
-
[50]
Science of The Total Environment, 860, 160435
Evaluating traffic emission control policies based on large-scale and real-time data: A case study in central China. Science of The Total Environment, 860, 160435. doi:10.1016/j.scitotenv.2022.160435
2022
- [1464]
-
[1984]
Transportation Research Part B: Methodological, 18, 13-28
The stability of stochastic equilibrium in a two -link transportation network. Transportation Research Part B: Methodological, 18, 13-28. doi:10.1016/0191-2615(84)90003-1 HUANG, H.-J. & LAM, W. H. K
-
[1989]
Transportation Research Part B: Methodological, 23, 1-17
A stochastic process approach to the analysis of temporal dynamics in transportation networks. Transportation Research Part B: Methodological, 23, 1-17. doi:10.1016/0191 - 2615(89)90019-2 CHAN, N. D. & SHAHEEN, S. A
-
[1994]
42, 1120-1136
Day -To- Day Dynamic Network Disequilibria and Idealized Traveler Information Systems. 42, 1120-1136. doi:10.1287/opre.42.6.1120 FURUHATA, M., DESSOUKY , M., ORDóñEZ, F., BRUNET, M.-E., WANG, X. & KOENIG, S
-
[2002]
Transportation Research Part B: Methodological, 36, 253-273
Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues. Transportation Research Part B: Methodological, 36, 253-273. doi:10.1016/S0191-2615(00)00049-7 KAWAKAMI, S. & SHI, J
-
[2009]
Transportation Research Part B: Methodological, 43, 119-126
Day-to-day stationary link flow pattern. Transportation Research Part B: Methodological, 43, 119-126. doi:10.1016/j.trb.2008.05.005 YAO, R. & BEKHOR, S
2008 doi
-
[2010]
Transportation Research Part B: Methodological, 44, 597-608
A link -based day-to-day traffic assignment model. Transportation Research Part B: Methodological, 44, 597-608. doi:10.1016/j.trb.2009.10.001 HOROWITZ, J. L
2009 doi
-
[2011]
Energy for Sustainable Development, 15, 117-136
Reducing GHG emissions in the United States' transportation sector. Energy for Sustainable Development, 15, 117-136. doi:10.1016/j.esd.2011.03.002 ATAHRAN, A., LENTé, C. & T'KINDT, V
2011 doi
-
[2012]
TRANSPORT REVIEWS, 32, 93-112
Ridesharing in North America: Past, Present, and Future. TRANSPORT REVIEWS, 32, 93-112. doi:10.1080/01441647.2011.621557 CHEN, X. & DI, X
2011
-
[2013]
Transportation Research Part B: Methodological, 57, 28-46
Ridesharing: The state -of-the-art and future directions. Transportation Research Part B: Methodological, 57, 28-46. doi:10.1016/j.trb.2013.08.012 GUO, J.-X., ZENG, Y ., ZHU, K. & TAN, X
2013 doi
-
[2014]
21, 279-298
A Multicriteria Dial-a-Ride Problem with an Ecological Measure and Heterogeneous Vehicles. 21, 279-298. doi:doi.org/10.1002/mcda.1518 BAHAT, O. & BEKHOR, S
-
[2015]
Transportation Research Part B: Methodological, 71, 248-260
Link-based day-to-day network traffic dynamics and equilibria. Transportation Research Part B: Methodological, 71, 248-260. doi:10.1016/j.trb.2014.11.005 HALL, J. D., PALSSON, C. & PRICE, J
2014 doi
-
[2016]
Networks and Spatial Economics, 16, 1125-1149
Incorporating Ridesharing in the Static Traffic Assignment Model. Networks and Spatial Economics, 16, 1125-1149. doi:10.1007/s11067-015-9313-7 BAI, X., CHEN, H. & OLIVER, B. G
-
[2017]
Transportation Research Record, 2667, 39-50
Ridesharing User Equilibrium and Its Implications for High-Occupancy Toll Lane Pricing. Transportation Research Record, 2667, 39-50. doi:10.3141/2667-05 FRIESZ, T. L., BERNSTEIN, D., MEHTA, N. J., TOBIN, R. L. & GANJALIZADEH, S
-
[2018]
doi:10.1016/j.jue.2018.09.003 HE, X., GUO, X
Is Uber a substitute or complement for public transit? Journal of Urban Economics, 108, 36-50. doi:10.1016/j.jue.2018.09.003 HE, X., GUO, X. & LIU, H. X
2018 doi
-
[2019]
Transportation Research Part C: Emerging Technologies, 105, 422-438
Surrogate-based simulation optimization approach for day-to-day dynamics model calibration with real data. Transportation Research Part C: Emerging Technologies, 105, 422-438. doi:10.1016/j.trc.2019.06.009 DI, X., LIU, H. X., BAN, X. & YANG, H
2019 doi
-
[2020]
Transportation Research Part A: Policy and Practice, 136, 120-134
Who and where rideshares? Rideshare travel and use in Los Angeles. Transportation Research Part A: Policy and Practice, 136, 120-134. doi:10.1016/j.tra.2020.04.001 CANTARELLA, G. E. & FIORI, C
2020 doi
-
[2021]
doi:10.1016/j.trb.2021.01.004 ANDRESS, D., NGUYEN, T
Can dynamic ride-sharing reduce traffic congestion? Transportation Research Part B: Methodological, 145, 212-246. doi:10.1016/j.trb.2021.01.004 ANDRESS, D., NGUYEN, T. D. & DAS, S
2021 doi
-
[2022]
Chemosphere, 289, 133082
The health effects of traffic -related air pollution: A review focused the health effects of going green. Chemosphere, 289, 133082. doi:10.1016/j.chemosphere.2021.133082 BEOJONE, C. V . & GEROLIMINIS, N
2021
-
[2023]
Transportation Research Part E: Logistics and Transportation Review, 173, 103113
A day -to-day dynamic model for mixed traffic flow of autonomous vehicles and inertial human-driven vehicles. Transportation Research Part E: Logistics and Transportation Review, 173, 103113. doi:10.1016/j.tre.2023.103113 SUN, S. & SZETO, W. Y
2023
-
[2024]
Transportation Research Part A: Policy and Practice, 181, 103971
A barrier to the promotion of app- based ridesplitting: Travelers’ ambiguity aversion in mode choice. Transportation Research Part A: Policy and Practice, 181, 103971. doi:https://doi.org/10.1016/j.tra.2024.103971 ZHANG, Z., ZHAI, G., XIE, K. & XIAO, F
2024
Reviewed August 12, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.