(2013). Finding optimal solutions to Traveling Salesman Problem by using Branch and Bound method and one of intelligence techniques with application. , 13(3), 330-346. doi: 10.33899/iqjoss.2013.081242
. "Finding optimal solutions to Traveling Salesman Problem by using Branch and Bound method and one of intelligence techniques with application". , 13, 3, 2013, 330-346. doi: 10.33899/iqjoss.2013.081242
(2013). 'Finding optimal solutions to Traveling Salesman Problem by using Branch and Bound method and one of intelligence techniques with application', , 13(3), pp. 330-346. doi: 10.33899/iqjoss.2013.081242
Finding optimal solutions to Traveling Salesman Problem by using Branch and Bound method and one of intelligence techniques with application. , 2013; 13(3): 330-346. doi: 10.33899/iqjoss.2013.081242

Finding optimal solutions to Traveling Salesman Problem by using Branch and Bound method and one of intelligence techniques with application

IRAQI JOURNAL OF STATISTICAL SCIENCES
Article 35, Volume 13, Issue 3, 2013, Pages 330-346    PDF (0 K)
DOI: 10.33899/iqjoss.2013.081242
Abstract
In this research we find an optimal solutions for traveling salesman problem (TSP) using Branch and Bound method as well as we use an intelligence techniques represented by ant colony optimization (ACO) and applied them on the DNA chain data, where the technique method give an optimal solution with high efficiency.
Statistics
Article View: 382
PDF Download: 288


Journal Management System. Powered by iJournalPro.com