A bottleneck assignment approach to the multiple container loading problem

Michael Eley ()
Additional contact information
Michael Eley: Fraunhofer Institut für Techno- und Wirtschaftsmathematik (ITWM)

A chapter in Container Terminals and Automated Transport Systems, 2005, pp 359-374 from Springer

Abstract: Abstract The container loading problem addresses the question of how to store several three dimensional, rectangular items (e.g. boxes) in one or more containers in such a way that maximum use is made of the container space. The multiple container problem concentrates on the situation where the consignment to be loaded cannot be accommodated in a single container. To minimize the number of required containers the repeated application of a single container approach is often suggested in the literature. In contrast, in this paper an approach based on a set partitioning formulation of the problem is presented. Within this approach a single container algorithm is used to produce alternative loading patterns. This approach easily allows introducing additional aspects, e.g. separation of boxes or complete shipment of boxes.

Keywords: Packing; Container loading; Bottleneck assignment; Additional constraints (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-26686-0_16

Ordering information: This item can be ordered from
http://www.springer.com/9783540266860

DOI: 10.1007/3-540-26686-0_16

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().