UUM Electronic Theses and Dissertation
UUM ETD | Universiti Utara Malaysian Electronic Theses and Dissertation
FAQs | Feedback | Search Tips | Sitemap

An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town

Nor Rafidah, Mohamad (2005) An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town. Masters thesis, Universiti Utara Malaysia.

[thumbnail of NOR_RAFIDAH_BT._MOHAMAD.pdf] PDF
Restricted to Registered users only

Download (4MB) | Request a copy
[thumbnail of 1.NOR_RAFIDAH_BT._MOHAMAD.pdf]

Download (1MB) | Preview


Shortest path is one of the optimization problems that are difficult to solve. There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. Kota Kinabalu Central Town (KKCT) is been used as the real data, where the nodes represent as buildings, the arc represent as roads and weight on the arc represent as distance. The objectives of this study are to explore and evaluate the Ant System (AS) algorithm and Ant Colony System (ACS) algorithm in finding shortest paths. Both algorithms are compared. Simulation is used as a method in this study. This is because a simulator is been designed. There are several experiment carry out using the simulator. The experiments involved manipulating several parameters. As a result, the AS was found to be not suitable for the real data used because KKCT is a graph without Hamiltonian cycle. ACS was found to be suitable for KKCT real data and produced an optimal solution.

Item Type: Thesis (Masters)
Supervisor : UNSPECIFIED
Item ID: 1299
Uncontrolled Keywords: Artificial Intellegence, Ant Algorithms, Ant Colony System, Travelling Salesman
Subjects: Q Science > QA Mathematics > QA71-90 Instruments and machines
Divisions: Faculty and School System > Faculty of Information Technology
Date Deposited: 08 Feb 2010 01:40
Last Modified: 24 Jul 2013 12:11
Department: Faculty of Information Technology
URI: https://etd.uum.edu.my/id/eprint/1299

Actions (login required)

View Item
View Item