IEICE TRANSACTIONS on Information
A Network Analysis of Genetic Algorithms
Summary :
In recent years, network analysis has revealed that some real networks have the properties of small-world and/or scale-free networks. In this study, a simple Genetic Algorithm (GA) is regarded as a network where each node and each edge respectively represent a population and the possibility of the transition between two nodes. The characteristic path length (CPL), which is one of the most popular criteria in small-world networks, is derived analytically and shows how much the crossover operation affects the path length between two populations. As a result, the crossover operation is not so useful for shortening the CPL.
- Publication
- IEICE TRANSACTIONS on Information Vol.E90-D No.6 pp.1002-1005
- Publication Date
- 2007/06/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1093/ietisy/e90-d.6.1002
- Type of Manuscript
- LETTER
- Category
- Biocybernetics, Neurocomputing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroyuki FUNAYA, Kazushi IKEDA, "A Network Analysis of Genetic Algorithms" in IEICE TRANSACTIONS on Information,
vol. E90-D, no. 6, pp. 1002-1005, June 2007, doi: 10.1093/ietisy/e90-d.6.1002.
Abstract: In recent years, network analysis has revealed that some real networks have the properties of small-world and/or scale-free networks. In this study, a simple Genetic Algorithm (GA) is regarded as a network where each node and each edge respectively represent a population and the possibility of the transition between two nodes. The characteristic path length (CPL), which is one of the most popular criteria in small-world networks, is derived analytically and shows how much the crossover operation affects the path length between two populations. As a result, the crossover operation is not so useful for shortening the CPL.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e90-d.6.1002/_p
Copy
@ARTICLE{e90-d_6_1002,
author={Hiroyuki FUNAYA, Kazushi IKEDA, },
journal={IEICE TRANSACTIONS on Information},
title={A Network Analysis of Genetic Algorithms},
year={2007},
volume={E90-D},
number={6},
pages={1002-1005},
abstract={In recent years, network analysis has revealed that some real networks have the properties of small-world and/or scale-free networks. In this study, a simple Genetic Algorithm (GA) is regarded as a network where each node and each edge respectively represent a population and the possibility of the transition between two nodes. The characteristic path length (CPL), which is one of the most popular criteria in small-world networks, is derived analytically and shows how much the crossover operation affects the path length between two populations. As a result, the crossover operation is not so useful for shortening the CPL.},
keywords={},
doi={10.1093/ietisy/e90-d.6.1002},
ISSN={1745-1361},
month={June},}
Copy
TY - JOUR
TI - A Network Analysis of Genetic Algorithms
T2 - IEICE TRANSACTIONS on Information
SP - 1002
EP - 1005
AU - Hiroyuki FUNAYA
AU - Kazushi IKEDA
PY - 2007
DO - 10.1093/ietisy/e90-d.6.1002
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E90-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2007
AB - In recent years, network analysis has revealed that some real networks have the properties of small-world and/or scale-free networks. In this study, a simple Genetic Algorithm (GA) is regarded as a network where each node and each edge respectively represent a population and the possibility of the transition between two nodes. The characteristic path length (CPL), which is one of the most popular criteria in small-world networks, is derived analytically and shows how much the crossover operation affects the path length between two populations. As a result, the crossover operation is not so useful for shortening the CPL.
ER -
English
