A grey wolf optimizer-based chaotic gravitational search algorithm for global optimization

被引:14
作者
Yu, Xianrui [1 ]
Zhao, Qiuhong [1 ,2 ,3 ]
Lin, Qi [4 ]
Wang, Tongyu [5 ]
机构
[1] Beihang Univ, Sch Econ & Management, Beijing 100191, Peoples R China
[2] Beijing Key Lab Emergency Support Simulat Technol, Beijing 100191, Peoples R China
[3] Beijing Int Sci & Technol Cooperat Base City Safe, Beijing 100191, Peoples R China
[4] Univ Int Business & Econ, Sch Informat Technol & Management, Beijing 100029, Peoples R China
[5] Ocean Univ China, Sch Econ, Qingdao 266100, Peoples R China
基金
中国国家自然科学基金;
关键词
Gravitational search algorithm; Exploration and exploitation; Grey wolf optimizer; Chaotic map; Numerical optimization; SYSTEM; MODEL;
D O I
10.1007/s11227-022-04754-3
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Gravitational search algorithm (GSA) is widely accepted as one of the effective optimization algorithms providing promising results. However, it suffers with local optima and premature convergence. To deal with those problems, chaotic gravitational constants for the gravitational search algorithm (CGSA) are proposed to enhance the efficiency of exploration via embedding chaotic maps, but the enhancement of exploration throughout iterations could somehow degrade the exploitation ability of GSA. Accordingly, this paper introduces a location update strategy inspired by the hunting mechanism of grey wolf optimizer (GWO) for improving the exploitation process of CGSA. In addition, a negative entropy function is designed to effectively control the implementation of the proposed strategy. In order to show the superior performance of the grey wolf chaotic gravitational search algorithm (GWCGSA), we carry out a comparative study of 30 benchmark functions (CEC 2014) with multiple GSAs and state-of-the-art algorithms. The experimental results show that the proposed strategy achieves better performance in most functions (greater than 20/30). Also, the experiments on seven engineering optimization problems indicate that the practicality of the proposed algorithm can be ensured.
引用
收藏
页码:2691 / 2739
页数:49
相关论文
共 57 条
[1]   Optimal coordination of over current relay using opposition learning-based gravitational search algorithm [J].
Acharya, Debasis ;
Das, Dushmanta Kumar .
JOURNAL OF SUPERCOMPUTING, 2021, 77 (09) :10721-10741
[2]   Artificial bee colony algorithm for large-scale problems and engineering design optimization [J].
Akay, Bahriye ;
Karaboga, Dervis .
JOURNAL OF INTELLIGENT MANUFACTURING, 2012, 23 (04) :1001-1014
[3]   On Average Performance and Stability of Economic Model Predictive Control [J].
Angeli, David ;
Amrit, Rishi ;
Rawlings, James B. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2012, 57 (07) :1615-1626
[4]   A STUDY OF MATHEMATICAL-PROGRAMMING METHODS FOR STRUCTURAL OPTIMIZATION .2. NUMERICAL RESULTS [J].
BELEGUNDU, AD ;
ARORA, JS .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1985, 21 (09) :1601-1623
[5]   Design of space trusses using modified teaching-learning based optimization [J].
Camp, C. V. ;
Farshchin, M. .
ENGINEERING STRUCTURES, 2014, 62-63 :87-97
[6]   BRANCH-AND-BOUND SCHEDULING FOR THERMAL GENERATING-UNITS [J].
CHEN, CL ;
WANG, SC .
IEEE TRANSACTIONS ON ENERGY CONVERSION, 1993, 8 (02) :184-189
[7]   Use of a self-adaptive penalty approach for engineering optimization problems [J].
Coello, CAC .
COMPUTERS IN INDUSTRY, 2000, 41 (02) :113-127
[8]   Selective Opposition based Grey Wolf Optimization [J].
Dhargupta, Souvik ;
Ghosh, Manosij ;
Mirjalili, Seyedali ;
Sarkar, Ram .
EXPERT SYSTEMS WITH APPLICATIONS, 2020, 151
[9]   OPTIMAL FORMULATION AND SOLUTION OF SHORT-RANGE OPERATING PROBLEMS FOR A POWER-SYSTEM WITH FLOW CONSTRAINTS [J].
DODU, JC ;
POUGET, J ;
MERLIN, A ;
MARTIN, P .
PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1972, 60 (01) :54-&
[10]   ENVIRONMENTALLY CONSTRAINED ECONOMIC-DISPATCH USING LINEAR-PROGRAMMING [J].
ELKEIB, AA ;
DING, H .
ELECTRIC POWER SYSTEMS RESEARCH, 1994, 29 (03) :155-159