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

一种自适应的微粒群算法
引用本文:童瑿,吴智铭,童争雄. 一种自适应的微粒群算法[J]. 计算机科学, 2007, 34(9): 198-199
作者姓名:童瑿  吴智铭  童争雄
作者单位:上海交通大学自动化系CIMS实验室,上海,200030;上海行知学院计算机系,上海,200940
摘    要:研究发现,种群中个体间交换信息的方式对微粒群算法的性能影响很大。我们定义种群拓扑结构(population topology)为种群内部不同个体之间交流信息的网络。不同的种群拓扑结构有着各自的特点,有些利于加速收敛,有些利于扩展搜索空间。在分析种群拓扑结构变化特点的基础上,提出了一种新的自适应的微粒群算法。和通过调节惯性权重的自适应微粒群算法不同,本算法是通过改变种群拓扑结构来达到自适应优化目的的。

关 键 词:微粒群算法  函数优化  种群拓扑结构

A New Modified Adaptive Particle Swarm Optimization
TONG Yi,WU Zhi-Ming,TONG Zheng-Xiong. A New Modified Adaptive Particle Swarm Optimization[J]. Computer Science, 2007, 34(9): 198-199
Authors:TONG Yi  WU Zhi-Ming  TONG Zheng-Xiong
Affiliation:1.Department of Electronic Engineering for Automation, Shanghai Jiaotong University, Shanghai 200030; 2.Department of Computer Science and Technology, Shanghai Xingzhi College, Shanghai 200940
Abstract:In our study, the way of communication among individual and its neighbors plays a key role in the performance of particle swarm optimization. Now we give a clear definition for population topology that a communication network among individuals of population. These different population topologies have their own characters, some ones provide a faster search efficiency and the others offer the advantage that subpopulation could search diverse regions of problem spaces. On the basis of these features, we propose a new modified adaptive particle swarm optimization. Different from the traditional APSO, a new method using dynamically changing population topology is presented.
Keywords:Particle swarm optimization   Function optimization   Populafion fopology
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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