Migrational GA that preserves solutions in non-static optimization problems

Pitoyo Hartono, Shuji Hashimoto

    研究成果: Conference contribution

    2 引用 (Scopus)

    抜粋

    GA has been successfully introduced to solve various optimizations problems. One of the characteristics of GA is that once it has converged, most of its population members will be copies of the best individual, causing GA to loose population diversity. This characteristic is a setback when we consider non-stationary problems in which the fitness functions vary with time. In this paper we propose Migrational-GA that stores the past environmental solutions and retrieved them rapidly when that environment is reactivated, through probabilistic operation.

    元の言語English
    ホスト出版物のタイトルProceedings of the IEEE International Conference on Systems, Man and Cybernetics
    ページ255-260
    ページ数6
    1
    出版物ステータスPublished - 2001
    イベント2001 IEEE International Conference on Systems, Man and Cybernetics - Tucson, AZ, United States
    継続期間: 2001 10 72001 10 10

    Other

    Other2001 IEEE International Conference on Systems, Man and Cybernetics
    United States
    Tucson, AZ
    期間01/10/701/10/10

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Control and Systems Engineering

    これを引用

    Hartono, P., & Hashimoto, S. (2001). Migrational GA that preserves solutions in non-static optimization problems. : Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (巻 1, pp. 255-260)