Hybrid parliamentary optimization and big bang-big crunch algorithm for global optimization

Researchers have developed different metaheuristic algorithms to solve various optimization problems. Theefficiency of a metaheuristic algorithm depends on the balance between exploration and exploitation. This paper presentsthe hybrid parliamentary optimization and big bang-big crunch (HPO-BBBC) algorithm, which is a combination ofthe parliamentary optimization algorithm (POA) and the big bang-big crunch (BB-BC) optimization algorithm. Theintragroup competition phase of the POA is a process that searches for potential points in the search space, therebyproviding an exploration mechanism. By contrast, the BB-BC algorithm has an effective exploitation mechanism. Inthe proposed method, steps of the BB-BC algorithm are added to the intragroup competition phase of the POA inorder to improve the exploitation capabilities of the POA. Thus, the proposed method achieves a good balance betweenexploration and exploitation. The performance of the HPO-BBBC algorithm was tested using well-known mathematicaltest functions and compared with that of the POA, the BB-BC algorithm, and some other metaheuristics, namelythe genetic algorithm, multiverse optimizer, crow search algorithm, dragonfly algorithm, and moth-flame optimizationalgorithm. The HPO-BBBC algorithm was found to achieve better optimization performance and a higher convergencespeed than the above-mentioned algorithms on most benchmark problems.

PDF

___

