Hybrid particle swarm optimization with differential evolution and chaotic local search to solve reliability-redundancy allocation problems
来源期刊:中南大学学报(英文版)2013年第6期
论文作者:TAN Yue(谭跃) TAN Guan-zheng(谭冠政) DENG Shu-guang(邓曙光)
文章页码:1572 - 1581
Key words:particle swarm optimization; differential evolution; chaotic local search; reliability-redundancy allocation
Abstract: 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 meta-heuristics, and CDEPSO algorithm is the best in solving these problems.
TAN Yue(谭跃)1, 2, TAN Guan-zheng(谭冠政)1, DENG Shu-guang(邓曙光)2
(1. School of Information Science and Engineering, Central South University, Changsha 410083, China;2. School of Communication and Electronic Engineering, Hunan City University, Yiyang 413000, China)
Abstract: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 meta-heuristics, and CDEPSO algorithm is the best in solving these problems.
Key words:particle swarm optimization; differential evolution; chaotic local search; reliability-redundancy allocation