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 http://eprints.utm.my/id/eprint/11060/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Swarm intelligence algorithms’ solutions to the travelling salesman’s problem
by: Odili, Julius Beneoluchi, et al.
Published: (2020) -
An Efficient Solution to Travelling Salesman Problem using Genetic Algorithm with Modified Crossover Operator
by: Hossain, Md. Sabir, et al.
Published: (2019) -
Enhanced genetic algorithm with simulated annealing in solving travelling salesman problem
by: Pang, Li Sim
Published: (2010) -
Enhanced selection method for genetic algorithm to solve traveling salesman problem
by: Jubeir, Mohammed, et al.
Published: (2017) -
Modified reactive tabu search for the symmetric traveling salesman problems
by: Lim, Yai Fung, et al.
Published: (2013)