摘要
粒子群优化算法(PSO)是Eberhart和Kennedy提出的,该算法具有思想简单、易编程实现等特点,引起了国内外相关领域众多学者的关注。本文以旅行商问题为例,提出一种离散粒子群优化算法,对粒子的位置、速度等量及运算规则进行定义,并在迭代过程中对速度引入收缩因子。实验结果表明,该算法具有很好的性能。
The particle swarm optimization algorithm is proposed by Eberhart and Kennedy,thoughts of the algorithm is simple and easy to achieve by programming,so it attracts many scholars＇ attention in related areas.The traveling salesman problem as an example,a discrete particle swarm optimization is proposed.The particle＇s position,velocity and the operation rules are defined again.Velocity is added the shrinkage factor in the iteration process.The results show that the algorithm is of better performance.
出处
《计算机与现代化》
2011年第9期5-7,11,共4页
Computer and Modernization
基金
国家自然科学基金资助项目(60970004)
山东省研究生教育创新计划资助项目(SDYY10059)
关键词
粒子群算法
离散粒子群
组合优化
旅行商问题
particle swarm algorithm
discrete particle swarm
combinatorial optimization
traveling salesman problem
