Search arXivSearch

arXiv · 2410.23387

A Dynamic Strategic Plan for the Transition to a Clean Bus Fleet using Multi-Stage Stochastic Programming with a Case Study in Istanbul

Abstract

In recent years, the transition to clean bus fleets has accelerated. Although this transition might bring environmental and economic benefits, it requires a long-term strategic plan due to the large investment costs involved. This paper proposes a multi-stage stochastic program to optimize strategic plans for the clean bus fleet transition that explicitly considers the uncertainty scenarios in the cost and efficiency improvements of clean buses. Our optimization model minimizes the total expected cost subject to emission targets, budget restrictions and several other operational considerations. We propose a new forecasting approach that captures the correlation between these improvements to obtain realistic future pathways for Battery Electric Buses (BEBs) and Hydrogen Fuel Cell Buses (HFCBs), which are then given to the multi-stage stochastic program as scenarios. We also utilize a physics-based model for BEBs to accurately capture their energy consumption and recharging needs. As a case study, we focus on the complex public bus network of Istanbul, which aims to transition to a clean bus fleet by 2050. Utilizing real datasets, we solve a five-stage stochastic program spanning a 25-year planning horizon that involves 256 scenarios to obtain dynamic strategic plans that can be used by the policy makers. Our results suggest that BEBs are more advantageous than HFCBs, even in slow BEB but fast HFCB development scenarios. We also conduct several sensitivity analyses to understand the effects of the intermediate emission targets, budget limitations and energy prices.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Neman Karimi, Burak Kocuk, Tugce Yuksel. 2024-10-30. A Dynamic Strategic Plan for the Transition to a Clean Bus Fleet using Multi-Stage Stochastic Programming with a Case Study in Istanbul. https://arxiv.org/abs/2410.23387

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

KEEP EXPLORING

Related papers

The Riemannian Convex Bundle Method

We introduce the convex bundle method to solve convex, non-smooth optimization problems on Riemannian manifolds of bounded sectional curvature. Each step of our method is based on a model that involves the convex hull of previously collected subgradients, parallelly transported into the current serious iterate. This approach generalizes the dual form of classical bundle subproblems in Euclidean space. We prove that, under mild conditions, the convex bundle method converges to a minimizer. Several numerical examples implemented using Manopt$.$jl illustrate the performance of the proposed method and compare it to the subgradient method, the cyclic proximal point algorithm, as well as the proximal bundle method.

math.OC

Omega-Limit Sets and Input-to-State Stability in Power Grids With Switching Equilibria

This paper studies a power transmission system with both conventional generators (CGs) and distributed energy assets (DEAs) providing frequency control. We consider an operating condition with demand aggregating two dynamic components: one that switches between different values on a finite set, and one that varies smoothly over time. Such dynamic operating conditions may result from protection scheme activations, external cyber-attacks, or due to the integration of dynamic loads, such as data centers. Mathematically, the dynamics of the resulting system are captured by a system that switches between a finite number of vector fields -- or modes--, with each mode having a distinct equilibrium point induced by the demand aggregation. To analyze the stability properties of the resulting switching system, we leverage tools from hybrid dynamic inclusions and the concept of $Ω$-limit sets from sets. Specifically, we characterize a compact set that is semi-globally practically asymptotically stable under the assumption that the switching frequency and load variation rate are sufficiently slow. For arbitrarily fast variations of the load, we use a level-set argument with multiple Lyapunov functions to establish input-to-state stability of a larger set and with respect to the rate of change of the loads. The theoretical results are illustrated via numerical simulations on the IEEE 39-bus test system.

math.OC

Cellular flow control design for mixing based on the least action principle

We consider a novel approach for the enhancement of fluid mixing via pure stirring strategies building upon the Least Action Principle (LAP) for incompressible flows. The LAP is formally analogous to the Benamou--Brenier formulation of optimal transport, but imposes an incompressibility constraint. Our objective is to find a velocity field, generated by Hamiltonian flows, that minimizes the kinetic energy while ensuring that the initial scalar distribution reaches a prescribed degree of mixedness by a finite time. This formulation leads to a ``point-to-set" type of optimization problem which relaxes the requirement on controllability of the system compared to the classic LAP framework. In particular, we assume that the velocity field is induced by a finite set of cellular flows that can be controlled in time. To establish finite time feasibility, we introduce an operator-theoretic switching argument that combines the long-time cellular flow mixing result with the von Neumann alternating-projection theorem. We then leverage the direct method to establish the existence of an optimal solution. Finally, we derive the corresponding optimality conditions for the time-dependent control problem and conduct numerical experiments demonstrating the effectiveness of the proposed control design.

math.OC