混合种群算法HSO在求解RAP问题中的应用研究  

Application Research of HSO in Solving RAP Problem

作　　者：李学宝[1] 李东魁[1] Li Xuebao;Li Dongkui(Faculty of Information Science and Technology,Baotou Teachers College,Baotou Inner Mongolia,014030)

机构地区：[1]包头师范学院信息科学与技术学院,内蒙古包头014030

出　　处：《电子测试》2022年第1期43-47,130,共6页Electronic Test

基　　金：国家自然科学基金项目(61762071);包头师范学院科研项目(BSYKJ2021-ZY04)。

摘　　要：混合种群算法HSO是研究GRAP问题时给出的群体优化算法,具有结构简单,易于微型计算机上编程实现,收敛速度快等优点。本文研究HSO算法在解决RAP(GRAP问题的特殊情况)问题中的应用,用于求解单目标(费用最小)-单约束(可靠度>=R;)模型,和单目标(可靠度最大)-多约束(费用和重量约束)模型(每个子系统只有一种元件可供选择),并与传统的模拟退火算法SA、遗传算法GA、蚁群算法ACA、粒子群算法PSO等做比较,从而发现HSO算法的优势和不足,为更好的将HSO算法应用于可靠性优化问题奠定基础。Hybrid swarm optimization algorithm HSO is a optimization algorithm given in the study of GRAP problem.It has the advantages of simple structure,easy programming on micro-computer and fast convergence.This paper studies the application of HSO algorithm in solving RAP (special case of GRAP) problem.It is used to solve single objective (minimum cost)-single constraint (reliability >=R;) model and single objective (maximum reliability)-multiple constraint (cost and weight constraints) model (each subsystem has only one component to choose).It is also compared with traditional simulated annealing algorithm SA,genetic algorithm GA,Ant colony algorithm ACA and particle swarm optimization (PSO),to find the advantages and disadvantages of HSO algorithm.This lays the foundation for better application of HSO algorithm to reliability optimization problems.

关 键 词：混合种群算法(HSO) 可靠性冗余分配问题(RAP) 模型 算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]