非线性多目标概率约束规划免疫优化算法  

Immune optimization algorithm for nonlinear multi-objective probabilistic constrained programming

作　　者：张仁崇 张著洪 ZHANG Renchong;ZHANG Zhuhong(Computer and Information Engineering College,Guizhou University of Commerce,Guiyang 550014,China;College of Big Data and Information Engineering,Guizhou University,Guiyang 550025,China)

机构地区：[1]贵州商学院计算机与信息工程学院,贵阳550014 [2]贵州大学大数据与信息工程学院,贵阳550025

出　　处：《北京航空航天大学学报》2020年第5期900-914,共15页Journal of Beijing University of Aeronautics and Astronautics

基　　金：国家自然科学基金(61563009);贵州省教育厅青年科技人才成长项目(黔教合KY字[2018]276);贵州省大数据应用工程研究中心(黔教合KY字[2017]022)。

摘　　要：针对噪声信息未知的一般非线性多目标概率约束规划(MOPCP)问题,探讨基于危险理论的多目标免疫优化算法(MOIOA)。算法设计中,借助自适应采样方法估计机会约束的概率和目标值;借助危险理论蕴含的应答模式分割进化种群为已感染、易感染和未感染子群;借助二进制交叉、自适应变异概率、多项式变异策略平衡种群的全局与局部搜索能力。与7种算法相比较获得的数值结果表明,所提算法的搜索效率有明显优势且搜索效果有一定的优越性,同时对复杂工程问题有应用潜力。This paper investigates a Multi-Objective Immune Optimization Algorithm(MOIOA)based on danger theory to solve the problem of nonlinear Multi-Objective Probabilistic Constrained Programming(MOPCP)with unknown noise information.In the design of the algorithm,adaptive sampling methods are used to estimate each chance constraint’s probability and objective values,while each evolving population is divided into infected,susceptible and uninfected sub-populations in terms of one specific immune response mechanism contained by danger theory.The capability of global and local search can be enhanced,relying upon simulated binary crossover,adaptive mutation probability and polynomial mutation strategy.Numerical experiment results show that the proposed multi-objective algorithm has high efficiency and has some advantages over seven comparative methods with regard to solution quality.It has application potential to complex engineering problems.

关 键 词：多目标概率约束规划(MOPCP) 免疫优化 危险理论 自适应采样 随机模拟 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]