Akademik Veri Yönetim Sistemi
Global Joint Conference on Industrial Engineering and its Application Areas, Antalya, Türkiye, 7 - 09 Ağustos 2024, ss.5, (Özet Bildiri)
Traveling Salesman Problem (TSP) is a wellknown combinatorial optimization problem. The aim of the problem is to visit each node in a given network only once and return to the starting point with a minimum distance. In basic TSP, the priority of all nodes is considered equal. Looking at real-life problems, there are many situations where some nodes must be visited before some other nodes. In this article, the traveling salesman problem with priority relationship (TSP-PR), where nodes are clustered according to their priorities and routes are determined accordingly, is discussed. First, the mathematical model of the problem is presented, followed by the Greedy, Tabu search (TS) and conditioned Tabu search (C-TS) heuristics and the results obtained with hybrid versions of these heuristics. For this purpose, random problems ranging from 10 to 200 nodes were created and the nodes in these problems were randomly divided into 3, 5, and 7 priority sets. The problems were solved both with the mathematical model and heuristic methods, and the results were reported. It has been shown that the hybrid version of the Greedy and C-TS heuristics, among the heuristics used, gives faster and better results as the problem size increases.