Aug 2026· Sustainability· Vol 18, pp. 8175· 0 citations· 51 references
Abstract
Urban battery swapping station (BSS) planning is difficult because site opening, service-module allocation, user assignment, battery degradation pressure, travel burden, and congestion are tightly coupled. A plan that minimizes investment alone may create long queues, whereas a plan that only reduces waiting can overbuild costly and underused capacity. This study formulates the urban BSS siting–sizing problem as an operation-aware mixed-integer nonlinear model and evaluates feasible plans with payoff-table global-criterion normalization. To search this rugged planning space, we propose a Stable Portfolio Hyper-Heuristic (SPHH) that combines Greedy construction, BO-guided large-neighborhood search, simulated annealing, and optimized annealing with reheating, followed by feasible-incumbent preservation and non-worsening post-processing. The formal campaign contains 18 synthetic cases, 10 independent repeats, and five algorithms, yielding 900 optimization records. Across the 18 cases, SPHH produced the lowest mean GC score and reduced the mean GC value on average relative to the baseline algorithms. Nonparametric Friedman and Holm-adjusted Wilcoxon tests confirmed statistically significant differences among methods, although the advantage over the strongest baseline was not universal. These results indicate that SPHH is most useful as an offline planning selector that improves recommendation stability when additional computation is acceptable, rather than as a universally faster optimizer.
The increasing penetration of electric vehicles (EVs) creates new challenges for coordinated planning of charging and battery-swapping infrastructure. This study aims to develop a joint location and capacity planning framework for electric vehicle charging stations (EVCSs) and electric vehicle swapping stations (EVSSs)...
Zi-Han Li, Bo Yang, Huanming Zhang et al.· Algorithms· 0 citations
Electric vehicle adoption requires routing strategies that address travel efficiency and battery-energy constraints. This study develops a Multi-Objective Electric Vehicle Routing Problem (EVRP) model for two-wheeled electric ride-hailing services in Medan City, Indonesia. The model minimizes total travel distance and...
Widya Afriani, Fibri Rakhmawati· Journal of Computers and Dig...· 0 citations
Electric vehicles (EVs) are crucial for mitigating greenhouse gas emissions in urban transportation. However, their integration requires efficient charging infrastructure and allocation strategies. In this paper, five heuristic algorithms were developed to allocate EVs to urban charging stations. This allocation proces...
Luiz Virgilio Bozzi Aranda, Mário Mestria· World Electric Vehicle Journ...· 0 citations
Transmission expansion planning (TEP) for renewable-rich power systems requires a computational workflow that links investment decisions with chronological operations and nodal economic signals. This study presents a shadow price-guided framework integrating hourly DC optimal power flow, multi-hour candidate screening,...
Overnight rebalancing in dock-based bike-sharing systems requires routing a limited fleet of trucks before user activity begins. This article formulates static rebalancing problem under stochastic demand uncertainty as a bi-objective combinatorial optimization problem that selects truck routes and visited stations. The...
D. Pedroza-Perez, Gabriel Luque, S. Nesmachnow et al.· Journal of combinatorial opt...· 0 citations
Solid waste disposal scheduling coordinates waste generation, facility capacities, fleet resources, treatment compatibility, disposal priorities, and environmental costs over multiple periods. The deterministic model considered in this study is a continuous linear program with a convex polyhedral feasible region. To pr...