動的スケジューリング問題のための長期メモリを用いた並列分散遺伝的プログラミング

DOI Web Site 参考文献3件 オープンアクセス

書誌事項

タイトル別名
  • Parallel Distributed Genetic Programming using Long-term Memory for Dynamic Scheduling Problems

抄録

<p>Genetic Programming (GP) is an evolutionary computation method that optimizes the rules defining the relationship between environmental states and system output. GP is an effective method for dynamic environments in which the information repeatedly changes multiple times. On the other hand, in GP, the rules are evaluved as the environmental state changes, so the rules acquired in the distant past disappear in time, and re-learning is required in a dynamic environment. This paper proposes an optimization method for the dynamic scheduling problem where new jobs arrive intermittently. Specifically, a method to improve the learning efficiency of GP in such a periodic dynamic environment by dividing the population into several subpopulations and recording the environmental states or their characteristics. This paper conducts some numerical experiments on the dynamic scheduling problems in which new jobs arrive irregularly to verify the usefulness of the proposed method.</p>

収録刊行物

参考文献 (3)*注記

もっと見る

関連プロジェクト

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