A Taboo-Search Algorithm for 3D-Binpacking Problem in Containers

Paul Leon; Rony Cueva; Manuel Tupia; Gonçalo Paiva Dias

doi:10.1007/978-3-030-16181-1_22

A Taboo-Search Algorithm for 3D-Binpacking Problem in Containers

Paul Leon, Rony Cueva, Manuel Tupia, Gonçalo Paiva Dias

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

Abstract

One of the biggest challenges facing by logistics companies is the packing of fragile products in containers. These activities, due to the nature of the packaged products, can entail great risks for the company due to the possible losses and the cost of the transporting containers, so-called in literature as bin-packing problem. Being this problem of a complex computational nature (NP-hard), companies do not have exact technological solutions to establish a positional sequence of the packages that have to be arranged in containers, considering aspects such as fragility, weight, volume, among other aspects. In most cases only the volume and order of dispatch is considered. The application of bio-inspired techniques such as metaheuristics are an appropriate way to obtain approximate solutions to this kind of problems, without the difficulties of complex software implementations. In previous works of the authors, bio-inspired algorithms have been developed to solve the problem and in this paper a taboo-search algorithm is proposed to solve the 3D-bin packing variant, which has been compared with the previous algorithms obtaining approximately a waste reduction of 28%. Fundamentally, research has used real data from Peruvian ceramic industry.

Original language	English
Title of host publication	New Knowledge in Information Systems and Technologies - Volume 1
Editors	Luís Paulo Reis, Hojjat Adeli, Sandra Costanzo, Álvaro Rocha
Publisher	Springer Verlag
Pages	229-240
Number of pages	12
ISBN (Print)	9783030161804
DOIs	https://doi.org/10.1007/978-3-030-16181-1_22
State	Published - 2019
Event	World Conference on Information Systems and Technologies, WorldCIST 2019 - Galicia, Spain Duration: 16 Apr 2019 → 19 Apr 2019

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	930
ISSN (Print)	2194-5357
ISSN (Electronic)	2194-5365

Conference

Conference	World Conference on Information Systems and Technologies, WorldCIST 2019
Country/Territory	Spain
City	Galicia
Period	16/04/19 → 19/04/19

Keywords

Bin packing problem
Genetic algorithm
Metaheuristic
Taboo search

Access to Document

10.1007/978-3-030-16181-1_22

Cite this

Leon, P., Cueva, R., Tupia, M., & Paiva Dias, G. (2019). A Taboo-Search Algorithm for 3D-Binpacking Problem in Containers. In L. P. Reis, H. Adeli, S. Costanzo, & Á. Rocha (Eds.), New Knowledge in Information Systems and Technologies - Volume 1 (pp. 229-240). (Advances in Intelligent Systems and Computing; Vol. 930). Springer Verlag. https://doi.org/10.1007/978-3-030-16181-1_22

@inproceedings{f502a4b3193f4755a801d2344f1cd74f,

title = "A Taboo-Search Algorithm for 3D-Binpacking Problem in Containers",

abstract = "One of the biggest challenges facing by logistics companies is the packing of fragile products in containers. These activities, due to the nature of the packaged products, can entail great risks for the company due to the possible losses and the cost of the transporting containers, so-called in literature as bin-packing problem. Being this problem of a complex computational nature (NP-hard), companies do not have exact technological solutions to establish a positional sequence of the packages that have to be arranged in containers, considering aspects such as fragility, weight, volume, among other aspects. In most cases only the volume and order of dispatch is considered. The application of bio-inspired techniques such as metaheuristics are an appropriate way to obtain approximate solutions to this kind of problems, without the difficulties of complex software implementations. In previous works of the authors, bio-inspired algorithms have been developed to solve the problem and in this paper a taboo-search algorithm is proposed to solve the 3D-bin packing variant, which has been compared with the previous algorithms obtaining approximately a waste reduction of 28%. Fundamentally, research has used real data from Peruvian ceramic industry.",

keywords = "Bin packing problem, Genetic algorithm, Metaheuristic, Taboo search",

author = "Paul Leon and Rony Cueva and Manuel Tupia and {Paiva Dias}, Gon{\c c}alo",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.; World Conference on Information Systems and Technologies, WorldCIST 2019 ; Conference date: 16-04-2019 Through 19-04-2019",

year = "2019",

doi = "10.1007/978-3-030-16181-1_22",

language = "English",

isbn = "9783030161804",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "229--240",

editor = "Reis, {Lu{\'i}s Paulo} and Hojjat Adeli and Sandra Costanzo and {\'A}lvaro Rocha",

booktitle = "New Knowledge in Information Systems and Technologies - Volume 1",

}

