Pith. sign in

REVIEW 3 major objections 5 minor 69 references

Integrated Balanced and Staggered Routing in Autonomous Mobility-on-Demand Systems

T0 review · 3 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A centrally controlled fleet that jointly chooses routes and departure times cuts total traffic delay by up to 25 percent and congestion delay by up to 35 percent compared with selfish routing, and partial control still helps everyone.

desk verdict Solid algorithmic contribution integrating balanced and staggered routing, but the headline delay reductions are properties of a congestion model the authors admit underestimates reality, so treat them as indicative, not validated. read the letter →

arxiv 2506.19722 v1 pith:B5Q44KJU submitted 2025-06-24 math.OC

Antonio Coppola , Gerhard Hiermann , Dario Paccagnan , Michel Gendreau , Maximilian Schiffer This is my paper · ORCID
classification math.OC MSC 90B2090B0690C59
keywords autonomousmobility-on-demandbalancedroutingstaggeredcongestionlargeneighborhoodsearchVickreybottleneckmodelrouteanddeparturetimechoiceManhattantaxidata
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that a centrally coordinated autonomous mobility-on-demand fleet should decide each trip's route and departure time in a single optimization, rather than handling the two decisions separately. On a Manhattan street network with roughly six thousand real taxi trips per instance, the integrated policy reduces total delay by about 23 percent in median and up to 25 percent, and congestion delay by up to 35 percent, relative to selfish routing. The paper also claims a formal grounding: its arc-delay function is an unbiased estimator of travel times under a discretized Vickrey bottleneck model. In mixed traffic, a welfare-oriented controller and a profit-oriented fleet controller both produce a win-win outcome, lowering delays for controlled and uncontrolled vehicles alike. If true, the result gives a practical upper bound on what central control of ride-hailing and robotaxi fleets could achieve before online uncertainty is introduced.

What carries the argument

The carrying mechanism is a joint route-and-departure-time optimization model in which every trip chooses from a precomputed set of limited-overlap alternative routes and a feasible departure time, while arc travel times are $\tau_a + d(f^r_a)$ with $d$ any convex, non-decreasing delay function. The paper proves (Theorem 1) that when arrivals are Poisson with traffic intensity $\rho$, the linear delay law $\tau(t)=\tau_a+(\phi\tau_a)f(t)$ with $\phi=(2-\rho)^{-1}$ reproduces the expected travel time of a discretized Vickrey bottleneck model, giving a queueing-theoretic calibration for the delay-function family used in computation. In the experiments that family is realized as the polynomial $d(f^r_a)=\tau_a\alpha[((f^r_a+\beta)/\tau_a)^\gamma-(\beta/\tau_a)^\gamma]$. Around this model sits a large-neighborhood-search metaheuristic whose insert, remove, local-search, and schedule-update operators evaluate route and staggering changes efficiently at the scale of thousands of trips.

What would settle it

Re-run the 31 Manhattan instances with the delay function re-fitted to the observed median peak delay of about 1.5 minutes rather than the aggregate fit that yields a 0.7-minute median, and compare the integrated solution with the selfish baseline; if the delay reduction drops below 23 percent or the congestion reduction disappears, the calibrated-congestion assumption is the cause.

Watch

Extended reading notes

Core claim

The central claim is that balanced routing and staggered routing are complements: spreading trips over alternative routes relieves spatial congestion, while delaying departures smooths temporal peaks, and optimizing both together yields delay reductions that neither achieves alone. The evidence is an algorithm that assigns each trip one of five limited-overlap alternative routes and a departure time within its allowable staggering window, minimizing total fleet travel time under a convex non-decreasing arc-delay function. In the full-control Manhattan experiments, the algorithm's median total delay reduction is 23 percent (10 to 17 hours saved), congestion delay falls by up to 35 percent, and the two mechanisms combine in a nearly additive way. The paper further claims that even a 10 percent controlled share captures about a quarter of the maximum delay reduction, and a 50 percent share captures three-quarters, in both welfare- and profit-oriented settings.

Load-bearing premise

The load-bearing premise is that the fitted polynomial delay curve captures how congestion actually builds on these streets; the authors note this may understate real-world congestion, so the reported reductions could shrink under stronger or differently shaped congestion.

Editorial extensions

