Combined Particle Swarm Optimization and Simulated Annealing for Solving the Knapsack Problem
碩士 === 中原大學 === 資訊管理研究所 === 97 === Partical Swoarm Optimization (PSO) is one kind memory of algorithm. The initial random distribution of particles may be solved in accordance with their own memory to find particle particles optimal solution, but after a period of time after the generations evolutio...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/55451390390368797644 |