Solving chemical dynamic optimization problems with ranking-based differential evolution algorithms

Dynamic optimization problems(DOPs) described by differential equations are often encountered in chemical engineering. Deterministic techniques based on mathematic programming become invalid when the models are non-differentiable or explicit mathematical descriptions do not exist. Recently, evolutionary algorithms are gaining popularity for DOPs as they can be used as robust alternatives when the deterministic techniques are invalid. In this article, a technology named ranking-based mutation operator(RMO) is presented to enhance the previous differential evolution(DE) algorithms to solve DOPs using control vector parameterization. In the RMO, better individuals have higher probabilities to produce offspring, which is helpful for the performance enhancement of DE algorithms. Three DE-RMO algorithms are designed by incorporating the RMO. The three DE-RMO algorithms and their three original DE algorithms are applied to solve four constrained DOPs from the literature. Our simulation results indicate that DE-RMO algorithms exhibit better performance than previous non-ranking DE algorithms and other four evolutionary algorithms.

Harris Hawks Algorithm Incorporating Tuna Swarm Algorithm and Differential Variance Strategy

Because of the low convergence accuracy of the basic Harris Hawks algorithm,which quickly falls into the local optimal,a Harris Hawks algorithm combining tuna swarm algorithm and differential mutation strategy(TDHHO)is proposed.The escape energy factor of nonlinear periodic energy decline balances the ability of global exploration and regional development.The parabolic foraging approach of the tuna swarm algorithm is introduced to enhance the global exploration ability of the algorithm and accelerate the convergence speed.The difference variation strategy is used to mutate the individual position and calculate the fitness,and the fitness of the original individual position is compared.The greedy technique is used to select the one with better fitness of the objective function,which increases the diversity of the population and improves the possibility of the algorithm jumping out of the local extreme value.The test function tests the TDHHO algorithm,and compared with other optimization algorithms,the experimental results show that the convergence speed and optimization accuracy of the improved Harris Hawks are improved.Finally,the enhanced Harris Hawks algorithm is applied to engineering optimization and wireless sensor networks(WSN)coverage optimization problems,and the feasibility of the TDHHO algorithm in practical application is further verified.

Comparison of diagnostic value of TIRADS,BSRTC,BRAF^(V600E) mutation detection and their combined use in differentiating thyroid nodules

Objective To compare the diagnostic efficiency of the thyroid imaging reporting and data system(TIRADS),the Bethesda system for reporting thyroid cytopathology(BSRTC)and BRAFV600Edetection,and their combined use in the differentiation between benign and malignant thyroid nodules.Methods One hundred

A Discrete Bat Algorithm for Disassembly Sequence Planning

Based on the bat algorithm(BA), this paper proposes a discrete BA(DBA) approach to optimize the disassembly sequence planning(DSP) problem, for the purpose of obtaining an optimum disassembly sequence(ODS) of a product with a high degree of automation and guiding maintenance operation. The BA for solving continuous problems is introduced, and combining with mathematical formulations, the BA is reformed to be the DBA for DSP problems. The fitness function model(FFM) is built to evaluate the quality of disassembly sequences. The optimization performance of the DBA is tested and verified by an application case, and the DBA is compared with the genetic algorithm(GA), particle swarm optimization(PSO) algorithm and differential mutation BA(DMBA). Numerical experiments show that the proposed DBA has a better optimization capability and provides more accurate solutions than the other three algorithms.