نوع مقاله: مقاله پژوهشی

نویسندگان

1 استادیار دانشکده مهندسی صنایع، دانشگاه علم وصنعت ایران

2 دانشجوی دکترای مهندسی صنایع، دانشگاه علم و صنعت ایران

چکیده

سرعت حمل و نقل نقش مهمی را در تجارت جهانی دارد از این­رو مهم­ترین هدف پایانه کانتینری افزایش کارایی و کاهش تأخیر در خروج کشتی­ها از اسکله است. زمان بیکاری یک کشتی به کارایی زمان­بندی اسکله و چگونگی تخصیص منابع بستگی داشته که مدیریت مطلوب منابع پایانه موجب افزایش کارایی بنادر می­شود. زمان پهلوگیری کشتی­ها می­تواند به عنوان معیار اصلی در جهت افزایش کارایی پایانه­ های کانتینری در نظر گرفته شود. عملیات تخصیص کشتی­ها به اسکله به عنوان اولین و اصلی­ترین تصمیم عملیاتی در اکثر پایانه ­های کانتینری شناخته می­شوند. در این مقاله پس از بررسی مسئله تخصیص پهلوگاه­ های اسکله به کشتی­ها، مدل بررسی شده با استفاده از الگوریتم علف­های هرز حل شده است. در انتها کارایی الگوریتم پیشنهادی با نتایج حاصل از نرم ­افزار تجاری GAMS مقایسه شده و نتایج نشان می­دهند که الگوریتم پیشنهادی علاوه بر کیفیت بالای نتایج، بخصوص در مسائل با اندازه بزرگ، سرعت حل بسیار بالاتری نسبت به نرم افزار GAMS دارد.

کلیدواژه‌ها

موضوعات

عنوان مقاله [English]

A New Optimization via Invasive Weeds Algorith for Berth Allocation Problem in Container Terminals

نویسندگان [English]

  • M Mohammadpour omran 1
  • S.F Hoseini 2

1 Department of Industrial Engineering, Iran University of Science and Technology,

2 Department of Industrial Engineering, Iran University of Science and Technology

چکیده [English]

Transportation speed has an important role in global trade, therefor the main purposes of a container terminal are increasing efficiency and reduction of ships departure delay from port. A ship idle time depends on efficiency of berth scheduling and containter terminal resources allocation, which the optimal management of terminals will incease efficiency of ports. The vessels service time could be used as the main factor in order to increase the efficiency of container terminals. The berth allocation to vessles are known as the first and most important decision in most container terminals. In this paper we first studied the berth allocation problem and then was evaluated the proposed model with an invasive weeds algorithm. Finally, the effectiveness of the proposed method was compared with the results of GAMS commercial software. The proposed algorithm in addition to high quality results, especially for large size problems has much higher speed than the GAMS software.

کلیدواژه‌ها [English]

  • Container Terminals
  • Berth Allocation Problem
  • Invasive Weeds Algorithm

[1]           W. P. Source. (2014, 30 Jul). World Port. Available: http://www.worldportsource.com/

[2]           Clarksons. (2014, 30 Jul). Annual trade in containers (teu). Available: http://www.clarksons.com/

[3]           A. Imai, E. Nishimura, M. Hattori, and S. Papadimitriou, "Berth allocation at indented berths for mega-containerships," European Journal of Operational Research, vol. 179, pp. 579-593, 2007.

[4]           M. M. Golias, M. Boile, and S. Theofanis, "Berth scheduling by customer service differentiation: A multi-objective approach," Transportation Research Part E: Logistics and Transportation Review, vol. 45, pp. 878-892, 2009.

[5]           G. Saharidis, M. Golias, M. Boile, S. Theofanis, and M. Ierapetritou, "The berth scheduling problem with customer differentiation: a new methodological approach based on hierarchical optimization," The International Journal of Advanced Manufacturing Technology, vol. 46, pp. 377-393, 2010.

[6]           C. Arango, P. Cortés, J. Muñuzuri, and L. Onieva, "Berth allocation planning in Seville inland port by simulation and optimisation," Advanced Engineering Informatics, vol. 25, pp. 452-461, 2011.

[7]           K. Buhrkal, S. Zuglian, S. Ropke, J. Larsen, and R. Lusby, "Models for the discrete berth allocation problem: a computational comparison," Transportation Research Part E: Logistics and Transportation Review, vol. 47, pp. 461-473, 2011.

[8]           A. Imai, E. Nishimura, and S. Papadimitriou, "The dynamic berth allocation problem for a container port," Transportation Research Part B: Methodological, vol. 35, pp. 401-417, 2001.

[9]           J.-F. Cordeau, G. Laporte, P. Legato, and L. Moccia, "Models and tabu search heuristics for the berth-allocation problem," Transportation science, vol. 39, pp. 526-538, 2005.

[10]         M. F. Monaco and M. Sammarra, "The berth allocation problem: a strongformulation solved by a lagrangean approach," Transportation Science, vol. 41, pp. 265-280, 2007.

[11]         G. Giallombardo, L. Moccia, M. Salani, and I. Vacca, "Modeling and solving the tactical berth allocation problem," Transportation Research Part B: Methodological, vol. 44, pp. 232-245, 2010.

[12]         E. Lalla-Ruiz, J. L. González-Velarde, B. Melián-Batista, and J. M. Moreno-Vega, "Biased random key genetic algorithm for the tactical berth allocation problem," Applied Soft Computing, vol. 22, pp. 60-76, 2014.

[13]         A. Babazadeh, M. G. Shahbandi, S. Seyedalizadeh-Ganji, and M. Joharianzadeh, "A PSO algorithm for continuous berth allocation problem," International Journal of Shipping and Transport Logistics, vol. 7, pp. 479-493, 2015.

[14]         C. Liang, J. Guo, andY. Yang, "Multi-objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning," Journal of Intelligent Manufacturing, vol. 22, pp. 471-479, 2011.

[15]         Y. B. Türkoğulları, Z. C. Taşkın, N. Aras, and İ. K. Altınel, "Optimal berth allocation and time-invariant quay crane assignment in container terminals," European Journal of Operational Research, 2013.

[16]         C. Zhang, L. Zheng, Z. Zhang, L. Shi, and A. J. Armstrong, "The allocation of berths and quay cranes by using a sub-gradient optimization technique," Computers & Industrial Engineering, vol. 58, pp. 40-50, 2010.

[17]         J. F. Alvarez, T. Longva, and E. S. Engebrethsen, "A methodology to assess vessel berthing and speed optimization policies," Maritime Economics & Logistics, vol. 12, pp. 327-346, 2010.

[18]         P. M. Alderton, Reeds sea transport: operation and economics: A&C Black, 2004.

[19]         X.-l. Han, Z.-q. Lu, and L.-f. Xi, "A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time," European Journal of Operational Research, vol. 207, pp. 1327-1340, 12/16/ 2010.

[20]         P.-f. ZHOU and H.-g. KANG, "Study on berth and quay-crane allocation under stochastic environments in container terminal," Systems Engineering-Theory & Practice, vol. 28, pp. 161-169, 2008.

[21]         A. R. Mehrabian and C. Lucas, "A novel numerical optimization algorithm inspired from weed colonization," Ecological informatics, vol. 1, pp. 355-366, 2006.