A Review of Berth Allocation Problem in Bulk Terminals

This paper reviews the berth allocation problem (BAP) at bulk terminals. Initially, BAP, its constituent attributes related to spatial aspects, temporal aspects, handling time and performance measures are discussed. A classification of formulation approaches and solving methods is presented. These are discussed with respect to quay layout, i.e., discrete, continuous and hybrid. Majority of the studies minimize the total service times of the vessels followed by completion times and delayed departure times. Discrete bulk BAP models appear to be more robust in terms of the formulation and integration with other processes. Continuous and Hybrid problems have not been considered in detail as much as the Discrete problems. Future works can be explored by incorporating uncertainty, earmarking of berths by cargo type, modelling multiple cargos on same vessel, and indented berths in bulk BAP. Environmental considerations and overall operational integration can also be considered. This can be extended to Inland Water Transport (IWT) terminals. These will have higher applications on terminals in developing countries which majorly deal with bulk cargo.