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

求解一类不可微优化问题极大熵微粒群混合算法
引用本文:赵晓颖,刘国志,姜凤利.求解一类不可微优化问题极大熵微粒群混合算法[J].江西师范大学学报(自然科学版),2007,31(2):193-196.
作者姓名:赵晓颖  刘国志  姜凤利
作者单位:辽宁石油化工大学,理学院,辽宁,抚顺,113001
摘    要:针对一类不可微优化问题,本文提出了一个新的算法—极大熵微粒群混合算法.首先利用极大熵方法把带约束的不可微优化问题转换成无约束的单目标最优化问题,然后利用微粒群算法对其进行求解.利用4个测试函数对其进行测试并于其它算法进行比较,计算结果表明,本文提出算法在求解的准确性和有效性方面均优于其它算法.

关 键 词:微粒群算法  极大熵方法  不可微优化
文章编号:1000-5862(2007)02-0193-04
修稿时间:2006-11-01

A Maximum-Entropy Particle Swarm Optimization for a Class of Non-Differentiable Optimization Problems
ZHAO Xiao-ying,LIU Guo-zhi,JIANG Feng-li.A Maximum-Entropy Particle Swarm Optimization for a Class of Non-Differentiable Optimization Problems[J].Journal of Jiangxi Normal University (Natural Sciences Edition),2007,31(2):193-196.
Authors:ZHAO Xiao-ying  LIU Guo-zhi  JIANG Feng-li
Institution:Mathematics and Physics Faculty, Liaoning University of Petroleum and Chemical Technology, Fushun Liaoning 113001, China
Abstract:To solve a class of non-differentiable optimization problems,this paper proposed a new method called maximum-entropy particles swarm optimization algorithm.First,using the maximum-entropy function,constrained non-differentiable optimization problem can be transformed to the approximation unconstrained differentiable optimization problem.Then using the particles swarm optimization to solve this problem.Four examples were used to demonstrate the validity of the method and the results were compared with the ones of other methods.It is showed that the proposed method is more accurate and effective.
Keywords:particle swarm optimization  maximum-entropy method  non-differentiable optimization problem
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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