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: | Yan-Hung, Lai, 賴彥宏 |
---|---|
Other Authors: | Ruey-Maw Chen |
Format: | Others |
Language: | zh-TW |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/96728729876384196653 |
Similar Items
-
Particle Swarm Optimization Survey for Traveling Salesman Problem
by: Yen-Lin Chen, et al.
Published: (2007) -
Modified Particle Swarm Optimization Algorithms for the Traveling Salesman Problem
by: Chih-Jyz Wu, et al.
Published: (2007) -
An Improved Particle Swarm Optimization for Traveling SalesmanProblems
by: Chi-Hsiung Tung, et al.
Published: (2006) -
Hybrid Simulated Annealing and Particle Swarm Optimization Algorithms for Traveling Salesman Problems
by: Kuo-Lung Liao, et al.
Published: (2008) -
Applying Modified Particle Swarm Optimization to the Traveling Salesman Problem
by: Kai-Chih Chuang, et al.
Published: (2011)