Modelling and solving a berth allocation problem in an automotive transshipment terminal

References

• 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(4), 606–613. doi:10.1016/j.cie.2010.12.018
   Web of Science ®Google Scholar
• Bierwirth, C., & Meisel, F. (2010). A survey of berth and quay crane scheduling problems in container terminals. European Journal of Operational Research, 202(3), 615–627. doi:10.1016/j.ejor.2009.05.031
   Web of Science ®Google Scholar
• 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. doi:10.1016/j.ejor.2014.12.030
   Web of Science ®Google Scholar
• Blazewicz, J., Cheng, T. C. E., Machowiak, M., & Oguz, C. (2011). Berth and quay crane allocation: A moldable task scheduling model. Journal of the Operational Research Society, 62(7), 1189–1197. doi:10.1057/jors.2010.54
   Web of Science ®Google Scholar
• Budipriyanto, A., Wirjodirdjo, B., Pujawan, N., & Gurning, S. (2015). Berth allocation problem under uncertainty: A conceptual model using collaborative approach. Procedia Manufacturing, 4, 429–437. doi:10.1016/j.promfg.2015.11.059
   Google Scholar
• Buhrkal, K., Zuglian, S., Ropke, S., Larsen, J., & Lusby, R. (2011). Models for the discrete berth allocation problem: A computational comparison. Transportation Research Part E: Logistics and Transportation Review, 47(4), 461–473. doi:10.1016/j.tre.2010.11.016
   Web of Science ®Google Scholar
• Chen, X.-J., Hu, Z.-H., & Li, G.-J. (2016). Optimization for parking space distribution in automotive ro-ro yard based on attraction degree search. Journal of Dalian University of Technology, 2, 118–126.
   Google Scholar
• Cheong, C. Y., K., Tan, K. C., Liu, D. K., & Lin, C. J. (2010). Multi-objective and prioritized berth allocation in container ports. Annals of Operations Research, 180(1), 63–103. doi:10.1007/s10479-008-0493-0
   Web of Science ®Google Scholar
• Cordeau, J.-F., Laporte, G., Moccia, L., & Sorrentino, G. (2011). Optimizing yard assignment in an automotive transshipment terminal. European Journal of Operational Research, 215(1), 149–160. doi:10.1016/j.ejor.2011.06.008
   Web of Science ®Google Scholar
• Daofang, C., Jiang, Z., Yan, W., & He, J. (2010). Integrating berth allocation and quay crane assignments. Transportation Research Part E: Logistics and Transportation Review, 46(6), 975–990. doi:10.1016/j.tre.2010.05.008
   Web of Science ®Google Scholar
• Dresner, K., & Stone, P. (2008). A multiagent approach to autonomous intersection management. Journal of Artificial Intelligence Research, 31, 591–656. doi:10.1613/jair.2502
   Web of Science ®Google Scholar
• 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. doi:10.1016/j.tre.2011.05.011
   Web of Science ®Google Scholar
• 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. doi:10.1016/j.trb.2009.07.003
   Web of Science ®Google Scholar
• Guan, Y., & Cheung, R. K. (2004). The berth allocation problem: Models and solution methods. Or Spectrum, 26 (1), 75–92. doi:10.1007/s00291-003-0140-8
   Web of Science ®Google Scholar
• 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. doi:10.1016/j.ejor.2006.12.057
   Web of Science ®Google Scholar
• Iannone, R., Miranda, S., Prisco, L., Riemma, S., & Sarno, D. (2016). Proposal for a flexible discrete event simulation model for assessing the daily operation decisions in a Ro-Ro terminal. Simulation Modelling Practice and Theory, 61, 28–46. doi:10.1016/j.simpat.2015.11.005
   Web of Science ®Google Scholar
• Imai, A., Yamakawa, Y., & Huang, K. (2014). The strategic berth template problem. Transportation Research Part E: Logistics and Transportation Review, 72, 77–100. doi:10.1016/j.tre.2014.09.013
   Web of Science ®Google Scholar
