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: | |
---|---|
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!
|