By Topic

Hybridization of Genetic Algorithm and Branch-and-Price Framework for Solving the One Dimensional Cutting Stock Problem with Multiple Stock Sizes

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
$31 $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

1 Author(s)
Phan Thi Hoai Phuong ; Posts & Telecommun. Inst. of Technol. (PTIT), Hanoi, Vietnam

In this paper, we are concerned with a natural extension of the standard cutting stock problem, in which there are multiple stock sizes available instead of a single one. Based on decomposing problem of this type into the standard cutting stock ones, a new model called OneDCSP_M is proposed and its solution algorithm is developed. The quality of the algorithm is evaluated by comparing its results with the ones obtained by Belov and Scheithauer.

Published in:

Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), 2012 IEEE RIVF International Conference on

Date of Conference:

Feb. 27 2012-March 1 2012