Limanto, Susana and Angga, Ng Melissa (2009) Implementasi Local Pheromone Updating Rule pada Algoritma Ant Colony untuk Membantu Mencari Penyelesaian Traveling Salesman Problem. In: Konferensi Nasional Sistem dan Informatika, 14 November 2009, Bali.
Preview |
PDF
Ant Colony Algorithm-revisi_Mellisa Angga.pdf Download (128kB) | Preview |
Abstract
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Ant Colony algorithm, Travelling Salesman Problem, local pheromone updating rules. |
| Subjects: | T Technology > T Technology (General) |
| Divisions: | Faculty of Engineering > Department of Informatic |
| Depositing User: | Melissa Angga 61110 |
| Date Deposited: | 11 Feb 2019 01:55 |
| Last Modified: | 24 Mar 2021 16:00 |
| URI: | http://repository.ubaya.ac.id/id/eprint/34322 |
Actions (login required)
 |
View Item |
