DNA computing based RNA genetic algorithm with applications in parameter estimation of chemical engineering processes

Gray wolf optimizer with bubble-net predation for modeling fluidized catalytic cracking unit main fractionator

Fluidized catalytic cracking unit (FCCU) main fractionator is a complex system with multivariable, nonlinear and uncertainty. Its modeling is a hard nut to crack. Ordinary modeling methods are difficult to estimate its dynamic characteristics accurately. In this work, the gray wolf optimizer with bubble-net predation (GWO_BP) is proposed for solving this complex optimization problem. GWO_BP can effectively balance the detectability and exploitability to find the optimal value faster, and improve the accuracy. The head wolf has the best fitness value in GWO. GWO_BP uses the spiral bubble predation method of whale to replace the surrounding hunting scheme of the head wolf, which enhances the global search ability and speeds up the convergence speed. And Lévy flight is applied to improve the wolf search strategy to update the positions of wolfpack for overcoming the disadvantage of easily falling into local optimum. The experiments of the basic GWO, the particle swarm optimization (PSO) and the GWO_BP are carried out with 12 typical test functions. The experimental results show that GWO_BP has the best optimization accuracy. Then, the GWO_BP is used to solve the parameter estimation problem of FCCU main fractionator model. The simulation results show that the FCCU main fractionator model established by the proposed modeling method can accurately reflect the dynamic characteristics of the real world.

Automatic Density Peaks Clustering Using DNA Genetic Algorithm Optimized Data Field and Gaussian Process

Clustering by fast search and finding of Density Peaks (called as DPC) introduced by Alex Rodríguez and Alessandro Laio attracted much attention in the field of pattern recognition and artificial intelligence. However, DPC still has a lot of defects that are not resolved. Firstly, the local density [Formula: see text] of point [Formula: see text] is affected by the cutoff distance [Formula: see text], which can influence the clustering result, especially for small real-world cases. Secondly, the number of clusters is still found intuitively by using the decision diagram to select the cluster centers. In order to overcome these defects, this paper proposes an automatic density peaks clustering approach using DNA genetic algorithm optimized data field and Gaussian process (referred to as ADPC-DNAGA). ADPC-DNAGA can extract the optimal value of threshold with the potential entropy of data field and automatically determine the cluster centers by Gaussian method. For any data set to be clustered, the threshold can be calculated from the data set objectively rather than the empirical estimation. The proposed clustering algorithm is benchmarked on publicly available synthetic and real-world datasets which are commonly used for testing the performance of clustering algorithms. The clustering results are compared not only with that of DPC but also with that of several well-known clustering algorithms such as Affinity Propagation, DBSCAN and Spectral Cluster. The experimental results demonstrate that our proposed clustering algorithm can find the optimal cutoff distance [Formula: see text], to automatically identify clusters, regardless of their shape and dimension of the embedded space, and can often outperform the comparisons.