Using Hybrid of Genetic Algorithm and Ant Colony Optimization to Solve Travelling Salesman Problem
碩士 === 國立東華大學 === 資訊工程學系 === 100 === Travelling Salesman Problem (TSP) is a typical problem of combinatorial optimization problem (COP). It has proven to be an NP-complete problem, so the computing time will grow exponentially when the problem size increases. Recently, biological characteristics...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/8hf4g3 |