首页 | 官方网站   微博 | 高级检索  
     

求解一类不可微多目标优化问题的社会认知算法*
引用本文:雍龙泉.求解一类不可微多目标优化问题的社会认知算法*[J].计算机应用研究,2010,27(11):4128-4129.
作者姓名:雍龙泉
作者单位:陕西理工学院,数学系,陕西,汉中,723001
基金项目:陕西省教育厅自然科学研究项目(09JK381)
摘    要:针对一类不可微多目标优化问题,给出了一个新的算法——极大熵社会认知算法。利用极大熵方法将带有约束的不可微多目标优化问题转化为无约束单目标优化问题,然后利用社会认知算法对其进行求解。该算法是基于社会认知理论,通过一系列的学习代理来模拟人类的社会性和智能性从而完成对目标的优化。利用两个测试算例对其进行测试并与其他算法进行比较,计算结果表明,该算法在求解的准确性和有效性方面均优于其他算法。

关 键 词:社会认知算法    极大熵方法    不可微多目标优化

Social cognitive optimization algorithm for class of non-differentiable multi-objective optimization problems
YONG Long-quan.Social cognitive optimization algorithm for class of non-differentiable multi-objective optimization problems[J].Application Research of Computers,2010,27(11):4128-4129.
Authors:YONG Long-quan
Affiliation:(Dept. of Mathematics, Shaanxi University of Technology, Hanzhong Shaanxi 723001, China)
Abstract:To solve a class of non-differentiable multi-objective optimization problems, this paper proposed a new method called maximum-entropy social cognitive optimization algorithm. First, used the maximum-entropy function, transformed the constrained non-differentiable multi-objective optimization problem to the approximation unconstrained differentiable optimization problem, then used the social cognitive optimization algorithm to solve this problem. The algorithm was based on social cognitive theory, through a series of learning agents to simulate human social and intelligent thereby completing the optimization of the target. Used two examples to demonstrate the validity of the method and compared the results with the ones of other methods. It shows that the proposed method is more accurate and effective.
Keywords:social cognitive optimization(SCO)  maximum-entropy method  non-differentiable multi-objective optimization
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号