The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Reliability optimization of series-parallel systems using a genetic algorithm
Abstract
A problem-specific genetic algorithm (GA) is developed and demonstrated to analyze series-parallel systems and to determine the optimal design configuration when there are multiple component choices available for each of several k-out-of-n:G subsystems. The problem is to select components and redundancy-levels to optimize some objective function, given system-level constraints on reliability, cost, and/or weight. Previous formulations of the problem have implicit restrictions concerning the type of redundancy allowed, the number of available component choices, and whether mixing of components is allowed. GA is a robust evolutionary optimization search technique with very few restrictions concerning the type or size of the design problem. The solution approach was to solve the dual of a nonlinear optimization problem by using a dynamic penalty function. GA performs very well on two types of problems: (1) redundancy allocation originally proposed by Fyffe, Hines, Lee, and (2) randomly generated problem with more complex k-out-of-n:G configurations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
An Introduction to Probability Theory.
Fristedt, B., & Moran, P. A. P. (1986) · Journal of the American Statistical Association · doi:10.2307/2288022 · Cited by 3,300
Optimization of Control Parameters for Genetic Algorithms
Grefenstette, J. (1986) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1986.289288 · Cited by 2,854
Modern heuristic techniques for combinatorial problems
Reeves, C. R. (1993) · Medical Entomology and Zoology · Cited by 2,580
Freimer, M., Bellman, R. E., & Dreyfus, S. E. (1964) · Journal of the American Statistical Association · doi:10.2307/2282884 · Cited by 2,153
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Fisher, M. L. (1981) · Management Science · doi:10.1287/mnsc.27.1.1 · Cited by 2,109
Bellman, R. E., & Dreyfus, S. E. (1962) · Princeton University Press eBooks · doi:10.1515/9781400874651 · Cited by 1,971
Uniform crossover in genetic algorithms
Syswerda, G. (1989) · international conference on Genetic algorithms · Cited by 1,965
Genetic algorithms in optimization of system reliability
Painton, L., & Campbell, J. (1995) · IEEE Transactions on Reliability · doi:10.1109/24.387368 · Cited by 362
A genetic approach to the quadratic assignment problem
Tate, D. M., & Smith, A. E. (1995) · Computers & Operations Research · doi:10.1016/0305-0548(93)e0020-t · Cited by 332
Self-citationA New Interpretation of Schema Notation that Overtums the Binary Encoding Constraint
Antonisse, J. (1989) · international conference on Genetic algorithms · Cited by 155
Dynamic Programming and the Reliability of Multicomponent Devices
Bellman, R., & Dreyfus, S. E. (1958) · Operations Research · doi:10.1287/opre.6.2.200 · Cited by 154
Coaker, P. B., Bellman, R., & Dreyfus, S. E. (1964) · Journal of the Operational Research Society · doi:10.1057/jors.1964.34 · Cited by 126
Cited by
An annotated overview of system-reliability optimization
Kuo, W., & Prasad, V. R. (2000) · IEEE Transactions on Reliability · doi:10.1109/24.877336 · Cited by 665
Evolutionary algorithms in control systems engineering: a survey
Fleming, P. J., & Purshouse, R. C. (2002) · Control Engineering Practice · doi:10.1016/s0967-0661(02)00081-3 · Cited by 619
Singh, S., Rathore, S., Alfarraj, O., Tolba, A., & Yoon, B. (2022) · Future Generation Computer Systems · doi:10.1016/j.future.2021.11.028 · Cited by 386
An Ant Colony Optimization Algorithm for the Redundancy Allocation Problem (RAP)
Liang, Y.-C., & Smith, A. E. (2004) · IEEE Transactions on Reliability · doi:10.1109/tr.2004.832816 · Cited by 374
Self-citationRecent Advances in Optimal Reliability Allocation
Kuo, W., & Wan, R. (2007) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2006.889476 · Cited by 371
Metadata
- Authors
- Coit, D. W., & Smith, A. E.
- Venue
- IEEE Transactions on Reliability
- Published
- 1996-06
- Volume
- 45
- Issue
- 2
- Pages
- 254-260, 266
- ISSN
- 0018-9529 (ISSN-L)
- OpenAlex
- W2116827549
- Cited by
- 759
- References
- 15
- FWCI
- 47.56
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.