IMPLEMENTASI ALGORITMA SEMUT UNTUK MENENTUKAN RUTE TERPENDEK
| Main Author: | Kurnianingsih, Sri Dwi |
|---|---|
| Format: | Thesis NonPeerReviewed |
| Terbitan: |
, 2011
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/16334/ |
Daftar Isi:
- Searching for shortest route can be done by using two methods; there are conventional method and heuristic method. Heuristic method is a technique used to improve the efficiency of the search process. This method is different when compared with conventional methods, which when compared to conventional methods tend to be more easily understood with logic that is used only by comparing the distance of each node and then find the shortest distance. Differences between heuristics and conventional methods on the results obtained, if the heuristic method is more varied and the necessary calculation time is shorter. Ant algorithm is adopted from the behavior of ant colonies, known as ant system. Naturally, the ant colony is able to find the shortest route on the way from the nest to nearby food sources. Ant colony can find the shortest route between nest and food sources based on the pheromone trail on a path that had been passed. Ant algorithm is quite effective in determining the shortest route, because the calculation result obtained is accurate. However, a lot of date is used, make the accuracy becomes progressively decreasing. In additional, to the number of cities, the value of parameters used are also quite influence the accuracy of calculations.