Loading...
Please wait, while we are loading the content...
Similar Documents
Optimization approaches to the redundancy allocation problem for series-parallel systems (1995).
| Content Provider | CiteSeerX |
|---|---|
| Author | Coit, David W. Smith, Alice E. |
| Abstract | The redundancy allocation problem involves the selection of components and the appropriate levels of redundancy to maximize reliability or minimize cost of a series-parallel system given design constraints. Different optimization approaches have been previously applied to the problem including dynamic programming, integer programming, and mixed integer and nonlinear programming. However these approaches can only solve sub-classes of the problem. This paper presents a review of the different optimization approaches and presents a new approach, a genetic algorithm (GA) which can solve the general class of the redundancy allocation problem. The GA is demonstrated on two different problems and compared with the other techniques. INTRODUCTION Determination of an optimal or near optimal system design is very important to economically produce new systems which meet and exceed customers' expectations for reliability, quality and performance. When developing a new system, there are detailed e... |
| File Format | |
| Publisher Date | 1995-01-01 |
| Access Restriction | Open |
| Subject Keyword | Redundancy Allocation Problem Series-parallel System Optimization Approach Different Optimization Approach New System Appropriate Level Dynamic Programming Genetic Algorithm Mixed Integer Introduction Determination Optimal System Design New Approach Different Problem Design Constraint Nonlinear Programming General Class Integer Programming |
| Content Type | Text |
| Resource Type | Article |
