メタ戦略を用いたネスティング問題の解法 Application of Meta-Heuristics to a Nesting Problem

この論文にアクセスする

この論文をさがす

著者

抄録

A problem of optimizing locations of many rectangular pieces for efficiently utilizing a sheet is considered. The object is to minimize the amount of waste. This problem which is called the nesting problem is important in industrial applications, but it's NP hard. This problem is considered in two stages of the ordering the pieces and the selecting locations of the pieces using the order. In this paper, we propose a new greedy algorithm, called ridgeline method for selecting the optimal locations in the second stage. The order of the pieces strongly affects the performance of the method. Therefore, methods of meta-heuristics, i.e., local search, simulated annealing, tabu search and genetic algorithms, to optimize the order in the first stage are considered. Two options in genetic algorithms are used. These methods of meta heuristics as well as random ordering are compared using simulations experiments. The result shows that the simulated annealing is better than the other meta-heuristics.

収録刊行物

  • 計測自動制御学会論文集  

    計測自動制御学会論文集 33(11), 1081-1086, 1997-11-30 

    The Society of Instrument and Control Engineers

参考文献:  14件

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

被引用文献:  1件

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

各種コード

  • NII論文ID(NAID)
    10002491828
  • NII書誌ID(NCID)
    AN00072392
  • 本文言語コード
    JPN
  • 資料種別
    ART
  • ISSN
    04534654
  • NDL 記事登録ID
    4342559
  • NDL 雑誌分類
    ZM11(科学技術--科学技術一般--制御工学)
  • NDL 請求記号
    Z14-482
  • データ提供元
    CJP書誌  CJP引用  NDL  J-STAGE 
ページトップへ