Year 2013, Volume 2, Issue 2, Pages 143 - 148 2015-05-06

A NEW HYBRID HEURISTIC ALGORITHM FOR SOLVING TSP
GEZGİN SATICI PROBLEMİNİ ÇÖZMEK İÇİN YENİ BİR HİBRİD SEZGİSEL ALGORİTMA

Gözde KIZILATEŞ [1] , Fidan NURİYEVA [2]

343 339

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
Gezgin satıcı problemi, Hibrid sezgisel algoritma, Yakın komşu algoritması, Açgözlü algoritma
  • Climer, S., Zhang, W. (2006). Rearrangement Clustering: Pitfalls, Remedies, and Applications. Journal of Machine Learning Research, 7, 919 – 943.
  • Gutin, G., Punnen, A. (eds.). (2002). The Traveling Salesman Problem and Its Variations. Vol. 12 of Combinatorial Optimization. Kluwer, Dordrecht.
  • Held, M., Karp, R. (1962). A Dynamic Programming Approach to Sequencing Problems. Journal of SIAM, 10, 196 – 210.
  • Hubert, L. J., Baker, F. B. (1978). Applications of Combinatorial Programming to Data Analysis: The Traveling Salesman and Related Problems. Psychometrika, 43(1), 81-91.
  • Johnson, D., Papadimitriou, C. (1985a). Computational Complexity. In Lawler et al, Chapter 3, 37- 86.
  • Johnson, D., Papadimitriou, C. (1985b). Performance Guarantees for Heuristics. In Lawler et al, Chapter 5,145-180.
  • Johnson, D. S. and McGeoch, L. A. (1997). “The Traveling Salesman Problem: A Case Study”, Local Search in Combinatorial Optimization, 215-310, John Wiley & Sons.
  • Johnson, O., Liu, J. (2006). A Traveling Salesman Approach for Predicting Protein Functions. Source Code for Biology and Medicine, 1(3), 1-7.
  • Land, A., Doig, A. (1960). An Automatic Method for Solving Discrete Programming Problems. Econometrica, 28, 497-520.
  • Lawler, E. L., Lenstra, J. K., Rinnoy, Kan A. H. G., Shmoys D. B. (1986). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley & Sons.
  • Lenstra, J. K. (1974). Clustering a Data Array and The Traveling-Salesman Problem. Operations Research, 22(2), 413-414.
  • Lin, S., Kernighan, B. (1973). An Effective Heuristic Algorithm for The Traveling-Salesman Problem. Operations Research, 21(2), 498-516.
  • Ray, S. S., Bandyopadhyay, S., Pal, S. K. (2007). Gene Ordering in Partitive Clustering using Microar- ray Expressions. Journal of Biosciences, 32(5), 1019-1025.
  • Rego, C., Glover, F. (2002). Local Search and Metaheuristics. In Gutin and Punnen (2002), Chapter 8, 309-368.
  • Reinelt, G. (1994). The Traveling Salesman: Computational Solutions for TSP Applications. Springer- Verlag, Germany.
  • http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/tsp/
Primary Language en
Journal Section Articles
Authors

Author: Gözde KIZILATEŞ

Author: Fidan NURİYEVA

Dates

Publication Date: May 6, 2015

Bibtex @ { aubtdb42344, journal = {ANADOLU UNIVERSITY JOURNAL OF SCIENCE AND TECHNOLOGY –B Theoretical Sciences}, issn = {2146-0272}, eissn = {2146-0191}, address = {Eskişehir Teknik Üniversitesi}, year = {2015}, volume = {2}, pages = {143 - 148}, doi = {}, title = {A NEW HYBRID HEURISTIC ALGORITHM FOR SOLVING TSP}, key = {cite}, author = {KIZILATEŞ, Gözde and NURİYEVA, Fidan} }
APA KIZILATEŞ, G , NURİYEVA, F . (2015). A NEW HYBRID HEURISTIC ALGORITHM FOR SOLVING TSP. ANADOLU UNIVERSITY JOURNAL OF SCIENCE AND TECHNOLOGY –B Theoretical Sciences, 2 (2), 143-148. Retrieved from http://dergipark.org.tr/aubtdb/issue/3048/42344
MLA KIZILATEŞ, G , NURİYEVA, F . "A NEW HYBRID HEURISTIC ALGORITHM FOR SOLVING TSP". ANADOLU UNIVERSITY JOURNAL OF SCIENCE AND TECHNOLOGY –B Theoretical Sciences 2 (2015): 143-148 <http://dergipark.org.tr/aubtdb/issue/3048/42344>
Chicago KIZILATEŞ, G , NURİYEVA, F . "A NEW HYBRID HEURISTIC ALGORITHM FOR SOLVING TSP". ANADOLU UNIVERSITY JOURNAL OF SCIENCE AND TECHNOLOGY –B Theoretical Sciences 2 (2015): 143-148
RIS TY - JOUR T1 - A NEW HYBRID HEURISTIC ALGORITHM FOR SOLVING TSP AU - Gözde KIZILATEŞ , Fidan NURİYEVA Y1 - 2015 PY - 2015 N1 - DO - T2 - ANADOLU UNIVERSITY JOURNAL OF SCIENCE AND TECHNOLOGY –B Theoretical Sciences JF - Journal JO - JOR SP - 143 EP - 148 VL - 2 IS - 2 SN - 2146-0272-2146-0191 M3 - UR - Y2 - 2019 ER -
EndNote %0 ANADOLU UNIVERSITY JOURNAL OF SCIENCE AND TECHNOLOGY –B Theoretical Sciences A NEW HYBRID HEURISTIC ALGORITHM FOR SOLVING TSP %A Gözde KIZILATEŞ , Fidan NURİYEVA %T A NEW HYBRID HEURISTIC ALGORITHM FOR SOLVING TSP %D 2015 %J ANADOLU UNIVERSITY JOURNAL OF SCIENCE AND TECHNOLOGY –B Theoretical Sciences %P 2146-0272-2146-0191 %V 2 %N 2 %R %U
ISNAD KIZILATEŞ, Gözde , NURİYEVA, Fidan . "A NEW HYBRID HEURISTIC ALGORITHM FOR SOLVING TSP". ANADOLU UNIVERSITY JOURNAL OF SCIENCE AND TECHNOLOGY –B Theoretical Sciences 2 / 2 (May 2015): 143-148.
AMA KIZILATEŞ G , NURİYEVA F . A NEW HYBRID HEURISTIC ALGORITHM FOR SOLVING TSP. AUBTD-B. 2015; 2(2): 143-148.
Vancouver KIZILATEŞ G , NURİYEVA F . A NEW HYBRID HEURISTIC ALGORITHM FOR SOLVING TSP. ANADOLU UNIVERSITY JOURNAL OF SCIENCE AND TECHNOLOGY –B Theoretical Sciences. 2015; 2(2): 148-143.