A matheuristic-based solution approach for integrated stock selection and sizing problem with a case study in a corrugated box-production company

BAYKASOĞLU A., SUBULAN K., Karaman İ.

Computers and Industrial Engineering, cilt.195, 2024 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 195
  • Basım Tarihi: 2024
  • Doi Numarası: 10.1016/j.cie.2024.110429
  • Dergi Adı: Computers and Industrial Engineering
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, ABI/INFORM, Aerospace Database, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Metadex, DIALNET, Civil Engineering Abstracts
  • Anahtar Kelimeler: Corrugated carton box production industry, Matheuristic, Mixed-integer linear programming, Simulated annealing, Stock selection and sizing problem
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

The majority of former research has concentrated on different variants of the cutting stock problems with fixed-sized stocks only, and there is a scarcity of studies in the literature on variable-sized cutting stock problems, where dimensions of stocks (width and length) also need to be determined. In this research topic, a few studies have been published in recent years. Based on this motivation, this paper addressed a case-oriented two-dimensional cutting stock problem with variable-sized stocks of a carton box manufacturing company to determine optimal dimensions, production requirements, and the purchasing amounts of the corrugated boards. A novel mathematical programming model of the problem is first developed that formally defines the problem. Due to the complex nature of the proposed model and difficulties in its optimal solution, a matheuristic-based solution approach is also proposed. The proposed approach incorporates a mixed-integer linear program (MILP) into a Simulated Annealing (SA) algorithm. By using the proposed matheuristic approach, the dimension values of the purchased corrugated boards are selected from the combinations of zero-waste dimensions of the demanded carton boxes and supplied at each iteration of the SA algorithm as inputs to MILP. Then, MILP is easily solved within reasonable computation times by making use of the Gurobi MIP solver in each SA iteration. The performance of the matheuristic approach is first tested on a real-life application study for the towel radiator box products of a manufacturing company in Turkey. Thereafter, a comprehensive computational study is also performed. Computational results have demonstrated that the proposed approach can generate promising results, which necessitate minimal stock diversity and impose minimum waste costs when compared to the existing cutting and purchasing plans of the company as well as the results of some greedy search heuristics embedded in the proposed MILP model.