Pith. sign in

REVIEW 3 major objections 6 minor 12 references

Optimal charging guidance strategies for electric vehicles by considering dynamic charging requests in a time-varying road network

T0 review · 3 major / 6 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims that two online assignment rules—shortest driving distance and charging-station balance—can guide dynamic EV charging requests in a time-varying road network while preserving reachability, and that the balance rule keeps…

desk verdict A clearly written but modest EV charging guidance paper whose default simulation is plausible, but whose parameter-analysis claim that CSB stabilizes tense states is contradicted by the paper's own queue dynamics. read the letter →

arxiv 1908.03670 v1 pith:LS2NIV7G submitted 2019-08-10 eess.SY cs.SY

Yongxing Wang , Jun Bi This is my paper · ORCID
classification eess.SYcs.SY
keywords electricvehiclechargingguidancedynamicrequeststime-varyingroadnetworkstationbalancereachabilityshortestdrivingdistancestabilitySiouxFalls
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that two simple per-request assignment rules can handle electric-vehicle charging requests that arrive online, in a road network whose link travel times and energy consumption change from one time slot to the next. The first rule, SDD, sends each driver to a reachable charging station that minimizes the remaining driving distance to the destination. The second rule, CSB, sends each driver to a reachable station that currently has the fewest vehicles. Using simulation on a 24-node test network, the authors argue that both rules preserve the reachability of every selected station, and that CSB keeps station occupancy balanced and stable even over long time horizons, while SDD can overload some stations and become unstable under tense charging conditions.

What carries the argument

The machinery is a per-time-slot charging assignment procedure built on a time-varying road network $G=(V,A,\tau_a^t,E_a^t)$, where each link has a driving time and an energy consumption that are drawn anew each slot. At every slot, the strategy first computes minimum energy consumption $E_t(i,j)$ between each requesting node and each station, keeps only stations with $E_t(i,j)\le e_i^t$, and then selects among those using either the SDD rule $\min l(j,d_i^t)$ or the CSB rule $j^*=\arg\min_j U_j^t$. A dynamic recursive equation, $U_j^t=U_j^{t-1}+\sum_i x_{ij}^{t'}-S_j^t$, tracks the number of EVs in each station, with arrivals tied to departure time through $t=t''+\tau_{ij}^{t''}$, and geometric departure events are used to reflect station charging levels.

What would settle it

Pick a request whose minimum-energy route to a station crosses at least two time slots. Recompute the arrival time recursively as $t_{\text{next}}=t_{\text{current}}+\tau_a^{t_{\text{current}}}$ and the remaining energy as $e_{\text{next}}=e_{\text{current}}-E_a^{t_{\text{current}}}$, using each link's state at the slot the EV actually enters it. If the station is reachable in the paper's departure-slot calculation but this slot-by-slot update makes remaining energy negative before arrival, the reachability guarantee fails.

Watch

Extended reading notes

Core claim

The central claim is that a charging-operating centre can solve dynamic charging requests slot by slot using reachability filtering followed by a simple objective, and that both proposed objectives—shortest driving distance (SDD) and minimum station vehicle count (CSB)—guarantee that every assigned charging station is reachable with the EV's remaining energy. The paper further claims, based on simulation, that CSB has a significant advantage in vehicle balance among charging stations, especially when the time horizon is long. In the simulated Sioux Falls network, the extreme gap in maximum station occupancy stays near 7 under CSB but grows to 48 under SDD at the longest tested horizon, and SDD becomes unstable under parameter combinations that combine high request rates with low charging rates. From this, the authors recommend CSB for tense charging states and SDD for relaxed charging states.

Load-bearing premise

The load-bearing premise is that each road link's travel time and energy consumption, observed at the start of a time slot, stay fixed while the EV crosses that link; since a route can span several slots and link values are drawn anew each slot, the reachability check uses departure-slot values for the entire trip.

Editorial extensions

If this is right

  • If CSB is used, the maximum number of EVs waiting at any station stays relatively uniform across stations, with extreme gaps around 7 in the tested setting, even at time horizon $10^6$.
  • If SDD is used under tense charging states—small $\mu$ and large $\lambda$—at least one charging station can become unstable, so those parameter regimes should be avoided under the SDD rule.
  • In relaxed charging states, SDD and CSB perform similarly on station load, so the driver-oriented distance-minimization rule can be applied without degrading network-level station stability.
  • Both strategies decide each request online using only current-slot link data and the request's destination and remaining energy, so no advance knowledge of future charging requests is required.
  • The reachability guarantee holds for both strategies, meaning drivers can trust that the assigned station can be reached with the energy they report at request time.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • An operator could extend the same two rules to a stochastic setting where link states change mid-route; the reachability guarantee would then become probabilistic and would require a roll-out check at each intermediate node rather than a single departure-slot calculation.
  • A natural tuning not explored in the paper is to minimize predicted station occupancy at arrival time rather than current occupancy; this would preserve CSB's balance effect while potentially reducing detours for drivers.
  • The stable and unstable parameter scenarios in the paper could be converted into an operational switching rule: use SDD when $\lambda$ is low or $\mu$ is high, and switch to CSB as the charging state becomes tense, calibrated on the reported scenario table.
  • The single-request-per-node-per-slot assumption is the main scope limit; relaxing it to allow multiple simultaneous requests at one node would require a queueing extension of the dynamic recursive equation, but the two selection criteria would remain applicable.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. This paper considers the problem of guiding electric vehicle (EV) drivers to charging stations when charging requests arrive dynamically over time and link travel times and energy consumptions vary across time slots. The authors formulate a dynamic recursive equation for the number of EVs at each charging station, propose two strategies—SDD (shortest driving distance from the charging station to the destination) and CSB (choosing the reachable station with the smallest current EV count)—and test them on a Sioux Falls-like network over horizons up to 10^6 time slots. The paper claims that both strategies guarantee the reachability of the selected station and that CSB leads to better balance among stations and stabilizes service in "tense charging states."

Significance. The topic is practically relevant, and the two strategies are simple, clearly specified, and could be of interest to operators of charging guidance systems. The paper's central quantitative claim, however, rests on simulation results that appear inconsistent with the model's own dynamics, and the reachability guarantee is overstated for trips spanning multiple time slots. The paper does not provide formal stability or optimality proofs, and no simulation code or data are supplied, so the reported figures cannot be independently checked. If the simulation inconsistencies and the reachability issue are resolved, the comparison between SDD and CSB could provide useful insights, especially the observation that CSB equalizes station loads better than SDD in the reported scenarios.

major comments (3)
  1. [§4.3, Fig. 11, Eq. (1)] In the parameter scenario λ=0.5, μ=0.6, the stated model generates an expected Σ_i λ_i = 16×0.5 = 8 charging requests per time slot and an expected Σ_j μ_j = 8×0.6 = 4.8 departures per time slot, giving a positive aggregate drift of 3.2 EVs per slot. Over T=10^6 slots the expected total number of EVs waiting at charging stations is about 3.2×10^6, so the maximum per-station EV count should be of order 10^5, not less than 32 as reported in Fig. 11. No load-balancing policy can remove this drift because CSB only redistributes arrivals among stations; it does not create service capacity. The reported maxima therefore imply that the simulation either drops arrivals, applies μ differently from the description, or solves a different model. Consequently, the conclusion in §4.3 that "the CSB strategy has ability to stabilize the state of CS 1-CS8 for all the parameter scenarios" is unsupported.
  2. [§3.1, Step 1 and Step 5, Eq. (2), Table 4] The reachability check in Step 1 uses the minimum energy consumption E^t_ij computed from link costs at the departure slot t, and Eq. (2) computes the arrival time as t + τ^t_ij using only the departure slot's travel times. But Table 4 allows link travel times up to 5 slots, and actual routes may traverse several links, so a trip can span multiple time slots. Since link energy consumptions change each slot, the actual energy needed can differ from E^t_ij; a station deemed reachable at departure may be unreachable when the vehicle is partway. The abstract and §4.2 state that both strategies "ensure the reachability" of selected stations in a time-varying network, but this guarantee is valid only if each trip completes within one time slot or if link states are fixed for the entire trip, neither of which is stated. This is a load-bearing issue because reachability is presented as the main shared property of the two strategies.
  3. [§4.2, Fig. 8] The stability assessment is based on a qualitative "flat change trend" of the average EV number as T increases, with no formal definition or uncertainty quantification. Moreover, under the same model parameters that give positive drift (e.g., λ=0.5, μ=0.6), the average number of EVs in stations should grow roughly linearly with T, which is inconsistent with the flat trends reported in Fig. 8. The lack of a precise stability criterion and the apparent contradiction with the model's dynamics make the stability comparison between SDD and CSB unreliable.
minor comments (6)
  1. [Section 2, Eq. (1)] The notation t'' is used both as the request time and in the condition {1,...,t-1}; please clarify the index ranges and the dependence of x on t''.
  2. [Section 4.3] In the discussion of Fig. 10, the sentence "the peak and lowest values of the maximum EV number are equal to 2 and 29, respectively" appears to have the two numbers reversed; please check all similar statements in §4.3.
  3. [Section 2] The paper states that "the probability variables λ_i and μ_j do not appear in the dynamic recursive equation." It would help to specify explicitly how the simulation draws actual requests and service completions from these probabilities and how those draws enter Eq. (1).
  4. [Section 4] The figures in Section 4 do not indicate whether the results come from a single random seed or from multiple runs; including confidence intervals or multiple-run summaries would make the simulation claims verifiable.
  5. [References] Some references are cited for background but are not directly about EV charging (e.g., Hung and Michailidis, 2012; Li and Eryilmaz, 2014); please ensure all citations are needed and accurately described.
  6. [References] The reference list has inconsistent formatting, with some entries lacking page ranges or having incomplete author lists; please unify the format.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the CSB/SDD comparison is a simulation result, Eq. (1) is an accounting identity, and self-citations are background only.

full rationale

Walking the paper's derivation chain, I found no step in which a claimed prediction reduces by construction to an input. Eq. (1) is an accounting identity for the EV count in each charging station: arrivals are added when requests reach the station and departures are subtracted when charging completes. It contains no fitted parameter that is later renamed as a prediction. The parameters lambda_i and mu_j are declared simulation inputs (Tables 1-2 and the 25 parameter scenarios in Section 4.3), not calibrated to reproduce the maximum-EV-number results in Figs. 9-11. SDD and CSB are explicitly defined decision rules: SDD minimizes driving distance from charging station to destination, and CSB selects the reachable station with minimum current EV number. Their performance comparison is produced by simulation, not by substituting the conclusion into the rules. The observation that CSB yields more balanced station loads is an evaluation of the strategy's own objective, but it is not a theoretical derivation whose output is identical to its input; the simulated maximum counts and stability behavior are nontrivial outputs. The self-citations (Bi et al. 2018b, 2019) support background empirical relationships, namely the linear distance-energy relation and the effect of traffic on driving speed and energy consumption; these are not load-bearing for the central CSB-versus-SDD comparison, and no uniqueness theorem or ansatz is imported from the authors' prior work. The skeptical concern that lambda=0.5, mu=0.6 gives positive drift inconsistent with the tiny maxima in Fig. 11 is an internal-consistency or simulation-validity issue, not a circularity issue. The Section 5 limitation that each normal node can generate at most one request per time slot is a stated scope assumption, not a circular step. Accordingly, no circularity score is warranted.

Assumptions & free parameters 6 free parameters · 8 assumptions · 0 invented entities

The central claim rests on a chain of simplifying domain assumptions about request generation, departure processes, single-charge trips, known and slot-constant link states, and the presence of at least one reachable station, plus hand-chosen simulation parameters that are not measured from real data. No new entities are invented; the two strategies are algorithmic rules, not physical constructs.

free parameters (6)
  • lambda_i (request occurrence probability at normal node i) = Table 2: 0.13 to 0.69 per node; parameter analysis uses identical lambda for all nodes in {0.1, 0.2, 0.3, 0.4, 0.5}
    Hand-chosen simulation input that controls how many charging requests appear per time slot; the paper's stability conclusions depend on this arrival load.
  • mu_j (EV departure probability at charging station j) = Table 1: 0.74 to 0.94 per station; parameter analysis uses identical mu in {0.6, 0.7, 0.8, 0.9, 1.0}
    Hand-chosen service rate for station departures; enters the recursive equation and the simulation as the inverse of charging pressure.
  • link energy consumption intervals E_a^t = Table 3, per-link intervals such as [2.64,5.76] kWh
    Chosen per link and sampled each slot; determines which stations are reachable, the core of both strategies.
  • link travel time intervals tau_a^t = Table 4, per-link intervals such as [2,5] time slots
    Chosen per link and sampled each slot; determines arrival slot via Eq. (2) and hence the timing of station load updates.
  • remaining energy interval for requests e_i^t = [7.2,16.8] kWh
    Hand-chosen random interval for the battery level reported by drivers; the reachability filter is sensitive to this range.
  • initial station occupancy phi_j = 0 for all charging stations
    Simulation initialization chosen for convenience; a different initial load could change transient behavior and the stability comparison.
assumptions (8)
  • domain assumption Link travel times and energy consumptions are constant during a time slot.
    Section 2 adopts the Neely et al. (2005) convention so the center can plan with point values at the start of each slot.
  • domain assumption Each normal node generates at most one charging request per time slot.
    Section 2 and the Conclusions acknowledge this simplification; multiple simultaneous requests at one node are deferred to future work.
  • domain assumption At most one EV leaves a charging station per time slot.
    Section 2 assumes this without loss of generality and uses it to make departure intervals geometric.
  • domain assumption Every charging request has at least one reachable charging station.
    Section 3 states this to guarantee a solution exists; unreachable cases are excluded from the strategies.
  • domain assumption EV drivers complete their trips with at most one charging event.
    Section 2 assumes single charging per trip, citing Franke and Krems (2013).
  • domain assumption Charging requests occur only at normal nodes, never at charging station nodes.
    Section 2 defines the problem this way to keep request origins distinct from service locations.
  • domain assumption Driving distance is a valid proxy for travel cost and energy consumption from station to destination.
    Section 3.1 assumes distance is proportional to time and linearly related to energy, so SDD's objective represents cost.
  • domain assumption The operating centre knows link travel times and energy consumptions at the beginning of each time slot.
    Section 2 assumes real-time traffic information or short-term prediction provides this; without it the reachability check cannot be run.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Optimal charging guidance strategies for electric vehicles by considering dynamic charging requests in a time-varying road network." pith.science (2026). https://pith.science/paper/LS2NIV7G

@misc{pith2026190803670,
  author       = {Pith},
  title        = {Pith review of: Optimal charging guidance strategies for electric vehicles by considering dynamic charging requests in a time-varying road network},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LS2NIV7G}},
  note         = {Machine review of arXiv:1908.03670}
}
read the original abstract

Electric vehicles (EVs) have enjoyed increasing adoption because of the global concerns about the petroleum dependence and greenhouse gas emissions. However, their limited driving range fosters the occurrence of charging requests deriving from EV drivers in urban road networks, which have significant uncertain characteristic from time dimension in the real-world situation. To tackle the challenge brought by the dynamic charging requests, this study is devoted to proposing optimal strategies to provide guidance for EV charging. The time-varying characteristic of road network is further involved in the problem formulation. Based on the charging request information, we propose two charging guidance strategies from different perspectives. One of the strategies considers the travel demands of EV drivers and uses the driving distance as the optimization criterion. In contrast, the other strategy focuses on the impacts of EV number on the charging station operation and service satisfaction. The reachable charging stations with minimum vehicle number are selected as the optimal ones. More importantly, both the strategies have the ability to ensure the reachability of selected charging stations in a time-varying road network. In addition, we conduct simulation examples to investigate the performance of the proposed charging guidance strategies. Besides, the insights and recommendations on application scenarios of the strategies are introduced according to the simulation results under various parameter scenarios.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

12 extracted references · 12 canonical work pages

  1. [7]

    EURO Journal on Transpo rtation and Logistics, 3(1), 55-92

    A network equilibrium analysi s on destination, route and parking choices with mixed g asoline and electric vehicular fl ows. EURO Journal on Transpo rtation and Logistics, 3(1), 55-92. Kobayashi, Y ., Kiyama, N., Aoshima, H. , Kashiyama, M., 2011 . A route search method for electric vehicle s in consideration of range and locations of charging st ations....

    work page 2011

  2. [10]

    Renewable and Sustainable Energy Reviews, 42, 786-800

    Electric vehicles challenges and opportunities: Lithuanian review. Renewable and Sustainable Energy Reviews, 42, 786-800. Rezvani, Z., Jansson, J. , Bodin, J., 2015 . Advances in consumer electric vehicle adoption research: A review and research agenda. Transportation research part D: transport and environment. 34, 122-136. Said, D., Cherkaoui, S., Khoukhi, L.,

    work page 2015

  3. [1040]

    A data-based model for driving distance estimation of battery electric logistic s vehicles

    Bi, J., Wang, Y ., Zhang, J., 2018b. A data-based model for driving distance estimation of battery electric logistic s vehicles. EURASIP Journal on Wireless Communications and Networking, 2018(1),

    work page 2018

  4. [2009]

    In 2009 IEEE Vehicle Power and Propulsion Conference, 827-831

    Impact of electric vehicles on power distribution networks. In 2009 IEEE Vehicle Power and Propulsion Conference, 827-831. IEEE. Qian, K., Zhou, C., Allan, M., Yuan, Y .,

    work page 2009

  5. [2010]

    IEEE Transactions on Power Systems, 26(2), 802-810

    Modeling of load demand due to EV battery charging in distribution systems. IEEE Transactions on Power Systems, 26(2), 802-810. Qin, H ., Zhang, W., 2011 . Charging sche duling with minimal waiting in a network of electric vehicles and charging stations. In Proceedings of the Eighth ACM interna tional workshop on Vehicular inter-networking, 51-60. ACM. Ra...

    work page 2011

  6. [2012]

    IEEE Transactions on Automatic Control, 57(2), 489-494

    Stability and co ntrol of acyclic stochastic processing networks with shared resources. IEEE Transactions on Automatic Control, 57(2), 489-494. Hung, Y ., Michailidis, G ., 2015 . Optimal routing for electric vehicle service systems. European Journal of Operational Research, 247(2), 515-524. International Energy Agency,

    work page 2015

  7. [2013]

    In 2013 9th International Wireless Communications and Mobile Computing Conference (IWCMC), 65-70

    Queuing model for EVs charging at public supply stations. In 2013 9th International Wireless Communications and Mobile Computing Conference (IWCMC), 65-70. IEEE. Storandt, S.,

    work page 2013

  8. [2014]

    In 20 14 5 2nd Annual Allerton Conference on Communication, Con trol, and Computing (Allerton), 25-32

    Optimized path planning for electric vehicle routing and charging. In 20 14 5 2nd Annual Allerton Conference on Communication, Con trol, and Computing (Allerton), 25-32. IEEE. Artmeier, A., Haselmayr, J., Leucker, M. , Sachenbacher, M., 2010 . The shortest path pr oblem revisited: Optimal routing for electric vehicles. In Annual con ference on artificial ...

    work page 2010

