An efficient particle swarm approach for mixed-integer programming in reliability–redundancy optimization applications
The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067 · cited 3×
“PSO, first introduced by Kennedy and Eberhart [23,24], is a stochastic global optimization technique inspired by social behavior of bird flocking or fish schooling.”
BackgroundInfluentialThe particle swarm - explosion, stability, and convergence in a multidimensional complex space
Clerc, M., & Kennedy, J. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.985692 · Cited by 9,017
(1998) · doi:10.1142/3481 · Cited by 4,436
Empirical study of particle swarm optimization
Shi, Y., & Eberhart, R. C. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785511 · Cited by 3,945 · cited 4×
“PSO, first introduced by Kennedy and Eberhart [23,24], is a stochastic global optimization technique inspired by social behavior of bird flocking or fish schooling.”
BackgroundInfluentialEvolutionary programming made faster
Yao, X., Liu, Y., & Lin, G. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771163 · Cited by 3,910
A two-dimensional mapping with a strange attractor
Hénon, M. (1976) · Communications in Mathematical Physics · doi:10.1007/bf01608556 · Cited by 2,987 · cited 1×
“Inspired by the Gaussian probability distribution and chaotic motion ideas, this paper provides a novel combined optimization method, which introduces chaotic mapping into PSO based on Hénon map [55] so as to improve the global convergence and also a Gaussian probability distribution to improve the local convergence.”
MethodCoello Coello, C. A. (2002) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(01)00323-1 · Cited by 2,343
Evolutionary Algorithms for Constrained Parameter Optimization Problems
Michalewicz, Z., & Schoenauer, M. (1996) · Evolutionary Computation · doi:10.1162/evco.1996.4.1.1 · Cited by 1,718
Peitgen, H.-O., Jürgens, H., & Saupe, D. (2004) · doi:10.1007/b97624 · Cited by 1,534
Practical numerical algorithms for chaotic systems
(1990) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(90)90156-d · Cited by 1,506
Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization
Koziel, S., & Michalewicz, Z. (1999) · Evolutionary Computation · doi:10.1162/evco.1999.7.1.19 · Cited by 758
Chaos and fractals: new frontiers of science
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5052c · Cited by 730
Particle swarm optimization with Gaussian mutation
Higashi, N., & Iba, H. (2004) · Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706) · doi:10.1109/sis.2003.1202250 · Cited by 544
Chaotic sequences to improve the performance of evolutionary algorithms
Caponetto, R., Fortuna, L., Fazzino, S., & Xibilia, M. G. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810069 · Cited by 519
On the efficiency of chaos optimization algorithms for global optimization
Yang, D., Li, G., & Cheng, G. (2007) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2006.04.057 · Cited by 414
Kendall, B. E. (2001) · Encyclopedia of Life Sciences · doi:10.1038/npg.els.0003314 · Cited by 383
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
Recent 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 · cited 1×
“Recently, many meta-heuristics [3,4], such as evolutionary algorithms [5–13], tabu search [14,15], ant colony optimization [16–19], artificial immune system [20], fuzzy system [21], and artificial neural networks [22] have been employed in”
BackgroundEfficiently Solving the Redundancy Allocation Problem Using Tabu Search
Kulturel-Konak, S., Smith, A. E., & Coit, D. W. (2003) · IIE Transactions · doi:10.1080/07408170304422 · Cited by 285 · cited 1×
“The reliability–redundancy optimizations are useful for system designs that are largely assembled and manufactured using off-the-shelf components, and also, have high reliability requirements [39].”
BackgroundChaotic particle swarm optimization for economic dispatch considering the generator constraints
Cai, J., Ma, X., Li, L., & Peng, H. (2006) · Energy Conversion and Management · doi:10.1016/j.enconman.2006.05.020 · Cited by 278
Multiobjective optimization by genetic algorithms: application to safety systems
Busacca, P. G., Marseguerra, M., & Zio, E. (2001) · Reliability Engineering & System Safety · doi:10.1016/s0951-8320(00)00109-5 · Cited by 267
Coelho, L. D. S., & Lee, C.-S. (2008) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2007.08.001 · Cited by 249 · cited 1×
“The procedure for implementing the global version of canonical PSO is given by the following steps [33,34]: Step 1.”
MethodSelf-citationOPTIMIZING COMPLEX FUNCTIONS BY CHAOS SEARCH
Jiang, B. (1998) · Cybernetics & Systems · doi:10.1080/019697298125678 · Cited by 238
Soft computing approach for reliability optimization: State-of-the-art survey
Gen, M., & Yun, Y. (2006) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2005.11.053 · Cited by 196
Coelho, L. D. S., & Mariani, V. C. (2009) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2007.01.093 · Cited by 175 · cited 1×
“The procedure for implementing the global version of canonical PSO is given by the following steps [33,34]: Step 1.”
MethodSelf-citationTabu search for the redundancy allocation problem of homogenous series–parallel multi-state systems
Ouzineb, M., Nourelfath, M., & Gendreau, M. (2008) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2007.06.004 · Cited by 168 · cited 1×
“Recently, many meta-heuristics [3,4], such as evolutionary algorithms [5–13], tabu search [14,15], ant colony optimization [16–19], artificial immune system [20], fuzzy system [21], and artificial neural networks [22] have been employed in”
BackgroundSamrout, M., Yalaoui, F., Châtelet, Ė., & Chebbo, N. (2004) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2004.09.005 · Cited by 121
Visualizing particle swarm optimization - Gaussian particle swarm optimization
Secrest, B. R., & Lamont, G. B. (2004) · IEEE Swarm Intelligence Symposium · doi:10.1109/sis.2003.1202268 · Cited by 119
Nahas, N., Nourelfath, M., & Aı̈t-Kadi, D. (2006) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2005.12.002 · Cited by 105 · cited 1×
“[41] Chen [19] This paper (using PSOGC)”
Basics of genetic algorithms optimization for RAMS applications
Marseguerra, M., Zio, E., & Martorell, S. (2006) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2005.11.046 · Cited by 93
Coelho, L. D. S., & Krohling, R. A. (2006) · Springer eBooks · doi:10.1007/3-540-32400-3_22 · Cited by 63
Self-citationA Fast Particle Swarm Optimization Algorithm with Cauchy Mutation and Natural Selection Strategy
Li, C., Liu, Y., Zhou, A., Kang, L., & Wang, H. (2007) · Springer eBooks · doi:10.1007/978-3-540-74581-5_37 · Cited by 59
A cellular evolutionary approach applied to reliability optimization of complex systems
Rocco, C. M., Miller, A., Moreno, J. A., & Carrasquero, N. (2002) · Annual Reliability and Maintainability Symposium (RAMS) · doi:10.1109/rams.2000.816309 · Cited by 26
Cited by
Coelho, L. D. S. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.06.044 · Cited by 544
Self-citationSoftware Architecture Optimization Methods: A Systematic Literature Review
Aleti, A., Buhnova, B., Grunske, L., Koziolek, A., & Meedeniya, I. (2013) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2012.64 · Cited by 293
A novel global harmony search algorithm for reliability problems
Zou, D., Gao, L., Wu, J., Li, S., & Li, Y. (2010) · Computers & Industrial Engineering · doi:10.1016/j.cie.2009.11.003 · Cited by 193
“The first two examples include a complex (bridge) system and an overspeed protection system used by Coelho (2009). The third example is a large-scale system reliability optimization design problem which was investigated by Prasad and Kuo (2000) and Gen and Yun (2006).”
BackgroundMethodInfluential
Metadata
- Authors
- Coelho, L. D. S.
- Venue
- Reliability Engineering & System Safety
- Publisher
- Elsevier BV
- Published
- 2009-04
- Volume
- 94
- Issue
- 4
- Pages
- 830-837
- ISSN
- 0951-8320 (ISSN-L)
- OpenAlex
- W2005954501
- Cited by
- 208
- References
- 35
- FWCI
- 36.58
- 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.