Towards an Optimal Hybrid Algorithm for EV Charging Stations Placement using Quantum Annealing and Genetic Algorithms

Citations Over Time

Abstract

Quantum Annealing is a heuristic for solving optimization problems that have seen a recent surge in usage owing to the success of D-Wave Systems. This paper aims to find a good heuristic for solving the Electric Vehicle Charger Placement (EVCP) problem, a problem that stands to be very important given the costs of setting up an electric vehicle (EV) charger and the expected surge in electric vehicles across the world. The same problem statement can also be generalized to the optimal placement of any entity in a grid and can be explored for further uses. Finally, the authors introduce a novel heuristic combining Quantum Annealing and Genetic Algorithms to solve the problem. The proposed hybrid approach entails seeding the genetic algorithms with the results of quantum annealing. Experimental results show that this method decreases the minimum distance from Points of Interest (POI) by 42.S9#x0025; compared to vanilla quantum annealing over the sample EVCP datasets.

Related Papers

• → Enhanced simulated-annealing-based algorithms and their applications to process planning in reconfigurable manufacturing systems(2011)78 cited
• → Performance Evaluation of Tsunami Evacuation Route Planning on Multiple Annealing Machines(2023)2 cited
• → Analysis and Research of Simulated Annealing Algorithm and Parameters(2020)2 cited
• Simulated Annealing, Weighted Simulated Annealing and Genetic Algorithm at Work(1998)
• → Mobile robot global path planning using hybrid modified simulated annealing optimization algorithm(2009)1 cited