.png){kind=icon}
Return
An effective placement method for the single container loading problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2016.05.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This study investigates a three-dimensional single container loading problem, which aims to pack a given set of unequal-size rectangular boxes into a single container such that the length of the occupied space in the container is minimized. Motivated by the practical logistics instances in literature, the problem under study is formulated as a zero-one mixed integer linear programming model. Due to the NP-hardness of the studied problem, a simple but effective loading placement heuristic is proposed for solving large-size instances. The experimental results demonstrate that the developed heuristic is capable of solving the instances with more than two hundred boxes and more efficient than the state-of-the-art mixed integer linear program and existing heuristic methods. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Container loading problem
Mixed integer linear program
Heuristic
Loading placement
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
View more organizations
Cited Papers
Assessing Service Quality, Switching Costs and Customer Loyalty in Home-Delivery Services in Taiwan.png)
TRANSPORT REVIEWS
TRANSPORT REVIEWSIF9.9
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave View more