ArticleScientific reports2025
A bi-decision model for electric vehicle dispatch and battery swapping station charging schedule problem.
Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
Abstract
The blooming population and advanced technology of electric vehicles (EVs) have promoted the wide studies on battery swapping station (BSS) models. However, current BSS researches only focus on isolated decision models, such as the dispatching model or charging schedule model, which cannot represent the realistic situation and obtain the optimal solution for both the EV drivers and BSS operators. In this paper, a bi-decision model for EV dispatch and BSS charging schedule problem is proposed to minimize the average extra time (ET) through the assigned BSS for EVs, and optimize the electricity cost, charging damage to batteries, and power load variance for BSSs, where the solution in the first decision is the pre-defined condition of the second decision model. Knowing that two models are both Non-deterministic Polynomial-time hard (NP-hard) problems, two types of evolutionary algorithms are proposed. In the first model, an adaptive tabu search (ATS) algorithm is proposed by formatting the EVs' ET, the number of batteries, and queuing EVs at BSSs. In the second model, a multi-objective particle swarm optimization (MOPSO) algorithm is proposed to obtain the Pareto set of the complicated scheduling problem. Experiments are carried out to investigate the viability of the bi-decision model by comparing it with rule-based strategies, such as nearest-in-range. Also, the waiting times in the first decision and the scheduling results are illustrated in the Gantt charts. Lastly, a comprehensive comparison between the proposed ATS algorithm and the MOPSO algorithm is presented to show the effectiveness and competitiveness.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.