The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Solving high-dimensional global optimization problems using an improved sine cosine algorithm
Abstract
The sine cosine algorithm (SCA) is a relatively novel population-based optimization technique that has been proven competitive with other algorithms and it has received significant interest from researchers in different fields. However, similar to other population-based algorithms, SCA tends to be trapped in local optima and unbalanced exploitation. Additionally, to our limited knowledge, the present SCA and its variants have not been applied to the high-dimensional global optimization problems. This paper presents an improved version of the SCA (ISCA) for solving high-dimensional problems. A modified position-updating equation by introducing inertia weight is proposed to accelerate convergence and avoid falling into the local optima. In addition, to balance the exploration and exploitation of the SCA, we present a new nonlinear conversion parameter decreasing strategy based on the Gaussian function. The effectiveness of the proposed ISCA is evaluated using 24 benchmark high-dimensional (D = 30, 100, 500, 1000, and 5000) functions, large-scale global optimization problems from the IEEE CEC2010 competition, and several real-world engineering applications. The comparisons show that the proposed ISCA can better escape from local optima with faster convergence than both the traditional SCA and other population-based algorithms.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Hansen, N., Müller, S. D., & Koumoutsakos, P. (2003) · Evolutionary Computation · doi:10.1162/106365603321828970 · Cited by 2,601
A Competitive Swarm Optimizer for Large Scale Optimization
Cheng, R., & Jin, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2322602 · Cited by 1,052
Cited by
A hybrid model for building energy consumption forecasting using long short term memory networks
Somu, N., M R, G. R., & Ramamritham, K. (2020) · Applied Energy · doi:10.1016/j.apenergy.2019.114131 · Cited by 396
Advances in Sine Cosine Algorithm: A comprehensive survey
Abualigah, L., & Diabat, A. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-020-09909-3 · Cited by 349
Zhang, Y., & Jin, Z. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113246 · Cited by 262
Quantum-inspired metaheuristic algorithms: comprehensive survey and classification
Gharehchopogh, F. S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10280-8 · Cited by 253
Lyu, F., Fan, X., Ding, F., & Chen, Z. (2021) · Composite Structures · doi:10.1016/j.compstruct.2021.114282 · Cited by 77
Metadata
- Authors
- Long, W., Wu, T., Liang, X., & Xu, S.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2019-06
- Volume
- 123
- Pages
- 108-126
- ISSN
- 0957-4174 (ISSN-L)
- OpenAlex
- W2903473811
- Cited by
- 180
- References
- 4
- FWCI
- 10.18
- 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: Solving high-dimensional global optimization problems using an improved sine cosine algorithm. https://app.cochat.ai/papers/10.1016/j.eswa.2018.11.032
- The paper
- Long, W., Wu, T., Liang, X., & Xu, S. (2019). Solving high-dimensional global optimization problems using an improved sine cosine algorithm. Expert Systems with Applications. https://doi.org/10.1016/j.eswa.2018.11.032
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.