A New Software System for Optimizing the Operations at a Container Terminal

This paper describes the procedures implemented in the software system developed for the CONTRAST project to optimize the logistic operations at a container terminal. In particular, we consider the problems of minimizing the number of reshuffle operations and designing the routes of the vehicles inside the yard. Minimizing the number of reshuffle operations required to empty a container yard is addressed in the literature as the Block Relocation Problem and it is known to be NP-hard. Here we implemented two heuristic procedures that provide feasible solutions to the problem when new containers enter the yard or when some container must be reallocated for any reason.

[1]  Tonguç Ünlüyurt,et al.  Improved Rehandling Strategies for the Container Retrieval Process , 2012 .

[2]  Stefan Voß,et al.  An improved mathematical formulation for the blocks relocation problem , 2015, Eur. J. Oper. Res..

[3]  Tiziano Bacci,et al.  A New Lower Bound for the Block Relocation Problem , 2018, ICCL.

[4]  Stefan Voß,et al.  A mathematical formulation and complexity considerations for the blocks relocation problem , 2012, Eur. J. Oper. Res..

[5]  Sigrid Knust,et al.  Loading, unloading and premarshalling of stacks in storage areas: Survey and classification , 2014, Eur. J. Oper. Res..

[6]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[7]  Tiziano Bacci,et al.  Some Complexity Results for the Minimum Blocking Items Problem , 2017 .

[8]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[9]  Stefan Voß,et al.  A chain heuristic for the Blocks Relocation Problem , 2014, Comput. Ind. Eng..

[10]  Cynthia Barnhart,et al.  A new binary formulation of the restricted Container Relocation Problem based on a binary encoding of configurations , 2017, Eur. J. Oper. Res..

[11]  Gianpaolo Oriolo,et al.  Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem , 2010, Theor. Comput. Sci..

[12]  D. Ambrosino,et al.  How to reduce the impact of container flows generated by a maritime terminal on urban transport , 2011 .

[13]  Klaus Jansen,et al.  The mutual exclusion scheduling problem for permutation and comparability graphs , 1998, Inf. Comput..

[14]  E. Lawler,et al.  Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1986 .

[15]  Tiziano Bacci,et al.  The bounded beam search algorithm for the block relocation problem , 2019, Comput. Oper. Res..

[16]  Andrew Lim,et al.  Iterative Deepening A* Algorithms for the Container Relocation Problem , 2012, IEEE Transactions on Automation Science and Engineering.

[17]  Kees Jan Roodbergen,et al.  Storage yard operations in container terminals: Literature overview, trends, and research directions , 2014, Eur. J. Oper. Res..