If this is right

  • Under full centralized control, median total delay falls by roughly 23 percent on Manhattan-scale peak instances, corresponding to 10 to 17 hours saved per day.
  • Network congestion delay falls by up to 35 percent, and the integrated policy removes more congestion delay than balancing alone while adding less detour delay.
  • In mixed traffic, controlling only 10 percent of vehicles already yields about 25 percent of the maximum delay reduction, and 50 percent control yields about 75 percent.
  • Both welfare-oriented and profit-oriented operators produce lower delays for controlled and uncontrolled traffic at every tested control level.
  • The staggering-only variant beats the MILP-based matheuristic in delay reduction and robustness, giving a scalable building block for large instances.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because the model assumes full advance knowledge of demand and precomputed route sets, an online controller that learns requests as they arrive would likely recover a smaller share of the 25 percent; a rolling-horizon reoptimization on the same data would quantify the gap.
  • The authors note their delay parameterization may underestimate real congestion. If the true baseline congestion were closer to the observed 1.5-minute median delay, central coordination might produce larger absolute savings, but the relative 23 percent figure is not guaranteed to carry over.
  • The mixed-traffic win-win treats conventional traffic as fixed. If human drivers reroute in response to the fleet's new patterns, the gains to baseload traffic could change; simulating responsive baseload is the natural next experiment.
  • The unbiasedness theorem suggests the same delay-function form could be transferred to other cities by estimating $\rho$ or recalibrating $\alpha$, $\beta$, and $\gamma$ from local link data, without re-deriving the algorithm.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper studies the joint optimization of route choice and departure times (balanced and staggered routing) for centrally controlled autonomous mobility-on-demand (AMoD) fleets. It formulates a mixed-integer convex program, proves that, under Poisson arrivals, the linear congestion model (3.3) with φ=(2−ρ)^{-1} reproduces the expected travel time of an M/D/1 queue (discretized Vickrey bottleneck), and develops a large-neighborhood-search metaheuristic that initializes from a reactive dynamic user optimum and a greedy construction. On a Manhattan network with roughly 6,000 trips per instance derived from TLC taxi data, the integrated algorithm reduces total delay by a median of about 23% (up to 25%) and congestion delay by up to 35% relative to the selfish RDUO baseline; a mixed-traffic analysis with 10–100% controlled vehicles reports a win-win for both AMoD and baseload traffic under welfare- and profit-oriented objectives. The paper also benchmarks the staggering-only variant against an existing matheuristic from the literature.

Significance. The paper makes a useful algorithmic and modeling contribution: it is one of the few studies that simultaneously optimizes route and departure-time choices at vehicle level with explicit trip-by-trip congestion, and the LNS is designed to scale to thousands of trips. The connection to the discretized Vickrey bottleneck model, though limited to a linear special case, is a nice theoretical anchor, and the machine-implemented code is publicly available. The main quantitative claims (25%/35% reductions, win-win under partial control) are, however, demonstrated only inside a congestion surrogate that the authors themselves flag as possibly underestimating real congestion, and the unbiasedness theorem does not cover the polynomial delay function used in the case study.

major comments (3)
  1. [Section 3, Theorem 1 and Equation (3.3); Section 5, Delay function parameterization] The unbiasedness result in Theorem 1 is established only for the linear congestion model τ(t)=τa+φτa f(t). The case study in Section 5 uses the polynomial delay function d(f)=τa·α[((f+β)/τa)^γ−(β/τa)^γ] with α=0.1, β=35, γ=3, and the algorithm is explicitly designed for any convex non-decreasing delay function. No argument is given that the polynomial inherits the Vickrey/M/D/1 calibration, and the paragraph following (3.3) does not connect φ to the polynomial. Consequently, the abstract's statement that 'our congestion model yields an unbiased estimate of travel times derived from a discretized version of Vickrey's bottleneck model' is not supported for the model actually used in the numerical evaluation. Please either extend the theoretical justification to the calibrated delay function, or explicitly present the polynomial as a heuristic extension and soften the corresponding claims in the abstract and Section 3.
  2. [Section 5, 'Delay function parameterization'; Section 6.2, Results 2–3] The parameters α=0.1, β=35, γ=3 are calibrated to the same TLC dataset that supplies the trip origins, destinations, and departure times used in the evaluation, and the authors state that the resulting RDUO 'may underestimate real-world congestion' (median trip delay 0.7 min, delay share 12%). Under this surrogate, the reported reductions (median 23% total delay, up to 25%; congestion delay up to 35%) are internally consistent, but they are not established for realistic congestion levels. The manuscript should include a sensitivity analysis over the delay parameters (e.g., scaling α or the congestion multiplier) to show that the direction and approximate magnitude of the reductions persist, and the abstract and conclusion should report the reductions as properties of the calibrated model unless such robustness evidence is provided.
  3. [Section 6.4, 'Flow control analysis' and Result 6] The win-win conclusion—that both AMoD and baseload traffic benefit regardless of the operator's objective—is derived under the assumption that baseload trips are fixed at their RDUO routes and departure times ('Baseload trips follow fixed behavior, consistent with the RDUO solution'). The final paragraph of Section 6.4 acknowledges this and defers responsive baseload behavior to future work, but the abstract and conclusion state the win-win without this qualification. Since one of the paper's motivations is congestion driven by selfish rerouting, the claim should either be explicitly conditioned on non-responsive baseload traffic or supplemented with an experiment in which baseload traffic reacts to the controlled vehicles' choices (e.g., a simple selfish rerouting rule) to test whether the win-win survives.
