Skip to main content
Erschienen in: Neural Computing and Applications 2/2016

01.02.2016 | Original Article

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

verfasst von: Seyedali Mirjalili, Seyed Mohammad Mirjalili, Abdolreza Hatamlou

Erschienen in: Neural Computing and Applications | Ausgabe 2/2016

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This paper proposes a novel nature-inspired algorithm called Multi-Verse Optimizer (MVO). The main inspirations of this algorithm are based on three concepts in cosmology: white hole, black hole, and wormhole. The mathematical models of these three concepts are developed to perform exploration, exploitation, and local search, respectively. The MVO algorithm is first benchmarked on 19 challenging test problems. It is then applied to five real engineering problems to further confirm its performance. To validate the results, MVO is compared with four well-known algorithms: Grey Wolf Optimizer, Particle Swarm Optimization, Genetic Algorithm, and Gravitational Search Algorithm. The results prove that the proposed algorithm is able to provide very competitive results and outperforms the best algorithms in the literature on the majority of the test beds. The results of the real case studies also demonstrate the potential of MVO in solving real problems with unknown search spaces. Note that the source codes of the proposed MVO algorithm are publicly available at http://​www.​alimirjalili.​com/​MVO.​html.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
1.
Zurück zum Zitat John H (1992) Holland, adaptation in natural and artificial systems. MIT Press, Cambridge John H (1992) Holland, adaptation in natural and artificial systems. MIT Press, Cambridge
2.
Zurück zum Zitat Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, pp 1942–1948 Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, pp 1942–1948
3.
Zurück zum Zitat Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179:2232–2248MATHCrossRef Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179:2232–2248MATHCrossRef
4.
Zurück zum Zitat Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67–82CrossRef Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67–82CrossRef
5.
6.
Zurück zum Zitat Hoos HH, Stützle T (2004) Stochastic local search: foundations and applications. Elsevier, Amsterdam Hoos HH, Stützle T (2004) Stochastic local search: foundations and applications. Elsevier, Amsterdam
8.
Zurück zum Zitat Mitchell M, Holland JH, Forrest S (1993) When will a genetic algorithm outperform hill climbing? In: NIPS, pp 51–58 Mitchell M, Holland JH, Forrest S (1993) When will a genetic algorithm outperform hill climbing? In: NIPS, pp 51–58
9.
Zurück zum Zitat Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1:28–39CrossRef Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1:28–39CrossRef
10.
Zurück zum Zitat 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 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
11.
Zurück zum Zitat Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39:459–471MATHMathSciNetCrossRef Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39:459–471MATHMathSciNetCrossRef
12.
Zurück zum Zitat Khoury J, Ovrut BA, Seiberg N, Steinhardt PJ, Turok N (2002) From big crunch to big bang. Phys Rev D 65:086007CrossRef Khoury J, Ovrut BA, Seiberg N, Steinhardt PJ, Turok N (2002) From big crunch to big bang. Phys Rev D 65:086007CrossRef
13.
Zurück zum Zitat 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 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
14.
Zurück zum Zitat Eardley DM (1974) Death of white holes in the early Universe. Phys Rev Lett 33:442CrossRef Eardley DM (1974) Death of white holes in the early Universe. Phys Rev Lett 33:442CrossRef
16.
Zurück zum Zitat Davies PC (1978) Thermodynamics of black holes. Rep Prog Phys 41:1313CrossRef Davies PC (1978) Thermodynamics of black holes. Rep Prog Phys 41:1313CrossRef
17.
Zurück zum Zitat 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–412MATHMathSciNetCrossRef 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–412MATHMathSciNetCrossRef
19.
Zurück zum Zitat Steinhardt PJ, Turok N (2005) The cyclic model simplified. New Astron Rev 49:43–57CrossRef Steinhardt PJ, Turok N (2005) The cyclic model simplified. New Astron Rev 49:43–57CrossRef
20.
Zurück zum Zitat Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3:82–102CrossRef Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3:82–102CrossRef
21.
24.
Zurück zum Zitat 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 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
25.
Zurück zum Zitat Suganthan PN, Hansen N, Liang JJ, Deb K, Chen Y, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. In: KanGAL report, vol 2005 Suganthan PN, Hansen N, Liang JJ, Deb K, Chen Y, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. In: KanGAL report, vol 2005
26.
Zurück zum Zitat 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–18CrossRef 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–18CrossRef
27.
Zurück zum Zitat Mirjalili S, Lewis A (2013) S-shaped versus V-shaped transfer functions for binary particle swarm optimization. Swarm Evol Comput 9:1–14CrossRef Mirjalili S, Lewis A (2013) S-shaped versus V-shaped transfer functions for binary particle swarm optimization. Swarm Evol Comput 9:1–14CrossRef
28.
Zurück zum Zitat Mirjalili S, Mirjalili SM, Lewis A (2014) Grey Wolf Optimizer. Adv Eng Softw 69:46–61CrossRef Mirjalili S, Mirjalili SM, Lewis A (2014) Grey Wolf Optimizer. Adv Eng Softw 69:46–61CrossRef
30.
Zurück zum Zitat van den Bergh F, Engelbrecht A (2006) A study of particle swarm optimization particle trajectories. Inf Sci 176:937–971MATHCrossRef van den Bergh F, Engelbrecht A (2006) A study of particle swarm optimization particle trajectories. Inf Sci 176:937–971MATHCrossRef
31.
Zurück zum Zitat Carlos A, Coello C (2000) Constraint-handling using an evolutionary multiobjective optimization technique. Civil Eng Syst 17:319–346CrossRef Carlos A, Coello C (2000) Constraint-handling using an evolutionary multiobjective optimization technique. Civil Eng Syst 17:319–346CrossRef
32.
Zurück zum Zitat Deb K (1991) Optimal design of a welded beam via genetic algorithms. AIAA J 29:2013–2015CrossRef Deb K (1991) Optimal design of a welded beam via genetic algorithms. AIAA J 29:2013–2015CrossRef
33.
Zurück zum Zitat Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186:311–338MATHCrossRef Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186:311–338MATHCrossRef
34.
Zurück zum Zitat 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–1416CrossRef 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–1416CrossRef
35.
Zurück zum Zitat 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–3933MATHCrossRef 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–3933MATHCrossRef
36.
Zurück zum Zitat Ragsdell K, Phillips D (1976) Optimal design of a class of welded structures using geometric programming. ASME J Eng Ind 98:1021–1025CrossRef Ragsdell K, Phillips D (1976) Optimal design of a class of welded structures using geometric programming. ASME J Eng Ind 98:1021–1025CrossRef
39.
Zurück zum Zitat 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–2612CrossRef 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–2612CrossRef
40.
Zurück zum Zitat 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–411CrossRef 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–411CrossRef
41.
Zurück zum Zitat Deb K, Goyal M (1996) A combined genetic adaptive search (GeneAS) for engineering design. Comput Sci Inform 26:30–45 Deb K, Goyal M (1996) A combined genetic adaptive search (GeneAS) for engineering design. Comput Sci Inform 26:30–45
42.
Zurück zum Zitat Gandomi AH, Yang X-S, Alavi AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 29:17–35CrossRef Gandomi AH, Yang X-S, Alavi AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 29:17–35CrossRef
43.
Zurück zum Zitat Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci 178:3043–3074CrossRef Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci 178:3043–3074CrossRef
44.
Zurück zum Zitat 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–640CrossRef 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–640CrossRef
45.
Zurück zum Zitat Ray T, Saini P (2001) Engineering design optimization using a swarm with an intelligent information sharing among individuals. Eng Optim 33:735–748CrossRef Ray T, Saini P (2001) Engineering design optimization using a swarm with an intelligent information sharing among individuals. Eng Optim 33:735–748CrossRef
46.
Zurück zum Zitat Tsai J-F (2005) Global optimization of nonlinear fractional programming problems in engineering design. Eng Optim 37:399–409MathSciNetCrossRef Tsai J-F (2005) Global optimization of nonlinear fractional programming problems in engineering design. Eng Optim 37:399–409MathSciNetCrossRef
47.
Zurück zum Zitat Mahdavi M, Fesanghary M, Damangir E (2007) An improved harmony search algorithm for solving optimization problems. Appl Math Comput 188:1567–1579MATHMathSciNetCrossRef Mahdavi M, Fesanghary M, Damangir E (2007) An improved harmony search algorithm for solving optimization problems. Appl Math Comput 188:1567–1579MATHMathSciNetCrossRef
48.
Zurück zum Zitat He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20:89–99CrossRef He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20:89–99CrossRef
49.
Zurück zum Zitat Coello Coello CA (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41:113–127CrossRef Coello Coello CA (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41:113–127CrossRef
50.
Zurück zum Zitat 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–203CrossRef 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–203CrossRef
51.
Zurück zum Zitat 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 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
52.
Zurück zum Zitat 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–473MATHMathSciNetCrossRef 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–473MATHMathSciNetCrossRef
53.
Zurück zum Zitat Li L, Huang Z, Liu F, Wu Q (2007) A heuristic particle swarm optimizer for optimization of pin connected structures. Comput Struct 85:340–349CrossRef Li L, Huang Z, Liu F, Wu Q (2007) A heuristic particle swarm optimizer for optimization of pin connected structures. Comput Struct 85:340–349CrossRef
54.
Zurück zum Zitat Kaveh A, Talatahari S (2010) An improved ant colony optimization for constrained engineering design problems. Eng Comput Int J Comput Aided Eng 27:155–182MATH Kaveh A, Talatahari S (2010) An improved ant colony optimization for constrained engineering design problems. Eng Comput Int J Comput Aided Eng 27:155–182MATH
55.
Zurück zum Zitat Chickermane H, Gea HC (1996) Structural optimization using a new local approximation method. Int J Numer Methods Eng 39(5):829–846MATHMathSciNetCrossRef Chickermane H, Gea HC (1996) Structural optimization using a new local approximation method. Int J Numer Methods Eng 39(5):829–846MATHMathSciNetCrossRef
56.
Zurück zum Zitat Cheng M-Y, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98–112CrossRef Cheng M-Y, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98–112CrossRef
Metadaten
Titel
Multi-Verse Optimizer: a nature-inspired algorithm for global optimization
verfasst von
Seyedali Mirjalili
Seyed Mohammad Mirjalili
Abdolreza Hatamlou
Publikationsdatum
01.02.2016
Verlag
Springer London
Erschienen in
Neural Computing and Applications / Ausgabe 2/2016
Print ISSN: 0941-0643
Elektronische ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-015-1870-7

Weitere Artikel der Ausgabe 2/2016

Neural Computing and Applications 2/2016 Zur Ausgabe

Extreme Learning Machine and Applications

An optimal method for data clustering

Extreme Learning Machine and Applications

Self-adaptive extreme learning machine