Presented at the International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT2017), Tokat, Turkey, Dec 02, 2017

SETSCI Conference Proceedings, 2017, 1, Page (s): 179-182 , https://doi.org/

Published Date: 08 December 2017    | 1284     13

Nowadays, there are old and new methods that involve the difficult problems and solution suggestions which many researchers research and try to solve. In the field of engineering, the success rates of the methods that produce solutions to these problems are often compared to the travelling salesman problems. Many studies have been done to solve the problems in the best way. In this paper, a new method, the Egyptian Vulture algorithm, was used. The purpose of the study is to solve the Travelling Salesman problem by adding the nearest and the farthest neighbour structures to the Egyptian Vulture algorithm in order to obtain better results in the problems that occur in the data sets of the paper. The nearest neighbors or the farthest neighbors is a scientific contribution to the algorithm. Performance and success of the proposed method are showed by tests.  

Keywords - Nearest Neighbor, Farthest Neighbor, Travelling Salesman Problem, Shortest Path, Longest Path, Travelling Salesman Problem

1. F Glover, HJ Greenberg 1989 New approaches for heuristic search: A bilateral linkage with artificial intelligence, European Journal of Operational Research, pp 119 – 130, North-Holland.

2. DL Applegate, RE Bixby, V Chvatal, WJ Cook, 2007, the traveling salesman problem: a computational study, 59 pages, Princeton University Press (Date of access: 11.10.2017)

3. C. Sur, S. Sharma, A. Shukla, 2013, Egyptian Vulture Optimization Algorithm – A New Nature Inspired Metaheuristics for Knapsack Problem, ABV Indıan Institute of in İnformation Technology & Managment Gwalior, pp 227-237, Madha Pradesh, India.

4. C. Sur, S. Sharma, A. Shukla, 2013, Solving Travelling Salesman Problem Using Egyptian Vulture Optimization Algorithm – A New Approach, ABV Indıan Institute of in İnformation Technology &Managment Gwalior, pp 254-267, Madha Pradesh, India.

5. M Dorigo, LM Gambardella, 1997. Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactıons On Evolutıonary Computation, pp 53 – 66.

6. H. Eldem, E. Ulker, 2014, Küre Üzerinde 3 Boyutlu Gezgin Satıcı Problemi Çözümünde Parçacık Sürü Optimizasyonu Uygulaması, XVI. Akademik Bilişim Konferansı Bildirileri Kitabı, pp 461-469, Mersin, Turkey (in Turkish language).