References

Budipriyanto, A., B. Wirjodirdjo, N. Pujawan and S. Gurning, 2015. Berth allocation problem under uncertainty: A conceptual model using collaborative approach. Proc. Manuf., 4: 429-437.
CrossRef  |  Direct Link  |  

Buhrkal, K., S. Zuglian, S. Ropke, J. Larsen and R. Lusby, 2011. Models for the discrete berth allocation problem: A computational comparison. Transp. Res. Part E: Logist. Transp. Rev., 47: 461-473.
CrossRef  |  

Cordeau, J.F., G. Laporte, P. Legato and L. Moccia, 2005. Models and tabu search heuristics for the berth-allocation problem. Transp. Sci., 39: 526-538.
CrossRef  |  

De Oliveira, R.M., G.R. Mauri and L.A. Nogueira Lorena, 2012. Clustering search for the berth allocation problem. Exp. Syst. Appl., 39: 5499-5505.
CrossRef  |  

Hu, Z.H., 2015. Heuristics for solving continuous berth allocation problem considering periodic balancing utilization of cranes. Comput. Ind. Eng., 85: 216-226.
CrossRef  |  Direct Link  |  

Ierapetritou, M.G., S. Theofanis, M. Boile, G.K. Saharidis and M.M. Golias, 2009. The berth allocation problem: Optimizing vessel arrival time. Mar. Econ. Logist., 11: 356-377.
CrossRef  |  Direct Link  |  

Imai, A., E. Nishimura and S. Papadimitriou, 2001. The dynamic berth allocation problem for a container port. Transp. Res. B: Methodol., 354: 401-417.

Imai, A., E. Nishimura and S. Papadimitriou, 2003. Berth allocation with service priority. Trans. Res. Part B Methodol., 37: 437-457.
CrossRef  |  Direct Link  |  

Imai, A., E. Nishimura and S. Papadimitriou, 2013. Marine container terminal configurations for efficient handling of mega-containerships. Transport. Res. Part E: Logist. Transport. Rev., 49: 141-158.
CrossRef  |  

Kim, K.H. and K.C. Moon, 2003. Berth scheduling by simulated annealing. Transp. Res. Part B: Methodol., 37: 541-560.
CrossRef  |  

Lin, S.W., C.J. Ting and K.C. Wu, 2018. Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem. Flexible Serv. Manuf. J., 30: 740-763.
CrossRef  |  Direct Link  |  

Nishi, T., T. Okura, E. Lalla-Ruiz and S. VoB, 2016. A dynamic programming-based matheuristic for the dynamic berth allocation problem. Ann. Oper. Res., 1: 1-20.
CrossRef  |  Direct Link  |  

Theofanis, S., M. Boile and M. Golias, 2007. An optimization based genetic algorithm heuristic for the berth allocation problem. Proceedings of the IEEE Congress on Evolutionary Computation, September 25-28, 2007, IEEE Computer Society, Singapore, pp: 4439-4445.

Umang, N., M. Bierlaire and I. Vacca, 2013. Exact and heuristic methods to solve the berth allocation problem in bulk ports. Trans. Res. Part E Logist. Rev., 54: 14-31.
CrossRef  |  Direct Link  |  

Yang, X.S., 2010. A new metaheuristic bat-inspired algorithm. Stud. Comput. Intell., 284: 65-74.
CrossRef  |  Direct Link  |