J-STAGE トップ  >  資料トップ  > 書誌事項

電気学会論文誌C(電子・情報・システム部門誌)
Vol. 130 (2010) No. 1 P 57-65

記事言語:

http://doi.org/10.1541/ieejeiss.130.57

<ソフトコンピューティング・学習>

Today, a lot of automatic programming techniques have been proposed and applied in various fields. Graph Structured Program Evolution (GRAPE) is one of the recent automatic programming techniques. The representation of GRAPE is graph structure, therefore it can represent complex programs using its graph structure. GRAPE succeeds in generating the complex programs automatically. The generation alternation model of GRAPE is usually used minimal generation gap (MGG) which is not considered the evolution of program size. Therefore, it would not be search various program sizes. In this paper, a new evolutionary algorithm for GRAPE, called Evolutionary Algorithm Considering Program Size (EACP), is proposed. EACP maintains the diversity of program size in the population by using particular fitness assignment and generation alternation. We apply EACP to three test problems, factorial, exponentiation and sorting a list. And we show the effectiveness of EACP and confirm evolution of maintaining the diversity of program size.

Copyright © 電気学会 2010

この記事を共有