Combining Cluster Algorithm and Hybrid Genetic Ant Colony Algorithm for Solving Traveling Salesman Problem
碩士 === 銘傳大學 === 資訊管理學系碩士班 === 98 === Nowadays, ranges of enterprising services expand thanks to the technological development. However, here comes a problem called “Traveling Salesman Problem” which makes people think over--- how to find the shortest route or the least cost to accomplish shipping? I...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/68624439940989791329 |
| Summary: | 碩士 === 銘傳大學 === 資訊管理學系碩士班 === 98 === Nowadays, ranges of enterprising services expand thanks to the technological development. However, here comes a problem called “Traveling Salesman Problem” which makes people think over--- how to find the shortest route or the least cost to accomplish shipping?
In this research, a cluster algorithm is used to divide TSP into Clustered TSP (CTSP); a parallel computing technique is integrated with the Hybrid Genetic Ant Colony Optimization Algorithm and 2-opt algorithm to accelerate the procedure for solving the TSP.
The experimental results showed that the process did solve the TSP in a shorter time by comparing with TSPLIB examples. Also, The proposed process was proved to be effective when comparing with some existing results.
|
|---|