Author
Listed:
- Pourvaziri, H.
- Sarhadi, H.
- Azad, N.
- Afshari, H.
- Taghavi, M.
Abstract
This study presents a hybrid solution for the charging station location-capacity problem. The proposed approach simultaneously determines the location and capacity of charging stations (i.e., number of charging piles), and assigns piles to electric vehicles based on their level of charge. The problem is formulated as a bi-objective mixed-integer nonlinear programming model to minimize the total cost of establishing charging stations together with the average customers’ waiting time. The proposed solution combines queueing theory with mathematical modelling to estimate the average waiting time. A deep learning algorithm is then developed to enhance the precision of waiting time estimation. Another contribution is involving a deep neural network model in improving NSGA-II algorithm. Numerical experiments are conducted in Halifax, Canada to assess the performance of the proposed framework. The results demonstrate the strong predictive performance of the deep learning algorithm and highlight the limitations of traditional queueing models in estimating waiting times in charging stations (i.e., 99.8% improvement in computation time, as well as accuracy improvement of time estimations from 13% to 1.6% deviation). Several valuable insights are obtained to improve the operational performance of charging stations such as achieving a significant (i.e., 61.5%) drop in the average waiting time across the network by a modest (i.e., 29.2%) increase in the initial investments. Also, it reveals that the variability of service rate significantly impacts the average waiting time (i.e., a 50% increase in the variability of service rate causes a substantial 950.56% surge in the average waiting time). The findings underscore the need to control service rate fluctuations to reduce wait times and boost driver satisfaction. The improved NSGA-II algorithm shows 12.77% improvement in the Pareto front solutions. Finally, the proposed prioritization strategy based on the charging level of vehicles could reduce the average waiting time and cost compared to the first-come-first-served strategy.
Suggested Citation
Pourvaziri, H. & Sarhadi, H. & Azad, N. & Afshari, H. & Taghavi, M., 2024.
"Planning of electric vehicle charging stations: An integrated deep learning and queueing theory approach,"
Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
Handle:
RePEc:eee:transe:v:186:y:2024:i:c:s1366554524001595
DOI: 10.1016/j.tre.2024.103568
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:186:y:2024:i:c:s1366554524001595. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.