CORDEAU, J.F., LAPORTE, G., LEGATO, P. and MOCCIA, L. (2005): “Models and Tabu Search Heuristics for the Berth-Allocation Problem”, Transportation Science, 39(4): 526-538.
CORDEAU, J.F., GAUDIOSO, M., LAPORTE, G. and MOCCIA, L. (2007): “The service allocation problem at the Gioia Tauro Maritime Terminal”, European Journal of Operational Research, 176: 1167-1184.
DENİZ TICARET ODASI (2005), 2004 Deniz Sektörü Raporu, İstanbul.
DRAGOVIC, B., PARK, N.K., RADMILOVIC, Z. and MARAS, V. (2005): “Simulation Modelling of Ship-Berth Link With Priority Service”, Maritime Economics & Logistics, 7: 316–335. Dünya Bankası, http://www.worldbank.org/html/prddr/outreach/or3.htm, 10.09.2007 GUAN, Y. and CHEUNG, R.K. (2004): “The Berth Allocation Problem: Models and Solution Methods”, OR Spectrum, 26: 75-92. IMAI, A., NAGAIWA, K. and CHAN, W.T. (1997): “Efficient planning of berth allocation for container terminals in Asia”, Journal of Advanced Transportation, 31: 75-94. IMAI, A., NISHIMURA, E. and PAPADIMITRIOU, S. (2001): “The dynamic berth allocation problem for a container port”, Transportation Research Part B, 35: 401-417. IMAI, A., NISHIMURA, E. and PAPADIMITRIOU, S. (2003): “Berth Allocation with Service Priority”, Transportation Research Part B, 37: 437-457. IMAI, A., SUN, X., NISHIMURA, E. and PAPADIMITRIOU, S. (2005): “Berth Allocation in a Container Port: Using a Continuous Location Space Approach”, Transportation Research Part B, 39: 199-221. IMAI, A., NISHIMURA, E. and PAPADIMITRIOU, S. (2006): “Berthing ships at a multi-user container terminal with a limited quay capacity”, Transportation Research Part E, (article in press, doi: 10.1016 / j.tre. 2006.05.002). IMAI, A., NISHIMURA, E., HATTORI, M. and PAPADIMITRIOU, S. (2007): “Berth Allocation at indented berths for mega-containerships”, European Journal of Operational Research, 179: 579-593. IMAI, A., CHEN, H., NISHIMURA, E. and PAPADIMITRIOU, S. (2007): “The simultaneous berth and quay crane allocation problem”, Transportation Research Part E, (article in press, doi: 10.1016 / j.tre. 2007.03.003). International Maritime Organization (2005), “International Shipping-Carrier Of World Trade”, Background Paper, http://www.diadomar.mdn.gov.pt/ backgroundpaper_IMO.pdf , (10.09.2007). KIM, K.H. and MOON, K.C. (2003): “Berth scheduling by simulated annealing”, Transportation Research Part B, 37: 541-560. LEGATO, P. and MAZZA, R.M. (2001): “Berth planning and resources optimisation at a container terminal via discrete event simulation”, European Journal of Operational Research, 133: 537-547.
MURTY, K.G., LIU, J., WAN, Y-W. and LINN, R. (2005): “’’A Decision Support System in a Container Terminal”, Decision Support Systems, 39: 309-332.
NISHIMURA, E., IMAI, A., and PAPADIMITRIOU, S. (2001): “Berth allocation planning in the public berth system by genetic algorithms”, European Journal of Operational Research, 131: 282-292.
PARK, Y-M. and KIM, K.H. (2003): “A scheduling method for Berth and Quay cranes”, OR Spectrum, 25: 1-23.
T.C. Devlet Demiryolları İşletmesi, http://www.tcdd.gov.tr/liman/konteyner .htm, (08.09.2007).
Türkiye Denizcilik İşletmeleri, http://www.tdi.com.tr/ozellesen_limanlar.html, (10.09.2007).
WANG, F. and LIM, A. (2007): “A Stochastic beam search for the berth allocation problem”, Decision Support Systems, 42: 2186-2219.
ZHOU, P., KANG, H. and LIN, L. (2006): “A dynamic berth allocation model based on stochastic consideration”, Proceedings of the 6th World Congress on Intelligent Control and Automation, June 21-23, 2006, Dalian, China.