New Lower Bounds for the Three-dimensional Orthogonal Bin Packing Problem
碩士 === 國立清華大學 === 工業工程與工程管理學系 === 100 === In this thesis, we consider the three-dimensional orthogonal bin packing problem, which is a generalization of the well-known bin packing problem. The problem is useful to many practical applications, such as logistics industry, transportation industry and m...
Main Authors: | Hsu, Chia-Hung, 許嘉紘 |
---|---|
Other Authors: | Liao, Chung-Shou |
Format: | Others |
Language: | zh-TW |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/19567516351731080013 |
Similar Items
-
Two-Dimensional Bin Packing Problem with Guillotine Restrictions
by: Pietrobuoni, Enrico <1986>
Published: (2015) -
Meta-heuristic Algorithms for Three-dimensional Bin Packing Problem with Stability and Weight Distribution
by: Chih-Yang Kao, et al.
Published: (2019) -
New collaborative approaches for bin-packing problems
by: Clautiaux, François
Published: (2010) -
Combinatorial Bin Packing Problems
by: Nielsen, Torben Noerup
Published: (1985) -
An Adaptive Fitness-Dependent Optimizer for the One-Dimensional Bin Packing Problem
by: Diaa Salama Abdul-Minaam, et al.
Published: (2020-01-01)