minor comments (5)
  1. [Section 4.2, Equations (4.1e)–(4.1f)] In Equations (4.1e)–(4.1f), the start-time and completion-time variables are not distinguished typographically. The conflict condition in (4.1e) should use the completion time of the preceding trip in the rightmost term, and (4.1f) should set the completion time equal to the start time plus traversal time. As printed, the constraints are self-referential.
  2. [Appendix A, proof of Theorem 1] The proof divides by 1−φρ when solving for E[f(t)]; at ρ=1, φ=(2−ρ)^{-1}=1, so the denominator vanishes. Please state the assumption ρ<1 or treat ρ=1 via a limiting argument.
  3. [Throughout, especially Section 3 and abstract] The term 'unbiased estimator' is nonstandard here: Theorem 1 equates expected travel times of two stochastic processes, not an estimator's bias in the statistical sense. Consider rephrasing as 'calibrated in expectation' or 'mean-consistent'.
  4. [Section 5, 'Delay function parameterization'] The sentence 'commercial mapping services report that travel between the Financial District and Lower Manhattan experiences a delay of approximately 25%...' lacks a citation; please add a source or remove the claim.
  5. [Appendix F] The LNS parameter sensitivity analysis is conducted on five days (27–31); reporting the analysis on all 31 instances would strengthen confidence in the chosen parameter values.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the 25%/35% delay reductions are emergent outputs of a self-consistent optimization experiment, not fitted or defined into existence.

full rationale

The central experiment compares an optimized solution (INTEG) with a reactive dynamic user optimum (RDUO) under the same delay model and the same precomputed route set; the reported 23% median and up to 25% total delay reductions are outputs of the optimization, not parameters fitted to produce them. The delay function is parameterized from TLC statistics (alpha=0.1, beta=35, gamma=3) before optimization, and the paper explicitly reports that the resulting RDUO delay share of 12% and 0.7-minute median delay 'may underestimate real-world congestion' (Section 5), which is a validity caveat rather than a circular step. Theorem 1 is an explicit calibration: phi=(2-rho)^-1 is solved so that the linear congestion model's expected travel time matches the M/D/1/Vickrey expected travel time (Appendix A), and this linear model is not the polynomial used in the case study, so no fitted parameter is renamed as a prediction. Self-citations to Coppola et al. (2025) appear for NP-hardness, an MILP linearization procedure, and as the MATH benchmark; none of these carries the central claim, and the NP-hardness citation is not used to forbid alternatives or to define the result. No equation in the paper defines the headline reductions in terms of the fitted inputs; therefore no circular step can be exhibited.

Assumptions & free parameters 7 free parameters · 5 assumptions · 0 invented entities

The experimental claims rest on the fitted polynomial delay function and on modeling choices (fixed route sets, full information, unresponsive baseload) that bound the reported benefits. The theoretical unbiasedness result rests on a separate Poisson/M/D/1 mapping and is not used in the case study. No new entities are introduced.

free parameters (7)
  • phi (Vickrey matching parameter) = phi = (2 - rho)^-1
    Chosen in Theorem 1 so the linear congestion model's expected travel time equals the M/D/1 (discretized Vickrey) expectation; a calibration to a target, not an independent prediction.
  • alpha (delay scaling) = 0.1
    Fitted to TLC data to reproduce observed median peak-hour delay and the 25% delay from commercial mapping services.
  • beta (baseline shift) = 35
    Part of the polynomial delay function fit; shifts delay behavior under low congestion.
  • gamma (polynomial exponent) = 3
    Part of the polynomial delay function fit; chosen to match the shape of observed delays.
  • maximum staggering fraction = 20% of shortest-route free-flow time (10% in MATH comparison)
    Design choice defining trip time windows; directly affects how much staggering the algorithm can apply.
  • latest arrival buffer = 25% above RDUO travel time
    Arbitrary choice defining trip deadlines; shapes feasibility and therefore the reported reductions.
  • route set parameters k, theta = k=5, theta=60%
    Chosen via sensitivity analysis; bounds the alternative routes available for balancing.
