Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A GRASP Algorithm for Constrained Two-Dimensional Non-Guillotine Cutting Problems

R. Alvarez-Valdes, F. Parreño and J. M. Tamarit
The Journal of the Operational Research Society
Vol. 56, No. 4 (Apr., 2005), pp. 414-425
Stable URL: http://www.jstor.org/stable/4102213
Page Count: 12
  • Subscribe ($19.50)
  • Cite this Item
A GRASP Algorithm for Constrained Two-Dimensional Non-Guillotine Cutting Problems
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
[414]
    [414]
  • Thumbnail: Page 
415
    415
  • Thumbnail: Page 
416
    416
  • Thumbnail: Page 
417
    417
  • Thumbnail: Page 
418
    418
  • Thumbnail: Page 
419
    419
  • Thumbnail: Page 
420
    420
  • Thumbnail: Page 
421
    421
  • Thumbnail: Page 
422
    422
  • Thumbnail: Page 
423
    423
  • Thumbnail: Page 
424
    424
  • Thumbnail: Page 
425
    425