Penerapan Algoritma Ant Colony System (ACS) Pada Kasus Travelling Salesman Problem (TSP) ( Hasil Penelitian Dosen UNPAM )
| Main Author: | Achmad Udin Zailani, . |
|---|---|
| Format: | Lainnya NonPeerReviewed Book |
| Bahasa: | ind |
| Terbitan: |
Universitas Pamulang
, 2015
|
| Subjects: | |
| Online Access: |
http://eprints.unpam.ac.id/893/1/Hasil%20Penelitian%20Dosen%20UNPAM.pdf http://eprints.unpam.ac.id/893/ |
Daftar Isi:
- Ant Colony Algorithm is a methodology yielded by perception to ant. Ant Colony Algorithm represents the technique probabilistic to finish the computing problem by finding best path passing the graph. This algorithm is inspirited by ant behavior in finding path from the nest to the food. In Ant Colony algorithm there are number of artificial ants, which is assigned to look for the solution to an optimization problem, one of them is find the shortest path. This article study about graph which is used in Ant Colony algorithm to look for the optimal solution in Traveling Salesperson Problem (TSP). By giving a number of n cities, TSP can be defined as a problem of finding shortest path by visiting each city for once. Keyword : Ant Colony Algorithm, Graph, and Travelling Salesman Problem