Set Covering Model in Solving Multiple Cutting Stock Problem

Abstract

Cutting Stock Problem (CSP) is the determination of how to cut stocks into items with certain cutting rules. A diverse set of stocks is called multiple stock CSP. This study used Pattern Generation (PG) algorithm to determine cutting pattern, then formulated it into a Gilmore and Gomory model and solved by using Column Generation Technique (CGT). Set Covering model was generated from Gilmore and Gomory model. Based on the results, selected cutting patterns in the first stage can be used in the second stage. The combination of patterns generated from Gilmore and Gomory model showed that the use of stocks was more effective than Set Covering model.

Set Covering Model Using Greedy Heuristic Algorithm to Determine The Temporary Waste Disposal Sites in Palembang

“…SCP is a problem of integer programming to optimize the number and allocation of facility location points (Kwon et al, 2020). SCP in daily life includes allocating machines to the given task, assigning jobs to workers, optimizing the facility location to obtain optimal results, assigning garbage vehicle routes to the garbage collection site to optimize the distance and required costs, and others (Cordeau et al, 2019;Octarina et al, 2020;Sitepu et al, 2019a;Sitepu et al, 2019b;Ye and Kim, 2016). SCP has several problems, including Set Covering Location Problem (SCLP) and the p-Median Problem (Amarilies et al, 2020;Dzator and Dzator, 2015;Karataş et al, 2017).…”

Facility Location Problem of Dynamic Optimal Location of Hospital Emergency Department in Palembang

“…The optimal location problems deal with the nding of the optimal location of the facilities (Guzmán et al, 2016) , formed the set covering problem (SCP) (Doungpan, 2020;Octarina et al, 2020;Zhang and Zhang, 2015). In practical situations, it deals with the set of public facilities such as hospitals (Sitepu et al, 2019;Mohri and Haghshenas, 2021), waste bin allocation (Puspita et al, 2019) , gas stations, and so on (Özceylan et al, 2017) .…”

“…Most models of SCP only deal with the ability to set optimal facility location if the only parameter known would be the distance between facilities and distance between facilities and population (Sitepu et al, 2019) . Some approaches are available to solve SCP using exact (Sitepu et al, 2019;Sitepu et al, 2018), or heuristics methods (Yuliza et al, 2021;Avrahami and Israeli, 2013;Octarina et al, 2020;Puspita et al, 2019). Based on research that has been done previously by Sitepu et al (2018) in optimizing the location of emergency installations at health facilities in Palembang City, this study extends the research that has been done by designing models with a criterion of unknown radius (Bashiri and Fotuhi, 2009) , that never described before in dealing with ED di Palembang City of the facilities to be ful lled by utilizing the TOPSIS method (Olugu et al, 2021;Sürmeli et al, 2015;Surya, 2018;Zhang et al, 2020), compared previously described by (Sitepu et al, 2019) .…”