Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problem
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, 1998
Résumé/Abstract We are given a set of rectangular small pieces which may be rotated by 90, and an... more Résumé/Abstract We are given a set of rectangular small pieces which may be rotated by 90, and an unlimited number of identical rectangular large stock pieces. We consider the problem of determining the guillotine-cuttable patterns that provide all the pieces, such that the total number of required stock pieces is minimized. We show how some classical greedy algorithms given in the literature for the case where no rotation is allowed can be adapted to our problem; in addition, an original heuristic algorithm is presented. We then introduce a ...
Uploads
Papers by Andrea Lodi