Heuristic algorithms for container pre-marshalling problems

Authors:
Shan-Huen Huang;Tsan-Hwan Lin
Affiliations:
Department of Logistics Management, National Kaohsiung First University of Science and Technology, No. 2, Juoyue Road, Nantz District, Kaohsiung 811, Taiwan;Department of Logistics Management, National Kaohsiung First University of Science and Technology, No. 2, Juoyue Road, Nantz District, Kaohsiung 811, Taiwan
Venue:
Computers and Industrial Engineering
Year:
2012

Citing 4
Cited 1

Evaluation of the number of rehandles in container yards

Computers and Industrial Engineering - Special issue: new advances in analysis of manufacturing systems
Re-marshaling export containers in port container terminals

ICC&IE Selected papers from the 22nd ICC&IE conference on Computers & industrial engineering
An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals

Transportation Science
An optimization model for the container pre-marshalling problem

Computers and Operations Research

Simulation for performance evaluation of the housekeeping process

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

A container pre-marshalling problem is to find a sequence of container movements to reach final container layout satisfying certain conditions. Two container pre-marshalling problems that are denoted as problem Type-A and Type-B are defined in this paper. Two labelling algorithms, which denote as Heuristic-A and Heuristic-B, are proposed to solve these two container pre-marshalling problems, respectively. Experiments retrieved from past literature and generated by computer program are used to verify the performance of the two algorithms. According to the output results, these proposed algorithms are able to yield a competitive solution in comparison with other methods. Computational results and model variations are discussed.