An Efficient Detour Computation Scheme for Electric Vehicles to Support Smart Cities’ Electrification
Open Access
- 4 March 2022
- journal article
- research article
- Published by MDPI AG in Electronics
- Vol. 11 (5) , 803
Abstract
Achieving carbon-neutral transportation is the ultimate goal of the ongoing joint efforts of governments, policy-makers, and the transportation research community. Electrification of smart cities is a very important step towards the above objective; therefore, accelerating the adoption and widening the use of Electric Vehicles (EVs) are required. However, to achieve the full potential of EVs, ground-breaking detour computation and charging station selection schemes are needed. To this end, this paper developed a new scheme that finds the most suitable detour/route for an EV whenever an unexpected event occurs on the road. This scheme is based on A* and uses an original, Simple-Additive-Weighting (SAW)-based, charging station selection method. The performance evaluation carried out using the open-source traffic simulation platform SUMO under a grid map, as well as a real road network map highlighted that our scheme ensured more than 99% of EVs will reach their destination within a reasonable time even if a battery recharge is needed. This is a significant improvement compared to the baseline scheme that uses the A* only.Keywords
This publication has 21 references indexed in Scilit:
- Implementation of charging station based electric vehicle routing problem using nearest neighbour search algorithm2017
- Optimal Routing with In-Route Charging of Mobility-on-Demand Electric Vehicles2017
- Quantifying the Societal Benefits of Electric VehiclesWorld Electric Vehicle Journal, 2016
- A Bellman-Ford approach to energy efficient routing of electric vehicles2015
- The impact of range anxiety and home, workplace, and public charging infrastructure on simulated battery electric vehicle lifetime utilityJournal of Power Sources, 2014
- The shortest path: Comparison of different approaches and implementations for the automatic routing of vehicles2012
- Genetic algorithms for solving shortest path problems2002
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- An Approximate Measure of ValueJournal of the Operations Research Society of America, 1954