A new exact solution algorithm for a novel generalized redundancy allocation problem

The traditional redundancy allocation problem (RAP) aims to determine a system structure that strikes an appropriate balance between series and parallel components and that maximizes reliability by using redundant components in parallel, thus satisfying resource consumption constraints. The RAP is a...

Full description

Saved in:
Bibliographic Details
Published in:Information sciences Vol. 408; pp. 182 - 197
Main Author: Yeh, Wei-Chang
Format: Journal Article
Language:English
Published: Elsevier Inc 01.10.2017
Subjects:
Redundancy allocation problem (RAP)
Reliability
Soft computing
Swarm intelligence
Swarm intelligence
Soft computing
Reliability
Redundancy allocation problem (RAP)
ISSN:0020-0255, 1872-6291
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The traditional redundancy allocation problem (RAP) aims to determine a system structure that strikes an appropriate balance between series and parallel components and that maximizes reliability by using redundant components in parallel, thus satisfying resource consumption constraints. The RAP is a well-known NP-hard problem and has been an active area of research for the past four decades. By extending the series–parallel structure to a more general network structure, this paper proposes a novel RAP called the generalized RAP (GRAP). To reduce the computational burden in solving this intractable GRAP, a new algorithm, called the hybrid swarm optimization (HSO), is proposed. The HSO combines concepts from simplified swarm optimization (SSO), particle swarm optimization (PSO), simulated annealing, and network reliability methods. The paper presents designed experiments and computational studies that demonstrate the potential of using the proposed HSO for the GRAP instead of using the genetic algorithm, PSO, or SSO.
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2017.04.019