The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Clustering-Based Adaptive Crossover and Mutation Probabilities for Genetic Algorithms
Abstract
Research into adjusting the probabilities of crossover and mutation pmin genetic algorithms (GAs) is one of the most significant and promising areas in evolutionary computation. pxand pmgreatly determine whether the algorithm will find a near-optimum solution or whether it will find a solution efficiently. Instead of using fixed values of pxand pm, this paper presents the use of fuzzy logic to adaptively adjust the values of pxand pmin GA. By applying the K-means algorithm, distribution of the population in the search space is clustered in each generation. A fuzzy system is used to adjust the values of pxand pm. It is based on considering the relative size of the cluster containing the best chromosome and the one containing the worst chromosome. The proposed method has been applied to optimize a buck regulator that requires satisfying several static and dynamic operational requirements. The optimized circuit component values, the regulator's performance, and the convergence rate in the training are favorably compared with the GA using fixed values of pxand pm. The effectiveness of the fuzzy-controlled crossover and mutation probabilities is also demonstrated by optimizing eight multidimensional mathematical functions
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Russell, E. L., Chiang, L. H., & Braatz, R. D. (2000) · Advances in Industrial Control · doi:10.1007/978-1-4471-0409-4_3 · Cited by 7,862
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1996) · Springer eBooks · doi:10.1007/978-3-662-03315-9 · Cited by 5,095
Pattern Recognition Principles
(2009) · Classification Methods for Remotely Sensed Data, Second Edition · doi:10.1201/9781420090741.ch2 · Cited by 3,188
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
Pattern Classification (2nd ed.)
Duda, R. O., Hart, P. E., & Stork, D. G. (1999) · Cited by 2,520
Adaptive probabilities of crossover and mutation in genetic algorithms
Srinivas, M., & Patnaik, L. M. (1994) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.286385 · Cited by 2,512
Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
Fogel, D. B. (1995) · IEEE Press eBooks · Cited by 2,283
Evolutionary computation: Comments on the history and current state
Back, T., Hammel, U., & Schwefel, H.-P. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585888 · Cited by 1,536 · cited 1×
“Apart from the shortcomings of early approaches, it was also largely due to the lack of powerful computer platforms at that time [10], [11].”
BackgroundEvolutionary computation: Toward a new philosophy of machine intelligence
B�ck, T. (1997) · Complexity · doi:10.1002/(sici)1099-0526(199703/04)2:4<28::aid-cplx7>3.0.co;2-2 · Cited by 1,533
Principles of Power Electronics
Kassakian, J. G., Perreault, D. J., Verghese, G. C., & Schlecht, M. F. (2023) · Cambridge University Press eBooks · doi:10.1017/9781009023894 · Cited by 1,394
(1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0029723 · Cited by 1,049
Schaffer, J. D., Caruana, R. A., Eshelman, L. J., & Das, R. (1989) · international conference on Genetic algorithms · Cited by 896
Evolutionary Operation: A Method for Increasing Industrial Productivity
Box, G. E. P. (1957) · Applied Statistics · doi:10.2307/2985505 · Cited by 576
Beer, S. (1961) · Journal of the Operational Research Society · doi:10.1057/jors.1961.24 · Cited by 553
Dimopoulos, C., & Zalzala, A. M. S. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.850651 · Cited by 249
Genetic Algorithms Are NOT Function Optimizers
De Jong, K. A. (1993) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-094832-4.50006-4 · Cited by 233
Simulation of biological evolution and machine learning
Reed, J., Toombs, R., & Barricelli, N. A. (1967) · Journal of Theoretical Biology · doi:10.1016/0022-5193(67)90097-5 · Cited by 154
Are Genetic Algorithms Function Optimizers
Jong, K. A. D. (1992) · Cited by 129
Zhang, J., Chung, H. S.-H., Lo, A. W.-L., Hui, S. Y. R., & Wu, A. (2001) · IEEE Transactions on Power Electronics · doi:10.1109/63.974373 · Cited by 82
Self-citationSwitch Mode Power Conversion: Basic Theory and Design
Sum, K. K. (1984) · International Linear Collider · Cited by 45
Cited by
Adaptive Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Chung, H. S.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2015956 · Cited by 2,075
Self-citationAn Overview of Artificial Intelligence Applications for Power Electronics
Zhao, S., Blaabjerg, F., & Wang, H. (2021) · IEEE Transactions on Power Electronics · doi:10.1109/tpel.2020.3024914 · Cited by 947
Civicioglu, P., & Besdok, E. (2013) · Artificial Intelligence Review · doi:10.1007/s10462-011-9276-0 · Cited by 669
Zhan, Z.-H., Li, J., Cao, J., Zhang, J., Chung, H. S.-H., & Shi, Y.-H. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2209115 · Cited by 346
Self-citationEvolutionary Computation Meets Machine Learning: A Survey
Zhang, J., Zhan, Z.-H., Lin, Y., Chen, N., Gong, Y.-J., Zhong, J.-H., Chung, H. S. H., Li, Y., & Shi, Y.-H. (2011) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2011.942584 · Cited by 301
Self-citation
Metadata
- Authors
- Zhang, J., Chung, H. S.-H., & Lo, W.-L.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2007-06
- Volume
- 11
- Issue
- 3
- Pages
- 326-335
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2131202986
- Cited by
- 307
- References
- 24
- FWCI
- 13.79
- 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.