切割與裝箱最佳化系統之設計

A Design of Cutting and Packing Optimization System

黃曜輝(Yao-Huei Huang)

指導教授 ： 蔡榮發

國立臺北科技大學/管理學院/商業自動化與管理研究所/碩士(2006年)

https://doi.org/10.6841/NTUT.2006.00330

摘要

本研究，主要在設計切割與裝箱最佳化支援系統，以輔助製造業之原物料切割或運輸業之貨物裝填。而最佳化切割與裝箱方法是採用數學規劃模式進行處理，其目的在提高原物料使用以及降低生產成本。此系統的設計，主要由二個子系統所組成，分別為：(1)組合分析子系統及(2)最佳化訂單生產分析子系統。組合分析子系統在找尋可能的切割(裝箱)組合並且加以驗證是否可行，而最佳化訂單生產分析子系統，將利用組合分析子系統所記錄的可行組合計算出最少原物料的使用量。
此系統的設計，不僅能提供生產決策上的支援，更能夠提高業者在市場上的競爭力。除了數據的計算外，本系統的設計，也在程式的輸出階段，提供視覺化功能，以圖形來呈現各種最佳切割(裝箱)方式。

關鍵字

切割 ； 裝箱 ； 最佳化系統

並列摘要

This study is to design a cutting and packing optimization system. The system can be applied in various industries such as manufacturing and transportation. The formulated mathematical model is solved to find the best way of cutting and packing and therefore enhancing the utilization of the material and reducing the production cost. The system includes two subprograms: (i)The combination analytic subprogram; (ii)The production analytic subprogram. The combination analytic subprogram is to produce possible combinations and exam the feasibility of the combinations. The production analytic subprogram is to find the best production combination according to the feasible combinations and minimize the number of used material to meet the order quantities of the products.
The system could not only provide assistance to decision making on manufacturing but also increase the competitiveness of the product. Moreover, the graphical presentations of the optimal cutting and packing combinations are presented in the output phase.

並列關鍵字

Cutting ； Packing ； Optimization System

參考文獻

[3] Beasley, J.E., “A population heuristic for constrained two-dimensional non-guillotine cutting,” European Journal of operational Research, 2004, Volume:156, pp.601-627.

[4] Bischoff, E.E., “Three-dimensional packing of items with limited load bearing strength,” European Journal of Operational Research, 2004.

[5] Bortfeldt, A. and Gehring, H., “A hybrid genetic algorithm for the container loading problem,” European Journal of Operational Research, 2001, Volume:131, pp.143-161.

[6] Chen, C.S., Sarin, S. and Balasubramanian, R., “A mixed-Integer programming model for a class of assortment problems,” European Journal of Operational Research, 1993, Volume:63, pp.362-367.

[8] Chien, C.F. and Wu, W.T., “A framework of modularized heuristics for determining the container loading patterns,” Computers & Industrial Engineering, 1999, Volume:37, pp.339-342.