Liu, Jiamin, Yue, Yong, Dong, Zongran, Maple, Carsten and Keech, Malcolm (2011) A novel hybrid tabu search approach to container loading. Computers & Operations Research, 38 (4). pp. 797-807. doi:10.1016/j.cor.2010.09.002

Research output not available from this repository, contact author.

Request Changes to record.

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.

Item Type:	Journal Article
Divisions:	Faculty of Science > WMG (Formerly the Warwick Manufacturing Group)
Journal or Publication Title:	Computers & Operations Research
Publisher:	Elsevier BV
ISSN:	0305-0548
Official Date:	April 2011
Dates:	Date Event April 2011 Published
Volume:	38
Number:	4
Page Range:	pp. 797-807
DOI:	10.1016/j.cor.2010.09.002
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access

Request changes or add full text files to a record

Repository staff actions (login required)

View Item