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

求解连续Minimax问题的粒子群优化方法
引用本文:柯晶,钱积新,乔谊正. 求解连续Minimax问题的粒子群优化方法[J]. 仪器仪表学报, 2005, 26(3): 267-272
作者姓名:柯晶  钱积新  乔谊正
作者单位:1. 山东大学控制科学与工程学院,济南,250061
2. 浙江大学系统工程研究所,杭州,310027
摘    要:Minimax问题是一类十分重要同时也是比较困难的优化问题。提出了一种基于粒子群优化的连续minimax问题求解 方法。方法的基本思想是维持两个在不同搜索空间中不对称共同进化的群体并采用粒子群优化算法获得原minimax问题的 一个解。仿真结果显示此方法可以有效求解对称和非对称连续minimax问题。

关 键 词:Minimax问题  进化计算  粒子群优化
修稿时间:2003-03-01

Particle Swarm Optimization Method for Solving Continuous Minimax Problems
KE Jing,QIAN Jixin,Qiao Yizheng. Particle Swarm Optimization Method for Solving Continuous Minimax Problems[J]. Chinese Journal of Scientific Instrument, 2005, 26(3): 267-272
Authors:KE Jing  QIAN Jixin  Qiao Yizheng
Affiliation:Ke Jing 1 Qian Jixin 2 Qiao Yizheng 1 1
Abstract:Minimax problems are a class of important and difficult optimization problems. A particle swarm optimization based method for solving continuous minimax problems is proposed. The basic idea is that the method maintains two populations coevolving asymmetrically in two different search spaces, and a particle swarm optimization algorithm is employed to find a good solution to the minimax problems. Simulation results show that the proposed method can effectively solve symmetric and asymmetric continuous minimax problems.
Keywords:Minimax problems Evolutionary computation Particle swarm optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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