nach oben

Soft Computing

Erschienen in:

29.01.2022 | Optimization

Island-based Cuckoo Search with elite opposition-based learning and multiple mutation methods for solving optimization problems

verfasst von: Bilal H. Abed-alguni, David Paul

Erschienen in: Soft Computing | Ausgabe 7/2022

Einloggen

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

search-config

KI-gestützte Suche

Aus

Abstract

The island Cuckoo Search (iCSPM) algorithm is a variation of Cuckoo Search that uses the island model and highly disruptive polynomial mutation to solve optimization problems. This article introduces an improved iCSPM algorithm called iCSPM with elite opposition-based learning and multiple mutation methods (iCSPM2). iCSPM2 has three main characteristics. Firstly, it separates candidate solutions into several islands (sub-populations) and then divides the islands among four improved Cuckoo Search algorithms: Cuckoo Search via Lévy flights, Cuckoo Search with highly disruptive polynomial mutation, Cuckoo Search with Jaya mutation and Cuckoo Search with pitch adjustment mutation. Secondly, it uses elite opposition-based learning to improve its convergence rate and exploration ability. Finally, it makes continuous candidate solutions discrete using the smallest position value method. A set of 15 popular benchmark functions indicate iCSPM2 performs better than iCSPM. However, based on sensitivity analysis of both algorithms, convergence behavior seems sensitive to island model parameters. Further, the single-objective IEEE-CEC 2014 functions were used to evaluate and compare the performance of iCSPM2 to four well-known swarm optimization algorithms: distributed grey wolf optimizer, distributed adaptive differential evolution with linear population size reduction evolution, memory-based hybrid dragonfly algorithm and fireworks algorithm with differential mutation. Experimental and statistical results suggest iCSPM2 has better performance than the four other algorithms. iCSPM2’s performance was also shown to be favorable compared to two powerful discrete optimization algorithms (generalized accelerations for insertion-based heuristics and memetic algorithm with novel semi-constructive crossover and mutation operators) using a set of Taillard’s benchmark instances for the permutation flow shop scheduling problem.

Vorheriger Artikel Adaptive quantum class topper optimization tuned three degree of freedom-PID controller for automatic generation control of power system incorporating IPFC and real-time simulation

Nächster Artikel A developed framework for multi-document summarization using softmax regression and spider monkey optimization methods

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren

Abadlia H, Smairi N, Ghedira K (2017) Particle swarm optimization based on dynamic island model. In: 2017 IEEE 29th international conference on tools with artificial intelligence (ICTAI). IEEE, pp 709–716

Abed-alguni BH, Alawad NA, Barhoush M, Hammad R (2021) Exploratory cuckoo search for solving single-objective optimization problems. Soft Comput 1–14

Abed-alguni BH, Alkhateeb F (2018) Intelligent hybrid cuckoo search and \(\beta \)-hill climbing algorithm. J King Saud Uni Comput Inform Sci 1–43

Abed-Alguni BHK (2014) Cooperative reinforcement learning for independent learners. PhD thesis, Faculty of Engineering and Built Environment, School of Electrical Engineering and Computer Science, The University of Newcastle, Australia

Abed-alguni BH, Klaib AF (2018) Hybrid whale optimisation and \(\beta \)-hill climbing algorithm. Int J Comput Sci Math 1–13

Abed-Alguni BH, Paul DJ, Chalup SK, Henskens FA (2016) A comparison study of cooperative Q-learning algorithms for independent learners. Int J Artif Intell 14(1):71–93

Abed-alguni BH (2017) Bat Q-learning algorithm. Jordanian J Comput Inform Technol 3(1):56–77

Abed-alguni BH (2018) Action-selection method for reinforcement learning based on cuckoo search algorithm. Arab J Sci Eng 43(12):6771–6785CrossRef

Abed-alguni BH (2019) Island-based cuckoo search with highly disruptive polynomial mutation. Int J Artif Intell 17(1):57–82

Abed-alguni BH, Alawad NA (2021) Distributed grey wolf optimizer for scheduling of workflow applications in cloud environments. Appl Soft Comput 102:107113CrossRef

