IDEAS home Printed from https://ideas.repec.org/p/mse/cesdoc/b07059.html
   My bibliography  Save this paper

Algorithms for the circular open dimension problem

Author

Listed:

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

Suggested Citation

  • Hakim Akeb & Mhand Hifi, 2007. "Algorithms for the circular open dimension problem," Documents de travail du Centre d'Economie de la Sorbonne b07059, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    • Handle: RePEc:mse:cesdoc:b07059
    as

    Download full text from publisher

    File URL: ftp://mse.univ-paris1.fr/pub/mse/CES2007/2007059B.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Beam search; best local position; dichotomous search; strip cutting/packing; open dimension;
    All these keywords.

    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

    Statistics

    Access and download statistics

    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:mse:cesdoc:b07059. 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: Lucie Label (email available below). General contact details of provider: https://edirc.repec.org/data/cenp1fr.html .

    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.