Dynamic Optimization of Chemical Processes Based on Modified Sailfish Optimizer Combined with an Equal Division Method

Processes ◽  
2021 ◽  
Vol 9 (10) ◽  
pp. 1806
Author(s):  
Yuedong Zhang ◽  
Yuanbin Mo

The optimal solution of the chemical dynamic optimization problem is the basis of automatic control operation in the chemical process, which can reduce energy consumption, increase production efficiency, and maximize economic benefit. In this paper, a modified sailfish optimizer (MSFO) combined with an equal division method is proposed for solving chemical dynamic optimization problems. Based on the basic sailfish optimizer, firstly, the tent chaotic mapping strategy is introduced to disturb the initialization of sailfish and sardine populations to avoid the loss of population diversity. Secondly, an adaptive linear reduction strategy of attack parameters is proposed to enhance the exploration and exploitation ability of sailfish. Thirdly, the updating formula of sardine position is modified, and the global optimal solution is used to attract all sardine positions, which can avoid the premature phenomenon of the algorithm. Eventually, the MSFO is applied to solve six classical optimization cases of chemical engineering to evaluate its feasibility. The experimental results are analyzed and compared with other optimization methods to prove the superiority of the MSFO in solving chemical dynamic optimization problems.

Author(s):  
Al-khafaji Amen

<span lang="EN-US">Maintaining population diversity is the most notable challenge in solving dynamic optimization problems (DOPs). Therefore, the objective of an efficient dynamic optimization algorithm is to track the optimum in these uncertain environments, and to locate the best solution. In this work, we propose a framework that is based on multi operators embedded in genetic algorithms (GA) and these operators are heuristic and arithmetic crossovers operators. The rationale behind this is to address the convergence problem and to maintain the diversity. The performance of the proposed framework is tested on the well-known dynamic optimization functions i.e., OneMax, Plateau, Royal Road and Deceptive. Empirical results show the superiority of the proposed algorithm when compared to state-of-the-art algorithms from the literature.</span>


2013 ◽  
Vol 333-335 ◽  
pp. 1379-1383
Author(s):  
Yan Wu ◽  
Xiao Xiong Liu

In dynamic environments, it is difficult to track a changing optimal solution over time. Over the years, many approaches have been proposed to solve the problem with genetic algorithms. In this paper a new space-based immigrant scheme for genetic algorithms is proposed to solve dynamic optimization problems. In this scheme, the search space is divided into two subspaces using the elite of the previous generation and the range of variables. Then the immigrants are generated from both the subspaces and inserted into current population. The main idea of the approach is to increase the diversity more evenly and dispersed. Finally an experimental study on dynamic sphere function was carried out to compare the performance of several genetic algorithms. The experimental results show that the proposed algorithm is effective for the function with moving optimum and can adapt the dynamic environments rapidly.


Processes ◽  
2021 ◽  
Vol 9 (6) ◽  
pp. 1037
Author(s):  
Le Xu ◽  
Yuanbin Mo ◽  
Yanyue Lu ◽  
Jiang Li

The numerical solution of the dynamic optimization problem is often sought for chemical processes, but the discretization of control variables is a difficult problem. Firstly, based on the analysis of the seagull optimization algorithm, this paper introduces the cognitive part in the process of a seagull’s attack behavior to make the group approach the best position. Secondly, the algorithm adds the mechanism of natural selection, where the fitness value is used to sort the population, and the best half is used to replace the worst half, so as to find out the optimal solution. Finally, the improved seagull optimization algorithm (ISOA) is combined with the unequal division method to solve dynamic optimization problems. The feasibility of the method is verified by three practical examples of dynamic optimization in chemical industry.


Processes ◽  
2022 ◽  
Vol 10 (1) ◽  
pp. 148
Author(s):  
Yucheng Lyu ◽  
Yuanbin Mo ◽  
Yanyue Lu ◽  
Rui Liu

Dynamic optimization is an important research topic in chemical process control. A dynamic optimization method with good performance can reduce energy consumption and prompt production efficiency. However, the method of solving the problem is complicated in the establishment of the model, and the process of solving the optimal value has a certain degree of difficulty. Based on this, we proposed a non-fixed points discrete method of an enhanced beetle antennae optimization algorithm (EBSO) to solve this kind of problem. Firstly, we converted individual beetles into groups of beetles to search for the best and increase the diversity of the population. Secondly, we introduced a balanced direction strategy, which explored extreme values in new directions before the beetles updated their positions. Finally, a spiral flight mechanism was introduced to change the situation of the beetles flying straight toward the tentacles to prevent the traditional algorithm from easily falling into a certain local range and not being able to jump out. We applied the enhanced algorithm to four classic chemical problems. Meanwhile, we changed the equal time division method or unequal time division method commonly used to solve chemical dynamic optimization problems, and proposed a new interval distribution method—the non-fixed points discrete method, which can more accurately represent the optimal control trajectory. The comparison and analysis of the simulation test results with other algorithms for solving chemical dynamic optimization problems show that the EBSO algorithm has good performance to a certain extent, which further proves the effectiveness of the EBSO algorithm and has a better optimization ability.


2014 ◽  
Vol 22 (4) ◽  
pp. 559-594 ◽  
Author(s):  
Changhe Li ◽  
Shengxiang Yang ◽  
Ming Yang

The multipopulation method has been widely used to solve dynamic optimization problems (DOPs) with the aim of maintaining multiple populations on different peaks to locate and track multiple changing optima simultaneously. However, to make this approach effective for solving DOPs, two challenging issues need to be addressed. They are how to adapt the number of populations to changes and how to adaptively maintain the population diversity in a situation where changes are complicated or hard to detect or predict. Tracking the changing global optimum in dynamic environments is difficult because we cannot know when and where changes occur and what the characteristics of changes would be. Therefore, it is necessary to take these challenging issues into account in designing such adaptive algorithms. To address the issues when multipopulation methods are applied for solving DOPs, this paper proposes an adaptive multi-swarm algorithm, where the populations are enabled to be adaptive in dynamic environments without change detection. An experimental study is conducted based on the moving peaks problem to investigate the behavior of the proposed method. The performance of the proposed algorithm is also compared with a set of algorithms that are based on multipopulation methods from different research areas in the literature of evolutionary computation.


2012 ◽  
Vol 12 (10) ◽  
pp. 3176-3192 ◽  
Author(s):  
Ignacio G. del Amo ◽  
David A. Pelta ◽  
Juan R. González ◽  
Antonio D. Masegosa

Sign in / Sign up

Export Citation Format

Share Document