The Traveling Salesman Problem (TS P) 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 heurist ic algorithm based on Nearest Neighbour (NN) and Greedy heur istic algorithms is proposed for s olving the TSP. This proposed hybrid heuristic algorithm is compared with NN and Greedy heuristi cs. The experimental results show that the proposed algorithm is efficient
Alan : Fen Bilimleri ve Matematik; Mühendislik; Sağlık Bilimleri; Ziraat, Orman ve Su Ürünleri
Dergi Türü : Uluslararası
Benzer Makaleler | Yazar | # |
---|
Makale | Yazar | # |
---|