Adaptive algorithms for Circular Cutting/packing problems

Hakim Akeb and Mhand Hifi

International Journal of Operational Research, 2009, vol. 6, issue 4, 435-458

Abstract: In this paper, the Circular Cutting (CC)/packing problem is studied. Its objective is to cut/pack a set of circular pieces into a rectangular plate R of dimensions L × W. Each piece's type i, i = 1, . . .,m, is characterised by its radius r_i and its demand b_i. This problem is solved using an adaptive algorithm that combines Beam Search (BS) and various hill-climbing strategies. Decisions at each node of the truncated tree are based on the so-called best local position using a Minimum Local-Distance Position (MLDP) rule. The computational results show, on a set of problem instances of the literature, the effectiveness of the proposed algorithm.

Keywords: approximate algorithms; beam search; BLP; best local position; circular cutting; packing; hill climbing strategies; minimum local distance. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=27152 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijores:v:6:y:2009:i:4:p:435-458

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().