专栏首页人工智能与演化计算成长与进阶不完全免疫算法简介DMMO--AIS学习笔记3

不完全免疫算法简介DMMO--AIS学习笔记3

多目标优化

A double-module immune algorithm for MOP

“参考文献 A double-module immune algorithm for multi-objective optimizationproblems Applied Soft Computing 35 (2015) 161–174

摘要

  • Multi-objective optimization problems (MOPs) have become a research hotspot, as they are commonlyencountered in scientific and engineering applications. When solving some complex MOPs, it is quitedifficult to locate the entire Pareto-optimal front. To better settle this problem, a novel double-moduleimmune algorithm named DMMO is presented, where two evolutionary modules are embedded to simul-taneously improve the convergence speed and population diversity. The first module is designed tooptimize each objective independently by using a sub-population composed with the competitive indi-viduals in this objective. Differential evolution crossover is performed here to enhance the correspondingobjective. The second one follows the traditional procedures of immune algorithm, where proportionalcloning, recombination and hyper-mutation operators are operated to concurrently strengthen the multi-ple objectives. The performance of DMMO is validated by 16 benchmark problems, and further comparedwith several multi-objective algorithms, such as NSGA-II, SPEA2, SMSEMOA, MOEA/D, SMPSO, NNIA andMIMO. Experimental studies indicate that DMMO performs better than the compared targets on most oftest problems and the advantages of double modules in DMMO are also analyzed.

算法流程图

在这里插入图片描述

Artificial immune system

  • Artificial immune system is an interesting bio-inspired intel-ligent approach that simulates the information processingprocedures of biologic immune system [45,46]. When foreign anti-gens are detected in biologic immune system, its B-cell is adaptedcorrespondingly to eliminate the intruders, which is realized bythe processes known as clonal selection and affinity maturationthrough hyper-mutation. Antibodies that can better recognize anantigen will be selected to proliferate by cloning, which is known asthe process of clonal selection. Then, hyper-mutation implementsan affinity maturation process proportional to the fitness valuesin order to generate the matured population. At last, some anti-bodies with better affinities will be remained as memory cells toprevent the re-intrusion of the previous antigens. This informa-tion processing principle gives some inspirations to design artificial immune algorithm, which improves the convergence speed andmaintain the diversity of the antibody population.
  • In multi-objective immune algorithm, the problems and thecorresponding constraints can be treated as the antigen while apotential solution can be seen as an antibody. That is to say, as theMOPs defined in Eq. (1), a solution vector x = (x1, x2, . . ., xn) ∈ ˝is considered as an antibody and f(x) = {f1(x), f2(x), . . ., fm(x)} isregarded as an antigen. An antibody population is made up by a setof antibodies. When an antibody is called a non-dominated anti-body, it indicates that there does not exist another antibody in theantibody population that can dominate it. 人工免疫系统是一种有趣的仿生智能方法,它模拟了生物免疫系统的信息处理过程[45,46]。当生物免疫系统中检测到外来抗原时,其b细胞会相应地进行相应的适应以消除入侵者,这是通过超突变的克隆选择和亲和成熟过程来实现的。能够更好识别抗原的抗体将通过克隆选择增殖,这一过程被称为克隆选择。然后,超突变实现与适应度值成比例的亲和成熟过程,以产生成熟群体。最后,一些亲和性更好的抗体将作为记忆细胞保留下来,以防止以前抗原的再次入侵。该信息处理原理为设计人工免疫算法提供了一些启示,提高了算法的收敛速度,保持了抗体种群的多样性。
  • To solve optimization problems, most of immune algorithmsare designed by mimicking the two important immune principles,such as clonal selection and affinity maturation by hyper-mutation.The first immune optimization algorithm [47] was developed forsolving single-objective optimization problem with an abstractclonal selection concept. Then, De Castro and Timmis proposedan artificial immune network algorithm named opt-aiNet [45] formultimodal optimization, in which the immune network decideswhich antibody will be cloned, repressed or maintained. After that,the learning and optimization algorithm using the clonal selectionprinciple (CLONALG) [46], which takes the affinity maturation ofimmune response into account, was adapted to solve multimodaland combinatorial optimization problems.
  • Motivated by the promising performance of AIS in single-objective optimization problems, immune algorithms are extendedto tackle MOPs. The multi-objective immune system algorithm(MISA) [34], as an early multi-objective immune algorithm, waspresented based on clonal selection principle, in which an exter-nal memory is used to preserve the non-dominated antibodies andonly the highest fitness antibodies will be selected to proliferate. InRefs. [48,49], a vector artificial immune system (VAIS) was reported,which is extended from opt-aiNet [45] by few adjustments to dealwith MOPs. Similar antibodies are inhibited in VAIS, and a numberof new antibodies are added by random sampling to increase thepopulation diversity. Furthermore, an immune dominance clonalmulti-objective algorithm (IDCMA) was designed in Ref. [35], whichadopts Pareto domination relationship to determine the proce-dures of clonal selection with binary string representation. Theimproved version of IDCMA is a non-dominated neighbor-basedimmune algorithm (NNIA) [38], which designs a novel neighbor-based selection technique and population retention strategy toguarantee the population diversity using real-coded representa-tion. A dynamic multi-objective immune algorithm was presentedfor solving constrained nonlinear MOPs [50], which is realized bysimulating the simple interactive metaphors between antibodypopulation and multiple antigens. A novel simplified metaphor ofimmune response is implemented to obtain multiple excellent fea-sible solutions so as to explore the whole feasible PF. This work isfurther extended to the application of greenhouse control [51]. More recently, there are many competitive immune algorithmsstill presented to further enhance the performance. In Ref. [39],a hybrid immune multi-objective optimization algorithm (HIMO)was designed by us, which presents a hybrid mutation operatorcombining Gaussian and polynomial mutations. The performanceof HIMO was also enhanced by us [40] with an adaptive mutationoperator for local search and a fine-grained selection mechanismfor archive update. The adaptive mutation operator is executedaccording to the crowding-distance values, which promotes to useadaptive steps respectively for crowded and less-crowded individ-uals. A novel multi-objective immune algorithm was implementedby using a multiple-affinity model [52], which uses six measuresfor affinity assignment. Based on the selected affinity measures immune operators such as clonal proliferation, hyper-mutationand immune suppression are executed accordingly, which pro-liferate the superiors and suppress the inferiors. Afterwards, anovel immune clonal algorithm (NICA) [41] was presented withan improved clonal selection strategy, which can overcome theshortcomings of simple immune algorithm and well handle somecomplicated MOPs; in Ref. [53], a multi-objective immune algo-rithm with Baldwinian learning (MIAB) was designed, in which aBaldwinian learning strategy is presented to improve the searchcapability of NNIA [38]. The environment information and theevolving history of the parent solution are exploited to generatea predictive improving direction. All the above-mentioned immune algorithms treat the multipleobjectives as a whole and are aimed at optimizing them simulta-neously. However, as the conflicts exist among the objectives, thesimultaneous optimization on all the objectives may decline theconvergence speed on each objective, which is very evident in thecase with many local PFs. For example, some of the above immunealgorithms [38–41] cannot solve very well within the limited gener-ations for the test problems characterized with many local PFs, e.g.,WFG1, DTLZ1 and DTLZ3 [54,55]. Thus, this paper embeds a single-objective optimization process into traditional immune algorithm,which can accelerate the convergence speed for each objective andresultantly enhance the performance. Compared with the aboveimmune algorithms, the distinct feature of our algorithm is thedouble modules cooperatively evolved for solving MOPs and itssuperior performance is also confirmed by the experimental studiesdescribed in Section 4.

