Virus-Evolutionary Liner Genetic Programming
-
- Tamura Kenji
- Sugiyama Jogakuen University Culture Information
-
- Mutoh Atsuko
- Nagoya Institute of Technology
-
- Nakamura Tsuyoshi
- Nagoya Institute of Technology
-
- Itoh Hidenori
- Nagoya Institute of Technology
Bibliographic Information
- Other Title
-
- 線形表現を用いたウイルス進化型遺伝的プログラミング
- センケイ ヒョウゲン オ モチイタ ウイルス シンカガタ イデンテキ プログラミング
Search this article
Abstract
Many kinds of evolutionary methods have been proposed. GA and GP in particular have been demonstrated its effectiveness in various problems these days, and many systems have been proposed. One is Virus-Evolutionary Genetic Algorithm (VE-GA), and the other is Linear Genetic Programming in C (LGPC). Each of systems is reported its performance. VE-GA is the coevolution system that host individual and virus individuals. That can spread schema effectively among the host individuals by using the virus infection and virus incorporation. LGPC implements the GP by representing the individuals to one dimension as if GA. LGPC can reduce a search cost of pointer and save the machine memory, and can reduce the time to implements GP programs. We proposed that a system introduce virus individuals in LGPC, and the analyzed performance of the system at two problems. Our system can spread schema among the population, and search solution effectively. The results of computer simulation show that this system can search for solution depending on LGPC applying problem's character compare with LGPC. A search cost of pointer
Journal
-
- IEEJ Transactions on Electronics, Information and Systems
-
IEEJ Transactions on Electronics, Information and Systems 126 (7), 913-918, 2006
The Institute of Electrical Engineers of Japan
- Tweet
Details 詳細情報について
-
- CRID
- 1390001204605954304
-
- NII Article ID
- 10018146585
-
- NII Book ID
- AN10065950
-
- ISSN
- 13488155
- 03854221
-
- NDL BIB ID
- 8022625
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed