Welcome To UTPedia

We would like to introduce you, the new knowledge repository product called UTPedia. The UTP Electronic and Digital Intellectual Asset. It stores digitized version of thesis, dissertation, final year project reports and past year examination questions.

Browse content of UTPedia using Year, Subject, Department and Author and Search for required document using Searching facilities included in UTPedia. UTPedia with full text are accessible for all registered users, whereas only the physical information and metadata can be retrieved by public users. UTPedia collaborating and connecting peoples with university’s intellectual works from anywhere.

Disclaimer - Universiti Teknologi PETRONAS shall not be liable for any loss or damage caused by the usage of any information obtained from this web site.Best viewed using Mozilla Firefox 3 or IE 7 with resolution 1024 x 768.

Application of Bee Colony Optimization (BCO) in NP-Hard Problems

Kamarudin, Muhammad Sariy Syazwan (2011) Application of Bee Colony Optimization (BCO) in NP-Hard Problems. Universiti Teknologi Petronas. (Unpublished)

[img] PDF
Download (1691Kb)


This report presents the first stage of an ongoing research which is the problem solving of highly complex tasks using Bee-Inspired algorithms. Bee-Inspired algorithms are partially referring to the nature of bee swarm behaviour. Bee swarm behaviour characterized by autonomy and distributed functioning and selforganizing. Nowadays, lots algorithms under the field of Swann Intelligent have been used to solve complex problem. Various Artificial Intelligence systems have been developed based on plenty of researches and studies done on the behaviour of social insects. Bee-Inspired algorithms were presumed to bring the new direction in the field of Swann Intelligence. The primary goal of this research is to prove the efficiency of collective bee intelligence in solving problems characterized by uncertainty. P-Median problem will be used as the main case study in implementing one of the Bee-Inspired algorithms to prove, illustrate example and show the characteristics of the selected concept

Item Type: Final Year Project
Academic Subject : Academic Department - Information Communication Technology
Subject: T Technology > T Technology (General)
Divisions: Sciences and Information Technology
Depositing User: Users 2053 not found.
Date Deposited: 27 Sep 2013 10:55
Last Modified: 25 Jan 2017 09:42
URI: http://utpedia.utp.edu.my/id/eprint/6863

Actions (login required)

View Item View Item

Document Downloads

More statistics for this item...