FINDING SHORTEST PATH FOR DYNAMIC PUTTING PROBLEM USING ANT COLONY OPTIMISATION
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 Col...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Year Project Report / IMRAD |
| Language: | en |
| Published: |
Universiti malaysia sarawak (UNIMAS)
2005
|
| Subjects: | |
| Online Access: | http://ir.unimas.my/id/eprint/49055/1/Nor%20Akmal%20Bt%20Abdul%20Aziz%20FT.pdf http://ir.unimas.my/id/eprint/49055/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|