MétaCan
Menu
Back to cohort
Record W4327700136 · doi:10.1287/mnsc.2023.4731

Scaling Up Electric-Vehicle Battery Swapping Services in Cities: A Joint Location and Repairable-Inventory Model

2023· article· en· W4327700136 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

aboutThe title or abstract carries a Canadian signal from the geographic lexicon.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueManagement Science · 2023
Typearticle
Languageen
FieldEngineering
TopicElectric Vehicles and Infrastructure
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceBattery (electricity)Swap (finance)SolverPoolingCharging stationOperations researchElectric vehicleMathematical optimizationPower (physics)EngineeringBusiness

Abstract

fetched live from OpenAlex

Battery swapping for electric vehicle refueling is reviving and thriving. Despite a captivating sustainable future where swapping batteries will be as convenient as refueling gas today, a tension is mounting in practice (beyond the traditional “range anxiety” issue): On one hand, it is desirable to maximize battery proximity and availability to customers. On the other hand, capacitated urban power grids may curb decentralized charging at a slow speed. To reconcile this tension, some cities are embracing an emerging infrastructure network: Decentralized swapping stations replenish charged batteries from centralized charging stations. It remains unclear how to design such a network or whether pooling charging demands will save costs or batteries. In this paper, we model this new urban infrastructure network. This task is complicated by non-Poisson swaps and by the intertwined stochastic operations of swapping, charging, stocking, and circulating batteries among swapping and charging stations. We tackle these complexities by deriving analytical models, which enrich the classical batched repairable-inventory theory. We next propose a joint location and repairable-inventory model for citywide deployment of hub charging stations, with a nonconvex nonconcave objective function. We solve this problem exactly by exploiting submodularity and combining constraint-generation and parameter-search techniques. Even for solving convexified problems, our algorithm brings a speedup of at least three orders of magnitude relative to the Gurobi solver. The major insight is twofold: The benefit of pooling charging demands alone is not enough to justify the adoption of the “swap-locally, charge-centrally” network; instead, the main justification is that faster charging accessible at centralized charging stations significantly reduces the system-wide battery stock level. In a broader sense, this work deepens our understanding of how mobility and energy are coupled toward enabling smart cities. This paper was accepted by Chung Piaw Teo, optimization. Funding: Y. Zhang acknowledges the support from the National Natural Science Foundation of China [Grants 71871023, 72271029, and 72061127001]. W. Qi acknowledges the support from the National Natural Science Foundation of China [Grants 72272014 and 72188101] and the Natural Sciences and Engineering Research Council of Canada [Grant RGPIN-2019-04769]. N. Zhang acknowledges the support from the China Scholarship Council [202106030140]. Supplemental Material: The data files and online appendices are available at https://doi.org/10.1287/mnsc.2023.4731 .

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.030
Threshold uncertainty score0.448

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.011
GPT teacher head0.208
Teacher spread0.197 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it