Skip to main content

Packing rectangles into a fixed size circular container: Constructive and metaheuristic search approaches

Bouzid, Mouaouia Cherif, Salhi, Said (2020) Packing rectangles into a fixed size circular container: Constructive and metaheuristic search approaches. European Journal of Operational Research, . ISSN 0377-2217. (doi:10.1016/j.ejor.2020.02.048) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided) (KAR id:80655)

PDF Author's Accepted Manuscript
Language: English

Restricted to Repository staff only until 5 March 2022.

Creative Commons Licence
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Contact us about this Publication
[img]
Official URL
https://doi.org/10.1016/j.ejor.2020.02.048

Abstract

We investigate the orthogonal packing of rectangular objects into a circular container of fixed radius. We propose a new constructive heuristic called pack which builds a feasible packing starting from an ordered list of rectangles. This decoding procedure is polynomial and permits to move from the permutations search space to the packings search space by means of simple combinatorial moves combined with powerful geometrical analytical forms. The pack procedure is integrated into two well known metaheuristics, namely, a variable neighbourhood search (VNS) and a simulated annealing (SA). Two variants, namely xVNS and xSA, which stand as accelerated versions of VNS and SA are also presented. The proposed methodology produces 32 new best solutions out of the 54 benchmark instances while requiring less computational effort than the state-of-the-art method. In addition, we conduct experiments on newly generated larger instances which we have made publicly available alongside their respective results obtained from the proposed metaheuristics.

Item Type: Article
DOI/Identification number: 10.1016/j.ejor.2020.02.048
Uncontrolled keywords: Rectangle packing, Fixed size circular container, Constructive heuristic, Variable neighbourhood search, Simulated annealing
Subjects: H Social Sciences
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Faculties > Social Sciences > Kent Business School > Centre for Logistics and Heuristic Organisation (CLHO)
Depositing User: Said Salhi
Date Deposited: 30 Mar 2020 11:46 UTC
Last Modified: 30 Mar 2020 11:47 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/80655 (The current URI for this page, for reference purposes)
Salhi, Said: https://orcid.org/0000-0002-3384-5240
  • Depositors only (login required):

Downloads

Downloads per month over past year