Optimal Placement of Electric Vehicle Charging Stations in Düzce Province Using Binary Particle Swarm Optimization and Genetic Algorithm

This study aims to determine the most suitable locations for electric vehicle charging stations within the borders of Düzce province. A p-median-based Genetic Algorithm (GA) method was used in the site selection process. As an alternative solution approach, the Binary Particle Swarm Optimization (BPSO) algorithm was utilized. Detailed spatial data covering the Düzce city center and its surroundings were used in the study; 44 potential station points were identified, and 5,000 demand points to be directed to these points were defined. Different selection and mutation operators were tested within the GA method to determine the most suitable charging station locations. Operators such as Random Solution, Tournament Selection, and Roulette Wheel were compared. The study specifically examined which method provided the most efficient distribution for a region like Düzce. According to the results obtained, the Tournament Selection method yielded more successful results in terms of both cost and performance compared to other operators. Spatial analyses show that the model accurately reflects areas with high demand. Furthermore, it was observed that the most efficient solutions are clustered in specific areas. Another aim of the study is to comparatively evaluate the results obtained from the GA and BPSO methods. The findings revealed that BPSO offers faster and higher-quality solutions, especially in binary positioning problems. In this respect, BPSO stands out as a strong and feasible option for charging station planning. In conclusion, this study makes significant contributions to literature, both methodologically and practically. In analyses conducted with real field data, the GA and BPSO algorithms were compared via the p-median model; valuable information was obtained regarding the performance of these heuristic methods in complex urban structures.