IDEAS home Printed from https://ideas.repec.org/p/hal/cesptp/halshs-00187843.html
   My bibliography  Save this paper

Adaptive beam search solution procedures for constained circular cutting problems

Author

Listed:
  • 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)

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.

Suggested Citation

  • Hakim Akeb & Mhand Hifi, 2007. "Adaptive beam search solution procedures for constained circular cutting problems," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00187843, HAL.
    • Handle: RePEc:hal:cesptp:halshs-00187843
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    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:hal:cesptp:halshs-00187843. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.