• Iris, C., Pacino, D., & Ropke, S. (2017). Improved formulations and adaptive large neighborhood search for the integrated berth allocation and quay crane assignment problem. Transportation Research Part E: Logistics and Transportation Review, 105, 123–147. doi:10.1016/j.tre.2017.06.013
   Web of Science ®Google Scholar
• Iris, C., Pacino, D., Ropke, S., & Larsen, A. (2017). Integrated berth allocation and quay crane assignment problem: Set partitioning models and computational results. Transportation Research Part E: Logistics and Transportation Review, 105, 123–147. doi:10.1016/j.tre.2015.06.008
   Web of Science ®Google Scholar
• Lalla-Ruiz, E., Gonzalez-Velarde, J. L., Belen, M.-B., & Moreno-Vega, J. M. (2014). Biased random key genetic algorithm for the tactical berth allocation problem. Applied Soft Computing, 22, 60–76. doi:10.1016/j.asoc.2014.04.035
   Web of Science ®Google Scholar
• 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: Logistics and Transportation Review, 46(6), 1017–1029. doi:10.1016/j.tre.2010.01.009
   Web of Science ®Google Scholar
• Lim, A. (1998). The berth plannig problem. Operations Research Letters, 22(2/3), 105–110. doi:10.1016/S0167-6377(98)00010-8
   Web of Science ®Google Scholar
• Mattfeld, D. C., & Kopfer, H. (2003). Terminal operations management in vehicle transshipment. Transportation Research Part A: Policy and Practice, 37, 435–452. doi:10.1016/S0965-8564(02)00035-6
   Web of Science ®Google Scholar
• Meisel, F., & Bierwirth, C. (2013). A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transportation Science, 47(2), 131–147. doi:10.1287/trsc.1120.0419
   Web of Science ®Google Scholar
• Monaco, M. F., & Sammarra, M. (2007). The berth allocation problem: A strong formulation solved by a Lagrangean approach. Transportation Science, 41(2), 265–280. doi:10.1287/trsc.1060.0171
   Web of Science ®Google Scholar
• Richards, A., & How, J. P. (2002). Aircraft trajectory planning with collision avoidance using mixed integer linear programming. Proceedings of the American Control Conference, February 2002, 3, 1936–1941.
   Google Scholar
• Tsou, M.-C., & Hsueh, C.-K. P. (2010). The study of ship collision avoidance route planning by ant colony algorithm. Journal of Marine Science and Technology, 18(5), 746–756.
   Web of Science ®Google Scholar
• Xu, D., Li, C., & Leung, J.-Y.-T. (2012). Berth allocation with time-dependent physical limitations on vessels. European Journal of Operational Research, 216(1), 47–56. doi:10.1016/j.ejor.2011.07.012
   Web of Science ®Google Scholar
• Zhao, Y.-X., Li, W., Feng, S., Ochieng, W. Y., & Schuster, W. (2014). An improved differential evolution algorithm for maritime collision avoidance route planning. Abstract and Applied Analysis, 2014, 1–10. doi:10.1155/2014/614569
   Google Scholar
• Zhen, L. (2015). Tactical berth allocation under uncertainty. European Journal of Operational Research, 247(3), 928–944. doi:10.1016/j.ejor.2015.05.079
   Web of Science ®Google Scholar
• Zhen, L., Chew, E. P., & Lee, L. H. (2011). An integrated model for the berth templete and yard templete planning in transshipment hubs. Transportation Science, 45(4), 483–504. doi:10.1287/trsc.1100.0364
   Web of Science ®Google Scholar
• Zhen, L., Liang, Z., Zhuge, D., Lee, L. H., & Chew, E. P. (2017). Daily berth planning in a tidal port with channel flow control. Transportation Research Part B, 106, 193–217. doi:10.1016/j.trb.2017.10.008
   Google Scholar