Self-adaptive PID controller of microwave drying rotary device tuning on-line by genetic algorithms

The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.

Unfolding neutron spectra from water-pumping-injection multilayered concentric sphere neutron spectrometer using self-adaptive differential evolution algorithm

A self-adaptive differential evolution neutron spectrum unfolding algorithm(SDENUA)is established in this study to unfold the neutron spectra obtained from a water-pumping-injection multilayered concentric sphere neutron spectrometer(WMNS).Specifically,the neutron fluence bounds are estimated to accelerate the algorithm convergence,and the minimum error between the optimal solution and input neutron counts with relative uncertainties is limited to 10^(-6)to avoid unnecessary calculations.Furthermore,the crossover probability and scaling factor are self-adaptively controlled.FLUKA Monte Carlo is used to simulate the readings of the WMNS under(1)a spectrum of Cf-252 and(2)its spectrum after being moderated,(3)a spectrum used for boron neutron capture therapy,and(4)a reactor spectrum.Subsequently,the measured neutron counts are unfolded using the SDENUA.The uncertainties of the measured neutron count and the response matrix are considered in the SDENUA,which does not require complex parameter tuning or an a priori default spectrum.The results indicate that the solutions of the SDENUA agree better with the IAEA spectra than those of MAXED and GRAVEL in UMG 3.1,and the errors of the final results calculated using the SDENUA are less than 12%.The established SDENUA can be used to unfold spectra from the WMNS.

Enhanced self-adaptive evolutionary algorithm for numerical optimization

There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.

Dynamic self-adaptive ANP algorithm and its application to electric field simulation of aluminum reduction cell

Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index of RP method for the three-dimensional finite element model(FEM) has been given.By taking the electric field of aluminum reduction cell(ARC) as the research object,the performance of two classical RP methods,which are Al-NASRA and NGUYEN partition(ANP) algorithm and the multi-level partition(MLP) method,has been analyzed and compared.The comparison results indicate a sound performance of ANP algorithm,but to large-scale models,the computing time of ANP algorithm increases notably.This is because the ANP algorithm determines only one node based on the minimum weight and just adds the elements connected to the node into the sub-region during each iteration.To obtain the satisfied speed and the precision,an improved dynamic self-adaptive ANP(DSA-ANP) algorithm has been proposed.With consideration of model scale,complexity and sub-RP stage,the improved algorithm adaptively determines the number of nodes and selects those nodes with small enough weight,and then dynamically adds these connected elements.The proposed algorithm has been applied to the finite element analysis(FEA) of the electric field simulation of ARC.Compared with the traditional ANP algorithm,the computational efficiency of the proposed algorithm has been shortened approximately from 260 s to 13 s.This proves the superiority of the improved algorithm on computing time performance.

Generalized Self-Adaptive Genetic Algorithms

In order to solve the problem between searching performance and convergence of genetic algorithms, a fast genetic algorithm generalized self-adaptive genetic algorithm (GSAGA) is presented. (1) Evenly distributed initial population is generated. (2) Superior individuals are not broken because of crossover and mutation operation for they are sent to subgeneration directly. (3) High quality im- migrants are introduced according to the condition of the population schema. (4) Crossover and mutation are operated on self-adaptation. Therefore, GSAGA solves the coordination problem between convergence and searching performance. In GSAGA, the searching per- formance and global convergence are greatly improved compared with many existing genetic algorithms. Through simulation, the val- idity of this modified genetic algorithm is proved.

Differential Evolution Algorithm Based Self-adaptive Control Strategy for Fed-batch Cultivation of Yeast

In the fed-batch cultivation of Saccharomyces cerevisiae,excessive glucose addition leads to increased ethanol accumulation,which will reduce the efficiency of glucose utilization and inhibit product synthesis.Insufficient glucose addition limits cell growth.To properly regulate glucose feed,a different evolution algorithm based on self-adaptive control strategy was proposed,consisting of three modules(PID,system identification and parameter optimization).Performance of the proposed and conventional PID controllers was validated and compared in simulated and experimental cultivations.In the simulation,cultivation with the self-adaptive control strategy had a more stable glucose feed rate and concentration,more stable ethanol concentration around the set-point(1.0 g·L^(-1)),and final biomass concentration of 34.5 g-DCW·L^(-1),29.2%higher than that with a conventional PID control strategy.In the experiment,the cultivation with the self-adaptive control strategy also had more stable glucose and ethanol concentrations,as well as a final biomass concentration that was 37.4%higher than that using the conventional strategy.

Particle Swarm Optimization Algorithm Based on Chaotic Sequences and Dynamic Self-Adaptive Strategy

To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.

Self-Adaptive Algorithms for the Split Common Fixed Point Problem of the Demimetric Mappings

The split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed-point set. In this paper, we present new iterative algorithms for solving the split common fixed point problem of demimetric mappings in Hilbert spaces. Moreover, our algorithm does not need any prior information of the operator norm. Weak and strong convergence theorems are given under some mild assumptions. The results in this paper are the extension and improvement of the recent results in the literature.

Fast Fading Channel Neural Equalization Using Levenberg-Marquardt Training Algorithm and Pulse Shaping Filters

