Circuit Covering Graph Based Algorithm for Solving the Traveling Salesman Problem
Bildiriler > Tam Metin Bildiri
Yazarlar: Fidan Nuriyeva, Urfat NURİYEV
2024 3rd International Conference on Problems of Logistics, Management and Operation in the East-West Transport Corridor (PLMO), , , Uluslararası, Tam Metin Bildiri, ss 1-4
DOI: 10.1109/plmo62307.2024.10887141
Özet
This study presents an algorithm for solving the Traveling Salesman Problem (TSP) based on Circuit Covering Graph and Insertion Heuristic methods. This algorithm offers an efficient approach to constructing a tour for the TSP, Experimental results demonstrate the effectiveness of the algorithm in solving TSP instances with large numbers of cities.