Combined Stochastic and Robust Optimization for Electric Autonomous Mobility-on-Demand with Nested Benders Decomposition
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Robotics Radio. Generated commentary on the latest robotics and control papers.
Rosa: We're looking at the paper: "Combined Stochastic and Robust Optimization for Electric Autonomous Mobility-on-Demand with Nested Benders Decomposition".
Dev: Here's the gist of the paper. The gist: A combined stochastic and robust model predictive control framework for electric autonomous mobility-on-demand (EAMoD) systems jointly optimizes dispatch, rebalancing, charging, and V2G decisions under multiple uncertainties.
Rosa: Framework Overview The proposed framework integrates spatio-temporal Bayesian neural network forecasts with a multi-stage stochastic optimization model formulated as a large-scale mixed-integer linear program The framework uses Bayesian Neural Networks (BNNs) to produce calibrated probabilistic forecasts of travel demand and charger availability, capturing both spatial and temporal correlations These forecasts are used to generate a multi-stage scenario tree, which is then reduced using a clustering-based technique that efficiently handles multiple sources of uncertainty The resulting large-scale Mixed-Integer Linear Program (MILP) is solved using a tailored Nested Benders Decomposition (NBD) algorithm that exploits the scenario tree structure and enables parallelized computation.
Dev: Uncertainty Modeling and Scenario Reduction The system addresses four sources of uncertainty: travel demand, charger availability, energy consumption, and travel time Travel demand and charger availability are modeled by a scenario tree that encodes multiple realizations of the random variables and their evolution over time The uncertainty in energy consumption and travel time is handled through chance-constrained parameterization of the model parameters, ensuring operational feasibility with high probability.
Rosa: To handle the complexity of scenario trees, a clustering-based technique is employed to reduce the number of scenarios, preserving key patterns of future uncertainty The method involves sampling future values conditionally using the predictive model and applying soft k-means clustering to obtain representative centroids for each time stage.
Paper summary: Dev: Basically, the authors tackle this challenge with a combined stochastic and robust model predictive control MPC framework. It integrates spatio-temporal Bayesian neural network forecasts with a multi-stage stochastic optimization model that's formulated as a large-scale mixed-integer linear program. Rosa That means they use these neural network forecasts to build a scenario tree, and then they use that tree to run the optimization. Dev And because it’s so big, they use a tailored Nested Benders Decomposition algorithm to make sure it can actually run in real time.
Taro: So the thesis is using these Bayesian neural networks for forecasts of travel demand and charger availability, while robust constraints on energy consumption and travel times keep things feasible under the worst-case realizations. Rosa That’s a lot of uncertainty they're trying to handle at once, right? Dev Right. The scenario modeling part is interesting because constructing reduced scenario trees that faithfully represent multivariate, temporally correlated uncertainties remains computationally demanding and most existing reduction techniques are limited to single sources of uncertainty or don't preserve the filtration structure of the stochastic process <ref:2508.19933#pg3>.
Taro: They address that by using a clustering-based technique to reduce those scenarios, which they say preserves key patterns of future uncertainty <ref:2508.19933#pg3>. Rosa And then the optimization itself is formulated as a sequence of nested two-stage subproblems with a master problem coordinating the solution process via Benders cuts <ref:2508.19933#pg2>. Dev That nested structure is what makes it computationally tractable for real-time operations, which they say is the major challenge when dealing with temporal dependencies in EAMoD applications <ref:2508.19933#pg3>.
Rosa: So the overall claim of this paper is that this combined approach offers a way to anticipate demand and infrastructure variability while ensuring operational feasibility under those worst-case scenarios <ref:2508.19933#pg2>. Dev And they test this using high-fidelity simulations in San Francisco and Chicago <ref:2508.19933#pg1>.
Conclusion: Rosa: So, looking at the full paper "Combined Stochastic and Robust Optimization for Electric Autonomous Mobility-on-Demand with Nested Benders Decomposition" by Jacobsen, Kulcsár, and Lindman, the main thing to grasp is how they combine predictive control with uncertainty modeling. Dev They show that this combined stochastic and robust approach reduces median passenger waiting times by up to thirty-six percent <ref:2508.19933#pg1> and 95th-percentile delays by nearly twenty percent <ref:2508.19933#pg1>.
Taro: Plus, they also lower rebalancing distance by twenty-seven percent <ref:2508.19933#pg1> and electricity costs by more than thirty-five percent <ref:2508.19933#pg1>. Rosa That’s a lot of tangible improvement over the deterministic, reactive, and robust baselines they compared it against <ref:2508.19933#pg1>. Dev And their sensitivity analysis on battery size and vehicle efficiency showed something specific about different vehicle types <ref:2508.19933#pg1>.
Dev: They found that for energy-efficient vehicles, like Vehicle one wait times stay stable even with small batteries <ref:2508.19933#pg1>. But for less efficient vehicles, Vehicle three they need larger batteries and more infrastructure support to keep delays down <ref:2508.19933#pg1>. Rosa So what this means for the world is that it emphasizes the importance of jointly optimizing predictive control, vehicle capabilities, and infrastructure planning for scalable operations <ref:2508.19933#pg1>. Taro It gives us a computationally tractable pathway to integrate predictive uncertainty modeling and energy-aware fleet control in next-generation autonomous mobility systems <ref:2508.19933#pg1>.
Sten Elling Tingstad Jacobsen, Balžs Kulcsır, Anders Lindman
Department of Electrical Engineering, Chalmers University of Technology · Volvo Cars
eess.SY, cs.SY
Submitted: 2025-08-27
Updated: 2026-04-13
Comments: 32 pages, 12 figures
DOI: 10.1016/j.trc.2026.105903
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 87/100
The gist: The gist: A combined stochastic and robust model predictive control framework for electric autonomous mobility-on-demand (EAMoD) systems jointly optimizes dispatch, rebalancing, charging, and V2G
Key concepts
- Bayesian Neural Networks (BNNs)
- These are AI models used to create probabilistic forecasts for travel demand and charger availability. They are powerful because they don't just give one answer; they provide a range of likely outcomes, helping the system understand the uncertainty in future conditions across different locations and times.
- Nested Benders Decomposition (NBD)
- This is a specialized mathematical technique used to solve very large optimization problems efficiently. It breaks down the complex problem into smaller, manageable parts that are solved iteratively. This method is particularly effective for handling the specific structure of the scenario tree generated by the forecasting models.
- Stochastic and Robust Optimization
- This approach combines two methods: stochastic optimization anticipates uncertainty (like demand variability) using probability distributions, while robust optimization ensures solutions remain feasible even in the worst-case scenarios (like extreme travel times or energy consumption). This dual approach makes the control system reliable.
- Scenario Tree and Reduction
- A scenario tree maps out all possible future combinations of uncertain events (demand, chargers) over time. Since this tree can be too large, a clustering technique is used to reduce it to representative scenarios that capture the most important patterns of uncertainty without losing critical information.
Terminology
Summary
The gist: A combined stochastic and robust model predictive control framework for electric autonomous mobility-on-demand (EAMoD) systems jointly optimizes dispatch, rebalancing, charging, and V2G decisions under multiple uncertainties.
Framework Overview
The proposed framework integrates spatio-temporal Bayesian neural network forecasts with a multi-stage stochastic optimization model formulated as a large-scale mixed-integer linear program The framework uses Bayesian Neural Networks (BNNs) to produce calibrated probabilistic forecasts of travel demand and charger availability, capturing both spatial and temporal correlations These forecasts are used to generate a multi-stage scenario tree, which is then reduced using a clustering-based technique that efficiently handles multiple sources of uncertainty The resulting large-scale Mixed-Integer Linear Program (MILP) is solved using a tailored Nested Benders Decomposition (NBD) algorithm that exploits the scenario tree structure and enables parallelized computation.
Uncertainty Modeling and Scenario Reduction
The system addresses four sources of uncertainty: travel demand, charger availability, energy consumption, and travel time Travel demand and charger availability are modeled by a scenario tree that encodes multiple realizations of the random variables and their evolution over time The uncertainty in energy consumption and travel time is handled through chance-constrained parameterization of the model parameters, ensuring operational feasibility with high probability. To handle the complexity of scenario trees, a clustering-based technique is employed to reduce the number of scenarios, preserving key patterns of future uncertainty The method involves sampling future values conditionally using the predictive model and applying soft k-means clustering to obtain representative centroids for each time stage.
Optimization and Decomposition
The multi-stage SMPC problem is formulated as a sequence of nested two-stage subproblems, with a master problem (MP) coordinating the solution process by integrating Benders cuts derived from the duals of the subproblems The NBD procedure is executed in a forward–backward iterative scheme, commonly referred to as fastforward–fast-back sequencing The master problem inherits all structural constraints from the SMPC formulation, including flow conservation, imbalance dynamics, charger capacity, and non-anticipativity. The problem is nearly totally unimodular (TU), but two constraints break TU, necessitating explicit integrality on variables like x p i j b t.
Performance and Results
Simulation results in San Francisco and Chicago demonstrate significant improvements over deterministic, reactive, and robust baselines Compared with baseline methods, the combined stochastic and robust approach reduces median passenger waiting times by up to 36% and 95th-percentile delays by nearly 20%, while also lowering rebalancing distance by 27% and electricity costs by more than 35%. The Bayesian Neural Field forecasting model was shown to outperform established baselines in both point accuracy and calibrated uncertainty quantification For instance, in Chicago, the SMPC achieves the lowest passenger delays compared to DMP (Deterministic Mean Prediction Optimization).
Sensitivity Analysis Insights
A sensitivity analysis of battery size and vehicle energy efficiency reveals that for energy-efficient vehicles like Vehicle 1, wait times remain nearly constant across all battery sizes, indicating that Vehicle 1’s service quality is not constrained by battery size. Conversely, less efficient vehicles (Vehicle 3) are highly sensitive to battery capacity, with a larger battery significantly mitigating severe delays and reducing the number of trips exceeding 600 s. The analysis also shows that for V2G services, Vehicle 1 is the most attractive option because its lower consumption leaves more capacity for grid interaction.
This paper provides a scalable and computationally tractable pathway for integrating predictive uncertainty modeling and energy-aware fleet control in next-generation autonomous mobility systems. The framework's key methodological contribution is the tailored Nested Benders Decomposition algorithm, which exploits the scenario tree structure to solve large-scale multi-stage mixed-integer problems with temporally correlated uncertainties. Future research may explore scenario tree construction based on the nested distance [30] and alternative approaches to the terminal cost formulation. The proposed framework provides a scalable and computationally tractable pathway for integrating predictive uncertainty modeling and energy-aware fleet control in next-generation autonomous mobility systems.
--- Page 1 ---
Highlights
Combined Stochastic and Robust Optimization for Electric Autonomous Mobility-on-Demand with Nested Benders Decomposition
Sten Elling Tingstad Jacobsen, Balázs Kulcsár, Anders Lindman
• Stochastic and robust control model manages demand, energy, time, and charging uncertainties
• Bayesian neural networks generate multivariate travel and charging demand scenarios
• Scenario reduction via soft clustering preserves key patterns of future uncertainty
• Tailored Nested Benders decomposition efficiently solves the large-scale MILP model
• Simulation results show reduced costs and improved reliability over baseline methods
--- Page 2 ---
Combined Stochastic and Robust Optimization for Electric Autonomous Mobility-on-Demand with Nested Benders Decomposition
Decomposition
Sten Elling Tingstad Jacobsena,b,∗,1, Balázs Kulcsára and Anders Lindmanb aDepartment of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden bVolvo Cars, Gothenburg, Sweden A R T I C L E I N F O Keywords: Nested Benders decomposition electric autonomous mobility-on-demand Bayesian neural networks scenario tree scenario reduction charging scheduling connected and autonomous vehicles A B S T R A C T The electrification and automation of mobility are reshaping how cities operate on-demand transport systems. Managing Electric Autonomous Mobility-on-Demand (EAMoD) fleets effectively requires coordinating dispatch, rebalancing, and charging decisions under multiple uncertainties, including travel demand, travel time, energy consumption, and charger availability We address this challenge with a combined stochastic and robust model predictive control (MPC) framework The framework integrates spatio-temporal Bayesian neural network forecasts with a multi-stage stochastic optimization model, formulated as a large-scale mixed-integer linear program To ensure real-time applicability, we develop a tailored Nested Benders Decomposition that exploits the scenario tree structure and enables efficient parallelized solution Stochastic optimization is employed to anticipate demand and infrastructure variability, while robust constraints on energy consumption and travel times safeguard feasibility under worst-case realizations We evaluate the framework using high-fidelity simulations of San Francisco and Chicago Compared with deterministic, reactive, and robust baselines, the combined stochastic and robust approach reduces median passenger waiting times by up to 36% and 95th-percentile delays by nearly 20%, while also lowering rebalancing distance by 27% and electricity costs by more than 35% We also conduct a sensitivity analysis of battery size and vehicle efficiency, finding that energy-efficient vehicles maintain stable performance even with small batteries, whereas less efficient vehicles require larger batteries and greater infrastructure support
--- Page 3 ---
Stochastic and Robust Optimization for EAMoD vehicle allocation without considering the complexities introduced by electric vehicles, such as limited battery range and charging infrastructure constraints [7] Those that incorporate charging often treat it separately from dispatch and rebalancing, or rely on deterministic forecasts that fail to account for the full range of future uncertainty [8, 9].
Improvements for AI systems
-
Begin optimizing Electric Autonomous Mobility-on-Demand (EAMoD) fleets by jointly optimizing dispatch, rebalancing, charging, and vehicle-to-grid (V2G) operations under four uncertainties: travel demand, charger availability, energy consumption, and travel time. This unified formulation ensures that decisions are made considering both predictive control and worst-case feasibility guarantees.
-
Implement a Bayesian Neural Network (BNN) based probabilistic forecasting pipeline to generate calibrated distributions for travel demand and charger availability, capturing both spatial and temporal correlations in the data. These forecasts form the basis for a scenario tree, which is then reduced using soft k-means clustering to maintain computational tractability while preserving key uncertainty patterns.
-
Employ a tailored Nested Benders Decomposition (NBD) algorithm that exploits the scenario tree structure to efficiently solve large-scale mixed-integer linear programs (MILPs) in real time. This decomposition enables parallelized solution of subproblems, making the optimization applicable for dynamic, receding horizon control in EAMoD systems.
-
Integrate robust chance constraints on energy consumption and travel time into the model parameters to safeguard feasibility under worst-case realizations. This ensures that operational constraints are met with high probability (e.g., 1 - epsilon t), providing a level of reliability beyond purely deterministic models.
-
Use adaptive terminal cost parameterization based on day-ahead electricity prices to dynamically adjust the terminal cost during receding horizon iterations. This allows the system to coordinate charging schedules over daily time scales by incentivizing immediate charging when future electricity prices are expected to rise and deferring charging when they are expected to fall.
-
Develop an energy consumption estimation module within the simulation environment that uses detailed speed profiles to estimate energy usage, which is then used in the flow conservation constraints. This ensures the model accurately reflects real-world driving conditions and operational costs during high-fidelity simulations like San Francisco and Chicago case studies.
-
Incorporate a sensitivity analysis framework investigating battery size and vehicle efficiency to guide fleet design. This analysis reveals that energy-efficient vehicles can maintain stable performance with smaller batteries, while less efficient vehicles require larger batteries to achieve acceptable service quality, informing both vehicle selection and infrastructure planning.
Sources
Related papers
- One Request, Multiple Experts: LLM Orchestrates Domain Specific Models via Adaptive Task Routing
- A Geometric Decision Procedure for STL Feasibility and Repair
- Scaling up statistical model checking of cyber-physical systems via algorithm ensemble and parallel simulations over HPC infrastructures
- From Asymptotic to Designer-Assigned-Time Control: A Review of Stability Notions, Design Mechanisms, and Controller Architectures
- Battery Second Life: A Review of Experimental Studies
- Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems