A rotatable placement algorithm and GA to the nesting problem

Tzuo Liang Luo, Jian Horng Chen, Yuan Lung Lai

研究成果: Conference contribution

摘要

The objective of two-dimensional optimal nesting problem is to place the same or different pieces of the fixed quantity on the sheet in this paper. What we want to do is increase the rate of utility and decrease the waste of panel. Generally, determine the quality of the nesting results; it can briefly be divided into two factors: placement algorithm and permutation. Placement algorithm means to decide the positions where the pieces place into the sheet. And permutation is the placing sequence order of pieces. If the sequence of permutation is available and the placement rule also meets the demand of packing, then the exact or optimal solutions could be found. This research provides a new placement algorithm rule "Area-Decomposition" method. This combines the rotation function for each piece and genetic algorithm. A comparison of nesting with literature and commercial software shows the results. This research can really acquire good results of nesting according to the demand of different situations in interest.

原文English
主出版物標題2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009
頁面451-455
頁數5
DOIs
出版狀態Published - 2009 十一月 16
事件2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009 - Los Angeles, CA, United States
持續時間: 2009 三月 312009 四月 2

出版系列

名字2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009
5

Other

Other2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009
國家United States
城市Los Angeles, CA
期間09-03-3109-04-02

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Hardware and Architecture
  • Information Systems
  • Software

指紋 深入研究「A rotatable placement algorithm and GA to the nesting problem」主題。共同形成了獨特的指紋。

  • 引用此

    Luo, T. L., Chen, J. H., & Lai, Y. L. (2009). A rotatable placement algorithm and GA to the nesting problem. 於 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009 (頁 451-455). [5170576] (2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009; 卷 5). https://doi.org/10.1109/CSIE.2009.914