An efficient heuristic for series-parallel redundant reliability problems

Authors:
Peng-Sheng You;Ta-Cheng Chen
Affiliations:
Graduate Institute of Transportation & Logistics, National Chia-Yi University, 300 Shiue-Fu Road, Chia- Yi 600, Taiwan;Department of Information Management, National Huwei Institute of Technology, 300 Shiue-Fu Road, Chia- Yi 600, Taiwan
Venue:
Computers and Operations Research
Year:
2005

Citing 3
Cited 9

Penalty guided genetic search for reliability design optimization

Computers and Industrial Engineering
Genetic algorithm for non-linear mixed integer programming problems and its applications

Computers and Industrial Engineering
A linear approximation for redundant reliability problems with multiple component choices

Computers and Industrial Engineering

A knowledge management system for series-parallel availability optimization and design

Expert Systems with Applications: An International Journal
A cross entropy based algorithm for reliability problems

Journal of Heuristics
Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm

Journal of Heuristics
Reliability optimization of a series system with multiple-choice and budget constraints using an efficient ant colony approach

Expert Systems with Applications: An International Journal
Reliability analysis of waste clean-up manipulator using genetic algorithms and fuzzy methodology

Computers and Operations Research
Alternative design redundancy allocation using an efficient heuristic and a honey bee mating algorithm

Expert Systems with Applications: An International Journal
Reliability analysis of complex multi-robotic system using GA and fuzzy methodology

Applied Soft Computing
Annealing-based particle swarm optimization to solve the redundant reliability problem with multiple component choices

Applied Soft Computing
A PSO algorithm for constrained redundancy allocation in multi-state systems with bridge topology

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a novel algorithm for solving a series-parallel redundancy allocation problem with separable constraints. The idea of a heuristic approach design is inspired from the greedy method and the genetic algorithm. The structure of the algorithm includes: (1) randomly generating a specified population size number of minimum workable solutions; (2) assigning components either according to the greedy method or to the random selection method; and (3) improving solutions through an inner-system and intersystem solution revision process. Numerical results for the 33 test problems from previous research are reported and compared. As reported in this paper, the solutions found by our approach are all better than or are in par with the well-known best solutions from the approach taken by previous solutions.