Abstract
Port terminals processing large cargo vessels play an important role in bulk material supply chains. This paper addresses the question of how to allocate vessels to a location on a berth and the sequence in which the vessels should be processed in order to minimize delays. An important consideration in the berth allocation is the presence of tidal constraints that limit the departure of fully loaded vessels from the terminal. We show how the berth allocation problem can be modeled as an integer program and discuss a number of ways to tighten the formulation in order to make it computationally tractable. In addition, a two-phase method is developed for solving these problems. Empirical computational results demonstrate an order of magnitude improvement in performance. The two new approaches can solve significantly larger instances, producing faster solutions for small instances and much tighter bounds for large instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abdekhodaee, A., & Wirth, W. (2013). Off-line scheduling with forbidden zones. Computers & Operations Research, 40, 1034–1037.
Arahori, Y., Imamichi, T., & Nagamochi, H. (2012). An exact strip packing algorithm based on canonical forms. Computers & Operations Research, 39, 2991–3011.
Barros, V. H., Costa, T. S., Oliveira, A. C. M., & Lorena, L. A. N. (2011). Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Computers & Industrial Engineering, 60, 606–613.
Castro, P. M., & Oliveira, J. F. (2011). Scheduling inspired models for two-dimensional packing problems. European Journal of Operational Research, 215, 45–56.
Cordeau, J.-F., Laporte, G., Legato, P., & Moccia, L. (2005). Models and tabu search heuristics for the berth-allocation problem. Transportation Science, 39, 526–538.
Du, Y., Chen, Q., Lam, J. S. L., Xu, Y., & Cao, J. X. (2015). Modeling the impacts of tides and the virtual arrival policy in berth allocation. Transportation Science, 49, 939–956.
Guan, Y., & Cheung, R. K. (2004). The berth allocation problem: Models and solution methods. OR Spectrum, 26, 75–92.
Guan, Y., Xiao, W. Q., Cheung, R. K., & Li, C. L. (2002). A multiprocessor task scheduling model for berth allocation: Heuristic and worst case analysis. Operations Research Letters, 30, 343–350.
Haouari, M., Kooli, A., & Néron, E. (2012). Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem. Computers & Operations Research, 39(5), 1187–1194.
Imai, A., Sun, X., Nishimura, E., & Papadimitriou, S. (2005). Berth allocation in a container port: Using a continuous location space approach. Transportation Research Part B, 39, 199–221.
Kim, K. H., & Moon, K. C. (2003). Berth scheduling by simulated annealing. Transportation Research Part B, 37, 541–560.
Lee, D.-H., Chen, J. H., & Cao, J. X. (2010). The continuous berth allocation problem: A greedy randomized adaptive search solution. Transportation Research Part E, 46, 1017–1029.
Li, C. L., Cai, X. Q., & Lee, C. Y. (1998). Scheduling with multiple-job-on-one processor pattern. IIE Transactions, 30, 433–445.
Lim, A. (1998). The berth planning problem. Operations Research Letters, 22, 105–110.
Nishimura, E., Imai, A., & Papadimitriou, S. (2001). Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research, 131, 282–292.
Singh, G., Ernst, A. T., Baxter, M., & Sier, D. (2015). Rail schedule optimisation in The Hunter Valley Coal Chain. RAIRO-Operationas Research, 49, 413–434.
Singh, G., Sier, D., Ernst, A. T., Gavriliouk, O., Oyston, R., Giles, T., et al. (2011). A mixed integer programming model for long term capacity expansion planning: A case study from The Hunter Valley Coal Chain. European Journal of Operational Research, 220, 210–224.
Umang, N., Bierlaire, M., & Vacca, I. (2013). Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transportation Research Part E, 54, 14–31.
UNCTAD. (2015). Review of maritime transport. United Nations Conference on Trade and Development. http://unctad.org/en/PublicationsLibrary/rmt2015_en.
Xu, D., Li, C.-L., & Leung, J. Y.-T. (2012). Berth allocation with time-dependent physical limitations on vessels. European Journal of Operational Research, 216, 47–56.
Acknowledgements
The work described in this paper was supported in part by TÜBİTAK Grant 113M486 for Ceyda Oğuz and Gita Taherkhani. Ceyda Oğuz also acknowledges the support of Visiting Scholar Program 2014 of Koc University.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ernst, A.T., Oğuz, C., Singh, G. et al. Mathematical models for the berth allocation problem in dry bulk terminals. J Sched 20, 459–473 (2017). https://doi.org/10.1007/s10951-017-0510-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-017-0510-8