Notice of Retraction: Adaptive Genetic Algorithm Based on Population Diversity

Author(s):  
Xinping Liu ◽  
Ying Liu
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.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Junxi Zhang ◽  
Shiru Qu

This study is to explore the optimization of the adaptive genetic algorithm (AGA) in the backpropagation (BP) neural network (BPNN), so as to expand the application of the BPNN model in nonlinear issues. Traffic flow prediction is undertaken as a research case to analyse the performance of the optimized BPNN. Firstly, the advantages and disadvantages of the BPNN and genetic algorithm (GA) are analyzed based on their working principles, and the AGA is improved and optimized. Secondly, the optimized AGA is applied to optimize the standard BPNN, and the optimized algorithm is named as OAGA-BPNN. Finally, three different cases are proposed based on the actual scenario of traffic flow prediction to analyse the optimized algorithm on the matrix laboratory (MATLAB) platform by simulation. The results show that the average error distribution of the GA-BPNN algorithm is about 1% with small fluctuation range, better calculation accuracy, and generalization performance in contrast to the BPNN. The average output error of the AGA-BPNN fluctuates around 0 and remains in a relatively stable range as a whole in contrast to that of GA-BPNN; the maximum fitness level keeps increasing during the evolution process but approaches the average value in later process, so the population diversity is hard to be guaranteed. The output error of the OAGA-BPNN fluctuates little compared with that of AGA-BPNN, and its maximum fitness continues to increase in the evolution process with guaranteed population diversity. In short, the OAGA-BPNN algorithm can achieve the best performance in terms of calculation accuracy, generalization performance, and population evolution.


2014 ◽  
Vol 488-489 ◽  
pp. 942-946
Author(s):  
Chun Mei Zhang

In this paper, how to design the layout of transit hub terminals is discussed, and an optimized allocation model about bus lines and bus terminals is established. In order to address the slow convergence of adaptive genetic algorithm, an index that indicates population diversity degree is introduced to adjust the individual crossover and mutation rate. This improved adaptive genetic algorithm is applied for the allocation model and an example is used to validate its efficiency. Results show that it is a promising approach and can improve the convergence speed.


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.


2012 ◽  
Vol 616-618 ◽  
pp. 2210-2213
Author(s):  
Li Jun Chen ◽  
Ran Ran Hai ◽  
Ya Hong Zhang ◽  
Gang Gang Xu

Reactive power optimization is a typical high-dimensional, nonlinear, discontinuous problem. Traditional Genetic algorithm(GA) exists precocious phenomenon and is easy to be trapped in local minima. To overcome this shortcoming, this article will introduce cloud model into Adaptive Genetic Algorithm (AGA), adaptively adjust crossover and mutation probability according to the X-condition cloud generator to use the randomness and stable tendency of droplets in cloud model. The article proposes the cloud adaptive genetic algorithm(CAGA) ,according to the theory, which probability values have both stability and randomness, so, the algorithm have both rapidity and population diversity. Considering minimum network loss as the objective function, make the simulation in standard IEEE 14 node system. The results show that the improved CAGA can achieve a better global optimal solution compared with GA and AGA.


2011 ◽  
Vol 403-408 ◽  
pp. 2598-2601
Author(s):  
Lan Yao ◽  
Yu Lian Jiang ◽  
Jian Xiao

The critical operators for genetic algorithms to avoid premature and improve globe convergence is the adaptive selection of crossover probability and mutation probability. This paper proposed an improved fuzzy adaptive genetic algorithm in which the variance of population and individual fitness value are used to measure the overall population diversity and individual difference, meanwhile, both of them are applied to design fuzzy reference system for adaptively estimation of crossover probability and mutation probability. Simulation results of function optimization show that the new algorithm can converge faster and is more effective at avoiding premature convergence in comparison with standard genetic algorithm.


2011 ◽  
Vol 239-242 ◽  
pp. 2847-2850
Author(s):  
Gui Rong Dong ◽  
Peng Bing Zhao

In order to solve the shortcomings of current engineering methods for parameters adjustment that can only deal with them according to single requirement of system and can not optimize them in the whole range, as well as the standard genetic algorithm is prone to premature convergence, therefore, an improved PID parameters adjustment method based on self-adaptive genetic algorithm was proposed. This approach enables crossover and mutation probability automatically change along with the fitness value, not only can it maintain the population diversity, but also can ensure the convergence of the algorithm. A comparison of the dynamic response between the traditional PID control and the PID control based on self-adaptive genetic algorithm was made. Simulation results show that the latter has much superiority.


Sign in / Sign up

Export Citation Format

Share Document