References
- Bierwirth, C., & Meisel, F. (2010). A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 202(3), 615–627. https://doi.org/https://doi.org/10.1016/j.ejor.2009.05.031
- Bierwirth, C., & Meisel, F. (2015). A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 244(3), 675–689. https://doi.org/10.1016/j.ejor.2014.12.030
- Carlo, H. J., Vis, I. F. A., & Roodbergen, K. J. (2014). Transport operations in container terminals: Literature overview, trends, research directions and classification scheme. European Journal of Operational Research, 236(1), 1–13. https://doi.org/https://doi.org/10.1016/j.ejor.2013.11.023
- Du, Y., Chen, Q., Quan, X., Long, L., & Fung, R. Y. K. (2011). Berth allocation considering fuel consumption and vessel emissions. Transportation Research Part E: Logistics and Transportation Review, 47(6), 1021–1037. https://doi.org/https://doi.org/10.1016/j.tre.2011.05.011
- Emde, S., & Boysen, N. (2016). Berth allocation in container terminals that service feeder ships and deep-sea vessels. Journal of the Operational Research Society, 67(4), 551–563. https://doi.org/https://doi.org/10.1057/jors.2015.78
- Expósito-Izquierdo, C., Lalla-Ruiz, E., Lamata, T., Melián-Batista, B., & Moreno-Vega, J. M. (2016). Fuzzy optimization models for seaside port logistics: Berthing and quay crane scheduling. Computational Intelligence, 613, 323–343. https://doi.org/10.1007/978-3-319-23392-5_18
- Fransoo, J. C., & Lee, C. Y. (2013). The critical role of ocean container transport in global supply chain performance. Production and Operations Management, 22(2), 253–268. https://doi.org/https://doi.org/10.1111/j.1937-5956.2011.01310.x
- Giallombardo, G., Moccia, L., Salani, M., & Vacca, I. (2010). Modeling and solving the tactical berth allocation problem. Transportation Research Part B: Methodological, 44(2), 232−–245. https://doi.org/https://doi.org/10.1016/j.trb.2009.07.003
- 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/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
- Han, X., Lu, Z., & Xi, L. (2010). A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. European Journal of Operational Research, 207(3), 1327–1340. https://doi.org/https://doi.org/10.1016/j.ejor.2010.07.018
- He, J. (2016). Berth allocation and quay crane assignment in a container terminal for the trade-off between time-saving and energy-saving. Advanced Engineering Informatics, 30(3), 390–405. https://doi.org/https://doi.org/10.1016/j.aei.2016.04.006
- Hendriks, M., Laumanns, M., Lefeber, E., & Udding, J. T. (2010). Robust cyclic berth planning of container vessels. OR Spectrum, 32(3), 501–517. https://doi.org/10.1007/s00291-010-0198-z
- Hu, Q. M., Hu, Z. H., & Du, Y. (2014). Berth and quay-crane allocation problem considering fuel consumption and emissions from vessels. Computers & Industrial Engineering, 70, 1–10. https://doi.org/https://doi.org/10.1016/j.cie.2014.01.003
- Iris, Ç., Lalla-Ruiz, E., Lam, J. S. L., & Voß, S. (2018). Mathematical programming formulations for the strategic berth template problem. Computers & Industrial Engineering, 124, 167–179. https://doi.org/10.1016/j.cie.2018.07.003 https://doi.org/https://doi.org/10.1016/j.cie.2018.07.003
- Iris, Ç., & Lam, J. S. L. (2019a). Recoverable robustness in weekly berth and quay crane planning. Transportation Research Part B: Methodological, 122, 365–389. https://doi.org/https://doi.org/10.1016/j.trb.2019.02.013
- Iris, Ç., & Lam, J. S. L. (2019b). A review of energy efficiency in ports: Operational strategies, technologies and energy management systems. Renewable and Sustainable Energy Reviews, 112, 170–182. https://doi.org/10.1016/j.rser.2019.04.069
- Iris, Ç., Pacino, D., & Ropke, S. (2017). Improved formulations and an adaptive large neighborhood search heuristic for the integrated berth allocation and quay crane assignment problem. Transportation Research Part E: Logistics and Transportation Review, 105, 123–147. https://doi.org/https://doi.org/10.1016/j.tre.2017.06.013
- Iris, Ç., Pacino, D., Ropke, S., & Larsen, A. (2015). Integrated berth allocation and quay crane assignment problem: Set partitioning models and computational results. Transportation Research Part E: Logistics and Transportation Review, 81, 75–97. https://doi.org/https://doi.org/10.1016/j.tre.2015.06.008
- Jin, J. G., Lee, D. H., & Hu, H. (2015). Tactical berth and yard template design at container transshipment terminals: A column generation based approach. Transportation Research Part E: Logistics and Transportation Review, 73, 168–184. https://doi.org/https://doi.org/10.1016/j.tre.2014.11.009
- Lalla-Ruiz, E., González-Velarde, J. L., Melián-Batista, B., & Moreno-Vega, J. M. (2014). Biased random key genetic algorithm for the tactical berth allocation problem. Applied Soft Computing, 22, 60–76. https://doi.org/https://doi.org/10.1016/j.asoc.2014.04.035
- Lalla-Ruiz, E., Izquierdo, C. E., Batista, B. M., & Moreno-Vega, J. M. (2013). A metaheuristic approach for the seaside operations in maritime container terminals. Advances in Computational Intelligence, 7903, 28–35. https://doi.org/10.1007/978-3-642-38682-4_4
- Meisel, F., & Bierwirth, C. (2009). Heuristics for the integration of crane productivity in the berth allocation problem. Transportation Research Part E: Logistics and Transportation Review, 45(1), 196–209. https://doi.org/https://doi.org/10.1016/j.tre.2008.03.001
- Moorthy, R., & Teo, C. P. (2006). Berth management in container terminal: The template design problem. OR Spectrum, 28(4), 495–518. https://doi.org/https://doi.org/10.1007/s00291-006-0036-5
- 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
- Ribeiro, G. M., Mauri, G. R., Beluco, S. d C., Lorena, L. A. N., & Laporte, G. (2016). Berth allocation in an ore terminal with demurrage, dispatch and maintenance. Computers & Industrial Engineering, 96, 8–15. https://doi.org/https://doi.org/10.1016/j.cie.2016.03.005
- Robenek, T., Umang, N., Bierlaire, M., & Ropke, S. (2014). A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports. European Journal of Operational Research, 235(2), 399–411. https://doi.org/https://doi.org/10.1016/j.ejor.2013.08.015
- Schonfeld, P., & Sharafeldien, O. (1985). Optimal berth and crane combinations in containerports. Journal of Waterway, Port, Coastal, and Ocean Engineering, 111(6), 1060–1072. https://doi.org/10.1061/(ASCE)0733-950X(1985)111:6(1060)
- Stahlbock, R., & Voß, S. (2007). Operations research at container terminals: A literature update. Or Spectrum, 30(1), 1–52. https://doi.org/https://doi.org/10.1007/s00291-007-0100-9
- Steenken, D., Voß, S., & Stahlbock, R. (2004). Container terminal operation and operations research - A classification and literature review. OR Spectrum, 26, 3–49. https://doi.org/10.1007/s00291-003-0157-z
- Türkoğulları, Y. B., Taşkın, Z. C., Aras, N., & Altınel, İ. K. (2014). Optimal berth allocation and time-invariant quay crane assignment in container terminals. European Journal of Operational Research, 235(1), 88–101. https://doi.org/https://doi.org/10.1016/j.ejor.2013.10.015
- Türkoğulları, Y. B., Taşkın, Z. C., Aras, N., & Altınel, İ. K. (2016). Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals. European Journal of Operational Research, 254(3), 985–1001. https://doi.org/https://doi.org/10.1016/j.ejor.2016.04.022
- UNCTAD. (2018). Review of maritime transport 2018. Retrieved July 3, 2019, from https://unctad.org/en/PublicationsLibrary/rmt2018_en.pdf
- Ursavas, E., & Zhu, S. X. (2016). Optimal policies for the berth allocation problem under stochastic nature. European Journal of Operational Research, 255(2), 380–387. https://doi.org/https://doi.org/10.1016/j.ejor.2016.04.029
- Vacca, I., Salani, M., & Bierlaire, M. (2013). An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transportation Science, 47(2), 148–161. https://doi.org/https://doi.org/10.1287/trsc.1120.0428
- Venturini, G., Iris, Ç., Kontovas, C. A., & Larsen, A. (2017). The multi-port berth allocation problem with speed optimization and emission considerations. Transportation Research Part D: Transport and Environment, 54, 142–159. https://doi.org/https://doi.org/10.1016/j.trd.2017.05.002
- Vis, I. F. A., & de Koster, R. (2003). Transshipment of containers at a container terminal: An overview. European Journal of Operational Research, 147(1), 1–16. https://doi.org/https://doi.org/10.1016/S0377-2217(02)00293-X
- Wang, K., Zhen, L., Wang, S., & Laporte, G. (2018). Column generation for the integrated berth allocation, quay crane assignment, and yard assignment problem. Transportation Science, 52(4), 812–834. https://doi.org/https://doi.org/10.1287/trsc.2018.0822
- Wang, T., Wang, X., & Meng, Q. (2018). Joint berth allocation and quay crane assignment under different carbon taxation policies. Transportation Research Part B: Methodological, 117, 18–36. https://doi.org/https://doi.org/10.1016/j.trb.2018.08.012
- Wang, Y., Meng, Q., & Du, Y. (2015). Liner container seasonal shipping revenue management. Transportation Research Part B: Methodological, 82, 141–161. https://doi.org/https://doi.org/10.1016/j.trb.2015.10.003
- Xi, X., Liu, C., & Miao, L. (2017). A bi-objective robust model for berth allocation scheduling under uncertainty. Transportation Research Part E: Logistics and Transportation Review, 106, 294–319. https://doi.org/10.1016/j.tre.2017.07.006 https://doi.org/https://doi.org/10.1016/j.tre.2017.07.006
- Xu, Z., & Lee, C. Y. (2018). New lower bound and exact method for the continuous berth allocation problem. Operations Research, 66(3), 778–798. https://doi.org/10.1287/opre.2017.1687
- Zhen, L. (2015). Tactical berth allocation under uncertainty. European Journal of Operational Research, 247(3), 928–944. https://doi.org/https://doi.org/10.1016/j.ejor.2015.05.079
- Zhen, L., Chew, E. P., & Lee, L. H. (2011). An integrated model for berth template and yard template planning in transshipment hubs. Transportation Science, 45(4), 483–504. https://doi.org/https://doi.org/10.1287/trsc.1100.0364
- Zhen, L., Lee, L. H., & Chew, E. P. (2011). A decision model for berth allocation under uncertainty. European Journal of Operational Research, 212(1), 54–68. https://doi.org/https://doi.org/10.1016/j.ejor.2011.01.021
- Zhen, L., Liang, Z., Zhuge, D., Lee, L. H., & Chew, P. E. (2017). Daily berth planning in a tidal port with channel flow control. Transportation Research Part B: Methodological, 106, 193–217. https://doi.org/https://doi.org/10.1016/j.trb.2017.10.008
- Zhen, L., Zhuge, D., Murong, L., Yan, R., & Wang, S. (2019). Operation management of green ports and shipping networks: Overview and research opportunities. Frontiers of Engineering Management, 6(2), 152–162. https://doi.org/https://doi.org/10.1007/s42524-019-0027-2