Adaptive beam search solution procedures for constained circular cutting problems
Hakim Akeb and
Mhand Hifi ()
Additional contact information
Hakim Akeb: UPJV - Université de Picardie Jules Verne
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 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: Hill-Climbing; Approximate algorithms; beam search; best local position; cutting stock; Hill-Climbing.; Algorithmes approchées; recherche par faisceaux; meilleure position; problème de découpe (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-00187843
Access Statistics for this paper
More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().