Search arXivSearch

arXiv · 2501.05939

Designing a Robust and Cost-Efficient Electrified Bus Network with Sparse Energy Consumption Data

Abstract

This paper addresses the challenges of charging infrastructure design (CID) for electrified public transport networks using Battery Electric Buses (BEBs) under conditions of sparse energy consumption data. Accurate energy consumption estimation is critical for cost-effective and reliable electrification but often requires costly field experiments, resulting in limited data. To address this issue, we propose two mathematical models designed to handle uncertainty and data sparsity in energy consumption. The first is a robust optimization model with box uncertainty, addressing variability in energy consumption. The second is a data-driven distributionally robust optimization model that leverages observed data to provide more flexible and informed solutions. To evaluate these models, we apply them to the Rotterdam bus network. Our analysis reveals three key insights: (1) Ignoring variations in energy consumption can result in operational unreliability, with up to 55\% of scenarios leading to infeasible trips. (2) Designing infrastructure based on worst-case energy consumption increases costs by 67\% compared to using average estimates. (3) The data-driven distributionally robust optimization model reduces costs by 28\% compared to the box uncertainty model while maintaining reliability, especially in scenarios where extreme energy consumption values are rare and data exhibit skewness. In addition to cost savings, this approach provides robust protection against uncertainty, ensuring reliable operation under diverse conditions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sara Momen, Yousef Maknoon, Bart van Arem, Shadi Sharif Azadeh. 2025-01-10. Designing a Robust and Cost-Efficient Electrified Bus Network with Sparse Energy Consumption Data. https://arxiv.org/abs/2501.05939

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC