Received:
Revised:
Accepted:
Abstract: With the rapid expansion of electric vehicle charging infrastructure, increased attention has been paid to improving the service efficiency of public charging stations through the optimization of existing capacity. Three service mechanisms are developed for public charging settings in which reservation users and walk-in users coexist: a first-come, first-served (FCFS) mechanism, a static coexisting reservation mechanism, and a dynamic coexisting reservation mechanism. Simulation experiments are conducted under nine load–peak-profile scenarios. The revenue gains generated by the coexisting reservation mechanisms are found to be scenario-dependent. Except in light-load, flat-peak scenarios where differences in system states are limited, the dynamic mechanism is generally found to outperform the static mechanism, while the static mechanism generally outperforms the FCFS mechanism. The additional value of the reservation mechanisms is mainly realized in scenarios characterized by strong demand fluctuations or high load pressure. It is further shown through mechanism decomposition that the primary benefit of the reservation mechanisms is derived from converting demand that would otherwise be lost into completed charging services, whereas service loss and no-show or late-cancellation loss constitute the main mechanism costs. Through boundary analysis, the dynamic mechanism is also found to generate certain revenue gains under lower fulfillment quality, the transition toward fast charging, and supply–demand disturbances, although its advantages are subject to clear scenario and implementation boundaries. Practical guidance is provided for charging operators in selecting reservation quotas and dynamic response rules for public charging stations.
Key words: charging reservation, electric vehicle, coexisting reservation mechanism, service capacity allocation
/ Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.zgglkx.com/EN/10.16381/j.cnki.issn1003-207x.2026.0948