Mobile Energy Storage Sizing and Allocation for Multi-Services in Power Distribution Systems
Bibliographic record
Abstract
A mobile energy storage system (MESS) is a localizable transportable storage system that provides various utility services. These services include load leveling, load shifting, losses minimization, and energy arbitrage. A MESS is also controlled for voltage regulation in weak grids. The MESS mobility enables a single storage unit to achieve the tasks of multiple stationary units at different locations. The MESS is connected to the grid at specific substations (or buses) known as MESS stations. This paper proposes an optimization algorithm for sizing and allocation of a MESS for multi-services in a power distribution system. The design accounts for load variation, renewable resources intermittency, and market price fluctuations. A realistic dynamic model for the MESS is adopted to consider the capacity and lifetime constraints. A detailed network power flow model is utilized to include voltage constraints, feeders, and transformers ampacity in the problem formulation. By considering all these constraints, the resulting sizing problem is a mixed-integer nonlinear problem. This paper presents the problem formulation and proposes a solution using a hybrid optimization technique. The adopted technique is based on the particle swarm algorithm and mixed-integer convex programming. A case study is conducted on a real 41-bus radial feeder to validate the proposed sizing technique, and investigate the MESS profitability to the system operator.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".