首页> 外文期刊>International Journal of Artificial Intelligence Tools: Architectures, Languages, Algorithms >SOLVING CONSTRAINED GLOBAL OPTIMIZATION VIA ARTIFICIAL IMMUNE SYSTEM
【24h】

SOLVING CONSTRAINED GLOBAL OPTIMIZATION VIA ARTIFICIAL IMMUNE SYSTEM

机译:通过人工免疫系统解决约束性的全球优化

获取原文
获取原文并翻译 | 示例
           

摘要

Artificial immune systems (AISs) are computational intelligence (CI) oriented methods using information based on biological immune systems. In this study, an AIS, which combines the metaphor of clonal selection with idiotypic network theories, is developed. Although they are contradictory approaches, clonal selection and idiotypic network may prove useful in designing a stochastic global optimization tool. The AIS method consists of idiotypic network selection, somatic hypermuation, receptor editing and bone marrow operators. The idiotypic network selection operator determines the number of good solutions. The somatic hypermutation and receptor editing operators comprise the searching mechanisms for the exploration of the solution space. Diversity on the population of solutions is ensured by the bone marrow operator. The performance of the proposed AIS method is tested on a set of global constrained optimization problems (GCO), comprising of four benchmark nonlinear programming problems and four generalized polynomial programming (GPP) problems, where GPP problems are nonconvex optimization problems. The best solution found by the AIS algorithm is compared with the known global optimum. Numerical results show that the proposed method converged to the global optimal solution to each tested CGO problem. Moreover, this study compares the numerical results obtained by the AIS approach with those taken from published CI approaches, such as alternative AIS methods and genetic algorithms.
机译:人工免疫系统(AIS)是使用基于生物免疫系统的信息的面向计算智能(CI)的方法。在这项研究中,开发了一种AIS,它将克隆选择的隐喻与独特型网络理论相结合。尽管它们是相互矛盾的方法,但是克隆选择和独特型网络可能在设计随机全局优化工具中很有用。 AIS方法包括独特型网络选择,体细胞高粘,受体编辑和骨髓操作员。独特型网络选择运营商确定好的解决方案的数量。体细胞超变异和受体编辑算子包括用于探索解空间的搜索机制。骨髓操作员确保溶液总数的多样性。在一组全局约束优化问题(GCO)上测试了提出的AIS方法的性能,该约束问题包括四个基准非线性规划问题和四个广义多项式规划(GPP)问题,其中GPP问题是非凸优化问题。将AIS算法找到的最佳解决方案与已知的全局最优方案进行比较。数值结果表明,所提出的方法已收敛到每个被测CGO问题的全局最优解。此外,本研究将通过AIS方法获得的数值结果与从已发布的CI方法获得的数值结果进行了比较,例如替代的AIS方法和遗传算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号