Bisira, Hammed and Salhi, Abdellah (2021) 'Reshuffle minimisation to improve storage yard operations efficiency.' Journal of Algorithms and Computational Technology, 15. p. 174830262199401. ISSN 1748-3018

Preview

Text 1748302621994010.pdf - Published Version Available under License Creative Commons Attribution. Download (345kB) | Preview

Abstract

There are many ways to measure the efficiency of the storage area management in container terminals. These include minimising the need for container reshuffle especially at the yard level. In this paper, we consider the container reshuffle problem for stacking and retrieving containers. The problem was represented as a binary integer programming model and solved exactly. However, the exact method was not able to return results for large instances. We therefore considered a heuristic approach. A number of heuristics were implemented and compared on static and dynamic reshuffle problems including four new heuristics introduced here. Since heuristics are known to be instance dependent, we proposed a compatibility test to evaluate how well they work when combined to solve a reshuffle problem. Computational results of our methods on realistic instances are reported to be competitive and satisfactory.

Item Type:	Article
Uncontrolled Keywords:	Reshuffle, retrieval, container terminal, binary integer programming, heuristic
Divisions:	Faculty of Science and Health Faculty of Science and Health > Mathematical Sciences, Department of
SWORD Depositor:	Elements
Depositing User:	Elements
Date Deposited:	12 Mar 2021 16:08
Last Modified:	06 Jan 2022 14:22
URI:	http://repository.essex.ac.uk/id/eprint/30038

Actions (login required)

View Item