.png){kind=icon}
.png){kind=icon}
Return
A Large Neighbourhood Search Algorithm for Solving Container Loading Problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2023.106199.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a Large Neighbourhood Search (LNS) algorithm that finds an effective packing of a set of items into containers. The aim of the LNS algorithm is to provide packing solutions that can be adopted by many logistics companies. The LNS algorithm can handle a set of side constraints such as orientation, stacking, and separation as well as weight limit, loading priorities, and stability to address the issues arising for loading the items. The packing solution is also visualised and animated using an Excel workbook to help the workers for loading of the items. Finally, the authors present a comparison between the performance of the LNS algorithm and the state-of-the-art algorithms from the literature based on benchmark data sets. The results demonstrate the quality of the solutions achieved by the LNS algorithm.
Keywords:
Container loading problem
Large neighbourhood search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W