Immunity-based hybrid evolutionary algorithm for multi-objective optimization in global container repositioning

The development of evolutionary algorithms for optimization has always been a stimulating and growing research area with an increasing demand in using them to solve complex industrial optimization problems. A novel immunity-based hybrid evolutionary algorithm known as Hybrid Artificial Immune Systems (HAIS) for solving both unconstrained and constrained multi-objective optimization problems is developed in this research. The algorithm adopts the clonal selection and immune suppression theories, with a sorting scheme featuring uniform crossover, multi-point mutation, non-dominance and crowding distance sorting to attain the Pareto optimal front in an efficient manner. The proposed algorithm was verified with nine benchmarking functions on its global optimal search ability as well as compared with four optimization algorithms to assess its diversity and spread. Sensitivity analysis was also carried out to investigate the selection of key parameters of the algorithm. It is found that the developed immunity-based hybrid evolutionary algorithm provides a useful means for solving optimization problems and has successfully applied to the problem of global repositioning of containers, which is one of a constrained multi-objective optimization problem. The developed HAIS will assist shipping liners on timely decision making and planning of container repositioning operations in global container transportation business in an optimized and cost effective manner.     

一种用于入侵检测的改进人工免疫算法

通过对基于信息熵和基于欧氏距离的免疫算法的分析和改进,提出一种新的适用于入侵检测的人工免疫算法（AIAID）。该算法引入马氏距离的思想,改进相似度和期望繁殖率的计算,把抗体不同特征的重要性和取值范围加入到相关运算中,对算法流程进行优化。设计一种新的基于AIAID的入侵检测系统模型。实验表明,将AIAID用于入侵检测能够明显缩短训练时间,提高检测效率。     

面向子空间的否定选择算法

传统的否定选择算法无法有效识别落入到低维子空间的样本,导致算法在高维空间检测性能不佳。为此,本文提出了面向子空间的否定选择算法（Subspace-oriented Real Negative Selection Algorithm, SONSA）。在训练常规检测器的基础上,SONSA将搜索样本分布较密度高的低维子空间以进一步训练面向子空间的检测器,从而提高算法对低维子空间内样本的识别能力。实验结果表明在标准数据集Haberman’s Survival（3维）与Breast Cancer Wisconsin (9维)上,相对于经典的V-Detector算法以及采用PCA降维的V-Detector算法,SONSA能在误报率相似的情况下显著地提高检测率。     

基于事件驱动的动态免疫分簇路由算法*

为了降低应用于突发事件监测的无线传感器网络的能量消耗,设计实现了一种基于事件驱动的动态免疫分簇路由算法。将生物免疫系统的工作机制应用到无线传感器网络事件驱动的动态分簇算法中,事件作为抗原,传感器节点作为抗体,抗体对抗原有记忆保存的功能,使得相似的抗原再次出现时对事件及时响应。相似事件再次发生且传感器节点符合能量要求时,可以直接调用抗体中的记忆,对事件进行快速建簇,节省了簇的建立过程所消耗的大量能量,增加了网络的数据传输量,延长了网络的生命周期。仿真结果表明,生物免疫机制的学习记忆特性可以有效提高事件驱动的动态分簇算法的网络性能。     

On benefits and drawbacks of aging strategies for randomized search heuristics

Quite different search heuristics make use of the concept of assigning an age to search points and systematically remove search points that are too old from the search process. In evolutionary computation one defines some finite maximal lifespan and assigns age 0 to each new search point. In artificial immune systems static pure aging is used. There a finite maximal lifespan is defined but new search points inherit the age of their origin if they do not excel in function value. Both aging mechanisms are supposed to increase the capabilities of the respective search heuristics. A rigorous analysis for two typical difficult situations sheds light on similarities and differences. Considering the behavior on plateaus of constant function values and in local optima both methods are shown to have their strengths and weaknesses. A third aging operator is introduced that provably shares the advantages of both aging mechanisms. Experimental supplements are provided to point out practical implications of the theoretical results and discuss further issues concerning the considered aging strategies.     

Analyzing different variants of immune inspired somatic contiguous hypermutations

Artificial immune systems can be applied to a variety of very different tasks including function optimization. There are even artificial immune systems tailored specifically for this task. In spite of their successful application there is little knowledge and hardly any theoretical investigation about how and why they perform well. Here rigorous analyses for a specific class of mutation operators introduced for function optimization called somatic contiguous hypermutation is presented. Different concrete instantiations of this operator are considered and shown to behave quite differently in general. While there are serious limitations to the performance of this type of operator even for simple optimization tasks it is proven that for some types of optimization problems it performs much better than standard bit mutations most often used in evolutionary algorithms.     

一种IP网络友好的Overlay路由机制*

现有IP网络存在不支持QoS,故障恢复速度慢等问题。作为克服或屏蔽这些缺陷的一种有效手段,Overlay网络在当前Internet上被广泛部署和应用。目前存在很多的Overlay路由结构和方法。然而在现存的多层路由中,上层Overlay网络在路由决策时通常对底层的IP网络性能和状态缺乏有效的协调和感知,致使上层Overlay路由和底层IP路由常常处于非协同、非优化工作状态,产生大量路由抖动和次优路由。为解决这些问题,提出了一种底层IP网络友好的Overlay路由机制,其基本思路为：增加Overlay网络的层感知能力,减少路由抖动增加Overlay路由的稳定性。Overlay网络根据底层IP网络的节点跳数、链路带宽、丢包率等反映底层IP网络性能的信息做出路由决策。实际网络中,通过调整Overlay网络的链路代价有效控制Overlay网络的路由决策。最后仿真结果表明：与传统双重路由（Dual Routing）相比,此IP网络友好Overlay路由机制在减少Overlay网络路由抖动,降低Overlay网络路径代价膨胀,提高Overlay网络故障恢复成功率和满足Overlay业务需求等方面有优势。     

三种混合粒子群算法比较

混合粒子群算法是融合其它算法或技术特性来针对性地对基本粒子群算法进行改进的一类算法.文中对其中有代表性的三种:交叉粒子群、免疫粒子群、混沌粒子群展开了比较研究,分别从混合目的、混合基本方式、混合算法实现的关键步骤、混合算法的优化性能等多个方面对这三种混合算法进行了比较.通过这些比较,总结出了三种混合算法基本的混合方式及...     

基于差异进化的克隆选择算法

针对免疫算法在全局优化过程中多样性不足的问题,将差异进化引入克隆变异操作中,提出了一个新的改进的克隆选择算法——基于差异进化的克隆选择算法(DECSA),算法将差异进化和克隆超变异相结合,促进了抗体与抗体之间的信息融合,使得子代抗体继承父代抗体的信息的同时,携带着不同父代个体信息,丰富了抗体种群的多样性,实现了在同一父代抗体周围的多个方向同时进行全局和局部搜索。对13个标准测试函数的测试结果及与已有的算法的比较表明,该算法表现出较好的局部搜索和全局搜索能力。     

免疫分类研究进展

过去的十多年中,人工免疫系统得到了长足的发展。由于其具备强大的信息处理能力,被广泛应用于模式识别领域,尤其是分类问题。介绍了免疫系统的识别原理、人工免疫原理,包括克隆选择原理、负向选择原理和免疫网络,综述了近年来出现的主要的免疫分类算法,对免疫分类算法性能进行了相互比较,比较了免疫分类算法与其他著名分类算法的性能,结果显示免疫分类算法具有良好的分类性能。