Combinatorial Optimization: Solution Methods of Traveling Salesman Problem
2013
0 görüntülenme
0 i̇ndirme
Özet (EN)
ABSTRACT: Traveling Salesman Problem has been one of the most interesting and challenging problem in the literature. It is include a large area in combinatorial optimization problem. A variety of Exact and Heuristic Algorithms are usable algorithms for solving TSP. Branch and Bound Algorithm is an exact algorithm that is developed for solving TSP type problems. Furthermore, Genetic Algorithm is one of the extensively algorithm within the Heuristic Algorithm. In this work, we looked into symmetric and asymmetric matrices to solve TSP. We used Genetic and Branch-and-Bound Algorithms as the solution methods to get the shortest path. Keywords: Traveling Salesman Problem, Heuristic Algorithm, Exact Algorithm, Branch and Bound Algorithm, Genetic Algorithm. ……………………………………………………………………………………………………………………………………………………………………………………………………………………
Yazar
Dr. Hülya Demez
Bu Yayına Nasıl Atıf Yapılır
Hülya Demez (Master Thesis). Combinatorial Optimization: Solution Methods of Traveling Salesman Problem, 2013, Eastern Mediterranean University, Department of Mathematics.
Anahtar Kelimeler
Lisans
Tüm Hakları Saklıdır
Bu eser belirtilen lisans koşulları altında paylaşılmaktadır.
Eastern Mediterranean University tezlerinden daha fazlası
- An Investigation on Time and Cost Overrun in Construction Projects(2012)
- Radial Power-Law Position-dependent Mass, Cylindrical Coordinates, Spectral Signatures(2015)
- Predicting performance level of reinforced concrete structures subject to corrosion as a function of time(2012)
- Discussion of Conservation Approaches for the Selected Heritage Buildings in the Walled City of Famagusta(2019)
- High School Students' Learning Styles in North Cyprus(2011)
- Afyonkarahisar İl Merkezinde Yaşayan 18 Yaş ve Üzeri Kadınların Diyet Posasıyla İlgili Bilgi Düzeylerinin ve Posa Alım Miktarlarının Belirlenmesi(2018)