Intellectualization Methods of Population Algorithms of Global Optimization

Karpenko, Anatoly; Agasiev, T.A.; Sakharov, Maxim

doi:10.1007/978-3-030-32579-4_11

Cited by 4 publications

(6 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Modern approaches to the solution of the problem of multiobjective optimization use preliminary elaboration of an approximation of all or part of the Pareto front of this problem, usually with the help of evolutionary or, more often, genetic algorithms. The most known Pareto approximation algorithms are the algorithm of switching objective functions, VEGA (Vector Evaluated Genetic Algorithm); the algorithm of weighted sums SWO (Sum of Weighted Objectives); the algorithm of non-dominated sorting NDS (nondominated sorting), the SPEA (Strength Pareto Evolutionary Algorithm) and its extension SPEA-2 [26,27], the non-dominated sorting genetic algorithm NSGA, and its extension NSGA-II [9,28] and other algorithms [29,30].…”

Section: The Problem Of Multiobjective Optimal Control Of a Chemical ...mentioning

confidence: 99%

“…The approach provides for avoiding some computational complications and makes the methodology of the solution of a large class of problems easier [26]. One such method is the method of resolving the problem of optimal control to the problem of nonlinear programming [27]. It can be outlined as follows: the interval [0, t*] is covered by a uniform or non-uniform grid with nodes t i , i ∈ [0, N], where N is the number of grid nodes depending on the interval; the optimal control, u*(t), is defined in the class of piecewise constant functions.…”

Section: The Problem Of Multiobjective Optimal Control Of a Chemical ...mentioning

confidence: 99%

See 1 more Smart Citation

Multiobjective Optimization of a Metal Complex Catalytic Reaction Based on a Detailed Kinetic Model with Parallelization of Calculations

2023

View full text Add to dashboard Cite

The solution of the multiobjective optimization problem was performed with the help of the Pareto approximation algorithm. The problem of multiobjective optimization of the reaction process conditions for the olefin hydroalumination catalytic reaction, with the presence of organoaluminum compounds diisobutylaluminiumchloride, diisobutylaluminiumhydrate, and triisobutylaluminum, was solved. The optimality criteria are the yield of the reaction resultants. The largest yield of the high-order organoaluminum compound Bu2AlR was observed for the reactions with diisobutylaluminiumhydrate and triisobutylaluminum. Such results were obtained due to the fact that in the case of diisobutylaluminiumchloride, Bu2AlR was used for the formation of ClBuAlR. The yield of the Schwartz reagent Cp2ZrHCl was higher by a third in the reaction in the presence of diisobutylaluminiumchloride. Unlike the experimental isothermal conditions, the temperature optimal control showed the sufficiency of the gradual growth temperature for achieving the same or higher values of optimality criteria. For computational experiments, the algorithm for solving the multi-criteria optimization problem was parallelized using an island model.

show abstract

Section: The Problem Of Multiobjective Optimal Control Of a Chemical ...mentioning

confidence: 99%

Section: The Problem Of Multiobjective Optimal Control Of a Chemical ...mentioning

confidence: 99%

Multiobjective Optimization of a Metal Complex Catalytic Reaction Based on a Detailed Kinetic Model with Parallelization of Calculations

2023

View full text Add to dashboard Cite

show abstract

“…When developing an optimization algorithm for this class of systems, communication expenses between computing nodes must be minimized. It is possible to achieve this task either with a peculiar optimization algorithm [23,24] or with a specific parallelization technique [22].…”

Section: Introductionmentioning

confidence: 99%

“…We propose a new parallel algorithm based on the mind evolutionary computation (MEC) algorithm [25] to solve an optimal control problem. The classical MEC algorithm appeared to be successful in solving real-world global optimization problems and to be suitable for parallelization [1,4,25], like similar population-based algorithms [24]. The proposed method takes the architecture of the desktop grid into account by minimizing the number of information exchanges between computing nodes and can work both in synchronous and asynchronous modes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Studying the Efficiency of Parallelization in Optimal Control of Multistage Chemical Reactions

et al. 2022

Self Cite

View full text Add to dashboard Cite

In this paper, we investigate the problem of optimal control of complex multistage chemical reactions, which is considered a nonlinear global constrained optimization problem. This class of problems is computationally expensive due to the inclusion of multiple parameters and requires parallel computing systems and algorithms to obtain a solution within a reasonable time. However, the efficiency of parallel algorithms can differ depending on the architecture of the computing system. One available approach to deal with this is the development of specialized optimization algorithms that consider not only problem-specific features but also peculiarities of a computing system in which the algorithms are launched. In this work, we developed a novel parallel population algorithm based on the mind evolutionary computation method. This algorithm is designed for desktop girds and works in synchronous and asynchronous modes. The algorithm and its software implementation were used to solve the problem of the catalytic reforming of gasoline and to study the parallelization efficiency. Results of the numerical experiments are presented in this paper.

show abstract

Modeling of Vibration Separation of Bulk Materials Based on the Theory of Random Processes

Akhmadiev

Gizzyatov

Nazipov

2021

Studies in Systems, Decision and Control

View full text Add to dashboard Cite

Intellectualization Methods of Population Algorithms of Global Optimization

Cited by 4 publications

References 26 publications

Multiobjective Optimization of a Metal Complex Catalytic Reaction Based on a Detailed Kinetic Model with Parallelization of Calculations

Multiobjective Optimization of a Metal Complex Catalytic Reaction Based on a Detailed Kinetic Model with Parallelization of Calculations

Studying the Efficiency of Parallelization in Optimal Control of Multistage Chemical Reactions

Modeling of Vibration Separation of Bulk Materials Based on the Theory of Random Processes

Contact Info

Product

Resources

About