SearcharxivSearch

arXiv · 2509.05940

An Integrated Optimization Framework for Smart Charging of Electric Bus Fleets under Dynamic Electricity Prices with On-Site Solar Generation, Energy Storage, and V2G operations

Abstract

The rapid electrification of city bus fleets presents public transportation operators (PTOs) with the complex challenge of managing charging operations to minimize energy costs. Most existing studies on electric bus (EB) charging management rely on a discrete-time-based discretization approach, which is operationally unrealistic and limits their scalability for realistic applications. This study proposes a discrete-event optimization (DEO) approach for daily EB fleet charging management that considers peak power charges, photovoltaic (PV) generation with an energy storage system (ESS), vehicle-to-grid (V2G) operations, and battery degradation costs. We apply the DEO approach to a real-world case in Brussels involving 28 articulated EBs and 232 trips. A set of parametric instances is used to assess computational scalability. The results demonstrate that the DEO formulation can solve instances of realistic size within practical computation times with tight optimality gaps. A thorough cost analysis was conducted to evaluate the added value of V2G benefits and on-site PV generation. Key findings indicate that incorporating demand charges into the optimization reduces daily costs by 5% and decreases the share of peak power costs by 9%, underscoring the importance of load management. Integrating PV and ESS results in a total net cost reduction of up to 56%, with ESS primarily used for energy arbitrage rather than direct bus charging. V2G participation is highly sensitive to battery degradation costs and policy incentives. Combining all extensions results in a 58% reduction in total operational expenses compared to the baseline, demonstrating the significant value of smart (dis)charging tools for PTOs.

Explore related subjects

Keep this discovery

BibTeXRIS

Louise Caustur, Penelope Hertoghe, Tai-Yu Ma, Martina Vandebroek. 2025-09-07. An Integrated Optimization Framework for Smart Charging of Electric Bus Fleets under Dynamic Electricity Prices with On-Site Solar Generation, Energy Storage, and V2G operations. https://arxiv.org/abs/2509.05940

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

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC