Constraints in container loading–A state-of-the-art review

A Bortfeldt, G Wäscher - European Journal of Operational Research, 2013 - Elsevier
Container loading is a pivotal function for operating supply chains efficiently.
Underperformance results in unnecessary costs (eg cost of additional containers to be …

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 …

The exact solutions of several types of container loading problems

DV Kurpel, CT Scarpin, JEP Junior… - European Journal of …, 2020 - Elsevier
In this paper, we address multiple container loading problems, consisting of placing
rectangular boxes, orthogonally and without overlap**, inside containers in order to …

[HTML][HTML] A large neighbourhood search algorithm for solving container loading problems

Ö Şafak, G Erdoğan - Computers & Operations Research, 2023 - Elsevier
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 …

Effects of memory and genetic operators on Artificial Bee Colony algorithm for Single Container Loading problem

T Bayraktar, F Ersöz, C Kubat - Applied Soft Computing, 2021 - Elsevier
Abstract The Artificial Bee Colony (ABC) algorithm is widely used to achieve optimum
solution in a short time in integer-based optimization problems. However, the complexity of …

A three-dimensional adaptive PSO-based packing algorithm for an IoT-based automated e-fulfillment packaging system

THS Li, CY Liu, PH Kuo, NC Fang, CH Li… - Ieee …, 2017 - ieeexplore.ieee.org
With the development of online shop** and the demand for automated packaging
systems, we propose an Internet of Things (IoT)-based automated e-fulfillment packaging …

A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem

TAM Toffolo, E Esprit, T Wauters, GV Berghe - European Journal of …, 2017 - Elsevier
Efficient container loading has the potential to considerably reduce logistics and
transportation costs. The container loading problem is computationally complex and, despite …

MIP-based constructive heuristics for the three-dimensional Bin Packing Problem with transportation constraints

C Paquay, S Limbourg, M Schyns… - International Journal of …, 2018 - Taylor & Francis
This article is about seeking a good feasible solution in a reasonable amount of computation
time to the three-dimensional Multiple Bin Size Bin Packing Problem (MBSBPP). The …

Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review

CA Vega-Mejía, JR Montoya-Torres… - Annals of Operations …, 2019 - Springer
The current global interest in improving the use of ever-scarcer natural resources calls for
the re-alignment of supply chain operations to include not only economic factors, but …

A new iterative-doubling Greedy–Lookahead algorithm for the single container loading problem

W Zhu, A Lim - European Journal of Operational Research, 2012 - Elsevier
The aim of the Single Container Loading Problem (SCLP) is to pack three-dimensional
boxes into a three-dimensional container so as to maximize the volume utilization of the …