Optimized Scheduling for Solving Position Allocation Problem in Electric Vehicle Charging Stations

Abstract

In this paper, we combined the berth allocation problem with the scheduling of electric vehicle charging stations and formed a new problem namely the position allocation problem (PAP). To solve this problem, we used a meta-heuristic algorithm namely the Simulated Annealing (SA) and presented the results as a scheduling chart. Our findings are focused on the reduction of the charging time. Also, we considered the length of the cars and the length limit of the charging stations in order to allocate a suitable number of cars. For this reason, we choose several electric vehicle models and by considering their characteristics like the length and time of charging, formed an optimized schedule for the charging. The result showed a considerable reduction in charging time for the 3, 5 and 10 electric vehicle charging scenarios.