2017
DOI: 10.1007/978-3-319-55792-2_10
|View full text |Cite
|
Sign up to set email alerts
|

An Online Packing Heuristic for the Three-Dimensional Container Loading Problem in Dynamic Environments and the Physical Internet

Abstract: The version presented here may differ from the published version or from the version of the record. Please see the repository URL above for details on accessing the published version and note that access may require a subscription.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
24
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 27 publications
(26 citation statements)
references
References 30 publications
0
24
0
Order By: Relevance
“…Training on a spatial resolution of 100 × 100 takes about 12 hours and a single decision time is less than 10 ms. We compare our method with some state-of-the-art online bin packing methods to demonstrate the superiority. OnlineBPH [17] and OnlineDRL [50] are two representatives, where OnlineBPH is non-learning based and OnlineDRL learns how to pack from the data. [50] also proposes a heuristic baseline called boundary rule method.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Training on a spatial resolution of 100 × 100 takes about 12 hours and a single decision time is less than 10 ms. We compare our method with some state-of-the-art online bin packing methods to demonstrate the superiority. OnlineBPH [17] and OnlineDRL [50] are two representatives, where OnlineBPH is non-learning based and OnlineDRL learns how to pack from the data. [50] also proposes a heuristic baseline called boundary rule method.…”
Section: Methodsmentioning
confidence: 99%
“…Similar strategies have also been adapted to Online BPP works like [17,20,46,50]. Different from the offline setting, the size information of coming items is unknown for the agent to optimize the packing and the packing order can not be adjusted as well.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The previous studies successfully implemented online packing processes. Some have employed the fine-tuned heuristics based on the product packing routine [ 16 , 17 , 18 ] and the others have actively used deep reinforcement learning for their methods to learn how to pack things effectively themselves through trials and errors [ 11 , 19 , 20 , 21 ]. However, due to the high computational load of online optimization or learning complexity, objects have been assumed to be boxes without rotations or 3D problem has been decomposed into multiple 2D problems by packing objects layer by layer.…”
Section: Related Workmentioning
confidence: 99%
“…In such settings, for an inexpensive practical robotic automation, it is mostly assumed that the previously settled items cannot be readjusted, and a new incoming package cannot be put under the previous packages since such locations are usually difficult and expensive for robots to accesswhich we refer to as practicalrobotic constraint. An algorithm based on the empty maximal space approach has been proposed in [8] to solve an online 3D BPP for rectangular shapes. The empty maximal space strategy may lead to a highly sub-optimal solution.…”
Section: Introductionmentioning
confidence: 99%