Modification of Ant Colony Optimization Algorithm to Solve the Traveling Salesman Problem
Traveling salesman problem (TSP) is an optimization problem in determining the optimal route of a number of nodes that will only be passed once with the initial node as the final destination. One method for solving TSP is the Ant Colony Optimization (ACO) Algorithm. ACO is inspired by ant behaviour...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Program Studi Teknik Informatika Universitas Trilogi
2020-12-01
|
| Series: | JISA (Jurnal Informatika dan Sains) |
| Subjects: | |
| Online Access: | https://trilogi.ac.id/journal/ks/index.php/JISA/article/view/704 |