Solving the Robust Container Pre-Marshalling Problem
Container terminals across the world sort the containers in the stacks in their yard in a process called pre-marshalling to ensure their efficient retrieval for onward transport. The container pre-marshalling problem (CPMP) has mainly been considered from a deterministic perspective, with containers being assigned an exact exit time from the yard. However, exact exit times are rarely known, and most containers can at best be assigned a time interval in which they are expected to leave. We propose a method for solving the robust CPMP (RCPMP) to optimality that computes a relaxation of the robust problem and leverages this within a solution procedure for the deterministic CPMP. Our method outperforms the state-of-the-art approach on a dataset of 900 RCPMP instances, finding solutions in many cases in under a second.
KeywordsObjective Function Constraint Programming Exit Time Container Terminal Constraint Programming Model
We thank the Paderborn Center for Parallel Computing (PC\(^2\)) for the use of their high-throughput cluster. We also thank the anonymous referees for their valuable comments.
- 10.Jovanovic, R., Tuba, M., Voß, S.: A multi-heuristic approach for solving the pre-marshalling problem. Cent. Eur. J. Oper. Res. (2015)Google Scholar
- 16.Prud’homme, C., Fages, J., Lorca, X.: Choco Documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S (2015)Google Scholar
- 17.Rendl, A., Prandtstetter, M.: Constraint models for the container pre-marshaling problem. In: Katsirelos, G., Quimper, C.-G. (eds.) ModRef 2013: 12th International Workshop on Constraint Modelling and Reformulation, pp. 44–56 (2013)Google Scholar
- 20.Tierney, K., Pacino, D., Voß, S.: Solving the pre-marshalling problem to optimality with A* and IDA*. Flexible Services and Manufacturing (2016, in Press)Google Scholar
- 23.UNCTAD: United Nations Conference on Trade and Development (UNCTAD), Review of maritime transport (2015)Google Scholar
- 27.Zhang, R., Jiang, Z., Yun, W.: Stack pre-marshalling problem: a heuristic-guided branch-and bound algorithm. Int. J. Ind. Eng. Theor. Appl. Pract. 22(5), 509–523 (2015)Google Scholar