[1] Kızıloluk S, Alataş B. Automatic mining of numerical classification rules with parliamentary optimization algorithm. Adv Electr Comput Eng 2015; 15: 17-24.
[2] Holland JH. Adaptation in Natural and Artificial Systems. Ann Arbor, MI, USA: University of Michigan Press, 1975.
[3] De Castro L, Timmis J. Artificial Immune Systems: A New Computational Intelligence Approach. London, UK: Springer-Verlag, 2002.
[4] Rashedi E, Nezamabadi-Pour H, Saryazdi S. GSA: a gravitational search algorithm. Inf Sci 2009; 179: 2232-2248.
[5] Atashpaz-Gargari E, Lucas C. Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE Congress on Evolutionary Computation; 25–28 September 2007; Singapore. New York, NY, USA: IEEE. pp. 4661-4667.
[6] Alatas B. ACROA: artificial chemical reaction optimization algorithm for global optimization. Expert Syst Appl 2011; 38: 13170-13180.
[7] Malek M, Guruswamy M, Owens H, Pandya M. A Hybrid Algorithm Technique. Technical Report. Austin, TX, USA: University of Texas at Austin Department of Computer Sciences, 1989.
[8] Farnad B, Jafarian A, Baleanu D. A new hybrid algorithm for continuous optimization problem. Appl Math Modell 2018; 55: 652-673.
[9] Noack MM, Funke SW. Hybrid genetic deflated newton method for global optimisation. J Comput Appl Math 2017; 325: 97-112.
[10] Aydilek İB. A hybrid firefly and particle swarm optimization algorithm for computationally expensive numerical problems. Appl Soft Comput 2018; 66: 232-249.
[11] Zhang X, Kang Q, Cheng J, Wang X. A novel hybrid algorithm based on biogeography-based optimization and grey wolf optimizer. Appl Soft Comput 2018; 67: 197-214.
[12] Zou F, Chen D, Lu R. Hybrid hierarchical backtracking search optimization algorithm and its application. Arab J Sci Eng 2018; 43: 993-1014.
[13] Assad A, Deep K. A Hybrid harmony search and simulated annealing algorithm for continuous optimization. Inf Sci 2018; 450: 246-266.
[14] Jadon SS, Tiwari R, Sharma H, Bansal JC. Hybrid artificial bee colony algorithm with differential evolution. Appl Soft Comput 2017; 58: 11-24.
[15] Sree Ranjini KS, Murugan S. Memory based hybrid dragonfly algorithm for numerical optimization problems. Expert Syst Appl 2017; 83: 63-78.
[16] Nabil E. A modified flower pollination algorithm for global optimization. Expert Syst Appl 2016; 57: 192-203.
[17] Borji A. A new global optimization algorithm inspired by parliamentary political competitions. In: 6th Mexican International Conference on Artificial Intelligence; 4–10 November 2007; Aguascalientes, Mexico. pp. 61-71.
[18] Borji A, Hamidi M. A new approach to global optimization motivated by parliamentary political competitions. Int J Innov Comput 2009; 5: 1643-1653.
[19] De-Marcos L, García A, García E, Martínez JJ, Gutiérrez JA, Barchino R, Otón S. An adaptation of the parliamentary metaheuristic for permutation constraint satisfaction. In: IEEE Congress on Evolutionary Computation; 18–23 July 2010; Barcelona, Spain. New York, NY, USA: IEEE. pp. 1-8.
[20] Altunbey F, Alatas B. Overlapping community detection in social networks using parliamentary optimization algorithm. Int J Comput Netw Appl 2015; 2: 12-19.
[21] Kiziloluk S, Ozer AB. Web pages classification with parliamentary optimization algorithm. Int J Software Eng Knowl Eng 2017; 27: 499-513.
[22] Pekel E, Soner Kara S. Passenger flow prediction based on newly adopted algorithms. Appl Artif Intell 2017; 31: 64-79.
[23] Erol OK, Eksin I. A new optimization method: big bang–big crunch. Adv Eng Software 2006; 37: 106-111.
[24] Hatamlou A, Abdullah S, Hatamlou M. Data clustering using big bang–big crunch algorithm. In: Innovative Computing Technology; 13–15 December 2011; Tehran, Iran. pp. 383-388.
[25] Othman MM, El-Khattam W, Hegazy YG, Abdelaziz AY. Optimal placement and sizing of distributed generators in unbalanced distribution systems using supervised big bang-big crunch method. IEEE T Power Syst 2015; 30: 911-919.
[26] Kaveh A, Talatahari S. A discrete big bang-big crunch algorithm for optimal design of skeletal structures. Asian J Civ Eng 2010; 11: 103-122.
[27] Xing B, Gao WJ. Innovative Computational Intelligence: A Rough Guide to 134 Clever Algorithms. Cham, Switzerland: Springer International Publishing, 2014.
[28] Zandi Z, Afjei E, Sedighizadeh M. Hybrid big bang-big crunch optimization based optimal reactive power dispatch for voltage stability enhancement. J Theor Appl Inf Technol 2013; 47: 537-546.
[29] Ahmadi S, Abdi S. Application of the hybrid big bang–big crunch algorithm for optimal sizing of a stand-alone hybrid PV/wind/battery system. Sol Energy 2016; 134: 366-374.
[30] Hora C, Secui DC, Bendea G, Dzitac S. BB-BC-CG algorithm for operational reliability modeling of hydro generator groups. Procedia Comput Sci 2016; 91: 1088-1095.
[31] Sedighizadeh M, Mahmoodi MM, Soltanian M. Parameter identification of proton exchange membrane fuel cell using a hybrid big bang-big crunch optimization. In: 5th Conference on Thermal Power Plants; 10–11 June 2014; Tehran, Iran. New York, NY, USA: IEEE. pp. 35-39.
[32] Mirjalili S, Mirjalili SM, Hatamlou A. Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput Applic 2016; 27: 495-513.
[33] Askarzadeh A. A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput Struct 2016; 169: 1-12.
[34] Mirjalili S. Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput Applic 2016; 27: 1053-1073.
[35] Mirjalili S. Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl Based Syst 2015; 89: 228–249.
[36] Ozer AB. CIDE: Chaotically initialized differential evolution. Expert Syst Appl 2010; 37: 4632-4641.
[37] Lux T. Convergence rate evaluation of derivative-free optimization techniques. In: International Workshop on Machine Learning, Optimization and Big Data; 26–29 August 2016; Volterra, Italy. pp. 246-256.
[38] Jamil M, Yang XS. A literature survey of benchmark functions for global optimisation problems. Int J Math Modell Numer Optim 2013; 4: 150-194.
[39] Suganthan P, Hansen N, Liang J, Deb K, Chen Y, Auger A, Tiwari S. Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL report 2005.
[40] Wu B, Qian C, Ni W, Fan S. Hybrid harmony search and artificial bee colony algorithm for global optimization problems. Comput Math Appl 2012; 64: 2621-2634.
[41] Guvenc U, Katircioglu F. Escape velocity: a new operator for gravitational search algorithm. Neural Comput Appl 2019; 31: 27-42.
[42] Wilcoxon F. Individual comparisons by ranking methods. Biometrics Bulletin 1945; 6: 80–83.