6533b827fe1ef96bd1285a99

RESEARCH PRODUCT

A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems

Francisco ParreñoRamón Alvarez-valdésJosé Manuel Tamarit

subject

Marketing021103 operations researchAdaptive algorithmComputer scienceStrategy and ManagementGRASP0211 other engineering and technologies02 engineering and technologyManagement Science and Operations ResearchConstructiveManagement Information SystemsRandomized algorithm0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingRectangleHeuristicsGreedy algorithmAlgorithmGreedy randomized adaptive search procedure

description

This paper presents a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional non-guillotine cutting problem, the problem of cutting the rectangular pieces from a large rectangle so as to maximize the value of the pieces cut. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform extensive computational experiments with well-known instances previously reported, first to select the best alternatives and then to compare the efficiency of our algorithm with other procedures.

https://doi.org/10.1057/palgrave.jors.2601829