References
- Dadashi, A., Dulebenets, M. A., Golias, M. M., & Sheikholeslami, A. (2017). A novel continuous berth scheduling model at multiple marine container terminals with tidal considerations. Maritime Business Review, 2(2), 142–157. https://doi.org/https://doi.org/10.1108/MABR-02-2017-0010
- Dkhil, H., Diarrassouba, I., Benmansour, S., & Yassine, A. (2020). Modelling and solving a berth allocation problem in an automotive transshipment terminal. Journal of the Operational Research Society. https://doi.org/https://doi.org/10.1080/01605682.2019.1685361
- Dulebenets, M. A. (2018). Application of evolutionary computation for berth scheduling at marine container terminals: Parameter tuning versus parameter control. IEEE Transactions on Intelligent Transportation Systems, 19(1), 25–37. https://doi.org/https://doi.org/10.1109/TITS.2017.2688132
- Golias, M., Boile, M., Theofanis, S., & Efstathiou, C. (2010). The berth-scheduling problem: Maximizing berth productivity and minimizing fuel consumption and emissions production. Transportation Research Record: Journal of the Transportation Research Board, 2166(1), 20–27. https://doi.org/https://doi.org/10.3141/2166-03
- Golias, M., Portal, I., Konur, D., Kaisar, E., & Kolomvos, G. (2014). Robust berth scheduling at marine container terminals via hierarchical optimization. Computers & Operations Research, 41, 412–422. https://doi.org/https://doi.org/10.1016/j.cor.2013.07.018
- Golias, M. M., Saharidis, G. K., Boile, M., Theofanis, S., & Ierapetritou, M. G. (2009). The berth allocation problem: Optimizing vessel arrival time. Maritime Economics & Logistics, 11(4), 358–377.https://doi.org/https://doi.org/10.1057/mel.2009.12
- Gutierrez, F., Lujan, E., Asmat, R., & Vergara, E. (2019). Fuzziness in the berth allocation problem. In Said Salhi (ed.), Recent advances in computational optimization (pp. 149–174). Springer.
- Hansen, P., Oğuz, C., & Mladenović, N. (2008). Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research, 191(3), 636–649. https://doi.org/https://doi.org/10.1016/j.ejor.2006.12.057
- Imai, A., Nishimura, E., & Papadimitriou, S. (2008). Berthing ships at a multi-user container terminal with a limited quay capacity. Transportation Research Part E: Logistics and Transportation Review, 44(1), 136–151. https://doi.org/https://doi.org/10.1016/j.tre.2006.05.002
- 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: Methodological, 39(3), 199–221. https://doi.org/https://doi.org/10.1016/j.trb.2004.04.004
- Kavoosi, M., Dulebenets, M. A., Abioye, O. F., Pasha, J., Wang, H., & Chi, H. (2019). An augmented self-adaptive parameter control in evolutionary computation: A case study for the berth scheduling problem. Advanced Engineering Informatics, 42, 100972. https://doi.org/https://doi.org/10.1016/j.aei.2019.100972
- Li, M. W., Hong, W. C., Geng, J., & Wang, J. (2017). Berth and quay crane coordinated scheduling using multi-objective chaos cloud particle swarm optimization algorithm. Neural Computing and Applications, 28(11), 3163–3182. https://doi.org/https://doi.org/10.1007/s00521-016-2226-7
- Mat Tahar, R., & Hussain, K. (2000). Simulation and analysis for the Kelang Container Terminal operations. Logistics Information Management, 13(1), 14–20. https://doi.org/https://doi.org/10.1108/09576050010306350
- Mauri, G., Ribeiro, G., Lorena, L., & Laporte, G. (2016). An adaptive large neighborhood search for the discrete and continuous berth allocation problem. Computers & Operations Research, 70, 140–154. https://doi.org/https://doi.org/10.1016/j.cor.2016.01.002
- Monaco, M. F., & Sammarra, M. (2007). The berth allocation problem: A strong formulation solved by a Lagrangean approach. Transportation Science, 41(2), 265–280. https://doi.org/https://doi.org/10.1287/trsc.1060.0171
- Park, K. T., & Kim, K. H. (2002). Berth scheduling for container terminals by using a sub-gradient optimization technique. Journal of the Operational Research Society, 53(9), 1054–1062. https://doi.org/https://doi.org/10.1057/palgrave.jors.2601412
- Park, Y. M., & Kim, K. H. (2005). A scheduling method for berth and quay cranes. In H.-O. Günther & K. H. Kim (Eds.), Container terminals and automated transport systems (pp. 159–181). Springer.
- Segura, F. G., Segura, E. L., Moreno, E. V., & Uceda, R. A. (2017). A fully fuzzy linear programming model to the berth allocation problem. Annals of Computer Science and Information Systems, 11, 453–458. https://doi.org/https://doi.org/10.15439/2017F339
- Umang, N., Bierlaire, M., & Erera, A. L. (2017). Real-time management of berth allocation with stochastic arrival and handling times. Journal of Scheduling, 20(1), 67–83. https://doi.org/https://doi.org/10.1007/s10951-016-0480-2
- Umang, N., Bierlaire, M., & Vacca, I. (2013). Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transportation Research Part E: Logistics and Transportation Review, 54, 14–31. https://doi.org/https://doi.org/10.1016/j.tre.2013.03.003
- Xiang, X., Liu, C., & Miao, L. (2018). Reactive strategy for discrete berth allocation and quay crane assignment problems under uncertainty. Computers & Industrial Engineering, 126, 196–216. https://doi.org/https://doi.org/10.1016/j.cie.2018.09.033
- Xiaohuan, L., Jin, J. G., & Hu, H. (2020). Berth allocation recovery for container transshipment terminals. Maritime Policy & Management, 47(4), 558–574. https://doi.org/https://doi.org/10.1080/03088839.2020.1725672
- Xu, Y., Du, Y., Li, Y., & Zhang, H. (2018). Collaborative emergency berth scheduling based on decentralized decision and price mechanism. Annals of Operations Research.
- Yıldırım, M. S., Aydın, M. M., & Gökkuş, U. (2020). Simulation optimization of the berth allocation in a container terminal with flexible vessel priority management. Maritime Policy & Management, 47(6), 833–848. https://doi.org/https://doi.org/10.1080/03088839.2020.1730994
- Zeng, Q., Hu, X., Wang, W., & Fang, Y. (2011). Disruption management model and its algorithms for berth allocation problem in container terminals. International Journal of Innovative Computing, Information and Control, 7(5), 2130–2142.
- Zeng, Q., Yang, Z., & Hu, X. (2011). Disruption recovery model for berth and quay crane scheduling in container terminals. Engineering Optimization, 43(9), 967–983. https://doi.org/https://doi.org/10.1080/0305215X.2010.528411
- Zhang, Q., Zeng, Q., & Yang, H. (2016). A lexicographic optimization approach for berth schedule recovery problem in container terminals. TRANSPORT, 31(1), 76–83. https://doi.org/https://doi.org/10.3846/16484142.2016.1125387