Author/Authors
NURİYEVA, Fidan Dokuz Eylül Üniversitesi - Fen Fakültesi - Bilgisayar Bilimleri Bölümü, Turkey , NURİYEVA, Fidan Azerbaycan Ulusal Bilimler Akademisi - Yönetim Sistemleri Enstitüsü, Azerbaijan , KIZILATEŞ, Gözde Ege Üniversitesi - Fen Fakültesi - Matematik Bölümü, Turkey
Title Of Article
A New Hyper-Heuristic Method for Traveling Salesman Problem from Center to Margins
شماره ركورد
25509
Abstract
In this study a new hyper-heuristic algorithm is proposed for Traveling Salesman Problem. The central point of the tour is identified and four point vertices are selected from N cities first in the proposed method. Secondly, the mid-points of the center and each of the two point vertices are calculated one by one in order to establish a tour that includes a total of nine cities. This tour is extended afterwards in order to contain all vertices by using “nearest neighbor” and “insertion heuristic” algorithms. Computational experiments were conducted with a library of sample instances for the TSP and the results were compared with the results obtained from “Nearest Neighbor” algorithm. The proposed algorithm in this study is shown to be efficient regarding the experimental results.
From Page
319
NaturalLanguageKeyword
Symmetric Travelling Salesman Problem , Hyper , Heuristic Algorithm , Insertion Heuristic , Shortest Path Algorithm , Nearest Neighbor Algorithm
JournalTitle
Journal Of Natural and Applied Sciences
To Page
323
JournalTitle
Journal Of Natural and Applied Sciences
Link To Document