A feasibility-based heuristic for the container pre-marshalling problem

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review

11 Scopus Citations
View graph of relations

Author(s)

  • Ning Wang
  • Bo Jin
  • Zizhen Zhang
  • Andrew Lim

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)90-101
Journal / PublicationEuropean Journal of Operational Research
Volume256
Issue number1
Early online date8 Jun 2016
Publication statusPublished - 1 Jan 2017

Abstract

This paper addresses the container pre-marshalling problem (CPMP) which rearranges containers inside a storage bay to a desired layout. By far, target-driven algorithms have relatively good performance among all algorithms; they have two key components: first, containers are rearranged to their desired slots one by one in a certain order; and second, rearranging one container is completed by a sequence of movements. Our paper improves the performance of the target-driven algorithm from both aspects. The proposed heuristic determines the order of container rearrangements by the concepts of state feasibility, container stability, dead-end avoidance and tier-protection proposed in this paper. In addition, we improve the efficiency of performing container rearrangements by discriminating different task types. Computational experiments showcase that the performance of the proposed heuristic is considerable.

Research Area(s)

  • Container pre-marshalling problem, Feasibility-based heuristic, Tier-protection

Citation Format(s)

A feasibility-based heuristic for the container pre-marshalling problem. / Wang, Ning; Jin, Bo; Zhang, Zizhen; Lim, Andrew.

In: European Journal of Operational Research, Vol. 256, No. 1, 01.01.2017, p. 90-101.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review