本文分享自微信公众号 - DrawSky(wustcsken),作者:CloudXu

原文出处及转载信息见文内详细说明,如有侵权,请联系 yunjia_community@tencent.com 删除。

原始发表时间:2020-07-30

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

我来说两句

0 条评论
登录 后参与评论

相关文章

  • 不完全免疫算法简介IMADE--AIS学习笔记5

    DrawSky
  • jzy3D从入门到弃坑

    下载所有例子,注意其示例是Eclipse的,我喜欢IDEA+Maven,因此,直接将下载文件解压,并将其lib中的所有包全部提取出来都作为依赖文件添加进IDEA...

    DrawSky
  • 不完全免疫算法简介AIMA--AIS学习笔记7

    Most multi-objective immune algorithms (MOIAs) adopt clonal selection to speed u...

    DrawSky
  • Baozi Training Leetcode solution 1169: Invalid Transactions

    FB最近员工跳楼的员工被证实是一位中国员工。死者为大,具体原因目前也不清楚,希望大家也不要过多的猜测。在这里,包子君希望大家一定要学会处理工作和生活中的压力,没...

    包子面试培训
  • Using boosting to learn from errors使用提升法来从误差中学习

    Gradient boosting regression is a technique that learns from its mistakes. Essen...

    到不了的都叫做远方
  • Posgresql高可用集群实践

    工作中一个第三方软件使用了Posgresql数据库,而在我们的场景里,我们需要保证Posgresql数据库的高可用,网上查找了一下,发现stolon这个高可用,...

    jeremyxu
  • Flink如何保存Offset

    版权声明:本文为博主原创,欢迎转载,转载请标明出处 Blog Address:http://blog...

    shengjk1
  • 秋招面试真题解析:如何保证消息队列是高可用的?

    如果你的回答只是表明自己只会订阅和发布消息,面试官就会怀疑你是不是只是自己搭着玩,压根没在生产用过。

    Java_老男孩
  • 用GCC开发STM32,正点原子开发板的一个库函数版本例程示例

    首先下载交叉编译环境GCC,这个网上有很多,百度一下就能找到下载。比如 Sourcery G++ for ARM EABI

    特立独行的猫a
  • IIT 坎普尔咨询集团:将机器学习和管理咨询的方法应用到社会公益中(CS)

    IIT坎普尔咨询集团(IIT Kanpur Consulting Group)是印度的先驱研究机构之一,他们致力于研究机器学习和策略咨询在社会公益中的应用。该集...

    Pamela_Lin

扫码关注云+社区

领取腾讯云代金券