A comparative study of exact methods for the bi-objective integer one-dimensional cutting stock problem
- 12 December 2017
- journal article
- research article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 69 (1) , 91-107
Abstract
This article addresses the bi-objective integer cutting stock problem in one dimension. This problem has great importance and use in various industries, including steel mills. The bi-objective model considered aims to minimize the frequency of cutting patterns to meet the minimum demand for each item requested and the number of different cutting patterns to be used, being these conflicting objectives. In this study, we apply three classic methods of scalarization: weighted sum, Chebyshev metric and \(\varepsilon \)-Constraint. This last method is developed to obtain all of the efficient solutions. Also, we propose and test a fourth method, modifying the Chebyshev metric, without the insertion of additional variables in the formulation of the sub-problems. The computational experiments with randomly generated real size instances illustrate and attest the suitability of the bi-objective model for this problem, as well as the applicability of all the proposed exact algorithms, thus showing that they are useful tools for decision makers in this area. Moreover, the modified metric method improved with respect to the performance of the classical version in the tests.
Keywords
This publication has 25 references indexed in Scilit:
- Solution approaches for the cutting stock problem with setup costComputers & Operations Research, 2013
- C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reductionOptimization Methods and Software, 2011
- The one-dimensional cutting stock problem with due datesEuropean Journal of Operational Research, 2010
- A genetic symbiotic algorithm applied to the one-dimensional cutting stock problemPesquisa Operacional, 2009
- A branch-and-price-and-cut algorithm for the pattern minimization problemRAIRO - Operations Research, 2008
- The significance of reducing setup times/setup costsEuropean Journal of Operational Research, 2008
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programsEuropean Journal of Operational Research, 2007
- A method for finding the set of non-dominated vectors for multiple objective integer linear programsEuropean Journal of Operational Research, 2004
- Solving a bi-criterion cutting stock problem with open-ended demand: a case studyJournal of the Operational Research Society, 2000
- Pattern reduction in one-dimensional cutting stock problemsInternational Journal of Production Research, 2000