An efficient multi-objective artificial raindrop algorithm and its application to dynamic optimization problems in chemical processes

An Adaptive Sand Cat Swarm Algorithm Based on Cauchy Mutation and Optimal Neighborhood Disturbance Strategy

Sand cat swarm optimization algorithm (SCSO) keeps a potent and straightforward meta-heuristic algorithm derived from the distant sense of hearing of sand cats, which shows excellent performance in some large-scale optimization problems. However, the SCSO still has several disadvantages, including sluggish convergence, lower convergence precision, and the tendency to be trapped in the topical optimum. To escape these demerits, an adaptive sand cat swarm optimization algorithm based on Cauchy mutation and optimal neighborhood disturbance strategy (COSCSO) are provided in this study. First and foremost, the introduction of a nonlinear adaptive parameter in favor of scaling up the global search helps to retrieve the global optimum from a colossal search space, preventing it from being caught in a topical optimum. Secondly, the Cauchy mutation operator perturbs the search step, accelerating the convergence speed and improving the search efficiency. Finally, the optimal neighborhood disturbance strategy diversifies the population, broadens the search space, and enhances exploitation. To reveal the performance of COSCSO, it was compared with alternative algorithms in the CEC2017 and CEC2020 competition suites. Furthermore, COSCSO is further deployed to solve six engineering optimization problems. The experimental results reveal that the COSCSO is strongly competitive and capable of being deployed to solve some practical problems.

Improved seagull optimization algorithm combined with random division method to solve dynamic optimization problems

The numerical solution of dynamic optimization problem is often sought for chemical processes, but the discretization of control variables is a difficult problem. Therefore, we propose improved seagull optimization algorithm (ISOA) combined with random division method to solve dynamic optimization problems. 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, this paper uses the 14 benchmark test functions to verify ISOA. Finally, the improved seagull optimization algorithm is combined with the random division method to solve two chemical dynamic optimization problems. The experimental results show that ISOA algorithm has better performance in function optimization.

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

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.

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

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.

Product form evolutionary design system construction based on neural network model and multi-objective optimization

The product form evolutionary design based on multi-objective optimization can satisfy the complex emotional needs of consumers for product form, but most relevant literatures mainly focus on single-objective optimization or convert multiple-objective optimization into the single objective by weighting method. In order to explore the optimal product form design, we propose a hybrid product form design method based on back propagation neural networks (BP-NN) and non-dominated sorting genetic algorithm-II (NSGA-II) algorithms from the perspective of multi-objective optimization. First, the product form is deconstructed and encoded by morphological analysis method, and then the semantic difference method is used to enable consumers to evaluate product samples under a series of perceptual image vocabularies. Then, the nonlinear complex functional relation between the consumers’ perceptual image and the morphological elements is fitted with the BP-NN. Finally, the trained BP-NN is embedded into the NSGA-II multi-objective evolutionary algorithm to derive the Pareto optimal solution. Based on the hybrid BP-NN and NSGA-II algorithms, a multi-objective optimization based product form evolutionary design system is developed with the electric motorcycle as a case. The system is proved to be feasible and effective, providing theoretical reference and method guidance for the multi-image product form design.