3-D Container Packing Heuristics
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...
Saved in:
Main Authors: | LIM, Andrew, RODRIGUES, Brian, YANG, Y. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2005
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/2625 https://doi.org/10.1007/s10489-005-5601-0 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A Multi-Faced Buildup Algorithm for Three-Dimensional Container Packing
by: LIM, Andrew, et al.
Published: (2003) -
A multi-faced buildup algorithm for three-dimensional packing problems
by: Lim, A., et al.
Published: (2013) -
The Two-Dimensional Packing Problem for Irregular Objects
by: CHEN, Ping, et al.
Published: (2004) -
Port Space Allocation with a Time Dimension
by: FU, Zhaohui, et al.
Published: (2007) -
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
by: GUO, Yunsong, et al.
Published: (2006)