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...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
2010-04.
|
| Subjects: | |
| Online Access: | Get fulltext |