Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim

In this paper we considered finding minimum path problem which is known as shortest path problem. This problem generalizes several traditional shortest path problems and has applications in transportation and communication networks. The objective of this problem is to determine the shortest route...

Full description

Bibliographic Details
Main Author:	Hashim, Siti Zuraifah
Format:	Thesis
Language:	English
Published:	Faculty of Computer and Mathematical Sciences 2007
Subjects:	Electronic computers. Computer science
Online Access:	http://ir.uitm.edu.my/id/eprint/983/ http://ir.uitm.edu.my/id/eprint/983/1/TD_SITI%20ZURAIFAH%20HASHIM%20CS%2007_5%20P01.pdf

id	uitm-983
recordtype	eprints
spelling	uitm-9832018-11-14T08:13:57Z http://ir.uitm.edu.my/id/eprint/983/ Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim Hashim, Siti Zuraifah Electronic computers. Computer science In this paper we considered finding minimum path problem which is known as shortest path problem. This problem generalizes several traditional shortest path problems and has applications in transportation and communication networks. The objective of this problem is to determine the shortest routes or paths between two points so that it can minimize the cost and time. This problem is simple and can be solved easily. However, practical transportation networks will become much more complicated and needed to solve efficiently. Roadways and telephone systems are the examples of them. Genetic Algorithms (GA), pioneered by John Holland, applies the principle of evolution found in nature to the problem of finding an optimal solution. It makes use of three basic operations in order to optimize this problem. They are: 1) Reproduction means the creation of new generations, 2) Crossover means interchanging of parts of parent strings into the child string, and 3) Mutation means the random bit flip. Although this problem can be solved by GA, other methods also exist. Dijkstra's Algorithm is one of them. This approach solves the single-source shortest path problem with nonnegative edge weights. In this paper, GA has been applied to find the minimum path, then result will be compared with Dijkstra's algorithm are presented. Faculty of Computer and Mathematical Sciences 2007 Thesis NonPeerReviewed text en http://ir.uitm.edu.my/id/eprint/983/1/TD_SITI%20ZURAIFAH%20HASHIM%20CS%2007_5%20P01.pdf Hashim, Siti Zuraifah (2007) Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim. Degree thesis, Universiti Teknologi MARA.
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Teknologi MARA
building	UiTM Institutional Repository
collection	Online Access
language	English
topic	Electronic computers. Computer science
spellingShingle	Electronic computers. Computer science Hashim, Siti Zuraifah Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
description	In this paper we considered finding minimum path problem which is known as shortest path problem. This problem generalizes several traditional shortest path problems and has applications in transportation and communication networks. The objective of this problem is to determine the shortest routes or paths between two points so that it can minimize the cost and time. This problem is simple and can be solved easily. However, practical transportation networks will become much more complicated and needed to solve efficiently. Roadways and telephone systems are the examples of them. Genetic Algorithms (GA), pioneered by John Holland, applies the principle of evolution found in nature to the problem of finding an optimal solution. It makes use of three basic operations in order to optimize this problem. They are: 1) Reproduction means the creation of new generations, 2) Crossover means interchanging of parts of parent strings into the child string, and 3) Mutation means the random bit flip. Although this problem can be solved by GA, other methods also exist. Dijkstra's Algorithm is one of them. This approach solves the single-source shortest path problem with nonnegative edge weights. In this paper, GA has been applied to find the minimum path, then result will be compared with Dijkstra's algorithm are presented.
format	Thesis
author	Hashim, Siti Zuraifah
author_facet	Hashim, Siti Zuraifah
author_sort	Hashim, Siti Zuraifah
title	Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
title_short	Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
title_full	Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
title_fullStr	Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
title_full_unstemmed	Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
title_sort	finding minimum path by using genetic algorithm (ga)/ siti zuraifah hashim
publisher	Faculty of Computer and Mathematical Sciences
publishDate	2007
url	http://ir.uitm.edu.my/id/eprint/983/ http://ir.uitm.edu.my/id/eprint/983/1/TD_SITI%20ZURAIFAH%20HASHIM%20CS%2007_5%20P01.pdf
first_indexed	2023-09-18T22:45:27Z
last_indexed	2023-09-18T22:45:27Z
_version_	1777417193730867200

Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim

Similar Items