Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 4,626

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm

Mirjalili, Seyedali·2015·Knowledge-Based Systems
DOI 10.1016/j.knosys.2015.07.006
Open this paper in CoChat — free account

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.knosys.2015.07.006

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 4 references

Research works printed but not linked: 82

  1. A. Colorni, M. Dorigo, V. Maniezzo, Distributed optimization by ant colonies, in: Proceedings of the First European Conference on Artificial Life, 1991, pp. 134–142.
  2. Rechenberg, 1973, Evolution strategy: optimization of technical systems by means of biological evolution, Fromman-Holzboog, Stuttgart, 104
  3. Yao, 1999, Evolutionary programming made faster, IEEE Trans. Evol. Comput., 3, 82, 10.1109/4235.771163 · DOI · Paper page
  4. Glover, 1989, Tabu search – Part I, ORSA J. Comput., 1, 190, 10.1287/ijoc.1.3.190 · DOI · Paper page
  5. L. Davis, Bit-Climbing, Representational bias, and test suite design, in: ICGA, 1991, pp. 18–23.
  6. H.R. Lourenço, O.C. Martin, T. Stutzle, Iterated local search, 2001. Available from arXiv:preprint math/0102188. · arXiv
  7. Kirkpatrick, 1983, Optimization by simmulated annealing, Science, 220, 671, 10.1126/science.220.4598.671 · DOI · Paper page
  8. Eiben, 1998, On evolutionary exploration and exploitation, Fundam. Inform., 35, 35, 10.3233/FI-1998-35123403 · doi:10.3233/fi-1998-35123403
  9. Alba, 2005, The exploration/exploitation tradeoff in dynamic cellular genetic algorithms, IEEE Trans. Evol. Comput., 9, 126, 10.1109/TEVC.2005.843751 · DOI · Paper page
  10. Simon, 2008, Biogeography-based optimization, IEEE Trans. Evol. Comput., 12, 702, 10.1109/TEVC.2008.919004 · DOI · Paper page
  11. 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
  12. Montiel, 2007, Human evolutionary model: a new approach to optimization, Inf. Sci., 177, 2075, 10.1016/j.ins.2006.09.012 · DOI
  13. Farasat, 2010, ARO: a new model-free optimization algorithm inspired from asexual reproduction, Appl. Soft Comput., 10, 1284, 10.1016/j.asoc.2010.05.011 · DOI
  14. 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
  15. D. Pham, A. Ghanbarzadeh, E. Koc, S. Otri, S. Rahim, M. Zaidi, The bees algorithm-a novel tool for complex optimisation problems, in: Proceedings of the 2nd Virtual International Conference on Intelligent Production Machines and Systems (IPROMS 2006), 2006, pp. 454–459. · DOI · Paper page
  16. Karaboga, 2007, A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm, J. Glob. Opt., 39, 459, 10.1007/s10898-007-9149-x · DOI · Paper page
  17. X.S. Yang, Firefly algorithm, in: Engineering Optimization, 2010, pp. 221–230. · doi:10.1002/9780470640425.ch17
  18. X.-S. Yang, S. Deb, Cuckoo search via Lévy flights, in: World Congress on Nature & Biologically Inspired Computing, 2009. NaBIC 2009, 2009, pp. 210–214. · DOI · Paper page
  19. Rajabioun, 2011, Cuckoo optimization algorithm, Appl. Soft Comput., 11, 5508, 10.1016/j.asoc.2011.05.008 · DOI · Paper page
  20. Mirjalili, 2014, Grey wolf optimizer, Adv. Eng. Softw., 69, 46, 10.1016/j.advengsoft.2013.12.007 · DOI · Paper page
  21. Kaveh, 2013, A new optimization method: Dolphin echolocation, Adv. Eng. Softw., 59, 53, 10.1016/j.advengsoft.2013.03.004 · DOI · Paper page
  22. 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:10.1016/j.camwa.2010.07.049
  23. Pan, 2012, A new fruit fly optimization algorithm: taking the financial distress model as an example, Knowl.-Based Syst., 26, 69, 10.1016/j.knosys.2011.07.001 · DOI · Paper page
  24. Rashedi, 2009, GSA: a gravitational search algorithm, Inf. Sci., 179, 2232, 10.1016/j.ins.2009.03.004 · DOI · Paper page
  25. Lam, 2010, Chemical-reaction-inspired metaheuristic for optimization, IEEE Trans. Evol. Comput., 14, 381, 10.1109/TEVC.2009.2033580 · DOI · Paper page
  26. 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
  27. Kaveh, 2010, A novel heuristic optimization method: charged system search, Acta Mech., 213, 267, 10.1007/s00707-009-0270-4 · DOI · Paper page
  28. Kaveh, 2012, A new meta-heuristic method: ray optimization, Comput. Struct., 112–113, 283, 10.1016/j.compstruc.2012.09.003 · DOI · Paper page
  29. Hatamlou, 2013, Black hole: a new heuristic optimization approach for data clustering, Inf. Sci., 222, 175, 10.1016/j.ins.2012.08.023 · DOI · Paper page
  30. 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
  31. Abdechiri, 2013, Gases Brownian motion optimization: an algorithm for optimization (GBMO), Appl. Soft Comput., 13, 2932, 10.1016/j.asoc.2012.03.068 · DOI
  32. Geem, 2001, A new heuristic optimization algorithm: harmony search, Simulation, 76, 60, 10.1177/003754970107600201 · DOI · Paper page
  33. 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:10.1016/j.asoc.2012.11.026
  34. Cheng, 2014, Symbiotic organisms search: a new metaheuristic optimization algorithm, Comput. Struct., 139, 98, 10.1016/j.compstruc.2014.03.007 · DOI · Paper page
  35. 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
  36. Salcedo-Sanz, 2013, A novel coral reefs optimization algorithm for multi-objective problems, vol. 8206, 326
  37. 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:10.1007/s10489-013-0458-0
  38. Gaston, 2013, The ecological impacts of nighttime light pollution: a mechanistic appraisal, Biol. Rev., 88, 912, 10.1111/brv.12036 · DOI · Paper page
  39. K.D. Frank, C. Rich, T. Longcore, Effects of artificial night lighting on moths, in: Ecological Consequences of Artificial Night Lighting, 2006, pp. 305–344.
  40. Digalakis, 2001, On benchmarking functions for genetic algorithms, Int. J. Comput. Math., 77, 481, 10.1080/00207160108805080 · DOI · Paper page
  41. Molga, 2005, Test functions for optimization needs, Test Funct. Opt. Needs
  42. X.-S. Yang, Test problems in optimization, 2010. Available from arXiv:preprint 1008.0549.
  43. J. Liang, P. Suganthan, K. Deb, Novel composition test functions for numerical global optimization, in: Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005, SIS 2005, 2005, pp. 68–75. · DOI · Paper page
  44. Derrac, 2011, A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms, Swarm Evol. Comput., 1, 3, 10.1016/j.swevo.2011.02.002 · DOI · Paper page
  45. J. Kennedy, R. Eberhart, Particle swarm optimization, in: Proceedings of the IEEE International Conference on Neural Networks, 1995, 1995, pp. 1942–1948. · DOI · Paper page
  46. van den Bergh, 2006, A study of particle swarm optimization particle trajectories, Inf. Sci., 176, 937, 10.1016/j.ins.2005.02.003 · DOI · Paper page
  47. Coello Coello, 2002, Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art, Comput. Methods Appl. Mech. Eng., 191, 1245, 10.1016/S0045-7825(01)00323-1 · DOI · Paper page
  48. Wang, 2014, Chaotic krill herd algorithm, Inf. Sci., 10.1016/j.ins.2014.02.123 · DOI · Paper page
  49. Carlos, 2000, Constraint-handling using an evolutionary multiobjective optimization technique, Civ. Eng. Syst., 17, 319, 10.1080/02630250008970288 · DOI
  50. Deb, 1991, Optimal design of a welded beam via genetic algorithms, AIAA J., 29, 2013, 10.2514/3.10834 · doi:10.2514/3.10834
  51. Deb, 2000, An efficient constraint handling method for genetic algorithms, Comput. Methods Appl. Mech. Eng., 186, 311, 10.1016/S0045-7825(99)00389-8 · DOI · Paper page
  52. Krohling, 2006, Coevolutionary particle swarm optimization using Gaussian distribution for solving constrained optimization problems, IEEE Trans. Syst. Man Cybern., Part B: Cybern., 36, 1407, 10.1109/TSMCB.2006.873185 · DOI · Paper page
  53. Lee, 2005, A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice, Comput. Methods Appl. Mech. Eng., 194, 3902, 10.1016/j.cma.2004.09.007 · DOI · Paper page
  54. 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
  55. He, 2007, An effective co-evolutionary particle swarm optimization for constrained engineering design problems, Eng. Appl. Artif. Intell., 20, 89, 10.1016/j.engappai.2006.03.003 · DOI · Paper page
  56. Coello Coello, 2002, Constraint-handling in genetic algorithms through the use of dominance-based tournament selection, Adv. Eng. Inform., 16, 193, 10.1016/S1474-0346(02)00011-3 · DOI · Paper page
  57. Gandomi, 2014, Interior search algorithm (ISA): a novel approach for global optimization, ISA Trans., 10.1016/j.isatra.2014.03.018 · DOI · Paper page
  58. Sandgren, 1990, Nonlinear integer and discrete programming in mechanical design optimization, J. Mech. Des., 112, 223, 10.1115/1.2912596 · DOI · Paper page
  59. Deb, 1996, A combined genetic adaptive search (GeneAS) for engineering design, Comput. Sci. Inform., 26, 30
  60. Gandomi, 2013, Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems, Eng. Comput., 29, 17, 10.1007/s00366-011-0241-y · DOI · Paper page
  61. 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
  62. Zhang, 2008, Differential evolution with dynamic stochastic selection for constrained optimization, Inf. Sci., 178, 3043, 10.1016/j.ins.2008.02.014 · DOI · Paper page
  63. Liu, 2010, Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization, Appl. Soft Comput., 10, 629, 10.1016/j.asoc.2009.08.031 · DOI
  64. Ray, 2001, Engineering design optimization using a swarm with an intelligent information sharing among individuals, Eng. Opt., 33, 735, 10.1080/03052150108940941 · doi:10.1080/03052150108940941
  65. Tsai, 2005, Global optimization of nonlinear fractional programming problems in engineering design, Eng. Opt., 37, 399, 10.1080/03052150500066737 · DOI
  66. Mahdavi, 2007, An improved harmony search algorithm for solving optimization problems, Appl. Math. Comput., 188, 1567, 10.1016/j.amc.2006.11.033 · DOI · Paper page
  67. Coello Coello, 2000, Use of a self-adaptive penalty approach for engineering optimization problems, Comput. Ind., 41, 113, 10.1016/S0166-3615(99)00046-9 · DOI · Paper page
  68. 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:10.1007/978-3-662-03423-1_27
  69. 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
  70. Li, 2007, A heuristic particle swarm optimizer for optimization of pin connected structures, Comput. Struct., 85, 340, 10.1016/j.compstruc.2006.11.020 · DOI · Paper page
  71. Kaveh, 2010, An improved ant colony optimization for constrained engineering design problems, Eng. Comput.: Int. J. Comput.-Aid. Eng., 27, 155, 10.1108/02644401011008577 · DOI
  72. 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
  73. E. Sandgren, Nonlinear integer and discrete programming in mechanical design, 1988, pp. 95–105. · doi:10.1115/detc1988-0012
  74. Chickermane, 1996, Structural optimization using a new local approximation method, Int. J. Numer. Methods Eng., 39, 829, 10.1002/(SICI)1097-0207(19960315)39:5<829::AID-NME884>3.0.CO;2-U · DOI
  75. 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
  76. Belegundu, 1983, Study of mathematical programming methods for structural optimization, Diss. Abst. Int. Pt. B – Sci. Eng., 43, 1983
  77. 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
  78. 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:10.1016/j.compstruc.2012.03.013
  79. Kaveh, 2009, A particle swarm ant colony optimization for truss structures with discrete variables, J. Construct. Steel Res., 65, 1558, 10.1016/j.jcsr.2009.04.021 · DOI
  80. 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
  81. 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
  82. 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

See all 4,626

Metadata

Authors
Mirjalili, S.
Venue
Knowledge-Based Systems
Publisher
Elsevier BV
Published
2015-11
Volume
89
Pages
228-249
ISSN
0950-7051 (ISSN-L)
DOI
10.1016/j.knosys.2015.07.006
OpenAlex
W883434633
Cited by
4,626
References
4
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm. https://app.cochat.ai/papers/10.1016/j.knosys.2015.07.006
The paper
Mirjalili, S. (2015). Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm. Knowledge-Based Systems. https://doi.org/10.1016/j.knosys.2015.07.006

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.