求解约束优化问题的新型帝国竞争算法
CSTR:
作者:
作者单位:

(武汉理工大学自动化学院,武汉430070)

作者简介:

通讯作者:

E-mail: caosanqiang93@163.com.

中图分类号:

TP18

基金项目:

国家自然科学基金项目(61573264, 71471151).


An imperialist competitive algorithm for solving constrained optimization problem
Author:
Affiliation:

(School of Automation,Wuhan University of Technology,Wuhan430070,China)

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对约束优化问题,提出一种约束处理的新策略,运用字典序方法同时优化问题的目标函数和约束违背程度,设计一种新型帝国竞争算法.该算法给出成本和归一化成本的新定义,以避免殖民国家势力为零,并应用嵌入殖民地间全局搜索的同化、基于优秀殖民地的革命、殖民国家的差分进化和新型帝国竞争等策略提高求解质量.基于两组约束优化标准测试函数的实验结果和算法对比表明,结合字典序方法的新型帝国竞争算法在约束优化问题的求解方面具有较强的优势.

    Abstract:

    To solve a constrained optimization problem, a new strategy is proposed, in which the lexicographical method is used to simultaneously optimize the objective function and the degree of constraint violation. A novel imperialist competitive algorithm (ICA) is presented, in which, cost and normalized cost are redefined to guarantee that the power of all imperialists exceeds zero, and some strategies such as the global search of colonies in assimilation, excellent colonies based revolution, differential evolution of imperialists and a new approach of imperialist competition are applied to improve solution quality. Many experiments are conducted based on two groups of test functions, and the ICA is compared with some algorithms from literature. The computational results show that the ICA with the lexicographical method has promising advantages for solving constrained optimization problems.

    参考文献
    相似文献
    引证文献
引用本文

雷德明,操三强,李明.求解约束优化问题的新型帝国竞争算法[J].控制与决策,2019,34(8):1663-1671

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2019-07-12
  • 出版日期:
文章二维码