首页 | 本学科首页   官方微博 | 高级检索  
     

二次分配问题的改进粒子群优化算法
引用本文:李琰珂.二次分配问题的改进粒子群优化算法[J].计算机时代,2010(7):26-27,30.
作者姓名:李琰珂
作者单位:南阳理工学院计算机科学与技术系,河南,南阳,473004
摘    要:粒子群优化算法已经成功地应用于求解连续域问题,但是对于离散域问题的求解,尤其涉及组合优化问题的研究和应用还很少。二次分配问题本身是一个离散域问题,因此,使用粒子群算法求解二次分配问题是一个新的研究方向。文章引入交叉策略和变异策略对粒子群优化算法进行改造,使得粒子群优化算法可以用来解决二次分配问题。

关 键 词:粒子群优化算法  二次分配问题  交叉策略  变异策略

An Improved Particle Swarm Optimization Algorithm for Quadratic Assignment Problem
LI Yan-ke.An Improved Particle Swarm Optimization Algorithm for Quadratic Assignment Problem[J].Computer Era,2010(7):26-27,30.
Authors:LI Yan-ke
Affiliation:LI Yan-ke (Dept. of Computer Science and Technology,Nanyang Institute of Technology,Nanyang,Henan 473004,China)
Abstract:Particle swarm optimization algorithm has been successfully applied in solving continuous domain problems,but for solving discrete domain problems,especially involving combinatorial optimization problems,the research and application is still limited. Quadratic assignment problem itself is a discrete domain problem,therefore using particle swarm algorithm to solve quadratic assignment problem is a new research direction. Introducing crossover strategy and mutation strategy to transform particle swarm optimization algorithm,the improved algorithm can be used to solve quadratic assignment problem.
Keywords:particle swarm optimization algorithm  quadratic assignment problem  crossover strategy  mutation strategy
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号