HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >

遺伝的アルゴリズムによる最適系列分割問題の解法

Files in This Item:
120_215.pdf1.96 MBPDFView/Open
Please use this identifier to cite or link to this item:http://hdl.handle.net/2115/64535

Title: 遺伝的アルゴリズムによる最適系列分割問題の解法
Other Titles: A genetic algorithm for the optimal sequential partitioning problem
Authors: 荒木, 肇1 Browse this author
加地, 太一2 Browse this author →KAKEN DB
山本, 雅人3 Browse this author →KAKEN DB
鈴木, 恵二4 Browse this author →KAKEN DB
大内, 東5 Browse this author →KAKEN DB
Authors(alt): ARAKI, Hajime1
KAJI, Taichi2
YAMAMOTO, Masahito3
SUZUKI, Keiji4
OHUCHI, Azuma5
Keywords: グラフ分割問題
遺伝的アルゴリズム
最適系列分割問題
無閉路有向グラフ
近似解法
Issue Date: 1-Feb-2000
Publisher: 電気学会
Journal Title: 電気学会論文誌. C, 電子・情報・システム部門誌
Journal Title(alt): The transactions of the Institute of Electrical Engineers of Japan. C, A publication of Electronics, Information and System Society
Volume: 120
Issue: 2
Start Page: 215
End Page: 221
Abstract: 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: http://www.iee.jp/
Type: article
URI: http://hdl.handle.net/2115/64535
Appears in Collections:情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: 山本 雅人

Export metadata:

OAI-PMH ( junii2 , jpcoar )


 

Feedback - Hokkaido University