assumptions (5)
  • domain assumption Arrivals at the bottleneck follow a stationary Poisson process with rate lambda <= tau_a^-1.
    Used in Theorem 1 to map the congestion model to an M/D/1 queue; not verified for the case study network.
  • domain assumption Arc travel time depends only on the number of trips concurrently on the arc, via a convex non-decreasing function.
    Basis of the conflict-based congestion model (Equation 3.1 and constraint 4.1e); simplifies but may not capture spillback or shockwaves.
  • domain assumption The operator has full knowledge of all trip requests in advance (offline setting).
    Stated in Section 3; the study provides an upper bound for online methods.
  • domain assumption Baseload (non-AMoD) trips follow the RDUO routes and departure times regardless of AMoD control.
    Used in the mixed-traffic analysis (Section 6.4); authors acknowledge responsive baseload is left to future work.
  • domain assumption The precomputed route set P_r bounds all possible route choices.
    Standard in route-based DTA; the algorithm cannot improve beyond the given alternatives, so k and theta constrain the attainable benefit.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Integrated Balanced and Staggered Routing in Autonomous Mobility-on-Demand Systems." pith.science (2026). https://pith.science/paper/B5Q44KJU

@misc{pith2026250619722,
  author       = {Pith},
  title        = {Pith review of: Integrated Balanced and Staggered Routing in Autonomous Mobility-on-Demand Systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/B5Q44KJU}},
  note         = {Machine review of arXiv:2506.19722}
}
read the original abstract

Autonomous mobility-on-demand (AMoD) systems, centrally coordinated fleets of self-driving vehicles, offer a promising alternative to traditional ride-hailing by improving traffic flow and reducing operating costs. Centralized control in AMoD systems enables two complementary routing strategies: balanced routing, which distributes traffic across alternative routes to ease congestion, and staggered routing, which delays departures to smooth peak demand over time. In this work, we introduce a unified framework that jointly optimizes both route choices and departure times to minimize system travel times. We formulate the problem as an optimization model and show that our congestion model yields an unbiased estimate of travel times derived from a discretized version of Vickrey's bottleneck model. To solve large-scale instances, we develop a custom metaheuristic based on a large neighborhood search framework. We assess our method through a case study on the Manhattan street network using real-world taxi data. In a setting with exclusively centrally controlled AMoD vehicles, our approach reduces total traffic delay by up to 25 percent and mitigates network congestion by up to 35 percent compared to selfish routing. We also consider mixed-traffic settings with both AMoD and conventional vehicles, comparing a welfare-oriented operator that minimizes total system travel time with a profit-oriented one that optimizes only the fleet's travel time. Independent of the operator's objective, the analysis reveals a win-win outcome: across all control levels, both autonomous and non-autonomous traffic benefit from the implementation of balancing and staggering strategies.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

69 extracted references · 68 canonical work pages

  1. [1]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize "" * " " * ...

  2. [2]

    , author Delling, D

    author Abraham, I. , author Delling, D. , author Goldberg, A. V. , & author Werneck, R. F. ( year 2013 ). title Alternative routes in road networks . journal Journal of Experimental Algorithmics (JEA) \/ , volume 18 \/ , pages 1--1

    work page 2013

  3. [3]

    , & author Tiriolo, M

    author Adacher, L. , & author Tiriolo, M. ( year 2018 ). title A macroscopic model with the advantages of microscopic model: A review of cell transmission model’s extensions for urban traffic networks . journal Simulation Modelling Practice and Theory \/ , volume 86 \/ , pages 102--119

    work page 2018

  4. [4]

    , & author Laval, J

    author Aghamohammadi, R. , & author Laval, J. A. ( year 2020 ). title Dynamic traffic assignment using the macroscopic fundamental diagram: A review of vehicular and pedestrian flow models . journal Transportation Research Part B: Methodological \/ , volume 137 \/ , pages 99--118

    work page 2020

  5. [5]

    , author Wallar, A

    author Alonso-Mora, J. , author Wallar, A. , & author Rus, D. ( year 2017 ). title Predictive routing for autonomous mobility-on-demand systems with ride-sharing . In booktitle International Conference on Intelligent Robots and Systems ( IROS ) \/ . publisher IEEE

    work page 2017

  6. [6]

    , author de Palma, A

    author Arnott, R. , author de Palma, A. , & author Lindsey, R. ( year 1990 ). title Departure time and route choice for the morning commute . journal Transportation Research Part B: Methodological \/ , volume 24 \/ , pages 209--228

    work page 1990

  7. [7]

    , & author Roorda, M

    author Bahrami, S. , & author Roorda, M. J. ( year 2020 ). title Optimal traffic management policies for mixed human and automated traffic flows . journal Transportation Research Part A: Policy and Practice \/ , volume 135 \/ , pages 130--143

    work page 2020

  8. [8]

    , & author Malikopoulos, A

    author Bang, H. , & author Malikopoulos, A. A. ( year 2022 ). title Congestion-aware routing, rebalancing, and charging scheduling for electric autonomous mobility-on-demand system . In booktitle 2022 American Control Conference (ACC) \/ (pp. pages 3152--3157 )

    work page 2022

