The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
An Enhanced MSIQDE Algorithm With Novel Multiple Strategies for Global Optimization Problems
Abstract
Quantum-inspired differential evolution (QDE) is an evolutionary algorithm, which can effectively solve complex optimization problems. However, sometimes, it easily leads to premature convergence and low search ability and falls to local optima. To overcome these problems, based on the MSIQDE (improved QDE with multistrategies) algorithm, an enhanced MSIQDE algorithm based on mixing multiple strategies, namely, EMMSIQDE is proposed in this article. In the EMMSIQDE, a new differential mutation strategy of a difference vector is proposed to enhance the search ability and descent ability. Then, a new multipopulation mutation evolution mechanism is designed to ensure the relative independence of each subpopulation and the population diversity. The feasible solution space transformation strategy is used to achieve the optimal solution by mapping the quantum chromosome from a unit space to solution space. Finally, some multidimensional unimodal and multimodal functions are selected to demonstrate the optimization performance of EMMSIQDE. The results demonstrate that the EMMSIQDE is significantly better than the DE, QDE, QGA, and MSIQDE, and has better optimization ability, scalability, efficiency, and stability.
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
Price, K. V. (2004) · Cited by 3,344
An Improved Quantum-Inspired Differential Evolution Algorithm for Deep Belief Network
Deng, W., Liu, H., Xu, J., Zhao, H., & Song, Y. (2020) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2020.2983233 · Cited by 429
Self-citationToward a resilient manufacturing system
Zhang, W. J., & van Luttervelt, C. A. (2011) · CIRP Annals · doi:10.1016/j.cirp.2011.03.041 · Cited by 367
A Novel Gate Resource Allocation Method Using Improved PSO-Based QEA
Deng, W., Xu, J., Zhao, H., & Song, Y. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.3025796 · Cited by 337
Self-citationDaily Activity Feature Selection in Smart Homes Based on Pearson Correlation Coefficient
Liu, Y., Mu, Y., Chen, K., Li, Y., & Guo, J. (2020) · Neural Processing Letters · doi:10.1007/s11063-019-10185-8 · Cited by 283
A Cost-Sensitive Deep Belief Network for Imbalanced Classification
Zhang, C., Tan, K. C., Li, H., & Hong, G. S. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2832648 · Cited by 282
Deng, W., Xu, J., Song, Y., & Zhao, H. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2020.106724 · Cited by 281
Self-citationUnsupervised pre-trained filter learning approach for efficient convolution neural network
Rehman, S. U., Tu, S., Waqas, M., Huang, Y., Rehman, O. U., Ahmad, B., & Ahmad, S. (2019) · Neurocomputing · doi:10.1016/j.neucom.2019.06.084 · Cited by 270
An efficient chaotic mutative moth-flame-inspired optimizer for global optimization tasks
Xu, Y., Chen, H., Heidari, A. A., Luo, J., Zhang, Q., Zhao, X., & Li, C. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.03.043 · Cited by 263
Chen, H., Zhang, Q., Luo, J., Xu, Y., & Zhang, X. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2019.105884 · Cited by 257
Cited by
An enhanced fast non-dominated solution sorting genetic algorithm for multi-objective problems
Deng, W., Zhang, X., Zhou, Y., Liu, Y., Zhou, X., Chen, H., & Zhao, H. (2022) · Information Sciences · doi:10.1016/j.ins.2021.11.052 · Cited by 462
Self-citationAn improved differential evolution algorithm and its application in optimization problem
Deng, W., Shang, S., Cai, X., Zhao, H., Song, Y., & Xu, J. (2021) · Soft Computing · doi:10.1007/s00500-020-05527-x · Cited by 383
Self-citationHu, J., Chen, H., Heidari, A. A., Wang, M., Zhang, X., Chen, Y., & Pan, Z. (2021) · Knowledge-Based Systems · doi:10.1016/j.knosys.2020.106684 · Cited by 289
Scientometric Analysis of Quantum Algorithms for VANET Optimization
Pooja, & Kumar Sood, S. (2024) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2024.3428707 · Cited by 9
Metadata
- Authors
- Deng, W., Xu, J., Gao, X.-Z., & Zhao, H.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Published
- 2022-03
- Volume
- 52
- Issue
- 3
- Pages
- 1578-1587
- ISSN
- 2168-2216 (ISSN-L)
- 2168-2232
- OpenAlex
- W3096193467
- Cited by
- 388
- References
- 31
- FWCI
- 31.06
- 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.