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:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2010
|
| 主題: | |
| 在線閱讀: | http://eprints.utm.my/id/eprint/11060/1/AmirAtapouriAbarghoueiMFSKSM2010.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|