Implementasi Local Pheromone Updating Rule pada Algoritma Ant Colony untuk Membantu Mencari Penyelesaian Traveling Salesman Problem
| Main Authors: | Limanto, Susana, Ng, Melissa Angga |
|---|---|
| Format: | Proceeding NonPeerReviewed application/pdf |
| Terbitan: |
, 2009
|
| Subjects: | |
| Online Access: |
http://repository.ubaya.ac.id/34322/2/Ant%20Colony%20Algorithm%2Drevisi_Mellisa%20Angga.pdf http://repository.ubaya.ac.id/34322/ |
Daftar Isi:
- Ant Colony Algorithm was developed based on the ant’s behaviour on the real world. On the real world, the ants grouped as blind animals, however they have the ability to discover the shortest path from their nest to the food resources and return. As a media of communication along the path and to decide the preference path, the ants used a substance called pheromone. While they strolling, the ants marked their preference path by putting some pheromone (local pheromone updating rules). Thus the other ants while they moving would prefer more on the path with more pheromone on it which has put by the previous ants rather than the others.