pith. machine review for the scientific record. sign in

arxiv: 2605.07743 · v1 · submitted 2026-05-08 · 📡 eess.SY · cs.SY

Recognition: no theorem link

Efficient MILP-based Urban Network Traffic Control in Mixed Autonomy with Dynamic Saturation Rates

Muhammad Haris , Claudio Roncoli
Authors on Pith no claims yet

Pith reviewed 2026-05-11 02:38 UTC · model grok-4.3

classification 📡 eess.SY cs.SY
keywords mixed autonomytraffic signal controlMILPdynamic saturation rateCAV routingstore-and-forward modelurban networksqueue spillback
0
0 comments X

The pith

A dynamic saturation rate and MILP reformulation let mixed CAV-HDV networks optimize signals and routing in real time.

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

The paper sets out to show that traffic control in cities with both automated and human-driven vehicles can be made practical by replacing fixed flow rates with ones that respond to queue lengths. This change is embedded in an extended store-and-forward model that also decides signal timings and routes for connected vehicles. The resulting non-convex program is turned into a tractable MILP through under- and over-estimators, allowing repeated solution at network scale. If the approach holds, cities could run coordinated control that accounts for how autonomy changes traffic behavior without excessive computation. Microscopic tests indicate lower total delay than earlier multi-commodity formulations.

Core claim

The central claim is that replacing static saturation flows with a queue-responsive dynamic version inside an extended multi-commodity store-and-forward model, then converting the resulting non-convex quadratic program into a sequence of mixed-integer linear programs, produces an efficient real-time controller that jointly optimizes green times and CAV routing while respecting queue evolution and spillback.

What carries the argument

The queue-responsive dynamic saturation rate that adjusts effective capacity according to observed queues to capture autonomy-induced flow differences.

If this is right

  • Joint signal timing and CAV routing decisions become solvable at each control interval for moderate-sized networks.
  • Queue spillback and capacity variations due to autonomy are explicitly respected in the optimization.
  • The method scales better than direct solution of the original non-convex quadratic program.
  • Performance gains appear in total delay and throughput relative to prior multi-commodity formulations.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same dynamic-rate idea could be tested on perimeter control or route guidance problems that currently use fixed saturation values.
  • Replacing the assumed linear relationship between queue and saturation with data-driven functions would be a direct next measurement.
  • The MILP reformulation opens the door to warm-starting or decomposition techniques for even larger networks.

Load-bearing premise

The assumed relationship between queue length and saturation rate fully captures how mixed autonomy changes traffic flow without leaving out important real-world effects.

What would settle it

A controlled microscopic simulation or field deployment in which the proposed controller produces equal or higher total vehicle delay than the baseline multi-commodity method at the same computation budget would falsify the performance advantage.

Figures

Figures reproduced from arXiv: 2605.07743 by Claudio Roncoli, Muhammad Haris.

