2.50
Hdl Handle:
http://hdl.handle.net/10547/250916
Title:
A novel hybrid tabu search approach to container loading
Authors:
Liu, Jiamin; Yue, Yong; Dong, Zongran; Maple, Carsten; Keech, Malcolm
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.
Citation:
Liu, J. et al (2011) 'A novel hybrid tabu search approach to container loading' Computers & Operations Research 38 (4):797-807
Publisher:
Elsevier
Journal:
Computers & Operations Research
Issue Date:
Apr-2011
URI:
http://hdl.handle.net/10547/250916
DOI:
10.1016/j.cor.2010.09.002
Additional Links:
http://linkinghub.elsevier.com/retrieve/pii/S0305054810001917
Type:
Article
Language:
en
ISSN:
0305-0548
Appears in Collections:
Centre for Research in Distributed Technologies (CREDIT)

Full metadata record

DC FieldValue Language
dc.contributor.authorLiu, Jiaminen_GB
dc.contributor.authorYue, Yongen_GB
dc.contributor.authorDong, Zongranen_GB
dc.contributor.authorMaple, Carstenen_GB
dc.contributor.authorKeech, Malcolmen_GB
dc.date.accessioned2012-11-05T10:26:39Zen
dc.date.available2012-11-05T10:26:39Zen
dc.date.issued2011-04en
dc.identifier.citationLiu, J. et al (2011) 'A novel hybrid tabu search approach to container loading' Computers & Operations Research 38 (4):797-807en_GB
dc.identifier.issn0305-0548en
dc.identifier.doi10.1016/j.cor.2010.09.002en
dc.identifier.urihttp://hdl.handle.net/10547/250916en
dc.description.abstractThe 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.en_GB
dc.language.isoenen
dc.publisherElsevieren_GB
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S0305054810001917en_GB
dc.subjectheuristicen_GB
dc.subjecttabu searchen_GB
dc.subjectcontainer loadingen_GB
dc.subjectstabilityen_GB
dc.subjectweight distributionen_GB
dc.titleA novel hybrid tabu search approach to container loadingen
dc.typeArticleen
dc.identifier.journalComputers & Operations Researchen_GB
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.