Adaptive beam search solution procedures for constrained circular cutting problems

Hakim Akeb and Mhand Hifi
Additional contact information
Hakim Akeb: Université de Picardie Jules Verne
Mhand Hifi: 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 study the constrained circular cutting problem whose objective is to cut a set of circular pieces into a rectangular plate R of dimensions L W. Each piece's type i, i = 1, ..., m is caracterized by its radius r(i) and its demand b(i). This problem is solved using an adaptive algorithm that combines beam search and various Hill-Climbing strategies. Decisions at each node of the truncated tree are based on the so-called best local position. The computational results show, on a set of problem instances of the literature, the effectiveness of the proposed algorithm

Keywords: Approximate algorithms; beam search; best local position; cutting stock; Hill-Climbing (search for similar items in EconPapers)
JEL-codes: C44 C61 C63 (search for similar items in EconPapers)
Pages: 21 pages
Date: 2007-11
New Economics Papers: this item is included in nep-cmp
References: Add references at CitEc
Citations:

Downloads: (external link)
https://shs.hal.science/halshs-00187843 (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:b07052

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 ().