Abed-alguni BH, Alkhateeb F (2017) Novel selection schemes for cuckoo search. Arab J Sci Eng 42(8):3635–3654CrossRef

Abed-alguni BH, Barhoush M (2018) Distributed grey wolf optimizer for numerical optimization problems. Jordanian J Comput Inf Technol 4:130–149

Abed-alguni BH, Ottom MA (2018) Double delayed Q-learning. Int J Artif Intell 16(2):41–59

Abed-Alguni BH, Paul DJ (2018) Hybridizing the cuckoo search algorithm with different mutation operators for numerical optimization problems. J Intell Syst 29(1):1043–1062

Abed-alguni BH, Chalup SK, Henskens FA, Paul DJ (2015) Erratum to: a multi-agent cooperative reinforcement learning model using a hierarchy of consultants, tutors and workers. Vietnam J Comput Sci 2(4):227CrossRef

Abed-alguni BH, Chalup SK, Henskens FA, Paul DJ (2015) A multi-agent cooperative reinforcement learning model using a hierarchy of consultants, tutors and workers. Vietnam J Comput Sci 2(4):213–226CrossRef

Abed-Alguni BH, Klaib AF, Nahar KM (2019) Island-based whale optimisation algorithm for continuous optimisation problems. Int J Reason Based Intell Syst 11(4):319–329

Abualigah LMQ et al (2019) Feature selection and enhanced krill herd algorithm for text document clustering. Springer

Abualigah L, Yousri D, Abd Elaziz M, Ewees AA, Al-qaness MA, Gandomi AH (2021) Aquila optimizer: a novel meta-heuristic optimization algorithm. Comput Indus Eng 157:107250CrossRef

Abualigah L, Diabat A, Mirjalili S, Abd Elaziz M, Gandomi AH (2021) The arithmetic optimization algorithm. Comput Methods Appl Mech Eng 376:113609

Alawad NA, Abed-alguni BH (2020) Discrete island-based cuckoo search with highly disruptive polynomial mutation and opposition-based learning strategy for scheduling of workflow applications in cloud environments. Arab J Sci Eng 1–30

Alawad NA, Abed-alguni BH (2021) Discrete jaya with refraction learning and three mutation methods for the permutation flow shop scheduling problem. J Supercomput 1–17

Alawad NA, Abed-alguni BH (2021) Discrete jaya with refraction learning and three mutation methods for the permutation flow shop scheduling problem. J Supercomput 1–22

Alawad NA, Anagnostopoulos A, Leonardi S, Mele I, Silvestri F (2016) Network-aware recommendations of novel tweets. In: Proceedings of the 39th international ACM SIGIR conference on research and development in information retrieval. ACM, pp 913–916

Al-Betar MA (2021) Island-based harmony search algorithm for non-convex economic load dispatch problems. J Elect Eng Technol 1–31

Al-Betar MA, Awadallah MA (2018) Island bat algorithm for optimization. Expert Syst Appl 107:126–145CrossRef

Al-Betar MA, Awadallah MA, Khader AT, Abdalkareem ZA (2015) Island-based harmony search for optimization problems. Expert Syst Appl 42(4):2026–2035CrossRef

Al-Betar MA, Awadallah MA, Doush IA, Hammouri AI, Mafarja M, Alyasseri ZAA (2019) Island flower pollination algorithm for global optimization. J Supercomput 75(8):5280–5323CrossRef

Ali IM, Essam D, Kasmarik K (2019) A novel differential evolution mapping technique for generic combinatorial optimization problems. Appl Soft Comput 80:297–309CrossRef

Alkhateeb F, Abed-alguni BH, Al-rousan MH (2021) Discrete hybrid cuckoo search and simulated annealing algorithm for solving the job shop scheduling problem. J Supercomput 1–28

Alkhateeb F, Abed-Alguni BH (2017) A hybrid cuckoo search and simulated annealing algorithm. J Intell Syst

Awadallah MA, Al-Betar MA, Bolaji AL, Doush IA, Hammouri AI, Mafarja M (2020) Island artificial bee colony for global optimization. Soft Computing, pp 1–27

