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.

The Implementation of Genetic Algorithm in Path Optimization

Jumali, Suriana (2005) The Implementation of Genetic Algorithm in Path Optimization. Universiti Teknologi Petronas. (Unpublished)

[img] PDF
Download (3160Kb)

Abstract

Traveling Salesman Problem (TSP) is a classical problem in Artificial Intelligence (AI) field. Since 1800s when first mathematical problems related to TSP was treated, it became an interesting topic of optimization problem to be studied. In this project, TSP will be used to model and easy visualize the path optimization problem and Genetic Algorithm (GA) was chosen to be implemented in resolving the problem. This project will focus on the static variable referring to the length of distance as the fitness function of optimization. The idea of resolving TSP study is to come out with the shortest path among all possible solutions of tour to be taken. However, the major concern here is how to ensure that the optimum result is obtained. Therefore, the operators and parameters of GA itself were studied in depth particularly the mutation operator. Experiments were conducted to measure the effectiveness of two different types of mutation method namely swapping method and inversion method. The comparison of both performances in achieving optimum result had been analyzed in detail. Therefore, the implementation ofGA in path optimization can be ascertained offering a compelling result.

Item Type: Final Year Project
Academic Subject : Academic Department - Information Communication Technology
Subject: Z Bibliography. Library Science. Information Resources > ZA Information resources
Divisions: Sciences and Information Technology > Computer and Information Sciences
Depositing User: Users 2053 not found.
Date Deposited: 02 Oct 2013 15:58
Last Modified: 25 Jan 2017 09:46
URI: http://utpedia.utp.edu.my/id/eprint/8125

Actions (login required)

View Item View Item

Document Downloads

More statistics for this item...