一种基于Minmax算法的混合MIMIC算法  

A Hybrid MIMIC Algorithm Based on Minmax Algorithm

作　　者：夏桂梅[1] 张文林[1] 张金风[1] 

机构地区：[1]太原科技大学应用科学学院,山西太原030024

出　　处：《宁夏大学学报（自然科学版）》2016年第4期416-419,共4页Journal of Ningxia University(Natural Science Edition)

基　　金：山西省自然科学基金资助项目(2014011006-2);太原科技大学研究生教育改革课题(20133001);太原科技大学博士基金资助项目(20122026)

摘　　要：将Minmax算法与MIMIC算法相结合,提出一种基于Minmax算法的混合MIMIC算法.该算法不再利用传统的约束保持法和可行规则法处理约束条件,而是结合Minmax算法的思想将约束问题转化为无约束问题,并利用MIMIC算法对无约束问题求解.数值试验结果表明:该算法能收敛到满足约束条件的全局最优解,并且具有很强的全局搜索能力,为解决非线性约束优化问题提供了一种新的有效途径.MIMIC algorithm is combined with Minmax algorithm to propose a hybrid MIMIC algorithm based on Minmax.The proposed algorithm breaks the commonly used method of constraint preserving and feasible rule,and the constrained optimization problems are transformed into unconstrained optimization problems through Minmax algorithm,then the MIMIC algorithm is applied to solve the unconstrained optimization problems.The simulation results show that the proposed algorithm has stronger global search ability and can converge to the best optimum of meeting constrained.Therefore,a novel way of solving constrained optimization problems is provided.

关 键 词：MIMIC算法 Minmax算法 非线性约束优化 

分 类 号：O221[理学—运筹学与控制论]