Adaptive beam search solution procedures for constrained circular cutting problems
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne in its series Documents de travail du Centre d'Economie de la Sorbonne with number b07052.
Length: 21 pages
Date of creation: Nov 2007
Date of revision:
Contact details of provider:
Postal: 106-112 boulevard de l'Hôpital 75 647 PARIS CEDEX 13
Phone: + 33 44 07 81 00
Fax: + 33 1 44 07 83 01
Web page: http://centredeconomiesorbonne.univ-paris1.fr/
More information through EDIRC
Approximate algorithms; beam search; best local position; cutting stock; Hill-Climbing.;
Find related papers by 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
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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).
If references are entirely missing, you can add them using this form.