Non-Cooperative Optimization Algorithm of Charging Scheduling for Electric Vehicle
In this paper, we aim to propose a charging scheduling algorithm for electric vehicles on highways. While the number of electric vehicles has been increasing recently, charging stations are not becoming widespread compared to gas stations. The distance that an electric vehicle can run on one charge...
Gespeichert in:
Veröffentlicht in: | SICE Journal of Control, Measurement, and System Integration Measurement, and System Integration, 2020, Vol.13(6), pp.265-273 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, we aim to propose a charging scheduling algorithm for electric vehicles on highways. While the number of electric vehicles has been increasing recently, charging stations are not becoming widespread compared to gas stations. The distance that an electric vehicle can run on one charge is only around 120km to 400km. Therefore, it is necessary to plan to recharge in advance when driving long distances. Problems related to planning algorithms are called charging scheduling problems of electric vehicles. In this paper, we assume that there is no difference in the power of the electric vehicle and the charging station, and consider the situation where each acts to maximize its profit. First, since the electric vehicle can select the charging station freely, it motivates us to solve the optimal allocation problem of the electric vehicle to the charging station using matching theory. Then, non-cooperative game theory is utilized to obtain the energy demand and energy price for the electric vehicles and charging stations, respectively. In addition, the convergence condition of the non-cooperative game is theoretically derived. Finally, the effectiveness of the proposed non-cooperative charging scheduling algorithm is confirmed by numerical simulation. |
---|---|
ISSN: | 1882-4889 1884-9970 |
DOI: | 10.9746/jcmsi.13.265 |