Solving the Travelling Salesman Problem by Using Artificial Bee Colony Algorithm
Travelling Salesman Problem (TSP) is a list of cities that must visit all cities that start and end in the same city to find the minimum cost of time or distance. The Artificial Bee Colony (ABC) algorithm was used in this study to resolve the TSP. ABC algorithms is an optimisation technique that si...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA Perlis
2022-09-01
|
| Series: | Journal of Computing Research and Innovation |
| Subjects: | |
| Online Access: | https://crinn.conferencehunter.com/index.php/jcrinn/article/view/295 |