Published November 1, 2018
| Version Version 1
Journal article
Open
A Study on the Traveling Salesman Problem by Using Brute Force and Nearest Neighbor Algorithms
Creators
Description
There are several puzzles which can be analyzed by graph theoretic concepts. In this paper we select one of such puzzles, namely, Hamiltonian puzzle. Firstly, we discuss how the mathematicians' works upon Hamiltonian puzzle resulted in significant theoretical discoveries. Then we discuss how to solve the traveling salesman problem using brute force and nearest neighbor algorithms. Finally, the differences of these two algorithms are presented.
Files
16 Dr Khaing Zaw Htun_Maths_.pdf
Files
(149.4 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:a0e6766368efbf3fb536fc775fea705c
|
149.4 kB | Preview Download |
Additional details
References
- Bondy, J. A. and Murty, U. S. R. (1976). "Graph Theory with Applications", American Elsevier, New York. Shirinivas, S. G., Vetrivel, S. and Dr. Elango, N. M. (2010). "Application of graph theory in computer science an overview", International Journal of Engineering Science and Technology, Vol. 2, pp. 4610-4621.