By Topic

Heterogeneous Redundancy Allocation for Series-Parallel Multi-State Systems Using Hybrid Particle Swarm Optimization and Local Search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yong Wang ; Sch. of Energy & Power Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Lin Li

A hybrid algorithm of particle swarm optimization (PSO) and local search (LS) is proposed to solve the redundancy allocation problem for series-parallel multi-state systems. The proposed hybrid algorithm is able to design the system structure with a minimum cost to provide a desired level of availability. Unlike most of the previous studies that only consider homogeneous redundancy, the proposed algorithm allows for the heterogeneous redundancy technique. The universal generating function method is applied to evaluate system availability. The standard PSO is modified and novel LS strategies are integrated to adapt to the redundancy allocation problem. Case studies that facilitate comparisons between the proposed hybrid algorithm and other non-hybrid heuristics as well as meta-heuristics reported in the literature (such as genetic algorithms, tabu search, and ant colony optimization) are provided. The results illustrate the advantages of the proposed hybrid algorithm in terms of the solution quality or algorithm efficiency.

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:42 ,  Issue: 2 )