プレカット材料取り合わせのための新しい交叉操作による遺伝的アルゴリズム 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.

収録刊行物

  • 電気学会論文誌. C, 電子・情報・システム部門誌 = The transactions of the Institute of Electrical Engineers of Japan. C, A publication of Electronics, Information and System Society  

    電気学会論文誌. C, 電子・情報・システム部門誌 = The transactions of the Institute of Electrical Engineers of Japan. C, A publication of Electronics, Information and System Society 128(7), 1131-1136, 2008-07-01 

    The Institute of Electrical Engineers of Japan

参考文献:  9件

参考文献を見るにはログインが必要です。ユーザIDをお持ちでない方は新規登録してください。

被引用文献:  1件

被引用文献を見るにはログインが必要です。ユーザIDをお持ちでない方は新規登録してください。

各種コード

  • NII論文ID(NAID)
    10021133144
  • NII書誌ID(NCID)
    AN10065950
  • 本文言語コード
    JPN
  • 資料種別
    ART
  • ISSN
    03854221
  • NDL 記事登録ID
    9564375
  • NDL 雑誌分類
    ZN31(科学技術--電気工学・電気機械工業)
  • NDL 請求記号
    Z16-795
  • データ提供元
    CJP書誌  CJP引用  NDL  J-STAGE 
ページトップへ