Figure 1
Figure 1. Figure 1: Assuming that hCAV and hHDV denote the average time headways of CAVs and HDVs respectively, we employ the mixed traffic autonomy function from [6], [7], obtaining: s(z,k) = 1 Θ(z,k) hCAV + (1 − Θ(z,k))hHDV (3) where Θ defines the autonomy level (percentage of CAVs) of the link or road segment defined as: Θ(z,k) = X(z,k) hCAV P d∈D¯ x(z,d,k) +hHDVx(z,0,k) (4) where X(z,k) is the total queue length vector of… view at source ↗
Figure 2
Figure 2. Figure 2: FIGURE 2 [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIGURE 3 [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIGURE 4 [PITH_FULL_IMAGE:figures/full_fig_p011_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIGURE 5 [PITH_FULL_IMAGE:figures/full_fig_p012_5.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIGURE 7 [PITH_FULL_IMAGE:figures/full_fig_p013_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: FIGURE 8 [PITH_FULL_IMAGE:figures/full_fig_p013_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: FIGURE 9 [PITH_FULL_IMAGE:figures/full_fig_p014_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: FIGURE 10 [PITH_FULL_IMAGE:figures/full_fig_p014_10.png] view at source ↗
read the original abstract

This paper introduces a novel control strategy to optimize urban network traffic in mixed autonomy settings, featuring Connected and Automated Vehicles (CAVs) alongside Human-Driven Vehicles (HDVs). Unlike previous control strategies, where the impact of driver behaviour of CAVs and HDVs is not explicitly considered, we propose a dynamic, queue-responsive saturation rate to account for autonomy-driven variations in traffic flow characteristics. The proposed method is based on an extended multi-commodity store-and-forward model to a mixed autonomy environment, integrating optimized routing for CAVs via infrastructure-linked connectivity, and signal timings at every signalized intersection. The problem is formulated as a Non-Convex Quadratic Program (NQP), which accounts for queue evolution, spillback, green time allocation, and CAVs routing. To enable computational efficiency for real-time applications, we transform the NQP into a sequence of convex subproblems, leveraging under- and over-estimators to reformulate it as a Mixed Integer Linear Program (MILP). Experimental results via microscopic simulations validate the efficiency and robustness of the proposed methodology. The results reflect that the proposed model outperforms the existing multi-commodity approach, thus demonstrating its potential for real-time traffic optimization in future urban mobility systems.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper proposes a dynamic, queue-responsive saturation rate for mixed-autonomy urban traffic control, extending the multi-commodity store-and-forward model to incorporate CAV routing and signal timing. The resulting non-convex quadratic program (NQP) is converted to a mixed-integer linear program (MILP) via under- and over-estimators for real-time solvability, with microscopic simulation results claimed to show outperformance relative to the prior multi-commodity formulation.

Significance. If the reported outperformance is robust, the work offers a practical advance for real-time network control in mixed CAV-HDV environments by explicitly modeling autonomy-driven saturation variations. The MILP reformulation addresses a key computational barrier, and the simulation-based validation pipeline is a positive element.

major comments (2)
  1. [Experimental validation] Experimental validation (abstract and results section): the outperformance claim is presented without error bars, sensitivity analysis, or quantitative assessment of how the NQP-to-MILP transformation with estimators affects solution quality or optimality gap. This directly affects confidence in the central claim that the method is superior for real-time use.
  2. [Model formulation] Dynamic saturation rate definition (model section): the assumption that the queue-responsive rate accurately captures autonomy-driven flow changes without introducing unmodeled errors is load-bearing for the claimed advantage over static multi-commodity models, yet receives limited empirical justification or robustness checks in the provided validation.
minor comments (1)
  1. [Formulation] Notation for saturation rate and estimator functions could be clarified with explicit definitions or a table to avoid ambiguity when reading the NQP and MILP formulations.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive feedback on our manuscript. We address each major comment below and indicate the revisions we will make to strengthen the presentation of our results and model.

read point-by-point responses

  1. Referee: [Experimental validation] Experimental validation (abstract and results section): the outperformance claim is presented without error bars, sensitivity analysis, or quantitative assessment of how the NQP-to-MILP transformation with estimators affects solution quality or optimality gap. This directly affects confidence in the central claim that the method is superior for real-time use.

    Authors: We agree that the current results section would benefit from additional statistical rigor. In the revised manuscript we will report error bars computed from multiple independent microscopic simulation runs using different random seeds. We will also add a sensitivity analysis with respect to CAV penetration rate and traffic demand levels. For the NQP-to-MILP approximation, we will include a quantitative comparison of solution quality on smaller network instances that remain solvable as NQPs; this will report the observed optimality gaps and confirm that the MILP solutions remain sufficiently close for real-time control purposes. revision: yes

  2. Referee: [Model formulation] Dynamic saturation rate definition (model section): the assumption that the queue-responsive rate accurately captures autonomy-driven flow changes without introducing unmodeled errors is load-bearing for the claimed advantage over static multi-commodity models, yet receives limited empirical justification or robustness checks in the provided validation.

    Authors: The dynamic saturation rate is derived from the mixed-autonomy fundamental diagram and queue-length dependence as described in the model section, consistent with prior literature on CAV-HDV interactions. To provide stronger empirical support, the revised manuscript will include additional figures that directly plot the time-varying saturation rates observed in the simulations against queue length and CAV fraction. We will also add a brief robustness discussion quantifying the performance difference when the dynamic rate is replaced by its static counterpart, thereby illustrating the captured autonomy-driven variations while acknowledging potential unmodeled effects. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The paper extends the standard multi-commodity store-and-forward model with a dynamic queue-responsive saturation rate, casts the resulting optimization as an NQP, and applies under-/over-estimators to obtain an MILP. Performance is assessed via external microscopic simulation against a baseline multi-commodity formulation. No derivation step reduces to a fitted parameter renamed as prediction, no load-bearing self-citation chain, and no self-definitional equivalence (e.g., saturation rate is introduced as an explicit modeling extension and validated empirically rather than presupposed). The outperformance result is therefore not forced by construction but obtained from independent simulation benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard traffic flow modeling assumptions plus the new dynamic saturation construct; no free parameters or invented entities are explicitly quantified in the abstract.

axioms (1)
  • domain assumption The extended multi-commodity store-and-forward model accurately captures queue evolution, spillback, and green time allocation in mixed autonomy settings.
    Invoked as the foundation for the NQP formulation.

pith-pipeline@v0.9.0 · 5512 in / 1128 out tokens · 45348 ms · 2026-05-11T02:38:01.677354+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

49 extracted references · 49 canonical work pages

  1. [1]

    Motorway traffic flow modelling, estimation and control with vehicle automation and communication systems,

    I. Papamichail, N. Bekiaris-Liberis, A. I. Delis, D. Manolis, K.- S. Mountakis, I. K. Nikolos, C. Roncoli, and M. Papageorgiou, “Motorway traffic flow modelling, estimation and control with vehicle automation and communication systems,”Annual Reviews in Control, vol. 48, pp. 325–346, 2019

    work page 2019

  2. [2]

    Freeway traffic management in presence of vehicle automation and communication systems (V ACS),

    M. Papageorgiou, C. Diakaki, I. Nikolos, I. Ntousakis, I. Papamichail, and C. Roncoli, “Freeway traffic management in presence of vehicle automation and communication systems (V ACS),” inRoad Vehicle Automation 2. Springer, 2015, pp. 205–214

    work page 2015

  3. [3]

    A. R. Foxxet al.,Beyond Traffic: 2045 Final Report. United States Department of Transportation, 2017

    work page 2045

  4. [4]

    Distributed signal-free intersection optimization via iterative time slots adjustment for con- nected and automated vehicles,

    F. Vitale, R. Niroumand, and C. Roncoli, “Distributed signal-free intersection optimization via iterative time slots adjustment for con- nected and automated vehicles,”IEEE Open Journal of Intelligent Transportation Systems, vol. 7, pp. 285–303, 2026

    work page 2026

  5. [5]

    Platoons of connected vehicles can double throughput in urban roads,

    J. Lioris, R. Pedarsani, F. Y . Tascikaraoglu, and P. Varaiya, “Platoons of connected vehicles can double throughput in urban roads,”Transporta- tion Research Part C: Emerging Technologies, vol. 77, pp. 292–305, 2017

    work page 2017

  6. [6]

    Integrated optimal traffic flow control enabled by speed and time-gap regulation,

    C. Roncoli, “Integrated optimal traffic flow control enabled by speed and time-gap regulation,” in2019 IEEE Intelligent Transportation Systems Conference (ITSC), 2019, pp. 3763–3769

    work page 2019

  7. [7]

    Routing for traffic networks with mixed autonomy,

    D. A. Lazar, S. Coogan, and R. Pedarsani, “Routing for traffic networks with mixed autonomy,”IEEE Transactions on Automatic Control, vol. 66, no. 6, pp. 2664–2676, 2020

    work page 2020

  8. [8]

    Influence of connected and autonomous vehicles on traffic flow stability and throughput,

    A. Talebpour and H. S. Mahmassani, “Influence of connected and autonomous vehicles on traffic flow stability and throughput,”Trans- portation Research Part C: Emerging Technologies, vol. 71, pp. 143– 163, 2016

    work page 2016

  9. [9]

    Autonomous vehicle implementation predictions,

    T. Litman, “Autonomous vehicle implementation predictions,”Victoria Transport Policy Institute Victoria, BC, Canada, 2017

    work page 2017

  10. [10]

    Automated vehicles and how they may affect urban form: A review of recent scenario studies,

    D. Stead and B. Vaddadi, “Automated vehicles and how they may affect urban form: A review of recent scenario studies,”Cities, vol. 92, pp. 125–133, 2019

    work page 2019

  11. [11]

    A review on energy, environmental, and sustainability implications of connected and automated vehicles,

    M. Taiebat, A. L. Brown, H. R. Safford, S. Qu, and M. Xu, “A review on energy, environmental, and sustainability implications of connected and automated vehicles,”Environmental science & technology, vol. 52, no. 20, pp. 11 449–11 465, 2018

    work page 2018

  12. [12]

    On urban traffic flow benefits of connected and automated vehicles,

    I. Mavromatis, A. Tassi, R. J. Piechocki, and M. Sooriyabandara, “On urban traffic flow benefits of connected and automated vehicles,” in 2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring), 2020

    work page 2020

  13. [13]

    Multi-commodity traffic signal control and routing with connected vehicles,

    F. De Souza, R. C. Carlson, E. R. M ¨uller, and K. Ampountolas, “Multi-commodity traffic signal control and routing with connected vehicles,”IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 5, pp. 4111–4121, 2020

    work page 2020

  14. [14]

    Back-pressure traffic signal control with fixed and adaptive routing for urban vehicular networks,

    A. A. Zaidi, B. Kulcs ´ar, and H. Wymeersch, “Back-pressure traffic signal control with fixed and adaptive routing for urban vehicular networks,”IEEE Transactions on Intelligent Transportation Systems, vol. 17, no. 8, pp. 2134–2143, 2016

    work page 2016

  15. [15]

    Max pressure control of a network of signalized inter- sections,

    P. Varaiya, “Max pressure control of a network of signalized inter- sections,”Transportation Research Part C: Emerging Technologies, vol. 36, pp. 177–195, 2013

    work page 2013

  16. [16]

    Back-pressure based adaptive traffic signal control and vehicle routing with real-time control information update,

    Y . Liu, J. Gao, and M. Ito, “Back-pressure based adaptive traffic signal control and vehicle routing with real-time control information update,” in2018 IEEE International Conference on Vehicular Electronics and Safety (ICVES), 2018, pp. 1–6

    work page 2018

  17. [17]

    An extended linear quadratic model predictive control approach for multi- destination urban traffic networks,

    Y . Han, A. Hegyi, Y . Yuan, C. Roncoli, and S. Hoogendoorn, “An extended linear quadratic model predictive control approach for multi- destination urban traffic networks,”IEEE Transactions on Intelligent Transportation Systems, vol. 20, no. 10, pp. 3647–3660, 2018

    work page 2018

  18. [18]

    Linear-quadratic model predictive control for urban traffic networks,

    T. Le, H. L. Vu, Y . Nazarathy, B. V o, and S. Hoogendoorn, “Linear-quadratic model predictive control for urban traffic networks,” Procedia-Social and Behavioral Sciences, vol. 80, pp. 512–530, 2013

    work page 2013

  19. [19]

    Fast model predic- tive control for urban road networks via milp,

    S. Lin, B. De Schutter, Y . Xi, and H. Hellendoorn, “Fast model predic- tive control for urban road networks via milp,”IEEE Transactions on Intelligent Transportation Systems, vol. 12, no. 3, pp. 846–856, 2011

    work page 2011

  20. [20]

    Efficient network-wide model-based predictive control for urban traffic networks,

    ——, “Efficient network-wide model-based predictive control for urban traffic networks,”Transportation Research Part C: Emerging Technologies, vol. 24, pp. 122–140, 2012

    work page 2012

  21. [21]

    Solving simultaneous route guidance and traffic signal optimization problem using space-phase- time hypernetwork,

    P. Li, P. Mirchandani, and X. Zhou, “Solving simultaneous route guidance and traffic signal optimization problem using space-phase- time hypernetwork,”Transportation Research Part B: Methodological, vol. 81, pp. 103–130, 2015

    work page 2015

  22. [22]

    P. T. Li and X. Zhou, “Recasting and optimizing intersection automa- tion as a connected-and-automated-vehicle (cav) scheduling problem: A sequential branch-and-bound search approach in phase-time-traffic hypernetwork,”Transportation Research Part B: Methodological, vol. 105, pp. 479–506, 2017. 16 SUBMITTED TO IEEE OPEN JOURNAL OF INTELLIGENT TRANSPORTATI...

    work page 2017

  23. [23]

    Dynamic capacity estimation of mixed traffic flows with application in adap- tive traffic signal control,

    Y . Du, A. Kouvelas, W. ShangGuan, and M. A. Makridis, “Dynamic capacity estimation of mixed traffic flows with application in adap- tive traffic signal control,”Physica A: Statistical Mechanics and its Applications, vol. 606, p. 128065, 2022

    work page 2022

  24. [24]

    Capacity modeling and routing for traffic networks with mixed autonomy,

    D. A. Lazar, S. Coogan, and R. Pedarsani, “Capacity modeling and routing for traffic networks with mixed autonomy,” inIEEE 56th Annual Conference on Decision and Control (CDC), 2017, pp. 5678– 5683

    work page 2017

  25. [25]

    Self healing of a mixed autonomy traffic system using reinforcement learning and attention,

    S. Fatima, K. Olav Ellefsen, and L. Moonen, “Self healing of a mixed autonomy traffic system using reinforcement learning and attention,” IEEE Open Journal of Intelligent Transportation Systems, vol. 6, pp. 1200–1220, 2025

    work page 2025

  26. [26]

    Platoonsafe: An integrated simulation tool for evaluating platoon safety,

    S. Hasan, J. Gorospe, S. Girs, A. A. G ´omez, and E. Uhlemann, “Platoonsafe: An integrated simulation tool for evaluating platoon safety,”IEEE Open Journal of Intelligent Transportation Systems, vol. 4, pp. 325–347, 2023

    work page 2023

  27. [27]

    Store-and- forward based methods for the signal control problem in large-scale congested urban road networks,

    K. Aboudolas, M. Papageorgiou, and E. Kosmatopoulos, “Store-and- forward based methods for the signal control problem in large-scale congested urban road networks,”Transportation Research Part C: Emerging Technologies, vol. 17, no. 2, pp. 163–174, 2009

    work page 2009

  28. [28]

    Van Leeuwen,Handbook of theoretical computer science (vol

    J. Van Leeuwen,Handbook of theoretical computer science (vol. A) algorithms and complexity. MIT Press, 1991

    work page 1991

  29. [29]

    A rolling-horizon quadratic-programming approach to the signal control problem in large-scale congested urban road networks,

    K. Aboudolas, M. Papageorgiou, A. Kouvelas, and E. Kosmatopoulos, “A rolling-horizon quadratic-programming approach to the signal control problem in large-scale congested urban road networks,”Trans- portation Research Part C: Emerging Technologies, vol. 18, no. 5, pp. 680–694, 2010

    work page 2010

  30. [30]

    T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein,Introduction to algorithms. MIT press, 2022

    work page 2022

  31. [31]

    Learning the structure of mixed graphical models,

    J. D. Lee and T. J. Hastie, “Learning the structure of mixed graphical models,”Journal of Computational and Graphical Statistics, vol. 24, no. 1, pp. 230–253, 2015

    work page 2015

  32. [32]

    Urbanik, A

    T. Urbanik, A. Tanaka, B. Lozner, E. Lindstrom, K. Lee, S. Quayle, S. Beaird, S. Tsoi, P. Ryus, D. Gettmanet al.,Signal timing manual. Transportation Research Board, 2015

    work page 2015

  33. [33]

    Real-time estimation of lane-to-lane turning flows at isolated signalized junctions,

    S. Lee, S. C. Wong, C. C. C. Pang, and K. Choi, “Real-time estimation of lane-to-lane turning flows at isolated signalized junctions,”IEEE Transactions on Intelligent Transportation Systems, vol. 16, no. 3, pp. 1549–1558, 2014

    work page 2014

  34. [34]

    Estimating turning movements at signalized intersections using artificial neural networks,

    M. S. Ghanim and K. Shaaban, “Estimating turning movements at signalized intersections using artificial neural networks,”IEEE Trans- actions on Intelligent Transportation Systems, vol. 20, no. 5, pp. 1828– 1836, 2018

    work page 2018

  35. [35]

    Real-time turning movement, queue length, and traffic density estimation and prediction using vehicle trajectory and stationary sensor data,

    A. K. Shafik and H. A. Rakha, “Real-time turning movement, queue length, and traffic density estimation and prediction using vehicle trajectory and stationary sensor data,”Sensors, vol. 25, no. 3, p. 830, 2025

    work page 2025

  36. [36]

    Piecewise MILP under-and overestimators for global optimization of bilinear programs,

    D. S. Wicaksono and I. A. Karimi, “Piecewise MILP under-and overestimators for global optimization of bilinear programs,”AIChE Journal, vol. 54, no. 4, pp. 991–1008, 2008

    work page 2008

  37. [37]

    A simplex algorithm for piecewise-linear programming i: Derivation and proof,

    R. Fourer, “A simplex algorithm for piecewise-linear programming i: Derivation and proof,”Mathematical programming, vol. 33, no. 2, pp. 204–233, 1985

    work page 1985

  38. [38]

    Model Predictive Control, 2nd ed

    E. F. Camacho and C. Bordons, “Model Predictive Control, 2nd ed.” 2016. [39]Aimsun Next Traffic Modeling Software, 2025, accessed: Mar. 21,

    work page 2016

  39. [39]

    Available: https://www.aimsun.com

    [Online]. Available: https://www.aimsun.com

    work page

  40. [40]

    A modeling language for mathematical programming,

    R. Fourer, D. M. Gay, and B. W. Kernighan, “A modeling language for mathematical programming,”Management Science, vol. 36, no. 5, pp. 519–554, 1990

    work page 1990

  41. [41]

    Fico xpress optimization suite,

    FICO, “Fico xpress optimization suite,” 2024, fair Isaac Corporation. [Online]. Available: https://www.fico.com/en/products/ fico-xpress-optimization

    work page 2024

  42. [42]

    Modeling cooperative and au- tonomous adaptive cruise control dynamic responses using experimen- tal data,

    V . Milan ´es and S. E. Shladover, “Modeling cooperative and au- tonomous adaptive cruise control dynamic responses using experimen- tal data,”Transportation Research Part C: Emerging Technologies, vol. 48, pp. 285–300, 2014

    work page 2014

  43. [43]

    A behavioural car-following model for computer simula- tion,

    P. G. Gipps, “A behavioural car-following model for computer simula- tion,”Transportation Research Part B: Methodological, vol. 15, no. 2, pp. 105–111, 1981

    work page 1981

  44. [44]

    Heuristic ramp-metering coordination strategy implemented at Monash Freeway, Australia,

    I. Papamichail, M. Papageorgiou, V . V ong, and J. Gaffney, “Heuristic ramp-metering coordination strategy implemented at Monash Freeway, Australia,”Transportation Research Record, vol. 2178, no. 1, pp. 10– 20, 2010

    work page 2010

  45. [45]

    Feedback-based mainstream traffic flow control for multiple bottle- necks on motorways,

    G.-R. Iordanidou, C. Roncoli, I. Papamichail, and M. Papageorgiou, “Feedback-based mainstream traffic flow control for multiple bottle- necks on motorways,”IEEE Transactions on Intelligent Transportation Systems, vol. 16, no. 2, pp. 610–621, 2015

    work page 2015

  46. [46]

    Feedback-based ramp metering and lane-changing control with connected and automated vehicles,

    F. Tajdari, C. Roncoli, and M. Papageorgiou, “Feedback-based ramp metering and lane-changing control with connected and automated vehicles,”IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 2, pp. 939–951, 2020

    work page 2020

  47. [47]

    Parallel computational optimization in operations re- search: A new integrative framework, literature review and research directions,

    G. Schryen, “Parallel computational optimization in operations re- search: A new integrative framework, literature review and research directions,”European Journal of Operational Research, vol. 287, no. 1, pp. 1–18, 2020

    work page 2020

  48. [48]

    Gurobi Optimizer Reference Manual,

    Gurobi Optimization, LLC, “Gurobi Optimizer Reference Manual,”

    work page

  49. [49]

    [Online]. Available: https://www.gurobi.com Haris Muhammadis a Doctoral Researcher at the Department of Built Environment, Aalto Uni- versity, Finland, where he is pursuing a Doctor of Science (Technology) in the School of En- gineering. He previously obtained his Master’s degree in Electrical and Computer Engineering from King Abdullah University of Scie...

    work page