Casanova H, Giersch A, Legrand A, Quinson M, Suter F (2014) Versatile, scalable, and accurate simulation of distributed applications and platforms. J Parallel Distrib Comput 74(10):2899–2917CrossRef

Chen H, Heidari AA, Chen H, Wang M, Pan Z, Gandomi AH (2020) Multi-population differential evolution-assisted harris hawks optimization: Framework and case studies. Futur Gener Comput Syst 111:175–198CrossRef

Corcoran AL, Wainwright RL (1994) A parallel island model genetic algorithm for the multiprocessor scheduling problem. In: Proceedings of the 1994 ACM symposium on applied computing, Phoenix, Arizona, USA (New York, NY, USA). ACM, pp 483–487

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(1):3–18CrossRef

Doush I, Hasan B, Al-Betar M, AlMaghayreh E, Alkhateeb F (2014) Artificial bee colony with different mutation schemes: a comparative study. Comput Sci J Moldova 64(1):77–98

Faramarzi A, Heidarinejad M, Stephens B, Mirjalili S (2020) Equilibrium optimizer: a novel optimization algorithm. Knowl-Based Syst 191:105190CrossRef

Fernandez-Viagas V, Molina-Pariente JM, Framinan JM (2020) Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling. Eur J Oper Res 282(3):858–872MathSciNetMATHCrossRef

Friedman M (1940) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11(1):86–92MathSciNetMATHCrossRef

