Loading...
Please wait, while we are loading the content...
Similar Documents
A Randomness Ant Colony Algorithm for Solving TSP
| Content Provider | Semantic Scholar |
|---|---|
| Author | Niu, Yue-Cheng Zhang, Deng-Yin |
| Copyright Year | 2017 |
| Abstract | The Travelling Salesman Problem (TSP) has received much attention because of its practical applications in several problems. One of the commonly used algorithms to solve TSP is Ant Colony Optimization (ACO). In this paper, a randomness ant colony algorithm is proposed to solve the defects of ACO by optimizing the path selection probability update rule and pheromone update rule. As the improved algorithm is applied to solve the classical TSP problem, the results show that it is more effective and converge faster. |
| File Format | PDF HTM / HTML |
| DOI | 10.12783/dtcse/cnsce2017/8904 |
| Alternate Webpage(s) | http://dpi-proceedings.com/index.php/dtcse/article/download/8904/8473 |
| Alternate Webpage(s) | https://doi.org/10.12783/dtcse%2Fcnsce2017%2F8904 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |