IDEAS home Printed from
   My bibliography  Save this paper

Adaptive beam search solution procedures for constrained circular cutting problems




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.

Suggested Citation

  • Hakim Akeb & Mhand Hifi, 2007. "Adaptive beam search solution procedures for constrained circular cutting problems," Documents de travail du Centre d'Economie de la Sorbonne b07052, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
  • Handle: RePEc:mse:cesdoc:b07052

    Download full text from publisher

    File URL:
    Download Restriction: no

    More about this item


    Approximate algorithms; beam search; best local position; cutting stock; Hill-Climbing.;

    JEL classification:

    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mse:cesdoc:b07052. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lucie Label). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.