Comparison of heuristic methods for reliability optimization of series-parallel systems /
Three heuristics, the max-min approach, Nakagawa and Nakashima method, and Kim and Yum method, are considered for the redundancy allocation problem with series-parallel structures. The max-min approach can formulate the problem as an integer linear programming problem instead of an integer nonlinear...
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
2003.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | Three heuristics, the max-min approach, Nakagawa and Nakashima method, and Kim and Yum method, are considered for the redundancy allocation problem with series-parallel structures. The max-min approach can formulate the problem as an integer linear programming problem instead of an integer nonlinear problem. This paper presents a comparison between those methods from the standpoint of solution quality and computational complexity. The experimental results show that most of the time the max-min approach is superior to the Nakagawa and Nakashima method and Kim and Yum method for the series-parallel problem with multiple component choices in terms of solution quality, but an analysis of computational complexity shows that the max-min approach is inferior to other greedy heuristics. |
|---|---|
| Item Description: | "Major subject: Industrial Engineering". Vita. |
| Physical Description: | vi, 30 leaves ; 28 cm. Also available online. Issued also on microfiche from Lange Micrographics. |
| Bibliography: | Includes bibliographical references (leaves 28-29). |