DocumentCode
617898
Title
Structural diversity for genetic algorithms and its use for creating individuals
Author
Suzuki, M. ; Tsuruta, Setsuo ; Knauf, Rainer
Author_Institution
Sch. of Inf. Environ., Tokyo Denki Univ., Inzai, Japan
fYear
2013
fDate
20-23 June 2013
Firstpage
783
Lastpage
788
Abstract
The paper presents a structural representation of diversity (respectively similarity). This representation can be used to decide, whether or not a new individual meets a requested degree of diversity, but also to estimate and optimize a population´s coverage of the solution space to avoid running into a local optimum and missing the global one. Moreover, it can also be constructively used for systematically creating new individuals, which (1) meet a certain diversity requirement, (2) additionally improve the coverage of the solution search space, and (3) have an optimal fitness value.
Keywords
genetic algorithms; search problems; diversity requirement; diversity structural representation; genetic algorithms; local optimum; optimal fitness value; solution search space population coverage; Cities and towns; Entropy; Genetics; Measurement; Pattern matching; Sociology; Statistics; Genetic Algorithm (GA); Structural Diversity; Travelling Salesman Problem (TSP);
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation (CEC), 2013 IEEE Congress on
Conference_Location
Cancun
Print_ISBN
978-1-4799-0453-2
Electronic_ISBN
978-1-4799-0452-5
Type
conf
DOI
10.1109/CEC.2013.6557648
Filename
6557648
Link To Document