Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
On-line three-dimensional packing problems: A review of off-line and on-line solution approaches
Abstract Three-Dimensional Packing Problems (3D-PPs) can be applied to effectively
reduce logistics costs in various areas, such as airline cargo management and warehouse …
reduce logistics costs in various areas, such as airline cargo management and warehouse …
A comparative review of 3D container loading algorithms
X Zhao, JA Bennell, T Bektaş… - … in Operational Research, 2016 - Wiley Online Library
Three‐dimensional cutting and packing problems have a range of important applications
and are of particular relevance to the transportation of cargo in the form of container loading …
and are of particular relevance to the transportation of cargo in the form of container loading …
Solving 3D packing problem using Transformer network and reinforcement learning
Q Que, F Yang, D Zhang - Expert Systems with Applications, 2023 - Elsevier
The three-dimensional packing problem (3D-PP) is a classic NP-hard problem in operations
research and computer science. One of the most popular ways to solve the problem is …
research and computer science. One of the most popular ways to solve the problem is …
Heuristics for online three-dimensional packing problems and algorithm selection framework for semi-online with full look-ahead
In online three-dimensional packing problems (3D-PPs), unlike offline problems, items arrive
sequentially and require immediate packing decisions without any information about the …
sequentially and require immediate packing decisions without any information about the …
3D dynamic heterogeneous robotic palletization problem
This paper proposes a practical robotic packing system to automate packing heterogeneous
carton boxes into pallets, which is still handled manually in many distribution centers. The …
carton boxes into pallets, which is still handled manually in many distribution centers. The …
Three-dimensional bin packing and mixed-case palletization
S Elhedhli, F Gzara, B Yildiz - INFORMS Journal on …, 2019 - pubsonline.informs.org
Despite its wide range of applications, the three-dimensional bin-packing problem is still one
of the most difficult optimization problems to solve. Currently, medium-to large-size instances …
of the most difficult optimization problems to solve. Currently, medium-to large-size instances …
An adaptive variable neighborhood search for a heterogeneous fleet vehicle routing problem with three-dimensional loading constraints
The paper addresses the heterogeneous fleet vehicle routing problem with three-
dimensional (3D) loading constraints (3L-HFVRP), a new practical variant of the combined …
dimensional (3D) loading constraints (3L-HFVRP), a new practical variant of the combined …
A multi-heuristic algorithm for multi-container 3-d bin packing problem optimization using real world constraints
With the growing demand for sustainable and optimal packaging solutions, this study
proposes a novel two-stage algorithm for the multi-container three-dimensional bin packing …
proposes a novel two-stage algorithm for the multi-container three-dimensional bin packing …
A beam search approach to the container loading problem
The single container loading problem is a three-dimensional packing problem in which a
container has to be filled with a set of boxes. The objective is to maximize the space …
container has to be filled with a set of boxes. The objective is to maximize the space …
A container loading algorithm with static mechanical equilibrium stability constraints
Abstract The Container Loading Problem (CLP) literature has traditionally guaranteed cargo
static stability by imposing the full support constraint for the base of the box. Used as a proxy …
static stability by imposing the full support constraint for the base of the box. Used as a proxy …