PENYELESAIAN MASALAH CUTTING STOCK DENGAN PENGELASAN MENGGUNAKAN TEKNIK COLUMN GENERATION

Kamal Isham, Khusnul Novianingsih, kartika Yulianti

Abstract


The cutting stock problem with welding is a problem for cutting a number of raw materials into a number of cutting patterns to meet every demand such that the raw material needed is minimum. In this study, column generation techniques are used to solve the problem. The technique contains two models i.e the master model and the column generator submodel. The master model is a linear programming model that is used to determine the minimum number of raw materials needed to meet the needs according the cutting patterns. The submodel is constructed to generate a new cutting pattern that will improve the optimal solution of the master model. The column generation step is complete if there is no cutting pattern that can give the better solution. Since column generation technique does not always produce integer solutions, an additional mixed integer programming model is needed to meet unmet demands. The computationl results show that column generation techniques can solve cutting stock problems with welding, and it can give an optimal solution.

Keywords


linear programming, integer programming, column generation, cutting stock problems with welding

References


[1] Agoston, K. C. (2019). The Effect of Welding on the One-Dimensional Cutting-Stock Problem: The Case of Fixed Firefighting Systems in the Construction Industry. Andvances in Operations Research, 1-12.

[2] Araujo, S. A. (2011). An evolutionary algorithm for the one-dimensional cutting stock problem. International Transactionin Operations Research, 18(1): 155-127.

[3] Gilmore, P. C. dan Gomory, R. C. (1963). A linear programming approach to the cutting stock problem path 2. Operations Research, 11(6): 868-888.

[4] Novianingsih, K. (2007). Column Generation Technique for Solving Two-Dimensional Cutting Stock Problems: method of stripe approach. Journal of the Indonesian Mathematical Society, 13(2): 161-172.

[5] Vance, P. H. (1994). Solving Binary cutting stock problems by column generation and branch-bound. Computational Optimization and Applications, 3(2): 111-130.

[6] Wacher, G. H. (2007). An Improvement typology of cutting stock and packing problem. European Journal of Operations Research, 183(6): 1109-1130.


Full Text: PDF

DOI: 10.33751/interval.v3i1.7351 Abstract views : 65 views : 98

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.