Show all 69 references
  1. [9]

    , & author Qian, S

    author Battifarano, M. , & author Qian, S. ( year 2023 ). title The impact of optimized fleets in transportation networks . journal Transportation Science \/ , volume 57 \/ , pages 1047--1068

    2023

  2. [10]

    , & author Watling, D

    author Carey, M. , & author Watling, D. ( year 2012 ). title Dynamic traffic assignment approximating the kinematic wave model: System optimum, marginal costs, externalities and tolls . journal Transportation Research Part B: Methodological \/ , volume 46 \/ , pages 634--648

    2012

  3. [11]

    , author Bouros, P

    author Chondrogiannis, T. , author Bouros, P. , author Gamper, J. , author Leser, U. , & author Blumenthal, D. B. ( year 2020 ). title Finding k-shortest paths with limited overlap . journal The VLDB Journal \/ , volume 29 \/ , pages 1023--1047

    2020

  4. [12]

    , author Hiermann, G

    author Coppola, A. , author Hiermann, G. , author Paccagnan, D. , & author Schiffer, M. ( year 2025 ). title Staggered routing in autonomous mobility-on-demand systems . journal European Journal of Operational Research, \/ , . note In Press

    2025

  5. [13]

    , author Kong, H

    author Diao, M. , author Kong, H. , & author Zhao, J. ( year 2021 ). title Impacts of transportation network companies on urban mobility . journal Nature Sustainability \/ , volume 4 \/ , pages 494--500

    2021

  6. [14]

    , author Harrison, J

    author Enders, T. , author Harrison, J. , author Pavone, M. , & author Schiffer, M. ( year 2023 ). title Hybrid multi-agent deep reinforcement learning for autonomous mobility on demand systems . In booktitle Learning for Dynamics and Control Conference \/ (pp. pages 1284--129...

    2023

  7. [15]

    , author Schiffer, M

    author Estandia, A. , author Schiffer, M. , author Rossi, F. , author Luke, J. , author Kara, E. C. , author Rajagopal, R. , & author Pavone, M. ( year 2021 ). title On the interaction between autonomous mobility on demand systems and power distribution networks—an optimal pow...

    2021

  8. [16]

    author Friesz, T. L. , author Kim, T. , author Kwon, C. , & author Rigdon, M. A. ( year 2011 ). title Approximate network loading and dual-time-scale dynamic user equilibrium . journal Transportation Research Part B: Methodological \/ , volume 45 \/ , pages 176--207

    2011

  9. [17]

    , author Yang, K

    author Gammelli, D. , author Yang, K. , author Harrison, J. , author Rodrigues, F. , author Pereira, F. C. , & author Pavone, M. ( year 2021 ). title Graph neural network reinforcement learning for autonomous mobility-on-demand systems . In booktitle 2021 60th IEEE Conference ...

    2021

  10. [18]

    , author Sanders, P

    author Geisberger, R. , author Sanders, P. , author Schultes, D. , & author Delling, D. ( year 2008 ). title Contraction hierarchies: Faster and simpler hierarchical routing in road networks . In editor C. C. McGeoch (Ed.), booktitle Experimental Algorithms \/ (pp. pages 319--...

    2008

  11. [19]

    , author Friesz, T

    author Han, K. , author Friesz, T. L. , & author Yao, T. ( year 2013 ). title Existence of simultaneous route and departure choice dynamic user equilibrium . journal Transportation Research Part B: Methodological \/ , volume 53 \/ , pages 17--30

    2013

  12. [20]

    , & author Kocur, G

    author Hendrickson, C. , & author Kocur, G. ( year 1981 ). title Schedule delay and departure time decisions in a deterministic model . journal Transportation science \/ , volume 15 \/ , pages 62--77

    1981

  13. [21]

    , & author Mahmassani, H

    author Hu, T.-Y. , & author Mahmassani, H. S. ( year 1997 ). title Day-to-day evolution of network flows under real-time information and reactive signal control . journal Transportation Research Part C: Emerging Technologies \/ , volume 5 \/ , pages 51--69

    1997

  14. [22]

    , & author Lam, W

    author Huang, H.-J. , & author Lam, W. H. ( year 2002 ). title Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues . journal Transportation Research Part B: Methodological \/ , volume 36 \/ , pages 253--273

    2002

  15. [23]

    , author Rossi, F

    author Iglesias, R. , author Rossi, F. , author Wang, K. , author Hallac, D. , author Leskovec, J. , & author Pavone, M. ( year 2018 ). title Data-driven model predictive control of autonomous mobility-on-demand systems . In booktitle 2018 IEEE International Conference on Robo...

    2018

  16. [24]

    , author Paccagnan, D

    author Jalota, D. , author Paccagnan, D. , author Schiffer, M. , & author Pavone, M. ( year 2023 ). title Online routing over parallel networks: Deterministic limits and data-driven enhancements . journal INFORMS Journal on Computing \/ , volume 35 \/ , pages 560--577

    2023

  17. [25]

    author Jauffred, F. J. , & author Bernstein, D. ( year 1996 ). title An alternative formulation of the simultaneous route and departure-time choice equilibrium problem . journal Transportation Research Part C: Emerging Technologies \/ , volume 4 \/ , pages 339--357

    1996

  18. [26]

    , author Tang, X

    author Jiao, Y. , author Tang, X. , author Qin, Z. T. , author Li, S. , author Zhang, F. , author Zhu, H. , & author Ye, J. ( year 2021 ). title Real-world ride-hailing vehicle repositioning using deep reinforcement learning . journal Transportation Research Part C: Emerging T...

    2021

  19. [27]

    , author Parmentier, A

    author Jungel, K. , author Parmentier, A. , author Schiffer, M. , & author Vidal, T. ( year 2023 ). title Learning-based online optimization for autonomous mobility-on-demand fleet control . journal arXiv:2302.03963 [math.OC] \/ , . :10.48550/arXiv.2302.03963

    2023 doi arXiv

  20. [28]

    , author Bojic, I

    author Kondor, D. , author Bojic, I. , author Resta, G. , author Duarte, F. , author Santi, P. , & author Ratti, C. ( year 2022 ). title The cost of non-coordination in urban on-demand mobility . journal Scientific reports \/ , volume 12 \/ , pages 4669

    2022

  21. [29]

    author Levin, M. W. ( year 2017 ). title Congestion-aware system optimal route choice for shared autonomous vehicles . journal Transportation Research Part C: Emerging Technologies \/ , volume 82 \/ , pages 229--247

    2017

  22. [30]

    , author Qin, Z

    author Li, M. , author Qin, Z. , author Jiao, Y. , author Yang, Y. , author Wang, J. , author Wang, C. , author Wu, G. , & author Ye, J. ( year 2019 ). title Efficient ridesharing order dispatching with mean field multi-agent reinforcement learning . In booktitle The World Wid...

    2019

  23. [31]

    , author Huang, H.-J

    author Li, Z.-C. , author Huang, H.-J. , & author Yang, H. ( year 2020 ). title Fifty years of the bottleneck model: A bibliometric review and future research directions . journal Transportation research part B: methodological \/ , volume 139 \/ , pages 311--342

    2020

  24. [32]

    , author Wen, K

    author Liang, E. , author Wen, K. , author Lam, W. H. , author Sumalee, A. , & author Zhong, R. ( year 2021 ). title An integrated reinforcement learning and centralized programming approach for online taxi dispatching . journal IEEE Transactions on Neural Networks and Learnin...

    2021

  25. [33]

    author Lindsey, C. R. , author Van den Berg, V. A. , & author Verhoef, E. T. ( year 2012 ). title Step tolling with bottleneck queuing congestion . journal Journal of Urban Economics \/ , volume 72 \/ , pages 46--59

    2012

  26. [34]

    , & author Nie, Y

    author Liu, Y. , & author Nie, Y. M. ( year 2011 ). title Morning commute problem considering route choice, user heterogeneity and alternative system optima . journal Transportation Research Part B: Methodological \/ , volume 45 \/ , pages 619--642

    2011

  27. [35]

    , & author Samaranayake, S

    author Liu, Y. , & author Samaranayake, S. ( year 2022 ). title Proactive rebalancing and speed-up techniques for on-demand high capacity ridesourcing services . journal IEEE Transactions on Intelligent Transportation Systems \/ , volume 23 \/ , pages 819--826

    2022

  28. [36]

    author Lo, H. K. , & author Szeto, W. ( year 2002 ). title A cell-based variational inequality formulation of the dynamic user optimal assignment problem . journal Transportation Research Part B: Methodological \/ , volume 36 \/ , pages 421--443

    2002

  29. [37]

    , author Huang, H.-J

    author Long, J. , author Huang, H.-J. , author Gao, Z. , & author Szeto, W. Y. ( year 2013 ). title An intersection-movement-based dynamic user optimal route choice problem . journal Operations Research \/ , volume 61 \/ , pages 1134--1147

    2013

  30. [38]

    , author Wang, C

    author Long, J. , author Wang, C. , & author Szeto, W. ( year 2018 ). title Dynamic system optimum simultaneous route and departure time choice problems: Intersection-movement-based formulations and comparisons . journal Transportation Research Part B: Methodological \/ , volu...

    2018

  31. [39]

    , author Menelaou, C

    author Makridis, C. , author Menelaou, C. , author Timotheou, S. , & author Panayiotou, C. G. ( year 2024 ). title A real-time demand management and route-guidance system for eliminating congestion . journal IEEE Intelligent Transportation Systems Magazine \/ ,

    2024

  32. [40]

    , author Timotheou, S

    author Menelaou, C. , author Timotheou, S. , author Kolios, P. , & author Panayiotou, C. G. ( year 2021 ). title Joint route guidance and demand management for real-time control of multi-regional traffic networks . journal IEEE Transactions on Intelligent Transportation System...

    2021

  33. [41]

    , & author Carey, M

    author Mounce, R. , & author Carey, M. ( year 2011 ). title Route swapping in dynamic traffic networks . journal Transportation Research Part B: Methodological \/ , volume 45 \/ , pages 102--111

    2011

  34. [42]

    ( year 2010 )

    author Nie, Y. ( year 2010 ). title Solving the dynamic user optimal assignment problem considering queue spillback . journal Networks and Spatial Economics \/ , volume 10 \/ , pages 49--71

    2010

  35. [43]

    title TLC Trip Record Data

    author NYCTLC ( year 2009 ). title TLC Trip Record Data . https://tinyurl.com/tlc-trip-data

    2009

  36. [44]

    title Hub bound travel data 2023

    author NYMTC ( year 2023 ). title Hub bound travel data 2023 . https://tinyurl.com/3bdsvhsd note New York Metropolitan Transportation Council

    2023

  37. [45]

    , author Seshadri, R

    author Oh, S. , author Seshadri, R. , author Azevedo, C. L. , author Kumar, N. , author Basak, K. , & author Ben-Akiva, M. ( year 2020 ). title Assessing the impacts of automated mobility-on-demand through agent-based simulation: A study of singapore . journal Transportation R...

    2020

  38. [46]

    https://www.openstreetmap.org

    author OpenStreetMap ( year 2024 ). https://www.openstreetmap.org

    2024

  39. [47]

    , & author Rapoport, A

    author Otsubo, H. , & author Rapoport, A. ( year 2008 ). title Vickrey’s model of traffic congestion discretized . journal Transportation Research Part B: Methodological \/ , volume 42 \/ , pages 873--889

    2008

  40. [48]

    ( year 2015 )

    author Pavone, M. ( year 2015 ). title Autonomous mobility-on-demand systems for future urban mobility . In booktitle Autonomes Fahren: Technische, rechtliche und gesellschaftliche Aspekte \/ (pp. pages 399--416 ). address Berlin, Heidelberg : publisher Springer Berlin Heidelberg

    2015

  41. [49]

    , author Hall, R

    author Ran, B. , author Hall, R. W. , & author Boyce, D. E. ( year 1996 ). title A link-based variational inequality model for dynamic departure time/route choice . journal Transportation Research Part B: Methodological \/ , volume 30 \/ , pages 31--46

    1996

  42. [50]

    , author Iglesias, R

    author Rossi, F. , author Iglesias, R. , author Alizadeh, M. , & author Pavone, M. ( year 2020 ). title On the interaction between autonomous mobility-on-demand systems and the power network: Models and coordination algorithms . journal IEEE Transactions on Control of Network ...

    2020

  43. [51]

    , author Zhang, R

    author Rossi, F. , author Zhang, R. , author Hindy, Y. , & author Pavone, M. ( year 2018 ). title Routing autonomous vehicles in congested transportation networks: structural properties and coordination algorithms . journal Autonomous Robots \/ , volume 42 \/ , pages 1427--1442

    2018

  44. [52]

    , author Tang, X

    author Sadeghi Eshkevari, S. , author Tang, X. , author Qin, Z. , author Mei, J. , author Zhang, C. , author Meng, Q. , & author Xu, J. ( year 2022 ). title Reinforcement learning in the wild: Scalable RL dispatching algorithm deployed in ridehailing marketplace . In booktitle...

    2022

  45. [53]

    , author Lanzetti, N

    author Salazar, M. , author Lanzetti, N. , author Rossi, F. , author Schiffer, M. , & author Pavone, M. ( year 2019 ). title Intermodal autonomous mobility-on-demand . journal IEEE Transactions on Intelligent Transportation Systems \/ , volume 21 \/ , pages 3946--3960

    2019

  46. [54]

    , author Hou, Y

    author Skordilis, E. , author Hou, Y. , author Tripp, C. , author Moniot, M. , author Graf, P. , & author Biagioni, D. ( year 2021 ). title A modular and transferable reinforcement learning framework for the fleet rebalancing problem . journal IEEE Transactions on Intelligent ...

    2021

  47. [55]

    title Ride-hailing - United States

    author Statista ( year 2024 ). title Ride-hailing - United States . https://tinyurl.com/ride-hailing-us

    2024

  48. [56]

    , author Qin, Z

    author Tang, X. , author Qin, Z. T. , author Zhang, F. , author Wang, Z. , author Xu, Z. , author Ma, Y. , author Zhu, H. , & author Ye, J. ( year 2019 ). title A deep value-network based approach for multi-driver order dispatching . In booktitle Proceedings of the 25th ACM SI...

    2019

  49. [57]

    author Thomopoulos, N. T. ( year 2012 ). title Fundamentals of queuing systems: statistical methods for analyzing queuing models \/ . publisher Springer Science & Business Media

    2012

  50. [58]

    , author Iglesias, R

    author Tsao, M. , author Iglesias, R. , & author Pavone, M. ( year 2018 ). title Stochastic model predictive control for autonomous mobility on demand . In booktitle 2018 21st International Conference on Intelligent Transportation Systems (ITSC) \/ (pp. pages 3941--3948 )

    2018

  51. [59]

    , author Milojevic, D

    author Tsao, M. , author Milojevic, D. , author Ruch, C. , author Salazar, M. , author Frazzoli, E. , & author Pavone, M. ( year 2019 ). title Model predictive control of ride-sharing autonomous mobility-on-demand systems . In booktitle 2019 International Conference on Robotic...

    2019

  52. [60]

    author Ukkusuri, S. V. , author Han, L. , & author Doan, K. ( year 2012 ). title Dynamic user equilibrium with a path based cell transmission model for general traffic networks . journal Transportation Research Part B: Methodological \/ , volume 46 \/ , pages 1657--1684

    2012

  53. [61]

    author Vickrey, W. S. ( year 1969 ). title Congestion theory and transport investment . journal The American economic review \/ , volume 59 \/ , pages 251--260

    1969

  54. [62]

    , author Li, Z

    author Xu, Z. , author Li, Z. , author Guan, Q. , author Zhang, D. , author Li, Q. , author Nan, J. , author Liu, C. , author Bian, W. , & author Ye, J. ( year 2018 ). title Large-scale order dispatch in on-demand ride-hailing platforms: A learning and planning approach . In b...

    2018

  55. [63]

    , & author Meng, Q

    author Yang, H. , & author Meng, Q. ( year 1998 ). title Departure time, route choice and congestion toll in a queuing network with elastic demand . journal Transportation Research Part B: Methodological \/ , volume 32 \/ , pages 247--260

    1998

  56. [64]

    , author Sessa, P

    author Zanardi, A. , author Sessa, P. G. , author Käslin, N. , author Bolognani, S. , author Censi, A. , & author Frazzoli, E. ( year 2023 ). title How bad is selfish driving? bounding the inefficiency of equilibria in urban driving games . journal IEEE Robotics and Automation...

    2023

  57. [65]

    , author Lanzetti, N

    author Zardini, G. , author Lanzetti, N. , author Pavone, M. , & author Frazzoli, E. ( year 2022 ). title Analysis and control of autonomous mobility-on-demand systems . journal Annual Review of Control, Robotics, and Autonomous Systems \/ , volume 5 \/ , pages 633--658

    2022

  58. [66]

    , author Hu, T

    author Zhang, L. , author Hu, T. , author Min, Y. , author Wu, G. , author Zhang, J. , author Feng, P. , author Gong, P. , & author Ye, J. ( year 2017 ). title A taxi order dispatch model based on combinatorial optimization . In booktitle Proceedings of the 23rd ACM SIGKDD Int...

    2017

  59. [67]

    , author Jin, J

    author Zhou, M. , author Jin, J. , author Zhang, W. , author Qin, Z. , author Jiao, Y. , author Wang, C. , author Wu, G. , author Yu, Y. , & author Ye, J. ( year 2019 ). title Multi-agent reinforcement learning for order-dispatching via order-vehicle distribution matching . In...

    2019

  60. [68]

    author Ziliaskopoulos, A. K. , & author Rao, L. ( year 1999 ). title A simultaneous route and departure time choice equilibrium model on dynamic networks . journal International Transactions in Operational Research \/ , volume 6 \/ , pages 21--37

    1999

  61. [69]

    author Ziliaskopoulos, A. K. , author Waller, S. T. , author Li, Y. , & author Byram, M. ( year 2004 ). title Large-scale dynamic traffic assignment: Implementation issues and computational analysis . journal Journal of Transportation Engineering \/ , volume 130 \/ , pages 585--593

    2004

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.