Nor Akmal, Abdul Aziz (2005) FINDING SHORTEST PATH FOR DYNAMIC PUTTING PROBLEM USING ANT COLONY OPTIMISATION. [Final Year Project Report / IMRAD] (Unpublished)
![[img]](http://ir.unimas.my/style/images/fileicons/text.png) |
PDF
Nor Akmal Bt Abdul Aziz FT.pdf Download (8MB) |
Abstract
This study aims to find the shortest path for free plotting nodes. Am Colony Optimisation (ACO) was chosen to solve this problem. Specifically. this thesis is intended to develop a system that can display the shortest path by the used of two algorithm in ACO which were Ant System (AS) and Ant Colony System (ACS). Besides, this thesis also aimed to compare both algorithms used in the system, based on their speed to generate the shortest path. The speeds were measured in seconds for each problem set. As a conclusion, this project had proved the fact that ACS generates the solution faster than AS. Lastly, this project also includes several recommendations for future work as an extension of this project
| Item Type: | Final Year Project Report / IMRAD |
|---|---|
| Additional Information: | Project report (B.sc.) -- Universiti malaysia sarawak,2005 |
| Uncontrolled Keywords: | shortest path for dynamic plotting problem |
| Subjects: | H Social Sciences > H Social Sciences (General) |
| Divisions: | Academic Faculties, Institutes and Centres > Faculty of Cognitive Sciences and Human Development Faculties, Institutes, Centres > Faculty of Cognitive Sciences and Human Development Academic Faculties, Institutes and Centres > Faculty of Cognitive Sciences and Human Development |
| Depositing User: | Sabang |
| Date Deposited: | 06 Aug 2025 01:24 |
| Last Modified: | 06 Aug 2025 01:24 |
| URI: | http://ir.unimas.my/id/eprint/49055 |
Actions (For repository members only: login required)
 |
View Item |
