The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Cooperation search algorithm: A novel metaheuristic evolutionary intelligence algorithm for numerical optimization and engineering optimization problems
Abstract
This paper develops a novel population-based evolutionary method called cooperation search algorithm (CSA) to address the complex global optimization problem. Inspired by the team cooperation behaviors in modern enterprise, the CSA method randomly generates a set of candidate solutions in the problem space, and then three operators are repeatedly executed until the stopping criterion is met: the team communication operator is used to improve the global exploration and determine the promising search area; the reflective learning operator is used to achieve a comprise between exploration and exploitation; the internal competition operator is used to choose solutions with better performances for the next cycle. Firstly, three kinds of mathematical optimization problems (including 24 famous test functions, 25 CEC2005 test problems and 30 CEC2014 test problems) are used to test the convergence speed and search accuracy of the CSA method. Then, several famous engineering optimization problems (like Gear train design, Welded beam design and Speed reducer design) are chosen to testify the engineering practicality of the CSA method. The results in different scenarios demonstrate that as compared with several existing evolutionary algorithms, the CSA method can effectively explore the decision space and produce competitive results in terms of various performance evaluation indicators. Thus, an effective tool is provided for solving the complex global optimization problems.
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
Hansen, N., Müller, S. D., & Koumoutsakos, P. (2003) · Evolutionary Computation · doi:10.1162/106365603321828970 · Cited by 2,601
Cited by
Dwarf Mongoose Optimization Algorithm
Agushaka, J. O., Ezugwu, A. E., & Abualigah, L. (2022) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2022.114570 · Cited by 898
Fire Hawk Optimizer: a novel metaheuristic algorithm
Azizi, M., Talatahari, S., & Gandomi, A. H. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10173-w · Cited by 391
Zhong, C., Li, G., Meng, Z., Li, H., Yildiz, A. R., & Mirjalili, S. (2025) · Neural Computing and Applications · doi:10.1007/s00521-024-10694-1 · Cited by 332
Walrus optimizer: A novel nature-inspired metaheuristic algorithm
Han, M., Du, Z., Yuen, K. F., Zhu, H., Li, Y., & Yuan, Q. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122413 · Cited by 315
Energy valley optimizer: a novel metaheuristic algorithm for global and engineering optimization
Azizi, M., Aickelin, U., A. Khorshidi, H., & Baghalzadeh Shishehgarkhaneh, M. (2023) · Scientific Reports · doi:10.1038/s41598-022-27344-y · Cited by 306
Metadata
- Authors
- Feng, Z.-K., Niu, W.-J., & Liu, S.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2021-01
- Volume
- 98
- Pages
- 106734
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W3087325074
- Cited by
- 208
- References
- 1
- FWCI
- 9.94
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Cooperation search algorithm: A novel metaheuristic evolutionary intelligence algorithm for numerical optimization and engineering optimization problems. https://app.cochat.ai/papers/10.1016/j.asoc.2020.106734
- The paper
- Feng, Z.-K., Niu, W.-J., & Liu, S. (2021). Cooperation search algorithm: A novel metaheuristic evolutionary intelligence algorithm for numerical optimization and engineering optimization problems. Applied Soft Computing. https://doi.org/10.1016/j.asoc.2020.106734
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.