Hybrid Simulated Annealing and Particle Swarm Optimization Algorithms for Traveling Salesman Problems
碩士 === 國立金門技術學院 === 電資研究所 === 97 === Traveling Salesman Problem (TSP) like the typical discrete scheduling, assigning system can be considered as an NP-Complete search problem. The heuristic Particle Swarm Optimization (PSO) algorithm is first introduced by Kennedy and Eberhart in 1995. Based on the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/10377006719037304935 |