In this paper, we propose three algorithms for approximately solving the circular open dimension problem, known also as the circular strip cutting/ packing problem. We first propose an open strip generation solution procedure that uses the best local position rule into the open strip. Second, we propose a simple augmented version of the first algorithm by introducing an exchange-order strategy. Third, we propose a hybrid algorithm that combines beam search and a series of target values belonging to a predetermined interval search. We evaluate the performance of these algorithms on several instances varying from small to large ones. Encouraging results have been obtained.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.