DocumentCode
3545745
Title
Hybridization of Genetic Algorithm and Branch-and-Price Framework for Solving the One Dimensional Cutting Stock Problem with Multiple Stock Sizes
Author
Phan Thi Hoai Phuong
Author_Institution
Posts & Telecommun. Inst. of Technol. (PTIT), Hanoi, Vietnam
fYear
2012
fDate
Feb. 27 2012-March 1 2012
Firstpage
1
Lastpage
5
Abstract
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.
Keywords
bin packing; genetic algorithms; tree searching; OneDCSP_M; branch-and-price framework; decomposing problem; genetic algorithm; multiple stock sizes; one dimensional cutting stock problem; standard cutting stock; Approximation algorithms; Genetic algorithms; Heuristic algorithms; Linear programming; Materials; Production; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), 2012 IEEE RIVF International Conference on
Conference_Location
Ho Chi Minh City
Print_ISBN
978-1-4673-0307-1
Type
conf
DOI
10.1109/rivf.2012.6169859
Filename
6169859
Link To Document