Skip to main content
Erschienen in: Neural Computing and Applications 13/2020

19.08.2019 | Original Article

Memetic quantum evolution algorithm for global optimization

verfasst von: Deyu Tang, Zhen Liu, Jie Zhao, Shoubin Dong, Yongming Cai

Erschienen in: Neural Computing and Applications | Ausgabe 13/2020

Einloggen

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

search-config
loading …

Abstract

Quantum-inspired heuristic search algorithms have attracted considerable research interest in recent years. However, existing quantum simulation methods are still limited on the basis of particle swarm optimizer. This paper explores the principle of memetic computing to develop a novel memetic quantum evolution algorithm for solving global optimization problem. First, we design a quantum theory-based memetic framework to handle multiple evolutionary operators, in which multiple units of different kinds of algorithmic information are harmoniously combined. Second, we propose the memetic evolutionary operator and the quantum evolutionary operator to complete the balance between the global search and the local search. The memetic evolutionary operator emphasizes meme diffusion by the shuffled process to enhance the global search ability. The quantum evolutionary operator utilizes an adaptive selection mechanism for different potential wells to tackle the local search ability. Furthermore, the Newton’s gravity laws-based gravitational center and geometric center as two important components are introduced to improve the diversity of population. These units can be recombined by means of different evolutionary operators that are based on the synergistic coordination between exploitation and exploration. Through extensive experiments on various optimization problems, we demonstrate that the proposed method consistently outperforms 11 state-of-the-art algorithms.

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!

