An optimized rail crack detection algorithm based on population status

Author(s):  
Jiao Zhao ◽  
Ruipeng Gao ◽  
Yuxiang Yang ◽  
Bing Wang

To improve efficiency and accuracy of wavelet packet decomposition method modified by simple genetic algorithm (SGA), a novel genetic algorithm, which is based on variance of population and population entropy, is proposed. And then wavelet packet decomposition method is optimized by this algorithm to detect rail cracks. In the optimized method, internal state of population and population diversity are linked up with evolutionary operations to adjust crossover-mutation operators of genetic algorithm. Further, a mathematical model describing fault signal is established, and its parameters are optimized to effectively extract information. The proposed algorithm was tested by test functions and simulated fault signals of rail cracks. The results about simulated fault signals show that convergence probability of proposed algorithm — at best — is 45% higher than that of SGA and 28% higher than that of improved adaptive genetic algorithm (IAGA), and accuracy of crack fault detection reaches above 92%. Meanwhile, the proposed algorithm isn’t prone to stagnation and has fast convergence speed and high accuracy of fault detection. This research not only improves performance of SGA, but also provides a new detection method for fault diagnosis of wheel-rail noise.

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Lina He ◽  
Chuan Jiang

The stochastic resonance system has the advantage of making the noise energy transfer to the signal energy. Because the existing stochastic resonance system model has the problem of poor performance, an asymmetric piecewise linear stochastic resonance system model is proposed, and the parameters of the model are optimized by a genetic algorithm. The signal-to-noise ratio formula of the model is derived and analyzed, and the theoretical basis for better performance of the model is given. The influence of the asymmetric coefficient on system performance is studied, which provides guidance for the selection of initial optimization range when a genetic algorithm is used. At the same time, the formula is verified and analyzed by numerical simulation, and the correctness of the formula is proved. Finally, the model is applied to bearing fault detection, and an adaptive genetic algorithm is used to optimize the parameters of the system. The results show that the model has an excellent detection effect, which proves that the model has great potential in fault detection.


2013 ◽  
Vol 753-755 ◽  
pp. 2925-2929
Author(s):  
Xiao Chun Zhu ◽  
Jian Feng Zhao ◽  
Mu Lan Wang

This paper studies the scheduling problem of Hybrid Flow Shop (HFS) under the objective of minimizing makespan. The corresponding scheduling simulation system is developed in details, which employed a new encoding method so as to guarantee the validity of chromosomes and the convenience of calculation. The corresponding crossover and mutation operators are proposed for optimum sequencing. The simulation results show that the adaptive Genetic Algorithm (GA) is an effective and efficient method for solving HFS Problems.


2012 ◽  
Vol 591-593 ◽  
pp. 123-126
Author(s):  
Peng Fei Wang ◽  
Xiu Hui Diao

With taking weight of single main beam of gantry crane as objective function, and taking main beam upper & lower cored, diagonal & horizontal bracing, and width & weight as design variable, this essay adopted population diversity adaptive genetic algorithm to optimize its structure and improved program design through MATLAB. This algorithm could accelerate convergence speed, which make much it easier to realize comprehensive optimal solution, since it effectively avoided weakness of basic genetic algorithm, such as partial optimal solution, prematurity and being lack of continuity, etc.


2014 ◽  
Vol 670-671 ◽  
pp. 1434-1438
Author(s):  
Jian Feng Zhao ◽  
Xiao Chun Zhu ◽  
Bao Sheng Wang

The n-job, k-stage hybrid flow shop problem is one of the general production scheduling problems. Hybrid flow shop (HFS) problems are NP-Hard when the objective is to minimize the makespan .The research deals with the criterion of makespan minimization for the HFS scheduling problems. In this paper we present a new encoding method so as to guarantee the validity of chromosomes and convenience of calculation and corresponding crossover and mutation operators are designed for optimum sequencing. The simulation results show that the Sequence Adaptive Cross Genetic Algorithm (SACGA) is an effective and efficient method for solving HFS Problems.


Sign in / Sign up

Export Citation Format

Share Document