A new optimization algorithm based on average and subtraction of the best and worst members of the population for solving various optimization problems

被引:0
作者
Dehghani M. [1 ]
Hubálovský Š. [2 ]
Trojovský P. [1 ]
机构
[1] Department of Mathematics/Faculty of Science, University of Hradec Králové, Hradec Kralove
[2] Department of Applied Cybernetics/Faculty of Science, University of Hradec Králové, Hradec Kralove
关键词
Algorithm of best and worst members of the population; Optimization; Optimization algorithm; Optimization problem;
D O I
10.7717/PEERJ-CS.910
中图分类号
学科分类号
摘要
In this paper, a novel evolutionary-based method, called Average and Subtraction-Based Optimizer (ASBO), is presented to attain suitable quasi-optimal solutions for various optimization problems. The core idea in the design of the ASBO is to use the average information and the subtraction of the best and worst population members for guiding the algorithm population in the problem search space. The proposed ASBO is mathematically modeled with the ability to solve optimization problems. Twenty-three test functions, including unimodal and multimodal functions, have been employed to evaluate ASBO’s performance in effectively solving optimization problems. The optimization results of the unimodal functions, which have only one main peak, show the high ASBO’s exploitation power in converging towards global optima. In addition, the optimization results of the high-dimensional multimodal functions and fixed-dimensional multimodal functions, which have several peaks and local optima, indicate the high exploration power of ASBO in accurately searching the problem-solving space and not getting stuck in nonoptimal peaks. The simulation results show the proper balance between exploration and exploitation in ASBO in order to discover and present the optimal solution. In addition, the results obtained from the implementation of ASBO in optimizing these objective functions are analyzed compared with the results of nine well-known metaheuristic algorithms. Analysis of the optimization results obtained from ASBO against the performance of the nine compared algorithms indicates the superiority and competitiveness of the proposed algorithm in providing more appropriate solutions. © Copyright 2022 Dehghani et al.
引用
收藏
相关论文
共 54 条
  • [21] Dhiman G, Garg M, Nagar A, Kumar V, Dehghani M., A novel algorithm for global optimization: rat swarm optimizer, Journal of Ambient Intelligence and Humanized Computing, 12, pp. 8457-8482, (2020)
  • [22] Dhiman G, Kumar V., Spotted hyena optimizer: a novel bio-inspired based metaheuristic technique for engineering applications, Advances in Engineering Software, 114, 10, pp. 48-70, (2017)
  • [23] Dorigo M, Maniezzo V, Colorni A., Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 26, 1, pp. 29-41, (1996)
  • [24] Doumari SA, Givi H, Dehghani M, Malik OP., Ring toss game-based optimization algorithm for solving various optimization problems, International Journal of Intelligent Engineering and Systems, 14, 3, pp. 545-554, (2021)
  • [25] Doumari SA, Givi H, Dehghani M, Montazeri Z, Leiva V, Guerrero JM., A new two-stage algorithm for solving optimization problems, Entropy, 23, 4, (2021)
  • [26] Faramarzi A, Afshar M., A novel hybrid cellular automata-linear programming approach for the optimal sizing of planar truss structures, Civil Engineering and Environmental Systems, 31, 3, pp. 209-228, (2014)
  • [27] Faramarzi A, Heidarinejad M, Mirjalili S, Gandomi AH., Marine predators algorithm: a nature-inspired metaheuristic, Expert Systems with Applications, 152, 4, (2020)
  • [28] Fogel LJ, Owens AJ, Walsh MJ., Artificial intelligence through simulated evolution, (1966)
  • [29] Goldberg DE, Holland JH., Genetic algorithms and machine learning, Machine Learning, 3, 2, pp. 95-99, (1988)
  • [30] Han X, Dong Y, Yue L, Xu Q, Xie G, Xu X., State-transition simulated annealing algorithm for constrained and unconstrained multi-objective optimization problems, Applied Intelligence, 51, 2, pp. 775-787, (2021)