Journal Article10.1007/S00366-020-01232-3
A modified multi-level cross-entropy algorithm for optimization of problems with discrete variables
3
TL;DR: 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 to suggest its higher speed compared to the best algorithms in designing the stated structures.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A novel chaotic Runge Kutta optimization algorithm for solving constrained engineering problems
TL;DR: In this article , a hybrid metaheuristic optimization algorithm named chaotic Runge Kutta optimization (CRUN) was proposed to improve the performance of the base runge kutta optimization algorithm.
References
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
46.9K
Particle Swarm Optimization.
James Kennedy
- 01 Jan 2017
TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
35K
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces
Rainer Storn,Kenneth Price +1 more
TL;DR: In this article, a new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous space functions is presented, which requires few control variables, is robust, easy to use, and lends itself very well to parallel computation.
Particle swarm optimization
TL;DR: A snapshot of particle swarming from the authors’ perspective, including variations in the algorithm, current and ongoing research, applications and open problems, is included.
Grey Wolf Optimizer
TL;DR: The results of the classical engineering design problems and real application prove that the proposed GWO algorithm is applicable to challenging problems with unknown search spaces.
15K