Author/Authors
KIZILATES, Gozde Ege University - Faculty of Science - Department of Mathematics, Turkey , NURiYEVA, Fidan Azerbaijan National Academy of Sciences - institute of Cybernetics, Azerbaijan
Title Of Article
A NEW HYBRID HEURISTIC ALGORITHM FOR SOLVING TSP
شماره ركورد
41862
Abstract
The Traveling Salesman Problem (TSP) is an important and well known combinatoriyal opti-mization problem. The goal of the problem is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Although the definition of the travelling salesman problem is easy, it belongs to NP-Hard class. In this paper, a new hybrid heuristic algorithm based on Nearest Neighbour (NN) and Greedy heuristic algorithms is proposed for solving the TSP. This proposed hybrid heuristic algorithm is compared with NN and Greedy heuristics. The experimental results show that the proposed algorithm is efficient.
From Page
143
NaturalLanguageKeyword
Traveling salesman problem , Hybrid heuristic algorithm , Nearest neighbour algorithm , Greedy algorithm
JournalTitle
Eskişehir Technical University Journal of Science and Technology B - Theoretical Sciences
To Page
148
JournalTitle
Eskişehir Technical University Journal of Science and Technology B - Theoretical Sciences
Link To Document