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

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

Multi-Verse Optimizer: a nature-inspired algorithm for global optimization

Mirjalili, Seyedali, Mirjalili, Seyed Mohammad, Hatamlou, Abdolreza·2016·Neural Computing and Applications
DOI 10.1007/s00521-015-1870-7
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.1007/s00521-015-1870-7

Cites

1 of 1 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 1 references

Research works printed but not linked: 53

  1. John H (1992) Holland, adaptation in natural and artificial systems. MIT Press, Cambridge
  2. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, pp 1942–1948 · DOI · Paper page
  3. Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179:2232–2248 · DOI · Paper page
  4. Kirkpatrick S (1984) Optimization by simulated annealing: quantitative studies. J Stat Phys 34:975–986 · DOI · Paper page
  5. Hoos HH, Stützle T (2004) Stochastic local search: foundations and applications. Elsevier, Amsterdam
  6. Johnson DS, Papadimitriou CH, Yannakakis M (1988) How easy is local search? J Comput Syst Sci 37:79–100 · DOI · Paper page
  7. Mitchell M, Holland JH, Forrest S (1993) When will a genetic algorithm outperform hill climbing? In: NIPS, pp 51–58
  8. Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1:28–39 · doi:10.1109/mci.2006.329691 · Paper page
  9. Dorigo M, Stützle T (2003) The ant colony optimization metaheuristic: algorithms, applications, and advances. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. International series in operations research & management science, vol 57. Springer, US, pp 250–285 · DOI · Paper page
  10. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39:459–471 · DOI · Paper page
  11. Khoury J, Ovrut BA, Seiberg N, Steinhardt PJ, Turok N (2002) From big crunch to big bang. Phys Rev D 65:086007 · DOI · Paper page
  12. Tegmark M (2004) Parallel universes. In: Barrow JD, Davies PCW, Harper CL Jr (eds) Science and ultimate reality: Quantum theory, cosmology, and complexity. Cambridge University Press, pp 459–491 · DOI
  13. Eardley DM (1974) Death of white holes in the early Universe. Phys Rev Lett 33:442 · DOI
  14. Steinhardt PJ, Turok N (2002) A cyclic model of the universe. Science 296:1436–1439 · DOI · Paper page
  15. Davies PC (1978) Thermodynamics of black holes. Rep Prog Phys 41:1313 · DOI · Paper page
  16. Morris MS, Thorne KS (1988) Wormholes in spacetime and their use for interstellar travel: a tool for teaching general relativity. Am J Phys 56:395–412 · DOI · Paper page
  17. Guth AH (2007) Eternal inflation and its implications. J Phys A Math Theor 40:6811 · DOI · Paper page
  18. Steinhardt PJ, Turok N (2005) The cyclic model simplified. New Astron Rev 49:43–57 · DOI
  19. Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3:82–102 · DOI · Paper page
  20. Digalakis J, Margaritis K (2001) On benchmarking functions for genetic algorithms. Int J Comput Math 77:481–506 · DOI · Paper page
  21. Yang X-S (2010) Test problems in optimization. arXiv preprint: arXiv:1008.0549 · arXiv
  22. Liang J, Suganthan P, Deb K (2005) Novel composition test functions for numerical global optimization. In: Proceedings 2005 IEEE swarm intelligence symposium, 2005. SIS 2005, pp 68–75 · DOI · Paper page
  23. Derrac J, García S, Molina D, Herrera F (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–18 · DOI · Paper page
  24. Mirjalili S, Lewis A (2013) S-shaped versus V-shaped transfer functions for binary particle swarm optimization. Swarm Evol Comput 9:1–14 · DOI · Paper page
  25. Mirjalili S, Mirjalili SM, Lewis A (2014) Grey Wolf Optimizer. Adv Eng Softw 69:46–61 · DOI · Paper page
  26. Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80–98. doi: 10.1016/j.advengsoft.2015.01.010 · DOI · Paper page
  27. van den Bergh F, Engelbrecht A (2006) A study of particle swarm optimization particle trajectories. Inf Sci 176:937–971 · DOI · Paper page
  28. Carlos A, Coello C (2000) Constraint-handling using an evolutionary multiobjective optimization technique. Civil Eng Syst 17:319–346 · DOI
  29. Deb K (1991) Optimal design of a welded beam via genetic algorithms. AIAA J 29:2013–2015 · doi:10.2514/3.10834
  30. Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186:311–338 · DOI · Paper page
  31. Krohling RA, dos Santos Coelho L (2006) Coevolutionary particle swarm optimization using Gaussian distribution for solving constrained optimization problems. IEEE Trans Syst Man Cybern Part B Cybern 36:1407–1416 · DOI · Paper page
  32. Lee KS, Geem ZW (2005) A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Methods Appl Mech Eng 194:3902–3933 · DOI · Paper page
  33. Ragsdell K, Phillips D (1976) Optimal design of a class of welded structures using geometric programming. ASME J Eng Ind 98:1021–1025 · doi:10.1115/1.3438995
  34. Sandgren E (1990) Nonlinear integer and discrete programming in mechanical design optimization. J Mech Des 112(2):223–229. doi: 10.1115/1.2912596 · DOI · Paper page
  35. Gandomi AH (2014) Interior search algorithm (ISA): a novel approach for global optimization. ISA Trans 53(4):1168–1183. doi: 10.1016/j.isatra.2014.03.018 · DOI · Paper page
  36. Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13:2592–2612 · doi:10.1016/j.asoc.2012.11.026
  37. Kannan B, Kramer SN (1994) An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design. J Mech Des 116:405–411 · doi:10.1115/1.2919393
  38. Deb K, Goyal M (1996) A combined genetic adaptive search (GeneAS) for engineering design. Comput Sci Inform 26:30–45
  39. Gandomi AH, Yang X-S, Alavi AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 29:17–35 · DOI · Paper page
  40. Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci 178:3043–3074 · DOI · Paper page
  41. Liu H, Cai Z, Wang Y (2010) Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization. Appl Soft Comput 10:629–640 · DOI
  42. Ray T, Saini P (2001) Engineering design optimization using a swarm with an intelligent information sharing among individuals. Eng Optim 33:735–748 · doi:10.1080/03052150108940941
  43. Tsai J-F (2005) Global optimization of nonlinear fractional programming problems in engineering design. Eng Optim 37:399–409 · DOI
  44. Mahdavi M, Fesanghary M, Damangir E (2007) An improved harmony search algorithm for solving optimization problems. Appl Math Comput 188:1567–1579 · DOI · Paper page
  45. He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20:89–99 · DOI · Paper page
  46. Coello Coello CA (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41:113–127 · DOI · Paper page
  47. Coello Coello CA, Mezura Montes E (2002) Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Adv Eng Inform 16:193–203 · DOI · Paper page
  48. Deb K, Gene AS (1997) A robust optimal design technique for mechanical component design. Presented at the D. Dasgupta, Z. Michalewicz (eds) Evolutionary algorithms in engineering applications, Berlin · doi:10.1007/978-3-662-03423-1_27
  49. Mezura-Montes E, Coello CAC (2008) An empirical study about the usefulness of evolution strategies to solve constrained optimization problems. Int J Gen Syst 37:443–473 · doi:10.1080/03081070701303470
  50. Li L, Huang Z, Liu F, Wu Q (2007) A heuristic particle swarm optimizer for optimization of pin connected structures. Comput Struct 85:340–349 · DOI · Paper page
  51. Kaveh A, Talatahari S (2010) An improved ant colony optimization for constrained engineering design problems. Eng Comput Int J Comput Aided Eng 27:155–182
  52. Chickermane H, Gea HC (1996) Structural optimization using a new local approximation method. Int J Numer Methods Eng 39(5):829–846 · DOI
  53. Cheng M-Y, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98–112 · DOI · Paper page

Cited by

See all 2,925

Metadata

Authors
Mirjalili, S., Mirjalili, S. M., & Hatamlou, A.
Venue
Neural Computing and Applications
Publisher
Springer Science and Business Media LLC
Published
2015-03-17
Volume
27
Issue
2
Pages
495-513
ISSN
  • 0941-0643 (ISSN-L)
  • 1433-3058
DOI
10.1007/s00521-015-1870-7
OpenAlex
W2031183907
Cited by
2,925
References
1
FWCI
68.19
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (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: Multi-Verse Optimizer: a nature-inspired algorithm for global optimization. https://app.cochat.ai/papers/10.1007/s00521-015-1870-7
The paper
Mirjalili, S., Mirjalili, S. M., & Hatamlou, A. (2016). Multi-Verse Optimizer: a nature-inspired algorithm for global optimization. Neural Computing and Applications. https://doi.org/10.1007/s00521-015-1870-7

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.