3-D Container Packing Heuristics

Publication Type

Journal Article

Publication Date

3-2005

Abstract

In this paper, we study the 3-D container packing problem. The problem is divided into box selection, space selection, box orientation and new space generation sub-problems. As a first step, a basic heuristic is devised. From results using this heuristic, problems are categorized as homogeneous and heterogeneous. Two augmenting heuristics are then formulated to deal with these categories. They are complementary in their capabilities in dealing with a range of practical problems, and in terms of their computational consumption. Results using our algorithms exceed the benchmark by 4.5% on average.

Keywords

packing, heuristics, combinatorial optimization, logistics

Discipline

Operations and Supply Chain Management

Research Areas

Operations Management

Publication

Applied Intelligence

Volume

22

Issue

2

First Page

125

Last Page

134

ISSN

0924-669X

Identifier

10.1007/s10489-005-5601-0

Publisher

Springer Verlag

Additional URL

https://doi.org/10.1007/s10489-005-5601-0

Link to Full Text

Share

COinS