EMoSOA: a new evolutionary multi-objective seagull optimization algorithm for global optimization

被引:95
|
作者
Dhiman, Gaurav [1 ]
Singh, Krishna Kant [2 ]
Slowik, Adam [3 ]
Chang, Victor [4 ]
Yildiz, Ali Riza [5 ]
Kaur, Amandeep [6 ]
Garg, Meenakshi [1 ]
机构
[1] Govt Bikram Coll Commerce, Dept Comp Sci, Patiala 147001, Punjab, India
[2] Delhi NCR, Dept Elect & Commun Engn, KIET Grp Inst, Ghaziabad, India
[3] Koszalin Univ Technol, Dept Elect & Comp Sci, Sniadeckich 2, PL-75453 Koszalin, Poland
[4] Teesside Univ, Sch Comp Engn & Digital Technol, Middlesbrough, Cleveland, England
[5] Uludag Univ, Dept Automot Engn, Coll Engn, TR-16059 Bursa, Turkey
[6] Sri Guru Granth Sahib World Univ, Dept Comp Sci & Engn, Fatehgarh Sahib, Punjab, India
关键词
Seagull Optimization Algorithm; Multi-objective Optimization; Evolutionary; Pareto; Engineering Design Problems; Convergence; Diversity; SPOTTED HYENA OPTIMIZER; COMPUTATIONAL INTELLIGENCE; DESIGN OPTIMIZATION; PLACEMENT; MODEL; COST;
D O I
10.1007/s13042-020-01189-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This study introduces the evolutionary multi-objective version of seagull optimization algorithm (SOA), entitled Evolutionary Multi-objective Seagull Optimization Algorithm (EMoSOA). In this algorithm, a dynamic archive concept, grid mechanism, leader selection, and genetic operators are employed with the capability to cache the solutions from the non-dominatedPareto. The roulette-wheel method is employed to find the appropriate archived solutions. The proposed algorithm is tested and compared with state-of-the-art metaheuristic algorithms over twenty-four standard benchmark test functions. Four real-world engineering design problems are validated using proposedEMoSOAalgorithm to determine its adequacy. The findings of empirical research indicate that the proposed algorithm is better than other algorithms. It also takes into account those optimal solutions from theParetowhich shows high convergence.
引用
收藏
页码:571 / 596
页数:26
相关论文
共 50 条
  • [1] EMoSOA: a new evolutionary multi-objective seagull optimization algorithm for global optimization
    Gaurav Dhiman
    Krishna Kant Singh
    Adam Slowik
    Victor Chang
    Ali Riza Yildiz
    Amandeep Kaur
    Meenakshi Garg
    [J]. International Journal of Machine Learning and Cybernetics, 2021, 12 : 571 - 596
  • [2] MOSOA: A new multi-objective seagull optimization algorithm
    Dhiman, Gaurav
    Singh, Krishna Kant
    Soni, Mukesh
    Nagar, Atulya
    Dehghani, Mohammad
    Slowik, Adam
    Kaur, Amandeep
    Sharma, Ashutosh
    Houssein, Essam H.
    Cengiz, Korhan
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2021, 167
  • [3] An new evolutionary multi-objective optimization algorithm
    Mu, SJ
    Su, HY
    Chu, J
    Wang, YX
    [J]. CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS, 2003, : 914 - 920
  • [4] A new dynamic multi-objective optimization evolutionary algorithm
    Liu, Chun-An
    Wang, Yuping
    [J]. INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2008, 4 (08): : 2087 - 2096
  • [5] A new Dynamic Multi-objective Optimization Evolutionary Algorithm
    Zheng, Bojin
    [J]. ICNC 2007: Third International Conference on Natural Computation, Vol 5, Proceedings, 2007, : 565 - 570
  • [6] Multi-Objective Quantum-Inspired Seagull Optimization Algorithm
    Wang, Yule
    Wang, Wanliang
    Ahmad, Ijaz
    Tag-Eldin, Elsayed
    [J]. ELECTRONICS, 2022, 11 (12)
  • [8] New Dynamic Multi-Objective Constrained Optimization Evolutionary Algorithm
    Liu, Chun-An
    Wang, Yuping
    Ren, Aihong
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2015, 32 (05)
  • [9] A New Quantum Clone Evolutionary Algorithm for Multi-objective Optimization
    Qu Hongjian
    Zhao Dawei
    Zhou Fangzhao
    [J]. ISBIM: 2008 INTERNATIONAL SEMINAR ON BUSINESS AND INFORMATION MANAGEMENT, VOL 2, 2009, : 23 - +
  • [10] An evolutionary algorithm for dynamic multi-objective optimization
    Wang, Yuping
    Dang, Chuangyin
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2008, 205 (01) : 6 - 18