The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
The Sailfish Optimizer: A novel nature-inspired metaheuristic algorithm for solving constrained engineering optimization problems
Abstract
Abstract Nature-inspired optimization algorithms, especially swarm based algorithms (SAs), solve many scientific and engineering problems due to their flexibility and simplicity. These algorithms are applicable for optimization problems without structural modifications. This work presents a novel nature-inspired metaheuristic optimization algorithm, called SailFish Optimizer (SFO), which is inspired by a group of hunting sailfish. This method consists of two tips of populations, sailfish population for intensification of the search around the best so far and sardines population for diversification of the search space. The SFO algorithm is evaluated on 20 well-known unimodal and multimodal mathematical functions to test different characteristics of the algorithm. In addition, SFO is compared with the six state-of-art metaheuristic algorithms in low and high dimensions. It also indicates competitive results for improvement of exploration and exploitation phases, avoidance of local optima, and high speed convergence especially on large-scale global optimization. The SFO algorithm outperforms the best algorithms in the literature on the majority of the test functions and it shows the statistically significant difference among other algorithms. Moreover, the SFO algorithm shows significantly great results for non-convex, non-separable and scalable test functions. Eventually, the promising results on five real world optimization problems indicate that the SFO is applicable for problem solving with constrained and unknown search spaces.
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
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
Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2013.12.007 · Cited by 19,343
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
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
GSA: A Gravitational Search Algorithm
Rashedi, E., Nezamabadi-pour, H., & Saryazdi, S. (2009) · Information Sciences · doi:10.1016/j.ins.2009.03.004 · Cited by 7,358
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
Holland, J. H. (1992) · Scientific American · doi:10.1038/scientificamerican0792-66 · Cited by 5,764
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems
Mirjalili, S., Gandomi, A. H., Mirjalili, S. Z., Saremi, S., Faris, H., & Mirjalili, S. M. (2017) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2017.07.002 · Cited by 5,082
Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm
Mirjalili, S. (2015) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.07.006 · Cited by 4,626
Mirjalili, S. (2015) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2015.01.010 · Cited by 3,233
Coello Coello, C. A. (2002) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(01)00323-1 · Cited by 2,343
Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems
Gandomi, A. H., Yang, X.-S., & Alavi, A. H. (2013) · Engineering with Computers · doi:10.1007/s00366-011-0241-y · Cited by 2,257
Askarzadeh, A. (2016) · Computers & Structures · doi:10.1016/j.compstruc.2016.03.001 · Cited by 2,216
Dorigo, M., Birattari, M., & Stutzle, T. (2006) · IEEE Computational Intelligence Magazine · doi:10.1109/ci-m.2006.248054 · Cited by 1,880
Eskandar, H., Sadollah, A., Bahreininejad, A., & Hamdi, M. (2012) · Computers & Structures · doi:10.1016/j.compstruc.2012.07.010 · Cited by 1,660
Symbiotic Organisms Search: A new metaheuristic optimization algorithm
Cheng, M.-Y., & Prayogo, D. (2014) · Computers & Structures · doi:10.1016/j.compstruc.2014.03.007 · Cited by 1,575
A study of particle swarm optimization particle trajectories
VANDENBERGH, F., & ENGELBRECHT, A. (2006) · Information Sciences · doi:10.1016/j.ins.2005.02.003 · Cited by 1,397
A literature survey of benchmark functions for global optimisation problems
Jamil, M., & Yang, X. S. (2013) · International Journal of Mathematical Modelling and Numerical Optimisation · doi:10.1504/ijmmno.2013.055204 · Cited by 1,301
A combined genetic adaptive search (GeneAS) for engineering design
Deb, K., & Goyal, M. K. (1996) · Cited by 1,229
An effective co-evolutionary particle swarm optimization for constrained engineering design problems
He, Q., & Wang, L. (2007) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2006.03.003 · Cited by 1,105
Nonlinear Integer and Discrete Programming in Mechanical Design Optimization
Sandgren, E. (1990) · Journal of Mechanical Design · doi:10.1115/1.2912596 · Cited by 757
Liu, H., Cai, Z., & Wang, Y. (2009) · Applied Soft Computing · doi:10.1016/j.asoc.2009.08.031 · Cited by 702
CONSTRAINT-HANDLING USING AN EVOLUTIONARY MULTIOBJECTIVE OPTIMIZATION TECHNIQUE
Coello, C. A. C. (2000) · Civil Engineering and Environmental Systems · doi:10.1080/02630250008970288 · Cited by 367
Samareh Moosavi, S. H., & Khatibi Bardsiri, V. (2017) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2017.01.006 · Cited by 309
Bailey, I., Myatt, J. P., & Wilson, A. M. (2013) · Behavioral Ecology and Sociobiology · doi:10.1007/s00265-012-1423-3 · Cited by 225
A Literature Survey of Benchmark Functions For Global Optimization ProblemsPreprint
(2016) · Cited by 213
Nature-Inspired Algorithms and Applied Optimization
(2018) · Studies in Computational Intelligence · doi:10.1007/978-3-319-67669-2 · Cited by 187
Marras, S., Noda, T., Steffensen, J. F., Svendsen, M. B. S., Krause, J., Wilson, A. D. M., Kurvers, R. H. J. M., Herbert‐Read, J. E., Boswell, K. M., & Domenici, P. (2015) · Integrative and Comparative Biology · doi:10.1093/icb/icv017 · Cited by 54
Cited by
Henry gas solubility optimization: A novel physics-based algorithm
Hashim, F. A., Houssein, E. H., Mabrouk, M. S., Al-Atabany, W., & Mirjalili, S. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.07.015 · Cited by 1,061
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
Rajwar, K., Deep, K., & Das, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10470-y · Cited by 687
Political Optimizer: A novel socio-inspired meta-heuristic for global optimization
Askari, Q., Younas, I., & Saeed, M. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2020.105709 · Cited by 615
Thirunavukkarasu, M., Sawle, Y., & Lala, H. (2023) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2023.113192 · Cited by 543
Metadata
- Authors
- Shadravan, S., Naji, H. R., & Bardsiri, V. K.
- Venue
- Engineering Applications of Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2019-04
- Volume
- 80
- Pages
- 20-34
- ISSN
- 0952-1976 (ISSN-L)
- OpenAlex
- W2914717758
- Cited by
- 634
- References
- 30
- FWCI
- 31.89
- 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.