Geem ZW, Kim JH, Loganathan G (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68CrossRef

Guo S-S, Wang J-S, Ma X-X (2019) Improved bat algorithm based on multipopulation strategy of island model for solving global function optimization problem. Comput Intell Neurosci 2019

Hasan BHF, Doush IA, Al Maghayreh E, Alkhateeb F, Hamdan M (2014) Hybridizing harmony search algorithm with different mutation operators for continuous problems. Appl Math Comput 232:1166–1182MathSciNetMATH

Karaboga D, Basturk B (2007) Artificial bee colony (abc) optimization algorithm for solving constrained optimization problems. In: International fuzzy systems association world congress. Springer, pp 789–798

Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN’95-international conference on neural networks, vol 4. IEEE, pp 1942–1948

Komusiewicz C, Kratsch D et al (2020) Matching cut: kernelization, single-exponential time fpt, and exact exponential algorithms. Disc Appl Math 283:44–58MathSciNetMATHCrossRef

Ks SR, Murugan S (2017) Memory based hybrid dragonfly algorithm for numerical optimization problems. Exp Syst Appl 83:63–78CrossRef

Kurdi M (2020) A memetic algorithm with novel semi-constructive evolution operators for permutation flowshop scheduling problem. Appl Soft Comput 106458

Kurdi M (2016) An effective new island model genetic algorithm for job shop scheduling problem. Comput Oper Res 67:132–142MathSciNetMATHCrossRef

Kushida J-i, Hara A, Takahama T, Kido A (2013) Island-based differential evolution with varying subpopulation size. In: 2013 IEEE 6th international workshop on computational intelligence and applications (IWCIA). IEEE, pp 119–124

Lardeux F, Goëffon A (2010) A dynamic island-based genetic algorithms framework. In: Asia-Pacific conference on simulated evolution and learning. Springer, pp 156–165

Liang JJ, Qu BY, Suganthan PN (2013) Problem definitions and evaluation criteria for the cec, 2014 special session and competition on single objective real-parameter numerical optimization. In: Computational intelligence laboratory, vol 635. Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore, p 2013

Liu Y, Cao B, Li H (2020)Improving ant colony optimization algorithm with epsilon greedy and levy flight. Compl Intell Syst 1–12

Mehta S, Kaur P (2019) Scheduling data intensive scientific workflows in cloud environment using nature inspired algorithms. In: Nature-inspired algorithms for big data frameworks. IGI Global, pp 196–217

Michel R, Middendorf M (1998) An island model based ant system with lookahead for the shortest supersequence problem. In: International conference on parallel problem solving from nature, Amsterdam, The Netherlands. Springer, pp 692–701

Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51–67CrossRef

Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61CrossRef

Mohammed SMZ, Khader AT, Al-Betar MA (2016) 3-sat using island-based genetic algorithm. IEEJ Trans Electron Inform Syst 136(12):1694–1698

Mugemanyi S, Qu Z, Rugema FX, Dong Y, Bananeza C, Wang L (2020) Optimal reactive power dispatch using chaotic bat algorithm. IEEE Access 8:65830–65867CrossRef

Paiva FA, Silva CR, Leite IV, Marcone MH, Costa JA (2017) Modified bat algorithm with cauchy mutation and elite opposition-based learning. In: 2017 IEEE Latin American conference on computational intelligence (LA-CCI). IEEE, pp 1–6

Rakhshani H, Rahati A (2016) Intelligent multiple search strategy cuckoo algorithm for numerical and engineering optimization problems. Arabian J Sci Eng 1–27

Rao R (2016) Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7(1):19–34

Saremi S, Mirjalili S, Lewis A (2017) Grasshopper optimisation algorithm: theory and application. Adv Eng Softw 105:30–47CrossRef

Sihwail R, Omar K, Ariffin KAZ, Tubishat M (2020) Improved harris hawks optimization using elite opposition-based learning and novel search mechanism for feature selection. IEEE Access 8:121127–121145CrossRef

Skakovski A, Jedrzejowicz P (2019) An island-based differential evolution algorithm with the multi-size populations. Exp Syst Appl 126:308–320CrossRef

Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47(1):65–74MathSciNetMATHCrossRef

Tanabe R, Fukunaga AS (2014) Improving the search performance of shade using linear population size reduction. In: 2014 IEEE congress on evolutionary computation (CEC). IEEE, pp 1658–1665

Wang H, Wang W, Sun H, Cui Z, Rahnamayan S, Zeng S (2017) A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems. Soft Comput 21(15):4297–4307CrossRef

Yang X-S, Deb S (2009) Cuckoo search via lévy flights. In: World congress on nature and biologically inspired computing. NaBIC. IEEE, pp 210–214

Yang X-S (2012) Flower pollination algorithm for global optimization. In: International conference on unconventional computing and natural computation. Springer, pp 240–249

Yu C, Kelley L, Zheng S, Tan Y (2014) Fireworks algorithm with differential mutation for solving the cec 2014 competition problems. In: 2014 IEEE congress on evolutionary computation (CEC). IEEE, pp 3238–3245

Yusta SC (2009) Different metaheuristic strategies to solve the feature selection problem. Pattern Recogn Lett 30(5):525–534CrossRef

Zhang S, Luo Q, Zhou Y (2017) Hybrid grey wolf optimizer using elite opposition-based learning strategy and simplex method. Int J Comput Intell Appl 16(02):1750012CrossRef

Zhou X, Wu Z, Wang H, Li K, Zhang H (2013) Elite opposition-based particle swarm optimization. Acta Electron Sin 41(8):1647–1652

Zhou Y, Wang R, Zhao C, Luo Q, Metwally MA (2019) Discrete greedy flower pollination algorithm for spherical traveling salesman problem. Neural Comput Appl 31(7):2155–2170CrossRef

Titel: Island-based Cuckoo Search with elite opposition-based learning and multiple mutation methods for solving optimization problems
verfasst von: Bilal H. Abed-alguni
David Paul
Publikationsdatum: 29.01.2022
Verlag: Springer Berlin Heidelberg
Erschienen in: Soft Computing / Ausgabe 7/2022
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI: https://doi.org/10.1007/s00500-021-06665-6

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

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

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 7/2022

Retraction Note to: Financial information prediction and information sharing supervision based on trend assessment and neural network

Mixed logit model based on nonlinear random utility functions: a transfer passenger demand prediction method on overnight D-trains

Using Bayesian optimization algorithm for model-based integration testing

De-noising of EEG signals with shift-based cycle spinning on wave atoms

Use of optimal control in studying the dynamical behaviors of fractional financial awareness models

Prediction of machinability parameters in turning operation using interval type-2 fuzzy logic system based on semi-elliptic and trapezoidal membership functions

Premium Partner