A Least-Loss Algorithm for a Bi-Objective One-Dimensional Cutting-Stock Problem
- 1 July 2019
- journal article
- Published by IGI Global Scientific Publishing in International Journal of Applied Industrial Engineering
- Vol. 6 (2) , 1-19
Abstract
This article presents a new model and an efficient solution algorithm for a bi-objective one-dimensional cutting-stock problem. In the cutting-stock—or trim-loss—problem, customer orders of different smaller item sizes are satisfied by cutting a number of larger standard-size objects. After cutting larger objects to satisfy orders for smaller items, the remaining parts are considered as useless or wasted material, which is called “trim-loss.” The two objectives of the proposed model, in the order of priority, are to minimize the total trim loss, and the number of partially cut large objects. To produce near-optimum solutions, a two-stage least-loss algorithm (LLA) is used to determine the combinations of small item sizes that minimize the trim loss quantity. Solving a real-life industrial problem as well as several benchmark problems from the literature, the algorithm demonstrated considerable effectiveness in terms of both objectives, in addition to high computational efficiency.Keywords
This publication has 32 references indexed in Scilit:
- A comparative study of exact methods for the bi-objective integer one-dimensional cutting stock problemJournal of the Operational Research Society, 2017
- Sufficient condition for partial efficiency in a bicriteria nonlinear cutting stock problemRAIRO - Operations Research, 2017
- New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftoversJournal of the Operational Research Society, 2017
- One‐dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming modelInternational Transactions in Operational Research, 2014
- Pattern-set generation algorithm for the one-dimensional multiple stock sizes cutting stock problemEngineering Optimization, 2014
- A GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPSPesquisa Operacional, 2014
- On cutting stock with due datesOmega, 2014
- The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristicInternational Transactions in Operational Research, 2012
- The three-dimensional knapsack problem with balancing constraintsApplied Mathematics and Computation, 2012
- A branch-and-price-and-cut algorithm for the pattern minimization problemRAIRO - Operations Research, 2008