Hybrid Artificial Bee Algorithm and Hybrid Differential Evolutionary Algorithm for Container Loading ProblemsTri Thanh- Le
Solving 3D-Container Loading Problems (in C, C#, VS2015) is a part of the project “UK-Vietnam institutional link in digital innovation for sustainable maritime logistics in Vietnam” funded by the UK Department of Business, Energy and Industrial Strategies (BEIS) and administered by the British Council under the Newton Institutional Links programme. The work is being extended as a part of the Project “Operational research for green logistics in Vietnam – a UK-Vietnam research collaboration”, funded by the UK BEIS and administered by the Royal Academy of Engineering, under the Newton Research Collaborations Programme (3).
The 3D-Container Loading Problems is to find an orthogonal packing of all items in containers to optimize an objective (cost, number of containers, utilization, etc.). The 3D-CLPs is a NP-hard combinatorial optimization problem where the primary aim is to pack a finite number of items using the least containers possible. It also involves a number of practical constraints and requirements to be satisfied, such as weight, centre of gravity, irregularly shaped bins and priority items. Although many studies have addressed the 3D-BPP, most have focused exclusively on volume utilization and ignored practical requirements, such as operational safety product handling, and the prevention of cargo damage during container shipping. However, in the context of transportation, practical considerations, particularly weight balance, are as important as volume utilization, but with a few exception have addressed it.
Our task is to develop a new operation research algorithm and heuristic for real-world Container Loading Problems to loading goods into containers. The output is connected with a 3D simulation. Experiments showed the results is competitive with previous works in this area and is to be applied to PetroVietnam Corp (https://www.pvoil.com.vn/en-US/pvoil/default.aspx).