Skip to main content

2018 | OriginalPaper | Buchkapitel

A Novel Memetic Whale Optimization Algorithm for Optimization

verfasst von : Zhe Xu, Yang Yu, Hanaki Yachi, Junkai Ji, Yuki Todo, Shangce Gao

Erschienen in: Advances in Swarm Intelligence

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

Whale optimization algorithm (WOA) is a newly proposed search optimization technique which mimics the encircling prey and bubble-net attacking mechanisms of the whale. It has proven to be very competitive in comparison with other state-of-the-art metaheuristics. Nevertheless, the performance of WOA is limited by its monotonous search dynamics, i.e., only the encircling mechanism drives the search which mainly focus the exploration in the landscape. Thus, WOA lacks of the capacity of jumping out the of local optima. To address this problem, this paper propose a memetic whale optimization algorithm (MWOA) by incorporating a chaotic local search into WOA to enhance its exploitation ability. It is expected that MWOA can well balance the global exploration and local exploitation during the search process, thus achieving a better search performance. Forty eight benchmark functions are used to verify the efficiency of MWOA. Experimental results suggest that MWOA can perform better than its competitors in terms of the convergence speed and the solution accuracy.

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

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!

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"

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!

Literatur
1.
Zurück zum Zitat Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence. Wiley, Chichester (2006) Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence. Wiley, Chichester (2006)
2.
Zurück zum Zitat Yu, H., Xu, Z., Gao, S., Wang, Y., Todo, Y.: PMPSO: a near-optimal graph planarization algorithm using probability model based particle swarm optimization. In: 2015 IEEE International Conference on Progress in Informatics and Computing (PIC), pp. 15–19. IEEE (2015) Yu, H., Xu, Z., Gao, S., Wang, Y., Todo, Y.: PMPSO: a near-optimal graph planarization algorithm using probability model based particle swarm optimization. In: 2015 IEEE International Conference on Progress in Informatics and Computing (PIC), pp. 15–19. IEEE (2015)
3.
Zurück zum Zitat Das, S., Suganthan, P.N.: Differential evolution: a survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15(1), 4–31 (2011)CrossRef Das, S., Suganthan, P.N.: Differential evolution: a survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15(1), 4–31 (2011)CrossRef
4.
Zurück zum Zitat Gao, S., Wang, Y., Wang, J., Cheng, J.J.: Understanding differential evolution: a poisson law derived from population interaction network. J. Comput. Sci. 21, 140–149 (2017)CrossRef Gao, S., Wang, Y., Wang, J., Cheng, J.J.: Understanding differential evolution: a poisson law derived from population interaction network. J. Comput. Sci. 21, 140–149 (2017)CrossRef
5.
Zurück zum Zitat Shi, Q., Chen, W., Jiang, T., Shen, D., Gao, S.: Handling multiobjectives with adaptive mutation based \(\varepsilon \)-dominance differential evolution. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds.) ICSI 2015. LNCS, vol. 9140, pp. 523–532. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-20466-6_55CrossRef Shi, Q., Chen, W., Jiang, T., Shen, D., Gao, S.: Handling multiobjectives with adaptive mutation based \(\varepsilon \)-dominance differential evolution. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds.) ICSI 2015. LNCS, vol. 9140, pp. 523–532. Springer, Cham (2015). https://​doi.​org/​10.​1007/​978-3-319-20466-6_​55CrossRef
6.
Zurück zum Zitat Ji, J., Gao, S., Wang, S., Tang, Y., Yu, H., Todo, Y.: Self-adaptive gravitational search algorithm with a modified chaotic local search. IEEE Access 5, 17881–17895 (2017)CrossRef Ji, J., Gao, S., Wang, S., Tang, Y., Yu, H., Todo, Y.: Self-adaptive gravitational search algorithm with a modified chaotic local search. IEEE Access 5, 17881–17895 (2017)CrossRef
7.
Zurück zum Zitat Gao, S., Vairappan, C., Wang, Y., Cao, Q., Tang, Z.: Gravitational search algorithm combined with chaos for unconstrained numerical optimization. Appl. Math. Comput. 231, 48–62 (2014)MathSciNet Gao, S., Vairappan, C., Wang, Y., Cao, Q., Tang, Z.: Gravitational search algorithm combined with chaos for unconstrained numerical optimization. Appl. Math. Comput. 231, 48–62 (2014)MathSciNet
8.
Zurück zum Zitat Song, Z., Gao, S., Yu, Y., Sun, J., Todo, Y.: Multiple chaos embedded gravitational search algorithm. IEICE Trans. Inf. Syst. 100(4), 888–900 (2017)CrossRef Song, Z., Gao, S., Yu, Y., Sun, J., Todo, Y.: Multiple chaos embedded gravitational search algorithm. IEICE Trans. Inf. Syst. 100(4), 888–900 (2017)CrossRef
10.
Zurück zum Zitat Karaboga, D.: Artificial bee colony algorithm. Scholarpedia 5(3), 6915 (2010)CrossRef Karaboga, D.: Artificial bee colony algorithm. Scholarpedia 5(3), 6915 (2010)CrossRef
11.
Zurück zum Zitat Gao, S., Wang, Y., Cheng, J., Inazumi, Y., Tang, Z.: Ant colony optimization with clustering for solving the dynamic location routing problem. Appl. Math. Comput. 285, 149–173 (2016)MathSciNet Gao, S., Wang, Y., Cheng, J., Inazumi, Y., Tang, Z.: Ant colony optimization with clustering for solving the dynamic location routing problem. Appl. Math. Comput. 285, 149–173 (2016)MathSciNet
12.
Zurück zum Zitat Gao, S., Wang, W., Dai, H., Li, F., Tang, Z.: Improved clonal selection algorithm combined with ant colony optimization. IEICE Trans. Inf. Syst. 91(6), 1813–1823 (2008)CrossRef Gao, S., Wang, W., Dai, H., Li, F., Tang, Z.: Improved clonal selection algorithm combined with ant colony optimization. IEICE Trans. Inf. Syst. 91(6), 1813–1823 (2008)CrossRef
14.
Zurück zum Zitat Zheng, S., Li, J., Janecek, A., Tan, Y.: A cooperative framework for fireworks algorithm. IEEE/ACM Trans. Comput. Biol. Bioinform. 14(1), 27–41 (2017)CrossRef Zheng, S., Li, J., Janecek, A., Tan, Y.: A cooperative framework for fireworks algorithm. IEEE/ACM Trans. Comput. Biol. Bioinform. 14(1), 27–41 (2017)CrossRef
18.
Zurück zum Zitat Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51–67 (2016)CrossRef Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51–67 (2016)CrossRef
19.
Zurück zum Zitat Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67–82 (1997)CrossRef Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67–82 (1997)CrossRef
21.
Zurück zum Zitat Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Comput. Intell. 9(3), 268–299 (1993)CrossRef Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Comput. Intell. 9(3), 268–299 (1993)CrossRef
22.
Zurück zum Zitat Liao, T.W.: Two hybrid differential evolution algorithms for engineering design optimization. Appl. Soft Comput. 10(4), 1188–1199 (2010)CrossRef Liao, T.W.: Two hybrid differential evolution algorithms for engineering design optimization. Appl. Soft Comput. 10(4), 1188–1199 (2010)CrossRef
23.
Zurück zum Zitat Kao, M.Y., Ma, Y., Sipser, M., Yin, Y.: Optimal constructions of hybrid algorithms. J. Algorithms 29(1), 142–164 (1998)MathSciNetCrossRef Kao, M.Y., Ma, Y., Sipser, M., Yin, Y.: Optimal constructions of hybrid algorithms. J. Algorithms 29(1), 142–164 (1998)MathSciNetCrossRef
24.
Zurück zum Zitat Gao, S., Tang, Z., Dai, H., Zhang, J.: A hybrid clonal selection algorithm. Int. J. Innov. Comput. Inf. Control 4(4), 995–1008 (2008) Gao, S., Tang, Z., Dai, H., Zhang, J.: A hybrid clonal selection algorithm. Int. J. Innov. Comput. Inf. Control 4(4), 995–1008 (2008)
25.
Zurück zum Zitat Wang, S., Aorigele, Liu, G., Gao, S.: A hybrid discrete imperialist competition algorithm for fuzzy job-shop scheduling problems. IEEE. Access 4, 9320–9331 (2016)CrossRef Wang, S., Aorigele, Liu, G., Gao, S.: A hybrid discrete imperialist competition algorithm for fuzzy job-shop scheduling problems. IEEE. Access 4, 9320–9331 (2016)CrossRef
26.
Zurück zum Zitat Juang, C.F.: A hybrid of genetic algorithm and particle swarm optimization for recurrent network design. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 34(2), 997–1006 (2004)CrossRef Juang, C.F.: A hybrid of genetic algorithm and particle swarm optimization for recurrent network design. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 34(2), 997–1006 (2004)CrossRef
27.
Zurück zum Zitat Gong, Y.J., Li, J.J., Zhou, Y., Li, Y., Chung, H.S.H., Shi, Y.H., Zhang, J.: Genetic learning particle swarm optimization. IEEE Trans. Cybern. 46(10), 2277–2290 (2016)CrossRef Gong, Y.J., Li, J.J., Zhou, Y., Li, Y., Chung, H.S.H., Shi, Y.H., Zhang, J.: Genetic learning particle swarm optimization. IEEE Trans. Cybern. 46(10), 2277–2290 (2016)CrossRef
28.
Zurück zum Zitat Tasgetiren, M.F., Suganthan, P.N., Pan, Q.K.: An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem. Appl. Math. Comput. 215(9), 3356–3368 (2010)MathSciNetMATH Tasgetiren, M.F., Suganthan, P.N., Pan, Q.K.: An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem. Appl. Math. Comput. 215(9), 3356–3368 (2010)MathSciNetMATH
30.
Zurück zum Zitat Kellert, S.H.: In the wake of chaos: unpredictable order in dynamical systems. University of Chicago press (1994) Kellert, S.H.: In the wake of chaos: unpredictable order in dynamical systems. University of Chicago press (1994)
31.
Zurück zum Zitat Liu, B., Wang, L., Jin, Y.H.: An effective pso-based memetic algorithm for flow shop scheduling. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 37(1), 18–27 (2007)CrossRef Liu, B., Wang, L., Jin, Y.H.: An effective pso-based memetic algorithm for flow shop scheduling. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 37(1), 18–27 (2007)CrossRef
32.
Zurück zum Zitat Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.P., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL report 2005005, p. 2005 (2005) Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.P., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL report 2005005, p. 2005 (2005)
Metadaten
Titel
A Novel Memetic Whale Optimization Algorithm for Optimization
verfasst von
Zhe Xu
Yang Yu
Hanaki Yachi
Junkai Ji
Yuki Todo
Shangce Gao
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-93815-8_37

Premium Partner