A modified multi-level cross-entropy algorithm for optimization of problems with discrete variables

被引:2
|
作者
Parand, Amirhossein [1 ]
Seraji, Mahmood [1 ]
Dashti, Hadi [1 ]
机构
[1] Islamic Azad Univ, Bushehr Branch, Dept Civil Engn, Bushehr, Iran
关键词
Optimization; Space conversion; Discrete variables; Meta-heuristic algorithm; PARTICLE SWARM OPTIMIZATION; ENGINEERING OPTIMIZATION; DIFFERENTIAL EVOLUTION; GLOBAL OPTIMIZATION; SEARCH ALGORITHM; SIMULATION;
D O I
10.1007/s00366-020-01232-3
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Nowadays, the advancement of technology and the increase in the power of computer processing have enabled using these processors to solve different problems in the shortest possible time. Many scholars throughout the world seek to shorten the time needed to solve various problems. As engineering science has a wide range of problems with different natures, it is impossible to claim whether a particular method can solve all the problems faced. Considering the aim of developing optimization methods, in this study, a new method is used by combining a multi-level cross-entropy optimizer (MCEO) algorithm with sigmoid functions to smooth the space of the problems with discrete variables. It is named modified multi-level cross-entropy optimizer (MMCEO). Four problems including designing vessel, speed reducer, 15-member, and 52-member trusses were considered to examine the effectiveness of the proposed algorithm in dealing with various problems. It is of note that all of these problems have discrete variables and they are defined in very difficult spaces. The results regarding the first two problems (i.e., pressure vessel and speed reducer) indicated the very high accuracy of the proposed method and the improvement of the response (in terms of function calls) and in trusses designing. Moreover, they suggested its higher speed compared to the best algorithms in designing the stated structures.
引用
收藏
页码:2683 / 2698
页数:16
相关论文
共 50 条
  • [1] A modified multi-level cross-entropy algorithm for optimization of problems with discrete variables
    Amirhossein Parand
    Mahmood Seraji
    Hadi Dashti
    Engineering with Computers, 2022, 38 : 2683 - 2698
  • [2] Multi-level cross entropy optimizer (MCEO): an evolutionary optimization algorithm for engineering problems
    MiarNaeimi, Farid
    Azizyan, Gholamreza
    Rashki, Mohsen
    ENGINEERING WITH COMPUTERS, 2018, 34 (04) : 719 - 739
  • [3] A new hybrid multi-level cross-entropy-based moth-flame optimization algorithm
    Safaeian Hamzehkolaei, Naser
    MiarNaeimi, Farid
    SOFT COMPUTING, 2021, 25 (22) : 14245 - 14279
  • [4] Multi-level cross entropy optimizer (MCEO): an evolutionary optimization algorithm for engineering problems
    Farid MiarNaeimi
    Gholamreza Azizyan
    Mohsen Rashki
    Engineering with Computers, 2018, 34 : 719 - 739
  • [5] Multi-Level Thresholding Image Segmentation Based on Improved Slime Mould Algorithm and Symmetric Cross-Entropy
    Jiang, Yuanyuan
    Zhang, Dong
    Zhu, Wenchang
    Wang, Li
    ENTROPY, 2023, 25 (01)
  • [6] THE CROSS-ENTROPY METHOD FOR COMBINATORIAL OPTIMIZATION PROBLEMS OF SEAPORT LOGISTICS TERMINAL
    Yildiz, Turkay
    Yercan, Funda
    TRANSPORT, 2010, 25 (04) : 411 - 422
  • [7] An Improved Butterfly Optimization Algorithm for Engineering Design Problems Using the Cross-Entropy Method
    Li, Guocheng
    Shuang, Fei
    Zhao, Pan
    Le, Chengyi
    SYMMETRY-BASEL, 2019, 11 (08):
  • [8] An efficient method to minimize cross-entropy for selecting multi-level threshold values using an improved human mental search algorithm
    Esmaeili, Leila
    Mousavirad, Seyed Jalaleddin
    Shahidinejad, Ali
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 182
  • [9] Cross-Entropy Method for Electromagnetic Optimization With Constraints and Mixed Variables
    Kovaleva, Maria
    Bulger, David
    Zeb, Basit Ali
    Esselle, Karu P.
    IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2017, 65 (10) : 5532 - 5540
  • [10] The Cross-Entropy Method for Combinatorial and Continuous Optimization
    Reuven Rubinstein
    Methodology And Computing In Applied Probability, 1999, 1 (2) : 127 - 190