Abdullah, Khamid (2009) PENCARIAN JALUR TERPENDEK MENGGUNAKAN METODE ANT COLONY BERBANTUAN JAVA. Other thesis, University of Muhammadiyah Malang.

Text
PENCARIAN_JALUR_TERPENDEK_MENGGUNAKAN_METODE_ANT_COLONY_BERBANTUAN_JAVA.pdf  Published Version Download (51kB)  Preview 
Abstract
In general, the shortest path search can be divided into two methods. the conventional method and heuristic methods. conventional methods tend to be more easily understood than the heuristic method, but when compared to the results obtained, heuristic methods more varied. heuristic methods there are several algorithms, one of which is the ant algorithm. Ant algorithm is the algorithm adopted from the behavior of ant colonies. ant colony naturally able to find the shortest route from the nest on their way to places where food sources. ant colony can find the shortest route between nest and food sources based on the path of footprints that have been passed. more and more ants passing through a trajectory, it will be more clearly ex trail leg. ant algorithm is used to apply precisely in solving optimization problems, one of which is to determine the shortest path, with a starting point as menganalogikan ant nest and the destination point as ant food source. Ant algorithm is effective in determining the shortest path, because the calculation results obtained fairly accurate. however, more data are processed accuracy rate could decrease. than the number of cities, the parameter values also affect the accuracy of the results of a calculation
Item Type:  Thesis (Other) 

Subjects:  Q Science > QA Mathematics > QA75 Electronic computers. Computer science 
Divisions:  Faculty of Teacher Training and Education > Department of Mathematics and Computing 
Depositing User:  Anwar Jasin 
Date Deposited:  22 Mar 2012 11:11 
Last Modified:  22 Mar 2012 11:11 
URI:  http://eprints.umm.ac.id/id/eprint/976 
Actions (login required)
View Item 