A modified self-adaptive marine predators algorithm: framework and engineering applications

被引:58
作者
Fan, Qingsong [1 ]
Huang, Haisong [1 ]
Chen, Qipeng [1 ]
Yao, Liguo [1 ,2 ]
Yang, Kai [1 ,3 ]
Huang, Dong [1 ]
机构
[1] Guizhou Univ, Key Lab Adv Mfg Technol, Minist Educ, Guiyang 550025, Guizhou, Peoples R China
[2] Yuan Ze Univ, Dept Ind Engn & Management, Taoyuan 32003, Taiwan
[3] South China Univ Technol, Coll Mech & Automot Engn, Guangzhou 510640, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Optimization; Marine predators algorithm; Self-adaptive rules; Logistic opposition-based learning; PARTICLE SWARM OPTIMIZATION; DIFFERENTIAL EVOLUTION; MULTIPLE COMPARISONS; SEARCH ALGORITHM; DESIGN; INTELLIGENCE; TESTS; STRATEGIES; SELECTION;
D O I
10.1007/s00366-021-01319-5
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The application of metaheuristic algorithms is one of the most promising approaches for solving real-world problems. The marine predators algorithm (MPA) is a recently proposed population-based metaheuristic algorithm that has been proven to be competitive with other algorithms. Although the MPA shows good performance compared with other algorithms, modifications are still necessary to improve its optimization performance. Therefore, this paper proposes a modified MPA (MMPA). First, a logistic opposition-based learning (LOBL) mechanism is put forward to improve the population diversity and generate more accurate solutions. Second, effective self-adaptive updating methods are introduced into the original MPA, such as proposing the new position-updating rule, inertia weight coefficient and nonlinear step size control parameter strategy. The validity of the MMPA is tested on 23 classical benchmark functions, CEC 2020 functions and four real-world problems. Furthermore, the proposed algorithm is also evaluated using high-dimensional (Dim = 100, 1000 and 2000) benchmark functions. The experimental results and two different statistical tests demonstrate that the MMPA exhibits superior performance, and that it is competitive with many state-of-the-art algorithms in terms of accuracy, convergence speed, and stability.
引用
收藏
页码:3269 / 3294
页数:26
相关论文
共 92 条
[1]   An improved Opposition-Based Sine Cosine Algorithm for global optimization [J].
Abd Elaziz, Mohamed ;
Oliva, Diego ;
Xiong, Shengwu .
EXPERT SYSTEMS WITH APPLICATIONS, 2017, 90 :484-500
[2]   A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm [J].
Askarzadeh, Alireza .
COMPUTERS & STRUCTURES, 2016, 169 :1-12
[3]   An improved differential evolution algorithm using efficient adapted surrogate model for numerical optimization [J].
Awad, Noor H. ;
Ali, Mostafa Z. ;
Mallipeddi, Rammohan ;
Suganthan, Ponnuthurai N. .
INFORMATION SCIENCES, 2018, 451 :326-347
[4]   A modification of tree-seed algorithm using Deb's rules for constrained optimization [J].
Babalik, Ahmet ;
Cinar, Ahmet Cevahir ;
Kiran, Mustafa Servet .
APPLIED SOFT COMPUTING, 2018, 63 :289-305
[5]   HMPA: an innovative hybrid multi-population algorithm based on artificial ecosystem-based and Harris Hawks optimization algorithms for engineering problems [J].
Barshandeh, Saeid ;
Piri, Farhad ;
Sangani, Simin Rasooli .
ENGINEERING WITH COMPUTERS, 2022, 38 (02) :1581-1625
[6]   A new hybrid chaotic atom search optimization based on tree-seed algorithm and Levy flight for solving optimization problems [J].
Barshandeh, Saeid ;
Haghzadeh, Maryam .
ENGINEERING WITH COMPUTERS, 2021, 37 (04) :3079-3122
[7]   An efficient hybrid clustering method based on improved cuckoo optimization and modified particle swarm optimization algorithms [J].
Bouyer, Asgarali ;
Hatamlou, Abdolreza .
APPLIED SOFT COMPUTING, 2018, 67 :172-182
[8]   Using visual features to design a content-based image retrieval method optimized by particle swarm optimization algorithm [J].
Chang, Bae-Muu ;
Tsai, Hung-Hsu ;
Chou, Wen-Ling .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2013, 26 (10) :2372-2382
[9]   Use of a self-adaptive penalty approach for engineering optimization problems [J].
Coello, CAC .
COMPUTERS IN INDUSTRY, 2000, 41 (02) :113-127
[10]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338