Student psychology based optimization algorithm: A new population based optimization algorithm for solving optimization problems

被引:160
|
作者
Das, Bikash [1 ]
Mukherjee, V. [2 ]
Das, Debapriya [3 ]
机构
[1] Govt Coll Engn & Textile Technol, Dept Elect Engn, Berhampur, W Bengal, India
[2] Indian Sch Mines, Indian Inst Technol, Dept Elect Engn, Dhanbad, Bihar, India
[3] Indian Inst Technol, Dept Elect Engn, Kharagpur, W Bengal, India
关键词
Benchmark function; CEC; 2015; Global optimum solution; Optimization algorithm; Student psychology based optimization (SPBO); SEARCH; POWER;
D O I
10.1016/j.advengsoft.2020.102804
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this article, a new metaheuristic optimization algorithm (named as, student psychology based optimization (SPBO)) is proposed. The proposed SPBO algorithm is based on the psychology of the students who are trying to give more effort to improve their performance in the examination up to the level for becoming the best student in the class. Performance of the proposed SPBO is analyzed while applying the algorithm to solve thirteen 50 dimensional benchmark functions as well as fifteen CEC 2015 benchmark problems. Results of the SPBO is compared to the performance of ten other state-of-the-art optimization algorithms such as particle swarm optimization, teaching learning based optimization, cuckoo search algorithm, symbiotic organism search, covariant matrix adaptation with evolution strategy, success-history based adaptive differential evolution, grey wolf optimization, butterfly optimization algorithm, poor and rich optimization algorithm, and barnacles mating optimizer. For fair analysis, performances of all these algorithms are analyzed based on the optimum results obtained as well as based on convergence mobility of the objective function. Pairwise and multiple comparisons are performed to analyze the statistical performance of the proposed method. From this study, it may be established that the proposed SPBO works very well in all the studied test cases and it is able to obtain an optimum solution with faster convergence mobility.
引用
收藏
页数:17
相关论文
共 50 条
  • [21] A new genetic algorithm for solving optimization problems
    Elsayed, Saber M.
    Sarker, Ruhul A.
    Essam, Daryl L.
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2014, 27 : 57 - 69
  • [22] Plasma generation optimization: a new physically-based metaheuristic algorithm for solving constrained optimization problems
    Kaveh, Ali
    Akbari, Hossein
    Hosseini, Seyed Milad
    ENGINEERING COMPUTATIONS, 2021, 38 (04) : 1554 - 1606
  • [23] A new optimization algorithm for solving complex constrained design optimization problems
    Rao, R. Venkata
    Waghmare, G. G.
    ENGINEERING OPTIMIZATION, 2017, 49 (01) : 60 - 83
  • [24] Leaf in Wind Optimization: A New Metaheuristic Algorithm for Solving Optimization Problems
    Fang, Ning
    Cao, Qi
    IEEE ACCESS, 2024, 12 : 56291 - 56308
  • [25] A new optimization algorithm for solving complex constrained design optimization problems
    Department of Mechanical Engineering, S.V. National Institute of Technology, Surat, India
    Eng Optim, 1 (60-83):
  • [26] Solving Optimization Problems via Vortex Optimization Algorithm and Cognitive Development Optimization Algorithm
    Demir, Ahmet
    Kose, Utku
    BRAIN-BROAD RESEARCH IN ARTIFICIAL INTELLIGENCE AND NEUROSCIENCE, 2016, 7 (04): : 23 - 42
  • [27] Archery Algorithm: A Novel Stochastic Optimization Algorithm for Solving Optimization Problems
    Zeidabadi, Fatemeh Ahmadi
    Dehghani, Mohammad
    Trojovsky, Pavel
    Hubalovsky, Stepan
    Leiva, Victor
    Dhiman, Gaurav
    CMC-COMPUTERS MATERIALS & CONTINUA, 2022, 72 (01): : 399 - 416
  • [28] A guided population archive whale optimization algorithm for solving multiobjective optimization problems
    Got, Adel
    Moussaoui, Abdelouahab
    Zouache, Djaafar
    EXPERT SYSTEMS WITH APPLICATIONS, 2020, 141
  • [29] Learning-based monarch butterfly optimization algorithm for solving numerical optimization problems
    Ghetas, Mohamed
    NEURAL COMPUTING & APPLICATIONS, 2022, 34 (05): : 3939 - 3957