Algorithms for the circular open dimension problem

Hakim Akeb and Mhand Hifi ()
Additional contact information
Hakim Akeb: UPJV - Université de Picardie Jules Verne, ISC Paris - Institut Supérieur du Commerce de Paris
Mhand Hifi: UPJV - Université de Picardie Jules Verne, CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique

Post-Print from HAL

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.; open dimension; Recherche par faisceaux; meilleure position voisine; recherche dichotomique; décope sur bande. (search for similar items in EconPapers)
Date: 2007-11
References: Add references at CitEc
Citations:

Published in 2007

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:hal:journl:halshs-00188289

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().