A novel hybrid tabu search approach to container loading

Authors:
Jiamin Liu;Yong Yue;Zongran Dong;Carsten Maple;Malcolm Keech
Affiliations:
School of Information Science and Engineering, Shenyang University of Technology, Shenyang 110178, China;Faculty of Creative Arts, Technologies and Science, University of Bedfordshire, Luton LU1 3JU, England, UK;Department of Computer Science and Technology, Dalian Neusoft Institute of Information, Dalian 116023, China;Faculty of Creative Arts, Technologies and Science, University of Bedfordshire, Luton LU1 3JU, England, UK;Faculty of Creative Arts, Technologies and Science, University of Bedfordshire, Luton LU1 3JU, England, UK
Venue:
Computers and Operations Research
Year:
2011

Citing 4
Cited 0

A parallel tabu search algorithm for solving the container loading problem

Parallel Computing - Special issue: Parallel computing in logistics
3-D Container Packing Heuristics

Applied Intelligence
A GRASP Approach to the Container-Loading Problem

IEEE Intelligent Systems
A study of optimal system for multiple-constraint multiple-container packing problems

IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

The container loading problem, which is significant for a number of industrial sectors, aims to obtain a high space utilisation in the container while satisfying practical constraints. This paper presents a novel hybrid tabu search approach to the container loading problem. A loading heuristic is devised to incorporate heuristic strategies with a handling method for remaining spaces to generate optimal loading arrangements of boxes with stability considered. The tabu search technique, which covers the encoding, evaluation criteria and configuration of neighbourhood and candidate solutions, is used to improve the performance of the loading heuristic. Experimental results with benchmark data show that the hybrid approach provides a better space utilisation than the published approaches under the condition of all loaded boxes with one hundred percent support from below. Moreover, it is shown that the hybrid tabu search can solve problems with the constraints of weight limit and weight distribution with real world data.