Cooperative coevolutionary genetic algorithm using hierarchical clustering of linkage tree

Author(s):  
Takatoshi Niwa ◽  
Koya Ihara ◽  
Shohei Kato
2012 ◽  
Vol 23 (4) ◽  
pp. 765-775 ◽  
Author(s):  
Quan LIU ◽  
Xiao-Yan WANG ◽  
Qi-Ming FU ◽  
Yong-Gang ZHANG ◽  
Xiao-Fang ZHANG

2014 ◽  
Vol 6 ◽  
pp. 624949 ◽  
Author(s):  
Kittipong Boonlong

Vibration-based damage detection, a nondestructive method, is based on the fact that vibration characteristics such as natural frequencies and mode shapes of structures are changed when the damage happens. This paper presents cooperative coevolutionary genetic algorithm (CCGA), which is capable for an optimization problem with a large number of decision variables, as the optimizer for the vibration-based damage detection in beams. In the CCGA, a minimized objective function is a numerical indicator of differences between vibration characteristics of the actual damage and those of the anticipated damage. The damage detection in a uniform cross-section cantilever beam, a uniform strength cantilever beam, and a uniform cross-section simply supported beam is used as the test problems. Random noise in the vibration characteristics is also considered in the damage detection. In the simulation analysis, the CCGA provides the superior solutions to those that use standard genetic algorithms presented in previous works, although it uses less numbers of the generated solutions in solution search. The simulation results reveal that the CCGA can efficiently identify the occurred damage in beams for all test problems including the damage detection in a beam with a large number of divided elements such as 300 elements.


2018 ◽  
Vol 36 (12) ◽  
pp. 2450-2462 ◽  
Author(s):  
Julio Cesar Medeiros Diniz ◽  
Francesco Da Ros ◽  
Edson Porto da Silva ◽  
Rasmus Thomas Jones ◽  
Darko Zibar

Author(s):  
M. H. MEHTA ◽  
V. V. KAPADIA

Engineering field has inherently many combinatorial optimization problems which are hard to solve in some definite interval of time especially when input size is big. Although traditional algorithms yield most optimal answers, they need large amount of time to solve the problems. A new branch of algorithms known as evolutionary algorithms solve these problems in less time. Such algorithms have landed themselves for solving combinatorial optimization problems independently, but alone they have not proved efficient. However, these algorithms can be joined with each other and new hybrid algorithms can be designed and further analyzed. In this paper, hierarchical clustering technique is merged with IAMB-GA with Catfish-PSO algorithm, which is a hybrid genetic algorithm. Clustering is done for reducing problem into sub problems and effectively solving it. Results taken with different cluster sizes and compared with hybrid algorithm clearly show that hierarchical clustering with hybrid GA is more effective in obtaining optimal answers than hybrid GA alone.


Sign in / Sign up

Export Citation Format

Share Document