Article Fingerprint
ReserarchID
F8R2P
We use ant colony optimization (ACO) algorithm for solving combinatorial optimization problems such as the traveling salesman problem. Some applications of ACO are: vehicle routing, sequential ordering, graph coloring, routing in communications networks, etc. In this paper, we compare the performance of ACO to that of a few other state-of-the-art algorithms currently in use and thus measure the effectiveness of ACO as one of the major optimization algorithms in regard with a few more algorithms. The performance of the algorithms is measured by observing their capacity to solve a traveling salesman problem (TSP). This paper will help to find the proper algorithm to be used for routing problems in different real-life situations.
A H M Saiful Islam. 2019. \u201cEvaluation of Ant Colony Optimization Algorithm Compared to Genetic Algorithm, Dynamic Programming and Branch and Bound Algorithm Regarding Travelling Salesman Problem\u201d. Global Journal of Computer Science and Technology - D: Neural & AI GJCST-D Volume 19 (GJCST Volume 19 Issue D3): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 104
Country: Bangladesh
Subject: Global Journal of Computer Science and Technology - D: Neural & AI
Authors: A.H.M Saiful Islam, Mashrure Tanzim, Sadia Afreen, Gerald Rozario (PhD/Dr. count: 0)
View Count (all-time): 276
Total Views (Real + Logic): 5049
Total Downloads (simulated): 1345
Publish Date: 2019 07, Wed
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
We use ant colony optimization (ACO) algorithm for solving combinatorial optimization problems such as the traveling salesman problem. Some applications of ACO are: vehicle routing, sequential ordering, graph coloring, routing in communications networks, etc. In this paper, we compare the performance of ACO to that of a few other state-of-the-art algorithms currently in use and thus measure the effectiveness of ACO as one of the major optimization algorithms in regard with a few more algorithms. The performance of the algorithms is measured by observing their capacity to solve a traveling salesman problem (TSP). This paper will help to find the proper algorithm to be used for routing problems in different real-life situations.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.