Adaptive genetic algorithm for optimal selection of non-uniform code based on Euclidean distance

2009 ◽  
Author(s):  
Zhang Mingbo ◽  
Luo Feng ◽  
Wu Shunjun
2015 ◽  
Vol 16 (Suppl 18) ◽  
pp. S1 ◽  
Author(s):  
Luke Vandewater ◽  
Vladimir Brusic ◽  
William Wilson ◽  
Lance Macaulay ◽  
Ping Zhang

2011 ◽  
Vol 49 (10) ◽  
pp. 3045-3068 ◽  
Author(s):  
Jitender K. Rai ◽  
Daniel Brand ◽  
Mohammed Slama ◽  
Paul Xirouchakis

2011 ◽  
Vol 328-330 ◽  
pp. 54-57
Author(s):  
Heng Hui Sun ◽  
Min Zhou Luo ◽  
Xiang Dong ◽  
Shi Hong Zha

In this paper, a new optimizing method for the moments of inertia of a mechanical structure was advanced. First, a new optimal model for the moments of inertia was advanced, which only involved with single objective and single variable, in order to reduce the calculating complexity of traditional multi-objective and multi-constrained optimizing model for the moments of inertia; Then, a new strategy for the probability selection of the crossover and mutation operation was improved to form the IAGA. The calculating results proved that, comparing to the Standard Genetic Algorithm (SGA), the IAGA improved in this paper had the advantage of converging faster, more powerfully searching, and less possible of falling into the local optimum. By that, the feasibility of the method advanced in this paper was demonstrated.


Sign in / Sign up

Export Citation Format

Share Document