An Approach to Consider Diversity Issues from a Semantic Point of View

Author

Suzuki, M. ; Motomura, T. ; Tsuruta, Setsuo ; Sakurai, Yasushi ; Knauf, Rainer

Author_Institution

Sch. of Inf. Environ., Tokyo Denki Univ., Inzai, Japan

fYear

2013

fDate

13-16 Oct. 2013

Firstpage

1696

Lastpage

1701

Abstract

In this paper, we discuss a semantic and application-driven approach to estimate diversity respectively similarity in Genetic Algorithms (GA) based on a relative distance. This diversity metric can used to decide, whether or not a new individual meets a requested degree of diversity. Furthermore, the trade-off between several versions of the metric and their computational complexity is discussed. Finally, the application of this metric and a formerly developed Backtrack- and Restart GA to solve the Travelling Salesman Problem under certain real time requirements is introduced along with experimental evaluation.

Keywords

computational complexity; genetic algorithms; travelling salesman problems; backtrack-GA; computational complexity; diversity issues; diversity metric; genetic algorithms; real time requirements; restart GA; semantic view point; travelling salesman problem; Cities and towns; Genetic algorithms; Measurement; Nickel; Pattern matching; Sociology; Statistics; Backtrack and Restart Genetic Algorithm (Br-GA); Diversity; Genetic Algorithms (GA); Travelling Salesman Problem (TSP);

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man, and Cybernetics (SMC), 2013 IEEE International Conference on

Conference_Location

Manchester

Type

conf

DOI

10.1109/SMC.2013.292

Filename

6722045