Power Cable Laying Route Optimization with a Traveling Salesman Problem Approach
13th IEEE International Conference on Smart Grid, icSmartGrid 2025, Glasgow, İngiltere, 27 - 29 Mayıs 2025, ss.761-765, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Doi Numarası: 10.1109/icsmartgrid66138.2025.11071836
- Basıldığı Şehir: Glasgow
- Basıldığı Ülke: İngiltere
- Sayfa Sayıları: ss.761-765
- Anahtar Kelimeler: energy cable routing, forbidden area avoidance, nearest neighbor algorithm, OpenStreetMap, route optimization, traveling salesman problem (TSP)
- Ankara Yıldırım Beyazıt Üniversitesi Adresli: Hayır
Özet
This study is developed to determine the shortest and safest route between distribution points in power cable laying projects. In the scenario where the start and end points are fixed, the Traveling Salesman Problem (TSP) approach is used to obtain the optimal sequencing between the distribution points. Nearest Neighbor algorithm is applied to solve the TSP and visualized on an OpenStreetMap based map with an orange-colored route. During the route generation, “penguin steps” are used, an iterative movement and step-by-step model that simulates cautious and small steps to avoid obstacles, by integrating spatial constraints such as prohibited zones (schools, hospitals, private properties) and residential areas. Thanks to this approach, safer and more feasible routes are obtained compared to conventional route planning methods. The application was carried out in Ankara Eryaman region and the practical usability of the methods was tested on the map. The results show that simple and fast approaches in energy infrastructure planning can be effective in field applications.