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 and Industrial Engineering, 60(4), 606–613. (doi:10.1016/j.cie.2010.12.018) doi: 10.1016/j.cie.2010.12.018
- 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. (doi:10.1016/j.ejor.2009.05.031) doi: 10.1016/j.ejor.2009.05.031
- Brown, G. G., Cormican, K. J., Lawphongpanich, S., Widdis, D. B. 1997. Optimizing Submarine Berthing with a Persistence Incentive. Naval Research Logistics, 44(4), 301–318. (doi:10.1002/(SICI)1520-6750(199706)44:4<301::AID-NAV2>3.0.CO;2-A) doi: 10.1002/(SICI)1520-6750(199706)44:4<301::AID-NAV2>3.0.CO;2-A
- Brown, G. G., Lawphongpanich, S., Thurman, K. P. 1994. Optimizing Ship Berthing. Naval Research Logistics, 41(1), 1–15. (doi:10.1002/1520-6750(199402)41:1<1::AID-NAV3220410102>3.0.CO;2-L) doi: 10.1002/1520-6750(199402)41:1<1::AID-NAV3220410102>3.0.CO;2-L
- 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, 47(4), 461–473. (doi:10.1016/j.tre.2010.11.016) doi: 10.1016/j.tre.2010.11.016
- Cordeau, J. F., Laporte, G., Legato, P., Moccia, L. 2005. Models and Tabu Search Heuristics for the Berth-Allocation Problem. Transportation Science, 39(4), 526–538. (doi:10.1287/trsc.1050.0120) doi: 10.1287/trsc.1050.0120
- Dai, J., Lin, W., Moorthy, R., Teo, C. P. 2008. “Berth Allocation Planning Optimization in Container Terminals.”. In TangC. S.TeoC. P.WeiK. K. (Ed.), Supply Chain Analysis: A Handbook on the Interaction of Information, System and Optimization, (pp. 69–104). New York: Springer.
- Giallombardo, G., Moccia, L., Salani, M., Vacca, I. 2010. Modeling and Solving the Tactical Berth Allocation Problem. Transportation Research Part B, 44(1), 232–245. (doi:10.1016/j.trb.2009.07.003) doi: 10.1016/j.trb.2009.07.003
- 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) doi: 10.1007/s00291-003-0140-8
- Guan, Y., Xiao, W. Q., Cheung, R. K., Li, C. L. 2002. A Multiprocessor Task Scheduling Model for Berth Allocation: Heuristic and Worst-Case Analysis. Operations Research Letters, 30(5), 343–350. (doi:10.1016/S0167-6377(02)00147-5) doi: 10.1016/S0167-6377(02)00147-5
- Hansen, P., Oğuz, C., Mladenovic, 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) doi: 10.1016/j.ejor.2006.12.057
- Imai, A., Nagaiwa, K., Chan, W. T. 1997. Efficient Planning of Berth Allocation for Container Terminals in Asia. Journal of Advanced Transportation, 31(1), 75–94. (doi:10.1002/atr.5670310107) doi: 10.1002/atr.5670310107
- Imai, A., Nishimura, E., Hattori, M., Papadimitriou, S. 2007a. Berth Allocation at Indented Berths for Mega-Containerships. European Journal of Operational Research, 179(2), 579–593. (doi:10.1016/j.ejor.2006.03.034) doi: 10.1016/j.ejor.2006.03.034
- Imai, A., Nishimura, E., Papadimitriou, S. 2001. The Dynamic Berth Allocation Problem for a Container Port. Transportation Research Part B, 35(4), 401–417. (doi:10.1016/S0191-2615(99)00057-0) doi: 10.1016/S0191-2615(99)00057-0
- Imai, A., Nishimura, E., Papadimitriou, S. 2003. Berth Allocation with Service Priority. Transportation Research Part B, 37(5), 437–457. (doi:10.1016/S0191-2615(02)00023-1) doi: 10.1016/S0191-2615(02)00023-1
- Imai, A., Nishimura, E., Papadimitriou, S. 2008. Berthing Ships at a Multi-User Container Terminal with a Limited Quay Capacity. Transportation Research Part E, 44(1), 136–151. (doi:10.1016/j.tre.2006.05.002) doi: 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, 39(3), 199–221. (doi:10.1016/j.trb.2004.04.004) doi: 10.1016/j.trb.2004.04.004
- Imai, A., Zhang, J. T., Nishimura, E., Papadimitriou, S. 2007b. The Berth Allocation Problem with Service Time and Delay Time Objectives. Maritime Economics and Logistics, 9(4), 269–290. (doi:10.1057/palgrave.mel.9100186) doi: 10.1057/palgrave.mel.9100186
- Kim, K. H., Moon, K. C. 2003. Berth Scheduling by Simulated Annealing. Transportation Research Part B, 37(6), 541–560. (doi:10.1016/S0191-2615(02)00027-9) doi: 10.1016/S0191-2615(02)00027-9
- Kirkpatrick, S., Gelatt, C. D., Vecch, M. P. 1983. Optimization by Simulated Annealing. Science, 220(4598), 671–680. (doi:10.1126/science.220.4598.671) doi: 10.1126/science.220.4598.671
- Lai, K. K., Shih, K. 1992. A Study of Container Berth Allocation. Journal of Advanced Transportation, 26(1), 45–60. (doi:10.1002/atr.5670260105) doi: 10.1002/atr.5670260105
- Lalla-Ruiz, E., Melián-Batista, B., Moreno-Vega, J. Marcos 2012. Artificial Intelligence Hybrid Heuristic Based on Tabu Search for the Dynamic Berth Allocation Problem. Engineering Applications of Artificial Intelligence, 25(6), 1132–1141. (doi:10.1016/j.engappai.2012.06.001) doi: 10.1016/j.engappai.2012.06.001
- Lee, Y., Chen, C. Y. 2009. An Optimization Heuristic for the Berth Scheduling Problem. European Journal of Operational Research, 196(2), 500–508. (doi:10.1016/j.ejor.2008.03.021) doi: 10.1016/j.ejor.2008.03.021
- 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, 46(6), 101–1029. (doi:10.1016/j.tre.2010.01.009) doi: 10.1016/j.tre.2010.01.009
- Lee, D. H., Wang, H. Q. 2010. Integrated Discrete Berth Allocation and Quay Crane Scheduling in Port Container Terminals. Engineering Optimization, 42(8), 747–761. (doi:10.1080/03052150903406571) doi: 10.1080/03052150903406571
- Li, C. L., Cai, X., Lee, C. Y. 1998. Scheduling with Multiple-Job-on-One-Processor Pattern. IIE Transactions, 30(5), 433–445.
- Lim, A. 1998. The Berth Planning Problem. Operations Research Letters, 22(2–3), 105–110. (doi:10.1016/S0167-6377(98)00010-8) doi: 10.1016/S0167-6377(98)00010-8
- Martí, R. 2003. “Multi-Start Methods.”. In GloverF.KochenbergerG. A. (Ed.), Handbook of Metaheuristics, International Series in Operations Research & Management Sciences, (pp. 355–368). Dordrecht: Kluwer.57
- MauriG. R.AndradeL. N.LorenaL. A. N.“A Memetic Algorithm for a Continuous Case of the Berth Allocation Problem.” In ECTA 2011 - International Conference on Evolutionary Computation Theory and Applications Pairs France October 24–26 2011 SciTePress Oxford 2011 pp. 105 - 113
- Mauri, G. R., Oliveira, A. C. M., Lorena, L. A. N. 2008. A Hybrid Column Generation Approach for the Berth Allocation Problem. Lecture Notes in Computer Science, 4972, 110–122. (doi:10.1007/978-3-540-78604-7_10) doi: 10.1007/978-3-540-78604-7_10
- Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E. 1953. Equation of State Calculations by Fast Computing Machines. Journal of Chemical Physics, 21(6), 1087–1090. (doi:10.1063/1.1699114) doi: 10.1063/1.1699114
- Monaco, M. F., Sammarra, M. 2007. The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangian Approach. Transportation Science, 41(2), 265–280. (doi:10.1287/trsc.1060.0171) doi: 10.1287/trsc.1060.0171
- Moorthy, R., Teo, C. P. 2006. Berth Management in Container Terminal: The Template Design Problem. OR Spectrum, 28(4), 495–518. (doi:10.1007/s00291-006-0036-5) doi: 10.1007/s00291-006-0036-5
- Nishimura, E., Imai, A., Papadimitriou, S. 2001. Berth Allocation Planning in the Public Berth System by Genetic Algorithms. European Journal of Operational Research, 131(2), 282–292. (doi:10.1016/S0377-2217(00)00128-4) doi: 10.1016/S0377-2217(00)00128-4
- de Oliveira, R. M., Mauri, G. R., Lorena, L. A. N. 2012a. Clustering Search Heuristics for Solving a Continuous Berth Allocation Problem. Lecture Notes in Computer Science, 7245, 49–62. (doi:10.1007/978-3-642-29124-1_5) doi: 10.1007/978-3-642-29124-1_5
- de Oliveira, R. M., Mauri, G. R., Lorena, L. A. N. 2012b. Clustering Search for the Berth Allocation Problem. Expert Systems with Applications, 39(5), 5499–5505. (doi:10.1016/j.eswa.2011.11.072) doi: 10.1016/j.eswa.2011.11.072
- Park, K. T., Kim, K. H. 2002. Berth Scheduling for Container Terminals by Using a Subgradient Optimization Technique. Journal of the Operational Research Society, 53(9), 1054–1062. (doi:10.1057/palgrave.jors.2601412) doi: 10.1057/palgrave.jors.2601412
- Park, Y. M., Kim, K. H. 2003. A Scheduling Method for Berth and Quay Cranes. OR Spectrum, 25(1), 1–23. (doi:10.1007/s00291-002-0109-z) doi: 10.1007/s00291-002-0109-z
- Stahlbock, R., Voß, S. 2008. Operations Research at Container Terminals: A Literature Update. OR Spectrum, 30(1), 1–52. (doi:10.1007/s00291-007-0100-9) doi: 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(1), 3–49. (doi:10.1007/s00291-003-0157-z) doi: 10.1007/s00291-003-0157-z
- Seyedalizadeh Ganji, S. R., Babazadeh, A., Arabshahi, N. 2010. Analysis of the Continuous Berth Allocation Problem in Container Ports Using a Genetic Algorithm. Journal of Marine Science and Technology, 15(4), 408–416. (doi:10.1007/s00773-010-0095-9) doi: 10.1007/s00773-010-0095-9
- Tang, L., Li, S., Liu, J. 2009. Dynamically Scheduling Ships to Multiple Continuous Berth Spaces in an Iron and Steel Complex. International Transactions in Operational Research, 16(1), 87–107. (doi:10.1111/j.1475-3995.2009.00662.x) doi: 10.1111/j.1475-3995.2009.00662.x
- Theofanis, S., Boile, M., Golias, M. M. 2009. Container Terminal Berth Planning: Critical Review of Research Approaches and Practical Challenges. Transportation Research Record: Journal of the Transportation Research Board, 2100, 22–28. (doi:10.3141/2100-03) doi: 10.3141/2100-03
- Tiwari, M. K., Kumar, S., Prakash, S. Kumar, Shankar, R. 2006. Solving Part-Type and Operation Allocation Problems in an FMS: An Approach Using Constraints-Based Fast Simulated Annealing Algorithm. IEEE Transactions on System Man and Cybernetics, Part A: Systems and Human, 36(6), 1170–1184. (doi:10.1109/TSMCA.2006.878979) doi: 10.1109/TSMCA.2006.878979
- Tong, C. J., Lau, H. C., Lim, A. 1999. Ant Colony Optimization for the Ship Berthing Problem. Lecture Notes in Computer Science, 1742, 359–370. (doi:10.1007/3-540-46674-6_30) doi: 10.1007/3-540-46674-6_30
- UNCTAD Review of Maritime Transportation United Nations Conference on Trade and Development. United Nations Geneva 2011
- Wang, F., Lim, A. 2007. A Stochastic Beam Search for the Berth Allocation Problem. Decision Support Systems, 42(4), 2186–2196. (doi:10.1016/j.dss.2006.06.008) doi: 10.1016/j.dss.2006.06.008
- 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. (doi:10.1080/0305215X.2010.528411) doi: 10.1080/0305215X.2010.528411
- Zhen, L., Chew, E. P., Lee, L. H. 2011a. An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs. Transportation Science, 45(4), 483–504. (doi:10.1287/trsc.1100.0364) doi: 10.1287/trsc.1100.0364
- Zhen, L., Lee, L. H., Chew, E. P. 2011b. A Decision Model for Berth Allocation Under Uncertainty. European Journal of Operational Research, 212(1), 54–68. (doi:10.1016/j.ejor.2011.01.021) doi: 10.1016/j.ejor.2011.01.021