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: | , , |
---|---|
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 |
id |
sg-smu-ink.lkcsb_research-3624 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.lkcsb_research-36242015-12-26T14:47:25Z 3-D Container Packing Heuristics LIM, Andrew RODRIGUES, Brian YANG, Y. 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. 2005-03-01T08:00:00Z text https://ink.library.smu.edu.sg/lkcsb_research/2625 info:doi/10.1007/s10489-005-5601-0 https://doi.org/10.1007/s10489-005-5601-0 Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University packing heuristics combinatorial optimization logistics Operations and Supply Chain Management |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
packing heuristics combinatorial optimization logistics Operations and Supply Chain Management |
spellingShingle |
packing heuristics combinatorial optimization logistics Operations and Supply Chain Management LIM, Andrew RODRIGUES, Brian YANG, Y. 3-D Container Packing Heuristics |
description |
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. |
format |
text |
author |
LIM, Andrew RODRIGUES, Brian YANG, Y. |
author_facet |
LIM, Andrew RODRIGUES, Brian YANG, Y. |
author_sort |
LIM, Andrew |
title |
3-D Container Packing Heuristics |
title_short |
3-D Container Packing Heuristics |
title_full |
3-D Container Packing Heuristics |
title_fullStr |
3-D Container Packing Heuristics |
title_full_unstemmed |
3-D Container Packing Heuristics |
title_sort |
3-d container packing heuristics |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2005 |
url |
https://ink.library.smu.edu.sg/lkcsb_research/2625 https://doi.org/10.1007/s10489-005-5601-0 |
_version_ |
1770570493541220352 |