PATH PLANNING CONSIDERING DRIVER PREFERENCES USING ANALYTIC HIERARCHY PROCESS FOR ELECTRIC VEHICLES

Authors : Mehmet Arıkan, Sinem Bozkurt Keser, İnci Sarıçiçek, Ahmet Yazici

Pages : 2054-2065

Doi:10.31796/ogummf.1698018

View : 71 | Download : 149

Publication Date : 2025-12-19

Article Type : Research Paper

Abstract :Sustainable transportation and green logistics are becoming increasingly important, and the efficient use of electric vehicles (EVs) plays a critical role. However, efficient path planning for EVs remains a major challenge due to limited driving range and the need for optimised charging strategies. Usually, path recommendations are made based on a single criterion. However, drivers may want to consider multiple criteria for path selection. This study focuses on building a multi-criteria path planning algorithm that incorporates driver preferences by considering total travel time, energy consumption and travelling distance. To obtain the appropriate recommendation, these three criteria are evaluated using the Analytic Hierarchy Process (AHP) and Dijkstra algorithm is used to identify roads that take into account driver preferences. Johnson technique was used to remove negative energy weights due to energy recovery and solved the incompatibility problem of the Dijkstra algorithm with negative edge weights. The results have shown the proposed algorithm can efficiently generate solutions designed based on driver preferences and is suitable for EV routing applications. This study presents a method to increase user satisfaction by aiming at the widespread adoption of EVs and emphasizes the importance of multi-criteria decision making in addressing the unique challenges of EVs.
Keywords : Elektrikli araç, Yol planlama, Sürücü tercihi, Analitik Hiyerarşi Süreci, Dijkstra algoritması

ORIGINAL ARTICLE URL