Sinaie, Saman (2010) Solving shortest path problem using gravitational search algorithm and neural networks. Masters thesis, Universiti Teknologi Malaysia, Faculty of Computer Science and Information Systems.

PDF
590kB 
Abstract
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.
Item Type:  Thesis (Masters) 

Additional Information:  Thesis (Sarjana Sains (Sains Komputer))  Universiti Teknologi Malaysia, 2010; Supervisor : Prof. Dr. Siti Mariyam Shamsuddin 
Uncontrolled Keywords:  shortest path problem (SPP), neural networks 
Subjects:  Q Science > QA Mathematics > QA75 Electronic computers. Computer science 
Divisions:  Computer Science and Information System (Formerly known) 
ID Code:  11402 
Deposited By:  Zalinda Shuratman 
Deposited On:  15 Dec 2010 04:45 
Last Modified:  26 Sep 2017 01:18 
Repository Staff Only: item control page