Enhanced Beetle Antennae Algorithm for Chemical Dynamic Optimization Problems’ Non-Fixed Points Discrete Solution

Abstract

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.