摘要
针对典型的背包问题,给出了一种基于粒子群算法的求解方法。考虑到粒子群算法在解决问题时容易陷入局部最优的缺点,将模拟退火(SA)思想引入到了粒子群算法中,得到了粒子群——模拟退火算法。该算法保持了粒子群算法原有的简单易实现特点,同时改善了粒子群算法易陷入局部最优的缺点。实验结果表明,该算法具有较好的求解质量。
A solving process based on the particle swarm algorithm is presented to resolve the knapsack problem. Considering the shortcomings of the particle swarm algorithm that is easy to trap into local minimum, the ideal of the simulated annealing （SA） was introduced into the particle swarm algorithm and the PSO-SA algorithm was obtained. The PSO-SA algorithm maintains the characteristics of particle swarm algorithm easy to realize and also overcomes its defect. The experimental results show that the PSO-SA algorithm can obtain higher quality of the solution.
出处
《现代电子技术》
2010年第12期85-86,89,共3页
Modern Electronics Technique
关键词
模拟退火
粒子群
背包问题
遗传算法
simulated annealing
particle swarm
knapsack problem
genetic algorithm
