You are here

Home » Content

LİMAN YÖNETİMİ VE RIHTIM ATAMA PROBLEMİ

PORT MANAGEMENT AND BERTH ALLOCATION PROBLEM

Journal Name:

  • Ege Akademik Bakış Dergisi

Publication Year:

  • 2008

Key Words:

Keywords (Original Language):

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
While the importance of oversea commerce is growing in the world trade, the ports are considered as key elements. In this respect, management of ports becomes a major competitive factor among the world countries. Although there are many different strategies implemented by different countries on port management, the major aim of all is to increase the efficiency and the volume of operation. Berth allocation problem (BAP) is one of the specific problems in port management. Due to being first problem to solve in ports, it influences all the other activities related. The efficiency of berth allocation problem can significantly reduce the waiting time and the operation time in ports. Despite the existence of many studies on BAP for different ports in the world literature, the number of studies done and implemented in our ports are very rare, almost none. In this paper, the studies on BAP in the world literature are examined and proposals for our country are brought into consideration.
Bookmark/Search this post with
Abstract (Original Language): 
Deniz aşırı ticaretin, dünya ticaretinde önemini artırdığı günümüzde, limanların önemi de artmaktadır. Bu hususta liman yönetimi dünya ülkeleri arasında rekabet unsuru oluşturmaktadır. Liman yönetimi konusunda ülkelerin uyguladıkları stratejiler farklı olmasına rağmen, hedeflenen verimlilik ve işlem hacminin artırılmasıdır. Rıhtım atama problemi (RAP) liman yönetiminde spesifik problemlerden birisidir. Limanda çözülmesi gereken ilk problemlerden biri olduğu için diğer bütün liman faaliyetlerini etkilemektedir. Rıhtım atamada sağlanacak etkinlik, gemilerin bekleme ve limanda işlem görme sürelerinin önemli oranda azalmasını sağlayacaktır. Bu bağlamda dünya limanlarında RAP konusunda pek çok çalışma olmasına rağmen ülkemiz limanları için yapılmış ve uygulanmış çalışmaların sayısı yok denecek kadar azdır. Bu çalışmada dünyada bu konuda yapılan çalışmalar incelenmiş ve ülkemiz için çalışma önerileri getirilmiştir.
FULL TEXT (PDF): 
PDF icon arastirmax-liman-yonetimi-rihtim-atama-problemi.pdf
  • 1
243-256
  • Turkish

REFERENCES

References: 

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.

Thank you for copying data from http://www.arastirmax.com