By Topic

A new guillotine placement heuristic combined with an improved genetic algorithm for the orthogonal cutting-stock problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Abou Msabah ; Department of Computer Science, University of Science and Technology Houari Boumedienne, USTHB, Algiers, Algeria ; A. R. Baba-Ali

The orthogonal cutting-stock problem consists in finding an optimal arrangement of n items on identical dimension bins. Several placement heuristics are used to perform this task. In our article, we are interested in the orthogonal cutting problem, taking into account the guillotine and the orientation constraints. We propose a new placement heuristic inspired by the BLF routine, which tries to place the items in levels, to check the guillotine constraint, while exploiting intra-levels residues, in two directions, vertically, then horizontally. Our heuristic named BLF2G, will be combined with an improved genetic algorithm, to be compared with other heuristics and metaheuristics found in literature, on made and existing data sets.

Published in:

Industrial Engineering and Engineering Management (IEEM), 2011 IEEE International Conference on

Date of Conference:

6-9 Dec. 2011