The University of Southampton
University of Southampton Institutional Repository

Matheuristics for the irregular bin packing problem with free rotations

Matheuristics for the irregular bin packing problem with free rotations
Matheuristics for the irregular bin packing problem with free rotations
We present a number of variants of a constructive algorithm able to solve a wide variety of variants of the Two-Dimensional Irregular Bin Packing Problem (2DIBPP). The aim of the 2DIBPP is to pack a set of irregular pieces, which may have concavities, into stock sheets (bins) with fixed dimensions in such a way that the utilization is maximized. This problem is inspired by a real application from a ceramic company in Spain. In addition, this problem arises in other industries such as the garment industry or ship building. The constructive procedure presented in this paper allows both free orientation for the pieces, as in the case of the ceramic industry, or a finite set of orientations as in the case of the garment industry. We explicitly model the assignment of pieces to bins and compare with the more common strategy of packing bins sequentially. There are very few papers in the literature that address the bin packing problem with irregular pieces and to our knowledge this is the first to additionally consider free rotation of pieces with bin packing. We propose several Integer Programing models to determine the association between pieces and bins and then we use a Mixed Integer Programing model for placing the pieces into the bins. The computational results show that the algorithm obtains high quality results in sets of instances with different properties. We have used both industry data and the available data in the literature of 2D irregular strip packing and bin packing problems.
0377-2217
440-455
Martinez Sykora, A.
2f9989e1-7860-4163-996c-b1e6f21d5bed
Alvarez-Valdes, R.
dc4255a8-e54b-4686-a7cf-0a5a4eae87cb
Bennell, J.
38d924bc-c870-4641-9448-1ac8dd663a30
Ruiz, R.
d2191e20-ca34-4da1-aa3a-6d3ec387b8db
Tamarit, J.M.
2e3ebe27-c1c9-459e-b846-dbe44d82bf62
Martinez Sykora, A.
2f9989e1-7860-4163-996c-b1e6f21d5bed
Alvarez-Valdes, R.
dc4255a8-e54b-4686-a7cf-0a5a4eae87cb
Bennell, J.
38d924bc-c870-4641-9448-1ac8dd663a30
Ruiz, R.
d2191e20-ca34-4da1-aa3a-6d3ec387b8db
Tamarit, J.M.
2e3ebe27-c1c9-459e-b846-dbe44d82bf62

Martinez Sykora, A., Alvarez-Valdes, R., Bennell, J., Ruiz, R. and Tamarit, J.M. (2017) Matheuristics for the irregular bin packing problem with free rotations. European Journal of Operational Research, 258 (2), 440-455. (doi:10.1016/j.ejor.2016.09.043).

Record type: Article

Abstract

We present a number of variants of a constructive algorithm able to solve a wide variety of variants of the Two-Dimensional Irregular Bin Packing Problem (2DIBPP). The aim of the 2DIBPP is to pack a set of irregular pieces, which may have concavities, into stock sheets (bins) with fixed dimensions in such a way that the utilization is maximized. This problem is inspired by a real application from a ceramic company in Spain. In addition, this problem arises in other industries such as the garment industry or ship building. The constructive procedure presented in this paper allows both free orientation for the pieces, as in the case of the ceramic industry, or a finite set of orientations as in the case of the garment industry. We explicitly model the assignment of pieces to bins and compare with the more common strategy of packing bins sequentially. There are very few papers in the literature that address the bin packing problem with irregular pieces and to our knowledge this is the first to additionally consider free rotation of pieces with bin packing. We propose several Integer Programing models to determine the association between pieces and bins and then we use a Mixed Integer Programing model for placing the pieces into the bins. The computational results show that the algorithm obtains high quality results in sets of instances with different properties. We have used both industry data and the available data in the literature of 2D irregular strip packing and bin packing problems.

Text
BCP-EJOR.pdf - Accepted Manuscript
Download (219kB)

More information

Accepted/In Press date: 25 September 2016
e-pub ahead of print date: 28 September 2016
Published date: 16 April 2017
Organisations: Southampton Business School

Identifiers

Local EPrints ID: 400806
URI: https://eprints.soton.ac.uk/id/eprint/400806
ISSN: 0377-2217
PURE UUID: 3421e7f1-d0dc-4711-a54c-608746ce94b9
ORCID for A. Martinez Sykora: ORCID iD orcid.org/0000-0002-2435-3113

Catalogue record

Date deposited: 27 Sep 2016 15:06
Last modified: 17 Sep 2019 05:14

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×