Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm
The DOI matches its Crossref record; 70 of the 70 references it cites were found in a registry or an index.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2013.12.007 · Cited by 19,343
Self-citationGoldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067 · cited 15×
“We solved this problem by the MFO algorithm and compare it to GSA, GA [61] [62, 63], CPSO [64], HS [65], Richardson’s random method, Simplex method, Davidon-Fletcher-Powell, and Griffith and Stewart’s successive linear approximation [66].”
MethodInfluentialNo 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
Karaboga, D., & Basturk, B. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9149-x · Cited by 7,651
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
Research works printed but not linked: 28
- Rechenberg, 1973, Evolution strategy: optimization of technical systems by means of biological evolution, Fromman-Holzboog, Stuttgart, 104
- L. Davis, Bit-Climbing, Representational bias, and test suite design, in: ICGA, 1991, pp. 18–23.
- H.R. Lourenço, O.C. Martin, T. Stutzle, Iterated local search, 2001. Available from arXiv:preprint math/0102188. · arXiv
- Eiben, 1998, On evolutionary exploration and exploitation, Fundam. Inform., 35, 35, 10.3233/FI-1998-35123403 · doi:10.3233/fi-1998-35123403
- C. Liu, M. Han, X. Wang, A novel evolutionary membrane algorithm for global numerical optimization, in: 2012 Third International Conference on Intelligent Control and Information Processing (ICICIP), 2012, pp. 727–732. · doi:10.1109/icicip.2012.6391475
- Krishnanand, 2009, Glowworm swarm optimisation: a new method for optimising multi-modal functions, Int. J. Comput. Intell. Stud., 1, 93, 10.1504/IJCISTUDIES.2009.025340 · doi:10.1504/ijcistudies.2009.025340
- X.S. Yang, Firefly algorithm, in: Engineering Optimization, 2010, pp. 221–230. · doi:10.1002/9780470640425.ch17
- Oftadeh, 2010, A novel meta-heuristic optimization algorithm inspired by group hunting of animals: hunting search, Comput. Math. Appl., 60, 2087, 10.1016/j.camwa.2010.07.049 · DOI
- Alatas, 2012, A novel chemistry based metaheuristic optimization method for mining of classification rules, Expert Syst. Appl., 39, 11080, 10.1016/j.eswa.2012.03.066 · doi:10.1016/j.eswa.2012.03.066
- Moein, 2014, KGMO: a swarm optimization algorithm based on the kinetic energy of gas molecules, Inf. Sci., 275, 127, 10.1016/j.ins.2014.02.026 · doi:10.1016/j.ins.2014.02.026
- Sadollah, 2013, Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems, Appl. Soft Comput., 13, 2592, 10.1016/j.asoc.2012.11.026 · DOI
- Moosavian, 2014, Soccer league competition algorithm: a novel meta-heuristic algorithm for optimal design of water distribution networks, Swarm Evol. Comput., 17, 14, 10.1016/j.swevo.2014.02.002 · doi:10.1016/j.swevo.2014.02.002
- Cuevas, 2014, An optimization algorithm inspired by the states of matter that improves the balance between exploration and exploitation, Appl. Intell., 40, 256, 10.1007/s10489-013-0458-0 · DOI
- Molga, 2005, Test functions for optimization needs, Test Funct. Opt. Needs
- Ragsdell, 1976, Optimal design of a class of welded structures using geometric programming, ASME J. Eng. Ind., 98, 1021, 10.1115/1.3438995 · doi:10.1115/1.3438995
- Kannan, 1994, An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design, J. Mech. Des., 116, 405, 10.1115/1.2919393 · doi:10.1115/1.2919393
- Ray, 2001, Engineering design optimization using a swarm with an intelligent information sharing among individuals, Eng. Opt., 33, 735, 10.1080/03052150108940941 · DOI
- K. Deb, A.S. Gene, A robust optimal design technique for mechanical component design, in: D. Dasgupta, Z. Michalewicz (Eds.), Evolutionary Algorithms in Engineering Applications, Berlin, 1997. · DOI
- Mezura-Montes, 2008, An empirical study about the usefulness of evolution strategies to solve constrained optimization problems, Int. J. Gen. Syst., 37, 443, 10.1080/03081070701303470 · doi:10.1080/03081070701303470
- Kannan, 1994, An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design, J. Mech. Des., 116, 405, 10.1115/1.2919393 · doi:10.1115/1.2919393
- E. Sandgren, Nonlinear integer and discrete programming in mechanical design, 1988, pp. 95–105. · doi:10.1115/detc1988-0012
- Wang, 2003, Adaptive response surface method using inherited latin hypercube design points, J. Mech. Des., 125, 210, 10.1115/1.1561044 · doi:10.1115/1.1561044
- Belegundu, 1983, Study of mathematical programming methods for structural optimization, Diss. Abst. Int. Pt. B – Sci. Eng., 43, 1983
- Li, 2009, A heuristic particle swarm optimization method for truss structures with discrete variables, Comput. Struct., 87, 435, 10.1016/j.compstruc.2009.01.004 · doi:10.1016/j.compstruc.2009.01.004
- Sadollah, 2012, Mine blast algorithm for optimization of truss structures with discrete variables, Comput. Struct., 102, 49, 10.1016/j.compstruc.2012.03.013 · DOI
- Xie, 2011, Optimal preliminary propeller design based on multi-objective optimization approach, Proc. Eng., 16, 278, 10.1016/j.proeng.2011.08.1084 · doi:10.1016/j.proeng.2011.08.1084
- Kim, 2009, Design of propeller geometry using streamline-adapted blade sections, J. Mar. Sci. Technol., 14, 161, 10.1007/s00773-008-0032-3 · doi:10.1007/s00773-008-0032-3
- B. Epps, J. Chalfant, R. Kimball, A. Techet, K. Flood, C. Chryssostomidis, OpenProp: sn open-source parametric design and analysis tool for propellers, in: Proceedings of the 2009 Grand Challenges in Modeling & Simulation Conference, 2009, pp. 104–111.
Cited by
Items 101–109 of 109
Hunter–prey optimization: algorithm and applications
Naruei, I., Keynia, F., & Sabbagh Molahosseini, A. (2022) · Soft Computing · doi:10.1007/s00500-021-06401-0 · Cited by 264
Diab, A. A. Z., Sultan, H. M., Mohamed, I. S., Kuznetsov, O. N., & Do, T. D. (2019) · IEEE Access · doi:10.1109/access.2019.2936656 · Cited by 260
Chen, H., Zhang, Q., Luo, J., Xu, Y., & Zhang, X. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2019.105884 · Cited by 257
Battle royale optimization algorithm
Rahkar Farshi, T. (2021) · Neural Computing and Applications · doi:10.1007/s00521-020-05004-4 · Cited by 253
A novel hybrid GWO-SCA approach for optimization problems
Singh, N., & Singh, S. B. (2017) · Engineering Science and Technology, an International Journal · doi:10.1016/j.jestch.2017.11.001 · Cited by 214
Quantum multiverse optimization algorithm for optimization problems
Sayed, G. I., Darwish, A., & Hassanien, A. E. (2019) · Neural Computing and Applications · doi:10.1007/s00521-017-3228-9 · Cited by 72
Applications and Challenges of Artificial Intelligence in Space Missions
Oche, P. A., Ewa, G. A., & Ibekwe, N. (2024) · IEEE Access · doi:10.1109/access.2021.3132500 · Cited by 68
Ibrahim, N. M. A., El-said, E. A., Attia, H. E. M., & Hemade, B. A. (2024) · Electrical Engineering · doi:10.1007/s00202-023-02051-7 · Cited by 28
Han, C., Xiong, W., Xiong, M., & Liu, Z. (2023) · Journal of Systems Engineering and Electronics · doi:10.23919/jsee.2023.000020 · Cited by 7
Metadata
- Authors
- Mirjalili, S.
- Venue
- Knowledge-Based Systems
- Publisher
- Elsevier BV
- Published
- 2015-11
- Volume
- 89
- Pages
- 228-249
- ISSN
- 0950-7051 (ISSN-L)
- OpenAlex
- W883434633
- Cited by
- 4,626
- References
- 70
- FWCI
- 111.36
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
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.