Artificial Neural Network (ANN) equalizers have been successfully applied to mitigate Inter symbolic Interference (ISI) due to distortions introduced by linear or nonlinear communication channels. The ANN architecture is chosen according to the type of ISI produced by fixed, fast or slow fading channels. In this work, we propose a combination of two techniques in order to minimize ISI yield by fast fading channels, i.e., pulse shape filtering and ANN equalizer. Levenberg-Marquardt algorithm is used to update the synaptic weights of an ANN comprise only by two recurrent perceptrons. The proposed system outperformed more complex structures such as those based on Kalman filtering approach.

Design Optimization of Permanent Magnet Eddy Current Coupler Based on an Intelligence Algorithm

The permanent magnet eddy current coupler(PMEC)solves the problem of flexible connection and speed regulation between the motor and the load and is widely used in electrical transmission systems.It provides torque to the load and generates heat and losses,reducing its energy transfer efficiency.This issue has become an obstacle for PMEC to develop toward a higher power.This paper aims to improve the overall performance of PMEC through multi-objective optimization methods.Firstly,a PMEC modeling method based on the Levenberg-Marquardt back propagation(LMBP)neural network is proposed,aiming at the characteristics of the complex input-output relationship and the strong nonlinearity of PMEC.Then,a novel competition mechanism-based multi-objective particle swarm optimization algorithm(NCMOPSO)is proposed to find the optimal structural parameters of PMEC.Chaotic search and mutation strategies are used to improve the original algorithm,which improves the shortcomings of multi-objective particle swarm optimization(MOPSO),which is too fast to converge into a global optimum,and balances the convergence and diversity of the algorithm.In order to verify the superiority and applicability of the proposed algorithm,it is compared with several popular multi-objective optimization algorithms.Applying them to the optimization model of PMEC,the results show that the proposed algorithm has better comprehensive performance.Finally,a finite element simulation model is established using the optimal structural parameters obtained by the proposed algorithm to verify the optimization results.Compared with the prototype,the optimized PMEC has reduced eddy current losses by 1.7812 kW,increased output torque by 658.5 N·m,and decreased costs by 13%,improving energy transfer efficiency.

Multi-objective microgrid optimal dispatching based on improved bird swarm algorithm

Multi-objective optimal dispatching schemes with intelligent algorithms are recognized as effective measures to promote the economics and environmental friendliness of microgrid applications.However,the low accuracy and poor convergence of these algorithms have been challenging for system operators.The bird swarm algorithm(BSA),a new bio-heuristic cluster intelligent algorithm,can potentially address these challenges;however,its computational iterative process may fall into a local optimum and result in premature convergence when optimizing small portions of multi-extremum functions.To analyze the impact of a multi-objective economic-environmental dispatching of a microgrid and overcome the aforementioned problems of the BSA,a self-adaptive levy flight strategy-based BSA(LF-BSA)was proposed.It can solve the dispatching problems of microgrid and enhance its dispatching convergence accuracy,stability,and speed,thereby improving its optimization performance.Six typical test functions were used to compare the LF-BSA with three commonly accepted algorithms to verify its excellence.Finally,a typical summer-time daily microgrid scenario under grid-connected operational conditions was simulated.The results proved the feasibility of the proposed LF-BSA,effectiveness of the multi-objective optimization,and necessity of using renewable energy and energy storage in microgrid dispatching optimization.

Capability Analysis of Chaotic Mutation and Its Self-Adaption

Through studying several kinds of chaotic mappings' distributions of orbital points, we analyze the capabilityof the chaotic mutations based on these mappings. Nunerical experiments support our conclusions very well. Thecapability analysis also led to a self-adaptive mechanism of chaotic mutation. The introducing of the self-adaptivechaotic mutation can improve the performance of genetic algorithm very prominently.

Self-adaptive Green-Ampt infiltration parameters obtained from measured moisture processes

The Green-Ampt(G-A) infiltration model(i.e., the G-A model) is often used to characterize the infiltration process in hydrology. The parameters of the G-A model are critical in applications for the prediction of infiltration and associated rainfall-runoff processes. Previous approaches to determining the G-A parameters have depended on pedotransfer functions(PTFs) or estimates from experimental results, usually without providing optimum values. In this study, rainfall simulators with soil moisture measurements were used to generate rainfall in various experimental plots. Observed runoff data and soil moisture dynamic data were jointly used to yield the infiltration processes, and an improved self-adaptive method was used to optimize the G-A parameters for various types of soil under different rainfall conditions. The two G-A parameters, i.e., the effective hydraulic conductivity and the effective capillary drive at the wetting front, were determined simultaneously to describe the relationships between rainfall, runoff, and infiltration processes. Through a designed experiment, the method for determining the GA parameters was proved to be reliable in reflecting the effects of pedologic background in G-A type infiltration cases and deriving the optimum G-A parameters. Unlike PTF methods, this approach estimates the G-A parameters directly from infiltration curves obtained from rainfall simulation experiments so that it can be used to determine site-specific parameters. This study provides a self-adaptive method of optimizing the G-A parameters through designed field experiments. The parameters derived from field-measured rainfall-infiltration processes are more reliable and applicable to hydrological models.

