二維型材自動化排版與其應用於多噴嘴CNC火燄切割__臺灣人文及社會科學引文索引資料庫

:::

詳目顯示

第 1 筆 / 總合 1 筆

/1頁

論文基本資料
摘要
外文摘要
參考文獻

題名：	二維型材自動化排版與其應用於多噴嘴CNC火燄切割
作者：	劉家盛
作者(外文)：	Chia-Cheng Liu
校院名稱：	中華大學
系所名稱：	科技管理研究所
指導教授：	馬恆
學位類別：	博士
出版日期：	2007
主題關鍵詞：	排版；CNC火燄切割；半離散式圖形表示法；啟發式；Nesting；CNC Flame Cutting；Geometric Representation；Heuristics
原始連結：	連回原系統網址
相關次數：	被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0) 排除自我引用:0 共同引用:0 點閱:41

二維型材自動化排版在許多類型的切割工具機是相當重要的製程，其目的在於減少切割材料的浪費，特別是昂貴的金屬材料上。多噴嘴CNC火燄切割機主要的功能在於切割上述類型之金屬材料，若CNC火燄切割機使用單一刀具切割(噴嘴)時，與一般二維排版無任何差異，但是，如果同時使用多把刀具切割時，與一般二維排版則有明顯的差異，其目的為大量生產相同形狀的工件(Parts)。本論文提出兩種新方法來解決此類型的問題，一為二維幾何圖形新的表示方法，本論文稱為半離散式(Semi-Discrete Representations)圖形表示法。二維工件或板材的表示法，與過去的連續式資料及離散式資料表達方法完全不同，取兩者之優點創造半離散式圖形表示法，將工件實際需安排部份與板材未被安排部份，使用同寬的矩形圖形表示。另一為提出緩衝區(Buffer Region)的方法來安排多切割刀具的工具機，所謂緩衝區即是單一火燄切割刀具與另一火燄切割刀具移動範圍重疊的區域，雖然使火燄切割刀具間距離縮短，但可以增加每把刀具移動範圍，進而增加板材面積的使用率。本論文取實務上的例子來測試，並且使用業界常用排版軟體比較，經測試後皆可獲得相當好的排版結果。

以文找文

Automatic nesting of two-dimensional shaped parts is an important process for a variety of cutting machine tools, whose purpose is to acquire a part layout with the minimal material waste on the payload. This is particularly desirable when the material of the payload, e.g., metals, is expensive. Multi-torch CNC flame cutting is a major method for cutting such materials and the nesting process for such a method is even more difficult than single-tool machinery due to its characteristics that cutting is carried out in a batch fashion. In this thesis, two techniques are developed for dealing with this type of problem. First, a novel geometric representation that divides the parts and the payload into stripes of an identical width is proposed, incorporated with a set of part-placing rules, for achieving a more effective outcome in generic nesting problems. Second, a buffering concept is utilized to accommodate the nesting difficulty in batch cutting. The proposed techniques were implemented and compared with a commercially available benchmark. Using a number of real cases from several industries requiring nesting, the proposed techniques achieved better part layouts than the benchmark for all the cases.

以文找文

1.王誌謙(2005)，「AutoCAD系統於二維排版問題最佳化之研究」，國立台灣海洋大學系統工程暨造船學系研究所碩士論文。
2.吳泰熙、駱景堯、林東養(2000)，「多尺寸方形排列問題啟發式解法之研究」，工業工程學刊，第17卷，第75-85頁。 new window

