Algorithms for the circular open dimension problem

Hakim Akeb and Mhand Hifi
Additional contact information
Hakim Akeb: Institut Sup rieur du Commerce et Universit de Picardie
Mhand Hifi: Universit de Picardie et Centre d'Economie de la Sorbonne

Documents de travail du Centre d'Economie de la Sorbonne from Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne

Abstract: 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

Keywords: Beam search; best local position; dichotomous search; strip cutting/packing; open dimension (search for similar items in EconPapers)
JEL-codes: C44 C61 C63 (search for similar items in EconPapers)
Pages: 21 pages
Date: 2007-11
References: Add references at CitEc
Citations:

Downloads: (external link)
https://shs.hal.science/halshs-00188289 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:mse:cesdoc:b07059

Access Statistics for this paper

More papers in Documents de travail du Centre d'Economie de la Sorbonne from Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne Contact information at EDIRC.
Bibliographic data for series maintained by Lucie Label ().