The implementation of Automatic Adaptive Equalizer Based on LMS Algorithm

In this paper,the inter-symbol interference and eliminating method are introduced.After analyzing the principle of adaptive equalization,we designed an adaptive equalizer using the LMS algorithm,and constructed a simulation system using MATLAB.Then we analyzed the convergence speed and mean square error characteristic of the adaptive equalizer by changing the step length factor to test the performance of the algorithm.

Multi-Objective Bacterial Foraging Optimization Algorithm Based on Effective Area in Cognitive Emergency Communication Networks

Cognitive emergency communication net-works can meet the requirements of large capac-ity,high density and low delay in emergency com-munications.This paper analyzes the properties of emergency users in cognitive emergency communi-cation networks,designs a multi-objective optimiza-tion and proposes a novel multi-objective bacterial foraging optimization algorithm based on effective area(MOBFO-EA)to maximize the transmission rate while maximizing the lifecycle of the network.In the algorithm,the effective area is proposed to prevent the algorithm from falling into a local optimum,and the diversity and uniformity of the Pareto-optimal solu-tions distributed in the effective area are used to eval-uate the optimization algorithm.Then,the dynamic preservation is used to enhance the competitiveness of excellent individuals and the uniformity and diversity of the Pareto-optimal solutions in the effective area.Finally,the adaptive step size,adaptive moving direc-tion and inertial weight are used to shorten the search time of bacteria and accelerate the optimization con-vergence.The simulation results show that the pro-posed MOBFO-EA algorithm improves the efficiency of the Pareto-optimal solutions by approximately 55%compared with the MOPSO algorithm and by approx-imately 60%compared with the MOBFO algorithm and has the fastest and smoothest convergence.

Fuzzy optimization neural network model based on LM algorithm

A new fuzzy optimization neural network model is proposed based on the Levenberg-Marquardt (LM) algorithm on account of the disadvantages of slow convergence of traditional fuzzy optimization neural network model. In this new model,the gradient descent algorithm is replaced by the LM algorithm to obtain the minimum of output errors during network training,which changes the weights adjusting equations of the network and increases the training speed. Moreover,to avoid the results yielding to local minimum,the transfer function is also revised to sigmoid function. A case study is utilized to validate this new model,and the results reveal that the new model fast training speed and better forecasting capability.

A Hybrid Differential Evolution Algorithm Integrated with Particle Swarm Optimization

To implement self-adaptive control parameters,a hybrid differential evolution algorithm integrated with particle swarm optimization( PSODE) is proposed. In the PSODE, control parameters are encoded to be a symbiotic individual of original individual,and each original individual has its own symbiotic individual. Differential evolution( DE) operators are used to evolve the original population. And,particle swarm optimization( PSO) is applied to co-evolving the symbiotic population. Thus,with the evolution of the original population in PSODE, the symbiotic population is dynamically and self-adaptively adjusted and the realtime optimum control parameters are obtained. The proposed algorithm is compared with some DE variants on nine functions. The results show that the average performance of PSODE is the best.

An Algorithm for Cavity Reconstruction in Electrical Impedance Tomography

We consider the inverse problem of finding cavities within some object from electrostatic measurements on the boundary. By a cavity we understand any object with a different electrical conductivity from the background material of the body. We give an algorithm for solving this inverse problem based on the output nonlinear least-square formulation and the regularized Newton-type iteration. In particular, we present a number of numerical results to highlight the potential and the limitations of this method.

Covariance Matrix Learning Differential Evolution Algorithm Based on Correlation

Differential evolution algorithm based on the covariance matrix learning can adjust the coordinate system according to the characteristics of the population, which makes the search move in a more favorable direction. In order to obtain more accurate information about the function shape, this paper proposes covariance matrix learning differential evolution algorithm based on correlation (denoted as RCLDE) to improve the search efficiency of the algorithm. First, a hybrid mutation strategy is designed to balance the diversity and convergence of the population;secondly, the covariance learning matrix is constructed by selecting the individual with the less correlation;then, a comprehensive learning mechanism is comprehensively designed by two covariance matrix learning mechanisms based on the principle of probability. Finally, the algorithm is tested on the CEC2005, and the experimental results are compared with other effective differential evolution algorithms. The experimental results show that the algorithm proposed in this paper is an effective algorithm.

A self-adaptive stochastic resonance system design and study in chaotic interference

The us of stochastic resonance （SR） can effectively achieve the detection of weak signal in white noise and colored noise. However, SR in chaotic interference is seldom involved. In view of the requirements for the detection of weak signal in the actual project and the relationship between the signal, chaotic interference, and nonlinear system in the bistable system, a self-adaptive SR system based on genetic algorithm is designed in this paper. It regards the output signal-to-noise ratio （SNR） as a fitness function and the system parameters are jointly encoded to gain optimal bistable system parameters, then the input signal is processed in the SR system with the optimal system parameters. Experimental results show that the system can keep the best state of SR under the condition of low input SNR, which ensures the effective detection and process of weak signal in low input SNR.