3.辛宜芳(2002)，「以CAD為平台之自動排版系統使用基因演算法」，中華大學科技管理研究所碩士論文。
4.許德欽(1996) ，「片材取料之最佳拼排研究」，國立臺灣大學機械工程研究所碩士論文。
5.郭建昌(1999) ，「多層印刷電路板排版方式與製程成本之整合評估與分析」，元智大學工業工程研究所碩士論文。
6.陳建聲(2001)，「結合啟發式與基因演算法解決不規則船體內構件排版問題之研究」，國立成功大學造船暨船舶機械工程研究所碩士論文。
7.陳隆斌(2004)，「2D不規則形狀元件密排方法之研究」，國立中正大學機械工程研究所碩士論文。
8.廖文鈺(1996) ，「工業用紙工廠紙張裁剪模式之探討」，元智大學工業工程研究所碩士論文。
9.蕭惟隆(1997)，「電腦輔助船體內構件排版及數值控制加工系統」，國立成功大學造船暨船舶機械工程研究所碩士論文。
10.龔宣任(1997)，「平行邊界限制下之最佳化拼排」，國立台灣大學機械工程研究所碩士論文。
11.Adamowicz, L. and Albano A. (1972), “A Two-Stage Solution of the Cutting Stock Problem,” Information Processing, Vol. 71, No. 6, pp.1086-1091.
12.Adamowicz, L. and Albano A. (1976), “Nesting Two-Dimensional Shapes in Rectangular Modules,” Computer Aided Design, Vol. 8, No. 1, pp.27-33.
13.Agarwal, P. K., Flato, E. and Halperin, D. (2002), “Polyqon Decomposition for Efficient Construction of Minkowski Sums,” Computational Geometry, Vol. 21, No. 1-2, pp.39-61.
14.Albano, A. (1977),” A Method to Improve Two-Dimensional Layout,” Computer-Aided Design, Vol. 9, No. 1, pp.48-52.
15.Bennell, J. A. and Dowsland, K. A. (1999), “A Tabu Thresholding Implementation for the Irregular Stock Cutting Problem,” International Journal Production Research, Vol. 37, No. 18, pp.4259-4275.
16.Biro, M. and Borors, E. (1984), “Network Flows and Non-Guillotine Cutting Patterns,” European Journal of Operational Research, Vol. 16, No. 1, pp.215-221.
17.Beasley, J. E. (1985), “Algorithms for Unconstrained Two-Dimensional Guillotine Cutting,” Journal of the Operational Research Society, Vol. 36, No. 4, pp.297-306.
18.Chang, T.C. (1990), “Expert Process Planning for Manufacturing,” Addison Wesley Publishing Company, New York.
19.Cheng, S. K. and Rao, K. P.(1999), “Concepts of Neighbourhood and Universal Compact Yield Towards Achieving Best Pattern Layouts,” International Journal of Production Research, Vo1. 37, No. 14, pp.3643-3658.
20.Cheng, S. K. and Rao, K. P.(2000), “Large-Scale Nesting of Irregular Patterns Using Compact Neighborhood Algorithm ,” Journal of Materials Processing Technology, Vo1. 103, No. 1, pp.135-140.
21.Dori, D., Ben-Bassat, M. (1984), ”Efficient Nesting of Congruent Convex Figures,” Communications of the ACM, Vol. 27, No. 3, pp.228-235.
22.Fischer, A. D. and Dagli, C. H. (2004), “Employing Subgroup Evolution for Irregular-Shape Nesting,” Journal of Intelligent Manufacturing, Vol. 15, No. 2, pp.187-199.
23.Francis, E. H., Chong T. Y. and Lee, F. C. (2002), “Pattern Nesting on Irregular-Shaped Stock Using Genetic Algorithms,” Engineering Applications of Artificial Intelligence, Vol. 15, No. 6, pp.551-558.
24.Freeman, H. and Shapira, R. (1975), “Determining the Minimum Area Encasing Rectangle for an Arbitrary Closed Curve,” Communications of the ACM , Vol. 81, No. 7, pp.409-413.
25.George, J. A., George, J. M. and Lamar, B. W. (1995), “Packing Different-Sized Circles into a Rectangular Container,” European Journal of Operational Research, Vo1. 84, No. 3, pp.693-712.
26.Gilmore, P. C. and Gomory, R. E. (1961), “A Linear Programming Approach to the Cutting Stock Program,” Operations Research, Vol. 9, No. 6, pp.848-859.
27.Gilmore, P. C. and Gomory, R. E. (1964), “Multi Stage Cutting Stock Problems of Two and More Dimension ,” Operations Research, Vol. 13, No. 1, pp.94-120.
28.Gomes, A. M. and Oliveira, J. F. (2002), “A 2-Exchange Heuristic for Nesting Problems,” European Journal of Operation Research, Vol. 141, No. 2, pp.359-370.
29.Hadjiconstantinou, E. and Christofides, N. (1995), “An Exact Algorithm for General, Orthogonal, Two-Dimensional Knapsack Problems,” European Journal of Operational Research, Vol. 83, No. 1, pp.39-56.
30.Heckmann, R. and Lengauer, T. (1998), “Computing Closely Matching Upper and Lower Bounds on Textile Nesting Problems,” European Journal of Operational Research, Vol. 108, No. 3, pp.473-489.
31.Hopper, E. and Turton, B. (1999), “A Genetic Algorithm for a 2D Industrial Packing Problem,” Computers & Industrial Engineering, Vol. 37, No. 1-2 , pp.375-378.
32.Ismail, H. S. and Hon, K. K. B. (1992), “New Approaches for the Nesting of Two-Dimensional Shapes for Press Tool Design,” International Journal of Production Research, Vo l. 30, No. 4, pp.825-837.
33.Israni, S. S., Sanders, J.L.(1985), “Performance Testing of Rectangular Parts-Nesting Heuristics,” International Journal of Production Research, Vol. 23, No. 2, pp.437-456.
34.Jakobs, S. (1996), “On Genetic Algorithms for the Packing of Polygons,” European Journal of Operational Research, Vo1. 88, No. 1, pp.165-181.
35.Li, Z. and Milenkovic, V. (1995), “Compaction and Separation Algorithms for Nonconvex Polygons and their Applications,” European Journal of Operational Research, Vol. 84, No. 3, pp.539-561.
36.Liu, H., Zeng, G.. Z. and Lin, Z. K. (1997), “A System of Optimizing Nesting with Analogical Learning Mechanism,” Computers and Industrial Engineering, Vol. 32 , Issue: 4, pp.713-725.
37.Lutfiyya, H., Mcmillan. B., Poshyanon, D. A. P. and Dagli, C. (1992) , “Composite Stock Cutting Through Simulated Annealing,” Mathematical Computer modeling, Vol. 16, No. 1, pp.57-74.
38.Ma, H., Cannon, D. J. and Kumara, S. R. T. (1995), “A Scheme Integrating Neural Networks for Real-Time Robotic Collision Detection,” Proceedings of 1995 IEEE International Conference on Robotics and Automation, Nagoya, Japan.
39.Milenkovic, V., Daniels, K. and Li, Z. (1992), “Placement and Compaction of Nonconvex Polygons for Clothing Manufacture,” In Proceedings of Fourth Canadian Conference on Computational Geometry, Newfoundland, pp. 236-243.
40.Milenkovic, V. (1998), “Rotational Polygon Overlap Minimzation and Compaction,” Computational Geometry, Vol. 10, No. 4, pp.305-318.
41.Milenkovic, V. (1999), “Rotational Polygon Containment and Minimum Enclosure Using Only Robust 2D Constructions,” Computational Geometry, Vol. 13, No. 1, pp.3-19.
42.Qu, W. and Sanders, J. L.(1987), “A Nesting Algorithm for Irregular Parts and Factors Affecting Trim Losses,” International Journal of Operation Research, Vol. 25, No. 8, pp.381-397.
43.Prasad, Y. K. D. V., Somasundaram, S. and Rao, K.P. (1995), “A Sliding Algorithm for Optimal Nesting Arbitrarily Shaped Sheet Metal Blanks,” International Journal Production Research, Vol. 33, No. 6, pp.1505-1520.
44.Ramesh Babu A. and Ramesh Babu N. (1999), “Effective Nesting of Rectangular Parts in Multiple Rectangular Sheets Using Genetic and Heuristic Algorithms,” International Journal Production Research, Vol. 37, No. 8, pp.1625-1643.
45.Ramesh Babu A. and Ramesh Babu N. (2001), “A generic Approach for Nesting of 2-D Parts in 2-D Sheets Using Genetic and Heuristic Algorithms,” Computer-Aided Design, Vol. 33, No. 12 , pp.879-891.
46.Tay, F. E. H., Chong T. Y. and Lee, F.C. (2002), “Pattern Nesting on Irregular-Shaped Stock Using Genetic Algorithms,” Engineering Applications of Artificial Intelligence, Vol. 15, No. 6, pp.551-558.
47.Weishuang, Q. and Jerry, L. S. (1987), “A Nesting Algorithm for Irregular Parts and Factors Affecting Trim Losses,” International Journal of Production Research, Vo1. 25, No. 2, pp.381-397.

推文
推薦
引用網址
引用嵌入語法
轉寄

top

:::

相關期刊
相關論文
相關專書
相關著作
熱門點閱

1.	多尺寸方形排列問題啟發式解法之研究

無相關博士論文

無相關書籍

無相關著作

無相關點閱

QR Code

臺灣人文及社會科學引文索引資料庫系統

詳目顯示

臺灣人文及社會科學引文索引資料庫