A DE Algorithm Combined with Lévy Flight for Reliability Redundancy Allocation Problems

Yubao Liu; Guihe Qin

A DE Algorithm Combined with Lévy Flight for Reliability Redundancy Allocation Problems

원문정보

Yubao Liu, Guihe Qin

보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.8 No.5 2015.05 pp.113-118

피인용수 : 0건 (자료제공 : 네이버학술정보)

초록

영어

In this paper, a differential evolution (DE) algorithm combined with Lévy flight is proposed to solve the reliability redundancy allocation problems. The Lévy flight is incorporated to enhance the ability of global search of differential evolution algorithm. DE is used for local search mainly. The method considers the trade-off of the diversification and the intensification simultaneously. Experimental results for three benchmark problems demonstrate that the proposed algorithm is more effective for solving the reliability redundancy allocation problems.

Abstract
1. Introduction
2. The Algorithm Based on DE and Lévy Flight
  2.1. Lévy Flight
  2.2. Differential Evolution Algorithm (DE)
3. The DE Algorithm Combined with Lévy Flight
4. Case Studies and Comparisons
  4.1. Case Study 1: Series-Parallel System
  4.2. Case Study 2: Complex (bridge) System
  4.3. Case study 3: Over Speed Protection System
5. Conclusion
Acknowledgment
References

키워드

저자정보

Yubao Liu College of Computer Science and Technology, Jilin University, Changchun, China, College of Computer Science and Technology, Changchun University, Changchun, China
Guihe Qin College of Computer Science and Technology, Jilin University, Changchun, China, Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun, China

참고문헌

자료제공 : 네이버학술정보

함께 이용한 논문

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

0개의 논문이 장바구니에 담겼습니다.

earticle