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

基于排序优化的微粒群算法
引用本文:祝成虎,彭宏. 基于排序优化的微粒群算法[J]. 计算机工程与设计, 2006, 27(21): 4025-4027
作者姓名:祝成虎  彭宏
作者单位:广州航海高等专科学校,广东,广州,510725;华南理工大学,计算机科学与工程学院,广东,广州,510640
基金项目:广东省科技攻关项目;广东省广州市科技攻关项目
摘    要:微粒群算法是一种新颖的群智能仿生进化优化算法,其原理简单,控制参数少,容易实现,在连续空间中有很强的优化能力。研究了将微粒群算法应用于基于排序的组合优化问题,进行了算法设计,给出了算法的流程,提出了计算两个排列的差及由置换求微粒群算法的速度的具体操作方法。为加快算法的收敛速度,增强全局搜索能力,运用矩阵的逐行最小元法来初始化微粒群,引入了突变算子。对一些测试旅行商问题利用新算法进行了模拟仿真,结果表明算法是可行的。

关 键 词:微粒群算法(PSO)  TSP问题  置换  突变算子  收敛
文章编号:1000-7024(2006)21-4025-03
收稿时间:2005-09-26
修稿时间:2005-09-26

Particle swarm optimization based on permutation
ZHU Cheng-hu,PENG Hong. Particle swarm optimization based on permutation[J]. Computer Engineering and Design, 2006, 27(21): 4025-4027
Authors:ZHU Cheng-hu  PENG Hong
Affiliation:1. Guangzhou Maritime College, Guangzhou 510725, China; 2. School of Computer Science and Engineering, South China University of Technology, Guangzhou 510640, China
Abstract:Particle swarm optimization(PSO) is a new swarm intelligence simulation evolution optimum algorithm.It has a simple principle,few controlling parameters,and strong optimizing ability in continuous space.It is easy to be implemented.The applying PSO to combination optimum problems is studied based on permutation,the flow of the algorithm is proposed,the computational method of difference between two permutations is designed,the method of deriving PSO's velocity from transforms,and the detailed operations is shown.In orderto increasethe convergentspeed and to improve the overallsearching ability ofthe algorithm,therule ofmatrix minima line-by-line to is used initiate the particle swarm,and introduces a mutation operator.Finally,the paper makes simulating computation on some testing TSP problems.The results show that the algorithm is feasible.
Keywords:particle swarm optimization   TSP   permutation   mutation operator   convergence
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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