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

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

書誌事項

タイトル別名
  • A genetic algorithm for the optimal sequential partitioning problem
  • イデンテキ アルゴリズム ニ ヨル サイテキ ケイレツ ブンカツ モンダイ ノ カイホウ

この論文をさがす

抄録

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<br> In this paper we present the genetic algorithm for the optimal sequential partitioning problem. We developeffective 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.

収録刊行物

参考文献 (8)*注記

もっと見る

キーワード

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

問題の指摘

ページトップへ