Show all 12 references
  1. [2015]

    In 2015 IEEE Transportation Electrification Conference and Expo (ITEC), 1-4

    A Bellman-Ford approach to energy efficient routing o f electric vehicles. In 2015 IEEE Transportation Electrification Conference and Expo (ITEC), 1-4. IEEE. Alizadeh, M., Wai, H., Scaglione, A., Goldsmith, A., Fan, Y ., Javidi, T.,

    2015

  2. [2016]

    In 2016 American Control Conference (ACC), 637-642

    Multi-objective route search for electric vehicles using ant colony optimization. In 2016 American Control Conference (ACC), 637-642. IEEE. Zhang, Y ., Aliya, B., Zhou, Y ., You, I., Zhang, X., Pau, G ., Collotta, M.,

    2016

  3. [2017]

    Jafari, E

    Global EV Outlook 2017; IEA: Paris, France. Jafari, E. , Boyles, S. ,

    2017

  4. [2019]

    Energy, 169, 833-843

    Estimating remaining driving range of battery electric vehicles based on real-world data: A case study of Beijing, China. Energy, 169, 833-843. Bi, J., Wang, Y ., Sun, S. , Guan, W., 2018 a. Predic ting Charging Time of Battery Ele ctric Vehicles Based on Regression and Time-S...

    2018

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.