Universiti Teknologi Malaysia Institutional Repository

A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm

Abarghouei, Amir Atapour (2010) A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm. Masters thesis, Universiti Teknologi Malaysia, Faculty of Computer Science and Information Systems.

[img] PDF (Abstract)
95Kb
[img] PDF (1st Chapter)
174Kb
[img] PDF (Table of Contents)
449Kb
[img] PDF
Restricted to Repository staff only

4Mb

Abstract

Throughout the history, many researchers have come across a problem in their real lives, called the Traveling Salesman Problem (TSP). This problem is to find the shortest route of a traveling salesperson that starts at a home city, visits a prescribed set of other cities and returns to the starting city. The distance travelled in such a tour obviously depends on the order in which the cities are visited and, thus, the problem is to find an optimal ordering of the cities. TSP is a representative of a large class of problems known as the combinatorial optimization problems. TSP is among the most important areas to explore, since it is very easy to describe, but very difficult to solve. There are several real-life applications of the TSP in several areas of knowledge including mathematics, computer science, operations research, genetics, engineering, and electronics. Many of the existing methods by which the TSP solved, suffer from considerable problems, such as lack of accuracy and speed. In this study, a hybrid method of TSP is proposed that can yield accurate results and relatively fast, without being trapped in a local optimum during the searching. In this approach, suitable fuzzy matrices are used to illustrate the details of the problem. A new optimization algorithm, called the Gravitational Search Algorithm (GSA) is applied to solve TSP as precise as possible, and finally the Genetic Algorithm (GA) finds the final answer in an acceptable amount of time. The results have illustrated that the proposed method are convincing compared to other related methods.

Item Type:Thesis (Masters)
Additional Information:Thesis (Sarjana Sains (Sains Komputer)) - Universiti Teknologi Malaysia, 2010; Supervisor : Prof. Dr. Siti Mariyam Shamsuddin
Uncontrolled Keywords:Traveling Salesman Problem (TSP), distance travelled
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computer Science and Information System (Formerly known)
ID Code:11060
Deposited By: Ms Zalinda Shuratman
Deposited On:25 Nov 2010 02:39
Last Modified:12 Sep 2012 01:57

Repository Staff Only: item control page