Particle Swarm Optimization Algorithm Analysis for Traveling Salesman Problem
碩士 === 國立勤益科技大學 === 電子工程系 === 101 === Traveling salesman problem (TSP) is a complex problem and has been confirmed to be non-deterministic polynomial (NP) complete combinatorial optimization problem. Particles Swarm Optimization (PSO) is an effective and efficient method which is an evolutionary m...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/96728729876384196653 |