Hybrid particle swarm optimization with differential evolution and chaotic local search to solve reliability-redundancy allocation problems

In order to solve reliability-redundancy allocation problems more effectively, a new hybrid algorithm named CDEPSO is proposed in this work, which combines particle swarm optimization （PSO） with differential evolution （DE） and a new chaotic local search. In the CDEPSO algorithm, DE provides its best solution to PSO if the best solution obtained by DE is better than that by PSO, while the best solution in the PSO is performed by chaotic local search. To investigate the performance of CDEPSO, four typical reliability-redundancy allocation problems were solved and the results indicate that the convergence speed and robustness of CDEPSO is better than those of PSO and CPSO （a hybrid algorithm which only combines PSO with chaotic local search）. And, compared with the other six improved meta-heuristics, CDEPSO also exhibits more robust performance. In addition, a new performance was proposed to more fairly compare CDEPSO with the same six improved recta-heuristics, and CDEPSO algorithm is the best in solving these problems.

IPSO-based hybrid approaches for reliability-redundancy allocation problems

The problem of maximizing system reliability through component reliability choices and component redundancy is called tell-ability-redundancy allocation problem （RAP）, and it is a difficult but realistic nonlinear mixed-integer optimization prob- lem. For the RAP. we pay attention to an improved particle swarm optimization （IPSO）, and introduce four hybrid approaches for combining the IPSO with other conventional search techniques, such as harmony search （HS） and LXPM （a real coded GA）. The basic structure of the hybrid approaches includes two phases. After devising an initial solution by the HS or LXPM technique in the first phase, the IPSO performs an optimal search in the next phase. In addition, a new procedure by using golden search, named GS, is developed for further improving the solutions obtained by IPSO. Consequently, four ISPO-based hybrid approaches are proposed including HS-IPSO, LXPM-IPSO, HS-IPSO-GS, and LXPM-IPSO-GS. In order to validate the per-formance of proposed approaches, five nonlinear mixed-integer RAPs are investigated where both the number of re- dundancy components and the corresponding component reliability in each subsystem are to be decided simultaneously. As shown, the proposed approaches are all superior in terms of both optimal solutions and robustness to those by IPSO. Especially the pro-posed LXPM-IPSO-GS has shown more excellent performance than other typical approaches in the literature.

单目标—多条件约束网络RRAP问题分段迭代PSO算法研究

研究2-状态可靠性-冗余分配问题(简写为RRAP),即选择元件的可靠度与冗余度(都是决策变量),在满足系统的费用、重量和体积等的约束下,使得系统的可靠度最大。构造系统的解结构:由系统的元件可靠度与系统可选元件的冗余度按照子系统元件顺序构成一个行向量,即行向量分量既有实数,又有整数部分。在此基础上,设计新解生成算法;构造具有固定压缩系数、动态权重系数的两阶段迭代粒子群优化算法。对算法用Matlab编程实现,用典型网络进行测试,算法都给出了问题的最优解。因此,适当设计的粒子群优化算法是求解复杂的可靠性-冗余分配问题的有效工具,算法具有原理容易理解,微型计算机上容易实现的特点。

Multiple-Objective Optimization and Design of Series-Parallel Systems Using Novel Hybrid Genetic Algorithm Meta-Heuristic Approach

In this study, we develop a new meta-heuristic-based approach to solve a multi-objective optimization problem, namely the reliability-redundancy allocation problem (RRAP). Further, we develop a new simulation process to generate practical tools for designing reliable series-parallel systems. Because the?RRAP is an NP-hard problem, conventional techniques or heuristics cannot be used to find the optimal solution. We propose a genetic algorithm (GA)-based hybrid meta-heuristic algorithm, namely the hybrid genetic algorithm (HGA), to find the optimal solution. A simulation process based on the HGA is developed to obtain different alternative solutions that are required to generate application tools for optimal design of reliable series-parallel systems. Finally, a practical case study regarding security control of a gas turbine in the overspeed state is presented to validate the proposed algorithm.