HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
情報科学研究科  >
雑誌発表論文等  >


120_215.pdf1.96 MBPDF見る/開く

タイトル: 遺伝的アルゴリズムによる最適系列分割問題の解法
その他のタイトル: A genetic algorithm for the optimal sequential partitioning problem
著者: 荒木, 肇 著作を一覧する
加地, 太一 著作を一覧する
山本, 雅人 著作を一覧する
鈴木, 恵二 著作を一覧する
大内, 東 著作を一覧する
キーワード: グラフ分割問題
発行日: 2000年 2月 1日
出版者: 電気学会
誌名: 電気学会論文誌. C, 電子・情報・システム部門誌 = The transactions of the Institute of Electrical Engineers of Japan. C, A publication of Electronics, Information and System Society
巻: 120
号: 2
開始ページ: 215
終了ページ: 221
抄録: The optimal sequential partitioning problem is defined as the problem to find the minimum cost partition of the nodes of a directed acyclic graph into subsets of a given size, subject to the constraint that the prece dence relationships among the elements are satisfied. The heuristic algorithm based on a tabu search for this problem has been proposed (2). However, there is a tendency for the solutions obtained using the tabu search approach to be trapped in bad local optima in the parallel graphs with random costs of edges In this paper we present the genetic algorithm for the optimal sequential partitioning problem. We develop effective two point partial order crossover satisfying sequential conditions, which preserve better block that has the larger sum of edge costs of block. In this crossover we introduce roulette selection method to escape local optima. We also assess the effectiveness of the developed algorithm. The results show that this proposed algorithm outperforms, in terms of solution quality, any other algorithm using tabu search.
Relation (URI):
資料タイプ: article
出現コレクション:雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

提供者: 山本 雅人


本サイトに関するご意見・お問い合わせは repo at へお願いします。 - 北海道大学