A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm
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...
Saved in:
Main Author: | Abarghouei, Amir Atapour |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/11060/1/AmirAtapouriAbarghoueiMFSKSM2010.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Enhanced genetic algorithm with simulated annealing in solving travelling salesman problem
by: Pang, Li Sim
Published: (2010) -
Application of genetic algorithm for traveling salesman problem /
by: Kanesan Muthusamy
Published: (1997) -
Genetic algorithm software for solving the travelling salesman problem
by: Sekharan, Vijayan Sandiara
Published: (1996) -
Solving shortest path problem using gravitational search algorithm and neural networks
by: Sinaie, Saman
Published: (2010) -
Gravitational search algorithm for feature selection in intrusion detection system
by: Jabali, Vahid Kaviani
Published: (2013)