Abstract

International audience; One of the major curb to electric vehicles (EV) acceptability is their constraints when performing long distance trips. Even if improvements made on fast charging technology enable to recover up to 400 km range in 20 minutes, the low density of this kind of infrastructure and the variability in their availability can lead to significant waiting times for users. Many articles develop communication scenario between vehicles in order to coordinate users charging places choices, permitting a better distribution that minimize waiting queue. The authors compare their approaches performances with theoretical resolution of the relaxed problem. In this article, the authors deal with a situation where many electric vehicles run along a highway with few charging stations, representing a usual daily traffic flow. It provides an approach that permits to find an optimal charging schedule for all users, minimizing their waiting and charging time at charging stations, using an all-knowing point of view. A differential evolution algorithm is used, with some improvements to better adapt it to this problem and speed the convergence.


Original document

The different versions of the original document can be found in:

https://hal.archives-ouvertes.fr/hal-02175048/document,
https://hal.archives-ouvertes.fr/hal-02175048/file/Article_ECOS_2019.pdf
Back to Top

Document information

Published on 01/01/2019

Volume 2019, 2019
Licence: CC BY-NC-SA license

Document Score

0

Views 1
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?