プレカット材料取り合わせのための新しい交叉操作による遺伝的アルゴリズム

• 豊田 丈輔

  住友林業（株）

書誌事項

タイトル別名

• A Genetic Algorithm Using New Crossover Operation for Cutting Stock Problem of Timber Precutting
• プレカット ザイリョウ トリアワセ ノ タメノ アタラシイ コウサ ソウサ ニ ヨル イデンテキ アルゴリズム

抄録

So far, there are many researches on Bin Packing Problem (BPP). Cutting Stock Problem for timber precutting (CSP) is one of the kind of BPP. There are some solving methods such as Integer Programming method, First Fit method and Best Fit method as for this. There are a few papers in which Genetic Algorithm (GA) is applied to BPP. This is because building model is difficult and generating effective individuals of next generation by crossover is also difficult. In this paper, an application of GA to CSP is examined. CSP contains mother materials consisted by plural lengths, which is different from general BPP. Therefore we devise doubled structure of gene. Reflecting dynamic change to crossover operation based on the result of combination, new model is built. Convergence process is improved largely by this newly proposed method.

収録刊行物

• 電気学会論文誌Ｃ（電子・情報・システム部門誌）

  電気学会論文誌Ｃ（電子・情報・システム部門誌） 128 (7), 1131-1136, 2008

  一般社団法人 電気学会

キーワード

• 遺伝的アルゴリズム
• 取り合わせ問題
• ビンパッキング問題
• 交叉操作

詳細情報

• CRID: 1390282679581748608
• NII論文ID: 10021133144
• NII書誌ID: AN10065950
• DOI: 10.1541/ieejeiss.128.1131
• BIBCODE: 2008ITEIS.128.1131T
• ISSN: 13488155
• ISSN: 03854221
• NDL書誌ID: 9564375
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I9564375
• Web Site: http://www.jstage.jst.go.jp/article/ieejeiss/128/7/128_7_1131/_pdf
• 本文言語コード: ja
• データソース種別:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可