Leon, P, Cueva, R , Tupia, M & Paiva Dias, G 2019, A Taboo-Search Algorithm for 3D-Binpacking Problem in Containers. in LP Reis, H Adeli, S Costanzo & Á Rocha (eds), New Knowledge in Information Systems and Technologies - Volume 1. Advances in Intelligent Systems and Computing, vol. 930, Springer Verlag, pp. 229-240, World Conference on Information Systems and Technologies, WorldCIST 2019, Galicia, Spain, 16/04/19. https://doi.org/10.1007/978-3-030-16181-1_22

A Taboo-Search Algorithm for 3D-Binpacking Problem in Containers. / Leon, Paul; Cueva, Rony ; Tupia, Manuel et al.
New Knowledge in Information Systems and Technologies - Volume 1. ed. / Luís Paulo Reis; Hojjat Adeli; Sandra Costanzo; Álvaro Rocha. Springer Verlag, 2019. p. 229-240 (Advances in Intelligent Systems and Computing; Vol. 930).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A Taboo-Search Algorithm for 3D-Binpacking Problem in Containers

AU - Leon, Paul

AU - Cueva, Rony

AU - Tupia, Manuel

AU - Paiva Dias, Gonçalo

PY - 2019

Y1 - 2019

N2 - One of the biggest challenges facing by logistics companies is the packing of fragile products in containers. These activities, due to the nature of the packaged products, can entail great risks for the company due to the possible losses and the cost of the transporting containers, so-called in literature as bin-packing problem. Being this problem of a complex computational nature (NP-hard), companies do not have exact technological solutions to establish a positional sequence of the packages that have to be arranged in containers, considering aspects such as fragility, weight, volume, among other aspects. In most cases only the volume and order of dispatch is considered. The application of bio-inspired techniques such as metaheuristics are an appropriate way to obtain approximate solutions to this kind of problems, without the difficulties of complex software implementations. In previous works of the authors, bio-inspired algorithms have been developed to solve the problem and in this paper a taboo-search algorithm is proposed to solve the 3D-bin packing variant, which has been compared with the previous algorithms obtaining approximately a waste reduction of 28%. Fundamentally, research has used real data from Peruvian ceramic industry.

AB - One of the biggest challenges facing by logistics companies is the packing of fragile products in containers. These activities, due to the nature of the packaged products, can entail great risks for the company due to the possible losses and the cost of the transporting containers, so-called in literature as bin-packing problem. Being this problem of a complex computational nature (NP-hard), companies do not have exact technological solutions to establish a positional sequence of the packages that have to be arranged in containers, considering aspects such as fragility, weight, volume, among other aspects. In most cases only the volume and order of dispatch is considered. The application of bio-inspired techniques such as metaheuristics are an appropriate way to obtain approximate solutions to this kind of problems, without the difficulties of complex software implementations. In previous works of the authors, bio-inspired algorithms have been developed to solve the problem and in this paper a taboo-search algorithm is proposed to solve the 3D-bin packing variant, which has been compared with the previous algorithms obtaining approximately a waste reduction of 28%. Fundamentally, research has used real data from Peruvian ceramic industry.

KW - Bin packing problem

KW - Genetic algorithm

KW - Metaheuristic

KW - Taboo search

UR - http://www.scopus.com/inward/record.url?scp=85064860622&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-16181-1_22

DO - 10.1007/978-3-030-16181-1_22

M3 - Conference contribution

AN - SCOPUS:85064860622

SN - 9783030161804

T3 - Advances in Intelligent Systems and Computing

SP - 229

EP - 240

BT - New Knowledge in Information Systems and Technologies - Volume 1

A2 - Reis, Luís Paulo

A2 - Adeli, Hojjat

A2 - Costanzo, Sandra

A2 - Rocha, Álvaro

PB - Springer Verlag

T2 - World Conference on Information Systems and Technologies, WorldCIST 2019

Y2 - 16 April 2019 through 19 April 2019

ER -

A Taboo-Search Algorithm for 3D-Binpacking Problem in Containers

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this