Literatur
1.
Zurück zum Zitat Wang X, Yang J, Teng X, Xia W, Jensen R (2007) Feature selection based on rough sets and particle swarm optimization. Pattern Recognit Lett 28(4):459–471CrossRef Wang X, Yang J, Teng X, Xia W, Jensen R (2007) Feature selection based on rough sets and particle swarm optimization. Pattern Recognit Lett 28(4):459–471CrossRef
2.
Zurück zum Zitat Maitra M, Chatterjee A (2008) A hybrid cooperative–comprehensive learning based PSO algorithm for image segmentation using multilevel thresholding. Expert Syst Appl 34(2):1341–1350CrossRef Maitra M, Chatterjee A (2008) A hybrid cooperative–comprehensive learning based PSO algorithm for image segmentation using multilevel thresholding. Expert Syst Appl 34(2):1341–1350CrossRef
3.
Zurück zum Zitat Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical report TR06, Erciyes University Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical report TR06, Erciyes University
4.
Zurück zum Zitat Yang XS, Deb S (2009) Cuckoo search via Lévy flights. In: Proceedings of world congress on nature and biologically inspired computing. IEEE Publications, USA, pp 210–214 Yang XS, Deb S (2009) Cuckoo search via Lévy flights. In: Proceedings of world congress on nature and biologically inspired computing. IEEE Publications, USA, pp 210–214
5.
Zurück zum Zitat Hatamlou A (2014) Heart: a novel optimization algorithm for cluster analysis. Prog Artif Intell 2(2–3):167–173CrossRef Hatamlou A (2014) Heart: a novel optimization algorithm for cluster analysis. Prog Artif Intell 2(2–3):167–173CrossRef
6.
Zurück zum Zitat Tang D, Dong S, Jiang Y, Li H, Huang Y (2015) ITGO: invasive tumor growth optimization algorithm. Appl Soft Comput 36:670–698CrossRef Tang D, Dong S, Jiang Y, Li H, Huang Y (2015) ITGO: invasive tumor growth optimization algorithm. Appl Soft Comput 36:670–698CrossRef
7.
Zurück zum Zitat Qin AK, Suganthan PN (2005) Self-adaptive differential evolution algorithm for numerical optimization. IEEE Cong Evolut Comput 2:1785–1791 Qin AK, Suganthan PN (2005) Self-adaptive differential evolution algorithm for numerical optimization. IEEE Cong Evolut Comput 2:1785–1791
8.
Zurück zum Zitat Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Cong Evolut Comput 13(2):398–417CrossRef Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Cong Evolut Comput 13(2):398–417CrossRef
9.
Zurück zum Zitat Zhang J, Sanderson AC (2009) JADE: adaptive differential evolution with optional external archive. IEEE Cong Evolut Comput 13(5):945–958CrossRef Zhang J, Sanderson AC (2009) JADE: adaptive differential evolution with optional external archive. IEEE Cong Evolut Comput 13(5):945–958CrossRef
10.
Zurück zum Zitat Zhou S, Sun Z (2005) A new approach belonging to EDAS: quantum-inspired genetic algorithm with only one chromosome. In: International conference on natural computation, vol 3612, pp 141–150 Zhou S, Sun Z (2005) A new approach belonging to EDAS: quantum-inspired genetic algorithm with only one chromosome. In: International conference on natural computation, vol 3612, pp 141–150
11.
Zurück zum Zitat Narayanan A, Moore M (1996) Quantum-inspired genetic algorithms. In: Proceedings of IEEE international conference on evolutionary computation. IEEE Press, NJ, pp 61–66 Narayanan A, Moore M (1996) Quantum-inspired genetic algorithms. In: Proceedings of IEEE international conference on evolutionary computation. IEEE Press, NJ, pp 61–66
12.
Zurück zum Zitat Han KH, Kim JH (2002) Quantum-inspired evolutionary algorithm for a class of Combinatorial optimization. IEEE Trans Evolut Comput 6:580–593MathSciNetCrossRef Han KH, Kim JH (2002) Quantum-inspired evolutionary algorithm for a class of Combinatorial optimization. IEEE Trans Evolut Comput 6:580–593MathSciNetCrossRef
13.
Zurück zum Zitat Sun J, Feng B, Xu WB (2004) Particle swam optimization with particles having quantum behavior. IEEE Cong Evolut Comput 1:325–331 Sun J, Feng B, Xu WB (2004) Particle swam optimization with particles having quantum behavior. IEEE Cong Evolut Comput 1:325–331
14.
Zurück zum Zitat Sun J, Xu WB, Feng B (2004) A global search strategy of quantum-behaved particle swarm optimization. In: IEEE conference on cybernetics and intelligent systems, vol 1, pp 111–116 Sun J, Xu WB, Feng B (2004) A global search strategy of quantum-behaved particle swarm optimization. In: IEEE conference on cybernetics and intelligent systems, vol 1, pp 111–116
15.
Zurück zum Zitat Xi ML, Sun J, Xu WB (2008) An improved quantum-behaved particle swarm optimization algorithm with weighted mean best position. Appl Math Comput 205:751–759MATH Xi ML, Sun J, Xu WB (2008) An improved quantum-behaved particle swarm optimization algorithm with weighted mean best position. Appl Math Comput 205:751–759MATH
16.
Zurück zum Zitat Sun J, Fang W, Palade V, Wu XJ, Xu WB (2011) Quantum-behaved particle swarm optimization with Gaussian distributed local attractor point. Appl Math Comput 218:3763–3775MATH Sun J, Fang W, Palade V, Wu XJ, Xu WB (2011) Quantum-behaved particle swarm optimization with Gaussian distributed local attractor point. Appl Math Comput 218:3763–3775MATH
17.
Zurück zum Zitat Chen DB, Wang JT, Zou F, Houb WB, Zhao CX (2012) An improved group search optimizer with operation of quantum-behaved swarm and its application. Appl Soft Comput 12:712–725CrossRef Chen DB, Wang JT, Zou F, Houb WB, Zhao CX (2012) An improved group search optimizer with operation of quantum-behaved swarm and its application. Appl Soft Comput 12:712–725CrossRef
18.
Zurück zum Zitat Huang L, Xi ML, Zhou YH (2010) An improved quantum-behaved particle swarm optimization with random selection of the optimal individual. In: 2010 WASE international conference on information engineering, (ICIE), vol 4, pp 189–193 Huang L, Xi ML, Zhou YH (2010) An improved quantum-behaved particle swarm optimization with random selection of the optimal individual. In: 2010 WASE international conference on information engineering, (ICIE), vol 4, pp 189–193
19.
Zurück zum Zitat Tang D, Cai Y, Zhao J, Xue Y (2014) A quantum behaved particle swarm optimization with memetic algorithm and memory for continuous non-linear large scale problems. Inf Sci 289:162–189CrossRef Tang D, Cai Y, Zhao J, Xue Y (2014) A quantum behaved particle swarm optimization with memetic algorithm and memory for continuous non-linear large scale problems. Inf Sci 289:162–189CrossRef
20.
Zurück zum Zitat Tang D, Dong S, Cai X, Zhao J (2016) A two stage quantum-behaved particle swarm optimization with skipping search rule and weight to solve continuous optimization problem. Neural Comput Appl 27:2429–2440CrossRef Tang D, Dong S, Cai X, Zhao J (2016) A two stage quantum-behaved particle swarm optimization with skipping search rule and weight to solve continuous optimization problem. Neural Comput Appl 27:2429–2440CrossRef
21.
Zurück zum Zitat Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech Concurrent Computation Program Technical Reports 826 Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech Concurrent Computation Program Technical Reports 826
22.
Zurück zum Zitat Neri F, Moscato P, Cotta C (2002) Handbook of memetic algorithms. Springer, Berlin, Heidelberg, pp 157–167 Neri F, Moscato P, Cotta C (2002) Handbook of memetic algorithms. Springer, Berlin, Heidelberg, pp 157–167
23.
Zurück zum Zitat Smith J (2007) Coevolving memetic algorithms: a review and progress report. IEEE Trans Syst Man Cybern B Cybern 37(1):6–17MathSciNetCrossRef Smith J (2007) Coevolving memetic algorithms: a review and progress report. IEEE Trans Syst Man Cybern B Cybern 37(1):6–17MathSciNetCrossRef
24.
Zurück zum Zitat Jadhav DG, Pattnaik SS, Das S (2014) Memetic algorithm with local search as modified swine influenza model-based optimization and its use in ECG filtering. J Optim 1–22 Jadhav DG, Pattnaik SS, Das S (2014) Memetic algorithm with local search as modified swine influenza model-based optimization and its use in ECG filtering. J Optim 1–22
25.
Zurück zum Zitat Zhou Z, Ong Y-S, Nair P, Keane A, Lum K-Y (2007) Combining global and local surrogate models to accelerate evolutionary optimization. IEEE Trans Syst Man Cybern C Appl Rev 37(1):66–76CrossRef Zhou Z, Ong Y-S, Nair P, Keane A, Lum K-Y (2007) Combining global and local surrogate models to accelerate evolutionary optimization. IEEE Trans Syst Man Cybern C Appl Rev 37(1):66–76CrossRef
26.
Zurück zum Zitat Iacca G, Neri F, Mininno E, Ong Y-S, Lim M-H (2012) Ockham’s Razor in memetic computing: three stage optimal memetic exploration. Inf Sci 188:17–43MathSciNetCrossRef Iacca G, Neri F, Mininno E, Ong Y-S, Lim M-H (2012) Ockham’s Razor in memetic computing: three stage optimal memetic exploration. Inf Sci 188:17–43MathSciNetCrossRef
28.
Zurück zum Zitat Caraffini F, Neri F, Picinali L (2014) An analysis on separability for memetic computing automatic design. Inf Sci 265:1–22MathSciNetCrossRef Caraffini F, Neri F, Picinali L (2014) An analysis on separability for memetic computing automatic design. Inf Sci 265:1–22MathSciNetCrossRef
29.
Zurück zum Zitat Samma H, Lim CP, Saleh JM (2016) A new reinforcement learning-based memetic particle swarm optimizer. Appl Soft Comput 43:276–297CrossRef Samma H, Lim CP, Saleh JM (2016) A new reinforcement learning-based memetic particle swarm optimizer. Appl Soft Comput 43:276–297CrossRef
30.
Zurück zum Zitat Li Y, Jiao L, Li P, Wu B (2014) A hybrid memetic algorithm for global optimization. Neurocomputing 134:132–139CrossRef Li Y, Jiao L, Li P, Wu B (2014) A hybrid memetic algorithm for global optimization. Neurocomputing 134:132–139CrossRef
31.
Zurück zum Zitat Bambha NK, Bhattacharyya S, Teich J, Zitzler E (2004) Systematic integration of parameterized local search into evolutionary algorithms. IEEE Trans Evol Comput 8(2):137–155CrossRef Bambha NK, Bhattacharyya S, Teich J, Zitzler E (2004) Systematic integration of parameterized local search into evolutionary algorithms. IEEE Trans Evol Comput 8(2):137–155CrossRef
32.
Zurück zum Zitat Wang H, Moon I, Yang S, Wanga D (2012) A memetic particle swarm optimization algorithm for multimodal optimization problems. Inf Sci 197:38–52CrossRef Wang H, Moon I, Yang S, Wanga D (2012) A memetic particle swarm optimization algorithm for multimodal optimization problems. Inf Sci 197:38–52CrossRef
33.
Zurück zum Zitat Sun J, Garibaldi JM, Krasnogor N, Zhang Q (2013) An intelligent multi-restart memetic algorithm for box constrained global optimisation. Evol Comput 21(1):107–147CrossRef Sun J, Garibaldi JM, Krasnogor N, Zhang Q (2013) An intelligent multi-restart memetic algorithm for box constrained global optimisation. Evol Comput 21(1):107–147CrossRef
34.
Zurück zum Zitat Zhang G, Xing K (2018) Memetic social spider optimization algorithm for scheduling two-stage assembly flowshop in a distributed environment. Comput Ind Eng 125:423–433CrossRef Zhang G, Xing K (2018) Memetic social spider optimization algorithm for scheduling two-stage assembly flowshop in a distributed environment. Comput Ind Eng 125:423–433CrossRef
35.
Zurück zum Zitat Žalik KR, Žalik B (2018) Memetic algorithm using node entropy and partition entropy for community detection in networks. Inf Sci 445–446:38–49MathSciNetCrossRef Žalik KR, Žalik B (2018) Memetic algorithm using node entropy and partition entropy for community detection in networks. Inf Sci 445–446:38–49MathSciNetCrossRef
36.
Zurück zum Zitat Kóczy LT, Földesi P, Tüű-Szabó B (2018) Enhanced discrete bacterial memetic evolutionary algorithm—an efficacious metaheuristic for the traveling salesman optimization. Inf Sci 460–461:389–400MathSciNetCrossRef Kóczy LT, Földesi P, Tüű-Szabó B (2018) Enhanced discrete bacterial memetic evolutionary algorithm—an efficacious metaheuristic for the traveling salesman optimization. Inf Sci 460–461:389–400MathSciNetCrossRef
37.
Zurück zum Zitat Soleimanpour-moghadam M, Nezamabadi-pour H, Farsangi M (2014) A quantum inspired gravitational search algorithm for numerical function optimization. Inf Sci 267:83–100MathSciNetMATHCrossRef Soleimanpour-moghadam M, Nezamabadi-pour H, Farsangi M (2014) A quantum inspired gravitational search algorithm for numerical function optimization. Inf Sci 267:83–100MathSciNetMATHCrossRef
38.
Zurück zum Zitat Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 79:2232–2248MATHCrossRef Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 79:2232–2248MATHCrossRef
39.
Zurück zum Zitat Eusuff MM, Lansey KE (2003) Optimization of water distribution network design using the shuffled frog leaping algorithm. J Water Resour Plan Manag 129(3):210–225CrossRef Eusuff MM, Lansey KE (2003) Optimization of water distribution network design using the shuffled frog leaping algorithm. J Water Resour Plan Manag 129(3):210–225CrossRef
40.
Zurück zum Zitat Liao T, Aydın D, Stützle T (2013) Artificial bee colonies for continuous optimization: experimental analysis and improvements. Swarm Intell 7(4):327–356CrossRef Liao T, Aydın D, Stützle T (2013) Artificial bee colonies for continuous optimization: experimental analysis and improvements. Swarm Intell 7(4):327–356CrossRef
41.
Zurück zum Zitat Veček N, Mernik M, Črepinšek M (2014) A chess rating system for evolutionary algorithms: a new method for the comparison and ranking of evolutionary algorithms. Inf Sci 277:656–679MathSciNetCrossRef Veček N, Mernik M, Črepinšek M (2014) A chess rating system for evolutionary algorithms: a new method for the comparison and ranking of evolutionary algorithms. Inf Sci 277:656–679MathSciNetCrossRef
42.
Zurück zum Zitat Tang D, Yang J, Dong S, Liu Z (2016) A Lévy flight-based shuffled frog-leaping algorithm and its applications for continuous optimization problems. Appl Soft Comput 49:641–662CrossRef Tang D, Yang J, Dong S, Liu Z (2016) A Lévy flight-based shuffled frog-leaping algorithm and its applications for continuous optimization problems. Appl Soft Comput 49:641–662CrossRef
43.
Zurück zum Zitat Chow CK, Yuen SY (2011) An evolutionary algorithm that makes decision based on the entire previous search history. IEEE Trans Evol Comput 15(6):741–769CrossRef Chow CK, Yuen SY (2011) An evolutionary algorithm that makes decision based on the entire previous search history. IEEE Trans Evol Comput 15(6):741–769CrossRef
44.
Zurück zum Zitat Chen D, Zou F, Lu R, Wang P (2017) Learning backtracking search optimisation algorithm and its application. Inf Sci 376:71–94CrossRef Chen D, Zou F, Lu R, Wang P (2017) Learning backtracking search optimisation algorithm and its application. Inf Sci 376:71–94CrossRef
45.
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 Evolut 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 Evolut Comput 1:3–18CrossRef
46.
47.
Zurück zum Zitat Tanabe R, Fukunaga AS (2014) Improving the search performance of SHADE using linear population size reduction. In: 2014 IEEE congress on evolutionary computation (CEC), pp 1658–1665 Tanabe R, Fukunaga AS (2014) Improving the search performance of SHADE using linear population size reduction. In: 2014 IEEE congress on evolutionary computation (CEC), pp 1658–1665
48.
Zurück zum Zitat Awad NH, Ali MZ, Suganthan PN, Reynolds RG (2016) An ensemble sinusoidal parameter adaptation incorporated with L-SHADE for solving CEC2014 benchmark problems. In: IEEE CEC, pp 2958–2965 Awad NH, Ali MZ, Suganthan PN, Reynolds RG (2016) An ensemble sinusoidal parameter adaptation incorporated with L-SHADE for solving CEC2014 benchmark problems. In: IEEE CEC, pp 2958–2965
49.
Zurück zum Zitat Jiawei Han MK (2006) Data mining: concepts and techniques. Elsevier, New YorkMATH Jiawei Han MK (2006) Data mining: concepts and techniques. Elsevier, New YorkMATH
50.
Zurück zum Zitat Das P, Das DK, Dey S (2016) An improved krill herd algorithm with global exploration capability for solving numerical function optimization problems and its application to data clustering. Appl Soft Comput 46:230–245CrossRef Das P, Das DK, Dey S (2016) An improved krill herd algorithm with global exploration capability for solving numerical function optimization problems and its application to data clustering. Appl Soft Comput 46:230–245CrossRef
51.
Zurück zum Zitat Tang D, Dong S, He L, Jiang Y (2016) Intrusive tumor growth inspired optimization algorithm for data clustering. Neural Comput Appl 27:349–374CrossRef Tang D, Dong S, He L, Jiang Y (2016) Intrusive tumor growth inspired optimization algorithm for data clustering. Neural Comput Appl 27:349–374CrossRef
52.
Zurück zum Zitat Hatamlou A (2013) Black hole: a new heuristic optimization approach for data clustering. Inf Sci 222:175–184MathSciNetCrossRef Hatamlou A (2013) Black hole: a new heuristic optimization approach for data clustering. Inf Sci 222:175–184MathSciNetCrossRef
54.
Zurück zum Zitat Das P, Das DK, Dey S (2018) A modified bee colony optimization (MBCO) and its hybridization with k-means for an application to data clustering. Appl Soft Comput 70:590–603CrossRef Das P, Das DK, Dey S (2018) A modified bee colony optimization (MBCO) and its hybridization with k-means for an application to data clustering. Appl Soft Comput 70:590–603CrossRef
55.
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
56.
Zurück zum Zitat Liu K, Ng JK, Lee V, Son SH, Stojmenovic I (2016) Cooperative data scheduling in hybrid vehicular ad hoc networks: VANET as a software defined network. IEEE/ACM Trans Netw (TON) 24(3):1759–1773CrossRef Liu K, Ng JK, Lee V, Son SH, Stojmenovic I (2016) Cooperative data scheduling in hybrid vehicular ad hoc networks: VANET as a software defined network. IEEE/ACM Trans Netw (TON) 24(3):1759–1773CrossRef
57.
Zurück zum Zitat Milner S, Davis C, Zhang H, Llorca J (2012) Nature-inspired self-organization, control, and optimization in heterogeneous wireless networks. IEEE Trans Mob Comput 11(7):1207–1222CrossRef Milner S, Davis C, Zhang H, Llorca J (2012) Nature-inspired self-organization, control, and optimization in heterogeneous wireless networks. IEEE Trans Mob Comput 11(7):1207–1222CrossRef
Metadaten
Titel
Memetic quantum evolution algorithm for global optimization
verfasst von
Deyu Tang
Zhen Liu
Jie Zhao
Shoubin Dong
Yongming Cai
Publikationsdatum
19.08.2019
Verlag
Springer London
Erschienen in
Neural Computing and Applications / Ausgabe 13/2020
Print ISSN: 0941-0643
Elektronische ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-019-04439-8

Weitere Artikel der Ausgabe 13/2020

Neural Computing and Applications 13/2020 Zur Ausgabe

Premium Partner