Article ID: | iaor20133048 |
Volume: | 57 |
Issue: | 11-12 |
Start Page Number: | 2873 |
End Page Number: | 2882 |
Publication Date: | Jun 2013 |
Journal: | Mathematical and Computer Modelling |
Authors: | Yang Shun-Neng, Cheng Wei-Sheng, Hsu Yu-Ching, Gan Chai-Hien, Lin Yi-Bing |
Keywords: | energy, vehicle routing & scheduling |
Today, charging stations (CSs) for electric vehicles (EVs) are much less popular than gas stations. Therefore, searching and selecting CSs is an important issue for the drivers of EVs. This paper investigates the EV charging problem. We propose two types of CS‐selection algorithms. The first type only utilizes local information of an EV. The second type utilizes the global information obtained through interactions between the EVs and a Global CS‐selection (GCS) server through the mobile telecommunications network. Our study indicates that by using the global information (specifically the workload status of each CS), the EVs can be effectively charged with short waiting times at the CSs.