Genetic algorithms and travelling salesman problem
Is this your thesis?
This record came from a bulk archive import. If it’s yours, link it to your profile.
Abstract (EN)
ABSTRACT Masters Thesis GENETIC ALGORITHM AND TRAVELLING SALESMAN PROBLEM Mustafa KAYA Fırat University Graduate School of Natural and Applied Sciences Department of Computer Engineering 1999, Page 85 In this research Genetic Algorithm and Genetic Programming are taken up. The operators and their preparing for algorithm are discussed. The difficulties of Genetic Programming and the technics to pass over are studied. The definition and formulas of Travelling Salesman Problem are handled. TSP have been solved many times with Genetic Algorithms, but, the quality of these solutions have still been discussed. The shortest route, with cties of Turkey, found by genetic programming. The results are given comperative. Many researchers defence and study that, if you use other subsidiary technics and better coding data, you can get better solutions. Some heuristics were given, and their advantages and disadvantages on solutions of TSP are discussed. The results, program code and output of program are given by interpretation. KEYWORDS: Genetic Algorithm,Traveller Salesman Problem, Genetic Programming, Route Problem.
Author
Mustafa Kaya
How to Cite
Mustafa Kaya (Master Thesis). Genetic algorithms and travelling salesman problem, 1999, Fırat University.
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Fırat University
- Color usage at Turkish Divan of Fuzûlî(2013)
- An investigation of energy dissipation ratios of different type energy dissipator blocks in chute channels(2009)
- Fixing and avaluation of rumours about Prophet Adam(2005)
- 1551 M. (959 H.) tarih ve 282 No'lu Tapu Tahrir Defterine göre Basra(1996)
- Historical building damage assessment and classification based on transfer learning(2025)
- Marriage records in Trabzon Sharia Registers Numbered 1873, 1874 and 1875 and their evaluation (H. 1124-1128/ m. 1712-1716)(2024)
