Alexander, Alexander and Sriwindono, Haris (2020) The Comparison of Genetic Algorithm and Ant Colony Optimization in Completing Travelling Salesman Problem. In: Proceedings of the 2nd International Conference of Science and Technology for the Internet of Things, ICSTI 2019, September 3rd 2019, Yogyakarta, Indonesia.
![[thumbnail of 37163.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "37163.pdf")
PDF
37163.pdf
Download (371kB)
Abstract
Traveling Salesman Problem abbreviated as TSP, is a NP-hard problem that is often applied in various applications. TSP is a polynomial problem, so the solution is exponential. One way to improve the resolution of NP-hard problems is to use probabilistic algorithms such as genetic algorithms, ant col
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 13:01 |
| Last Modified: | 17 Apr 2026 12:04 |
| URI: | http://eprints.eai.eu/id/eprint/27662 |
Actions (login required)
- View Item