Heuristics approaches for the industrial Storage Problem

Author

Mezghani, Salma ; Frikha, Ahmed

Author_Institution

LOGIQ Dept., Econ. Sci. & Manage. Fac. of Sfax, Sfax, Tunisia

fYear

2013

fDate

28-30 April 2013

Firstpage

1

Lastpage

4

Abstract

We investigate a real Storage Problem (SP) defined by the Tunisian company. It requires finding the minimum number of bins to pack all the available items (mattresses). Each item has a different sizes (width, height, length) and characteristics (ranges, colors, quantity). The problem is interpreted as Three-Dimensional Variable-Sized Bin Packing Problem (3D-VSBPP). Two heuristics are presented based on Best-Fit Decreasing (BFD) and Next-Fit decreasing (NFD) strategy. Those heuristics are analyzed in case; the number of bins is unlimited. The proposed approaches are analyzed on a real data with up to 9344 items and two bins types.

Keywords

bin packing; greedy algorithms; 3D-VSBPP; BFD strategy; NFD strategy; Tunisian company; best-fit decreasing strategy; next-fit decreasing strategy; real industrial storage problem; three-dimensional variable-sized bin packing problem; Color; Companies; Europe; Genetic algorithms; Heuristic algorithms; Loading; Transportation; BFD; NFD; Variable-Size Bin Packing Problem; storage problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Modeling, Simulation and Applied Optimization (ICMSAO), 2013 5th International Conference on

Conference_Location

Hammamet

Print_ISBN

978-1-4673-5812-5

Type

conf

DOI

10.1109/ICMSAO.2013.6552561

Filename

6552561