Solving shortest path problem using gravitational search algorithm and neural networks

For many years, scientists have aware the importance of conducting research related to actual problems, and Shortest Path Problem (SPP) is one of such examples. SPP is meant to find the shortest path between two given cities or nodes. The travelled distance in such a path obviously depends on the or...

Full description

Saved in:

Bibliographic Details
Main Author:	Sinaie, Saman
Format:	Thesis
Language:	English
Published:	2010
Subjects:	QA75 Electronic computers Computer science
Online Access:	http://eprints.utm.my/id/eprint/11402/5/SamanSinaieMFSKSM2010.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.11402
record_format	uketd_dc
spelling	my-utm-ep.114022017-09-26T01:18:19Z Solving shortest path problem using gravitational search algorithm and neural networks 2010-04 Sinaie, Saman QA75 Electronic computers. Computer science For many years, scientists have aware the importance of conducting research related to actual problems, and Shortest Path Problem (SPP) is one of such examples. SPP is meant to find the shortest path between two given cities or nodes. The travelled distance in such a path obviously depends on the order in which the cities are visited. Hence, it is the problem of finding an optimal ordering of the cities. Therefore, SPP is commonly known as the combinatorial optimization problems. In this study, a hybrid method is proposed that can solve the SPP accurately and fast without being trapped in a local optimum during searching. Gravitational Search Algorithm (GSA), a new optimization algorithm is applied to solve the above problem. In this scenario, decision making is provided by the Neural Network within a short amount of time. The results illustrate that with the precision of the GSA and the relatively high speed of the Neural Network, a very efficient method is obtained accordingly. 2010-04 Thesis http://eprints.utm.my/id/eprint/11402/ http://eprints.utm.my/id/eprint/11402/5/SamanSinaieMFSKSM2010.pdf application/pdf en public masters Universiti Teknologi Malaysia, Faculty of Computer Science and Information Systems Faculty of Computer Science and Information System
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	QA75 Electronic computers Computer science
spellingShingle	QA75 Electronic computers Computer science Sinaie, Saman Solving shortest path problem using gravitational search algorithm and neural networks
description	For many years, scientists have aware the importance of conducting research related to actual problems, and Shortest Path Problem (SPP) is one of such examples. SPP is meant to find the shortest path between two given cities or nodes. The travelled distance in such a path obviously depends on the order in which the cities are visited. Hence, it is the problem of finding an optimal ordering of the cities. Therefore, SPP is commonly known as the combinatorial optimization problems. In this study, a hybrid method is proposed that can solve the SPP accurately and fast without being trapped in a local optimum during searching. Gravitational Search Algorithm (GSA), a new optimization algorithm is applied to solve the above problem. In this scenario, decision making is provided by the Neural Network within a short amount of time. The results illustrate that with the precision of the GSA and the relatively high speed of the Neural Network, a very efficient method is obtained accordingly.
format	Thesis
qualification_level	Master's degree
author	Sinaie, Saman
author_facet	Sinaie, Saman
author_sort	Sinaie, Saman
title	Solving shortest path problem using gravitational search algorithm and neural networks
title_short	Solving shortest path problem using gravitational search algorithm and neural networks
title_full	Solving shortest path problem using gravitational search algorithm and neural networks
title_fullStr	Solving shortest path problem using gravitational search algorithm and neural networks
title_full_unstemmed	Solving shortest path problem using gravitational search algorithm and neural networks
title_sort	solving shortest path problem using gravitational search algorithm and neural networks
granting_institution	Universiti Teknologi Malaysia, Faculty of Computer Science and Information Systems
granting_department	Faculty of Computer Science and Information System
publishDate	2010
url	http://eprints.utm.my/id/eprint/11402/5/SamanSinaieMFSKSM2010.pdf
_version_	1747814850274263040

Solving shortest path problem using gravitational search algorithm and neural networks

Similar Items