Developing the Local Recovery Method for Disruption Management in Berth Plan

Document Type : Scientific - Research

Authors

1 Master of science, Transportation Planning, School of civil engineering, Iran University of Science and Technology

2 assistant Professor, Department of transportation Planning, School of civil engineering, Iran University of Science and Technology

Abstract

Berth planning Problems are one the problem related to port management that the answer to these problems can affect the cost of the port and therefore have been studied in many papers and studies. Berth planning includes two subproblems; Berth Allocation Problem and Quay Crane Assignment Problem. This paper intends to merge these two subproblems and develop an integrated mathematical model. An ant colony optimization algorithm is performed to solve this integrated model, which leads to an optimal berth plan that reduces port costs. The initial berth plan is planed assuming that all input data is certain, but this is not true. Unforeseen events may occur during the execution of the initial plan, which may challenge the execution of the initial plan. These types of events, which are generally unpredictable, are called disruptions. The process of recovering the initial berth plan in a way that results in the lowest cost and penalty for the port is called disruption management. So far, two general methods have been introduced for the recovery and management of berth allocation disruption; the Global recovery method and the local recovery method. This paper introduces a local recovery method by eliminating the weaknesses of the previous local recovery method and developing it. In order to validate the methods of solving mathematical models, the data of ships' entry and exit in both container terminals of Shahid Rajaei port are used. The numerical results of this paper show that local recovery methods perform much better than the global recovery method (the optimal response in local methods in the first terminal is about 120% and in the second terminal is about 300% better than the response in the global recovery method). The two methods of local recovery and the developed local recovery method have almost similar answers. However, reaching the final answer in the developed local recovery method is approximately 2 to 3 times faster.

Keywords

References

حسن‌نایبی, ع., س. ح. ذگردی, م. امین ناصری و م. یقینی (2018). "بهینه سازی استراتژی‌های مدیریت اختلال در خطوط راه آهن شهری با استفاده از الگوریتم جستجوی همسایگی متغیر." فصلنامه مهندسی حمل و نقل 9(3): 451-471.
 
Bierwirth, C. and F. Meisel (2010). "A survey of berth allocation and quay crane scheduling problems in container terminals." European Journal of Operational Research 202(3): 615-627.
 
Bierwirth, C. and F. Meisel (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.
 
Carlo, H. J., I. F. Vis and K. J. Roodbergen (2015). "Seaside operations in container terminals: literature overview, trends, and research directions." Flexible Services and Manufacturing Journal 27(2): 224-262.
 
Iris, Ç. and J. S. L. Lam (2019). "Recoverable robustness in weekly berth and quay crane planning." Transportation Research Part B: Methodological 122: 365-389.
 
Iris, Ç., D. Pacino and S. Ropke (2017). "Improved formulations and an adaptive large neighborhood search heuristic for the integrated berth allocation and quay crane assignment problem." Transportation Research Part E: Logistics and Transportation Review 105: 123-147.
 
Kim, A., H.-J. Park, J.-H. Park and S.-W. Cho (2021). "Rescheduling Strategy for Berth Planning in Container Terminals: An Empirical Study from Korea." Journal of Marine Science and Engineering 9(5): 527.
 
Lee, C.-Y. and D.-P. Song (2017). "Ocean container transport in global supply chains: Overview and research opportunities." Transportation Research Part B: Methodological 95: 442-474.
 
Li, M. Z., J. G. Jin and C. X. Lu (2015). "Real-time disruption recovery for integrated berth allocation and crane assignment in container terminals." Transportation Research Record 2479(1): 49-59.
 
Li, Q., S. Tong, C. Yang and N. Wang (2009). Optimization of operation scheme of container terminal based on disruption management. International Conference on Transportation Engineering 2009.
Liu, C., X. Xiang and L. Zheng (2020). "A two-stage robust optimization approach for the berth allocation problem under uncertainty." Flexible Services and Manufacturing Journal 32(2): 425-452.
 
Liu, C., L. Zheng and C. Zhang (2016). "Behavior perception-based disruption models for berth allocation and quay crane assignment problems." Computers & Industrial Engineering 97: 258-275.
 
Lu, Z.-q. and L.-f. Xi (2010). "A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time." European Journal of Operational Research 207(3): 1327-1340.
 
Lv, X., J. G. Jin and H. Hu (2020). "Berth allocation recovery for container transshipment terminals." Maritime Policy & Management: 1-17.
 
Lv, X., J. G. Jin and H. Hu (2020). "Berth allocation recovery for container transshipment terminals." Maritime Policy & Management 47(4): 558-574.
 
Rodrigues, F. and A. Agra (2021). "An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times." European Journal of Operational Research.
 
Rodriguez-Molins, M., M. Salido and F. Barber (2014). "Robust scheduling for berth allocation and quay crane assignment problem." Mathematical Problems in Engineering 2014.
 
Schepler, X., N. Absi, D. Feillet and E. Sanlaville (2019). "The stochastic discrete berth allocation problem." EURO Journal on Transportation and Logistics 8(4): 363-396.
 
Xiang, X., C. Liu and L. Miao (2018). "Reactive strategy for discrete berth allocation and quay crane assignment problems under uncertainty." Computers & Industrial Engineering 126: 196-216.
 
Yan, S., C.-C. Lu, J.-H. Hsieh and H.-C. Lin (2019). "A dynamic and flexible berth allocation model with stochastic vessel arrival times." Networks and Spatial Economics 19(3): 903-927.
 
Zeng, Q., Z. Yang and X. Hu (2011). "Disruption recovery model for berth and quay crane scheduling in container terminals." Engineering Optimization 43(9): 967-983.
 
Zhang, Q., Q. Zeng and H. Yang (2016). "A lexicographic optimization approach for berth schedule recovery problem in container terminals." Transport 31(1): 76-83.
 
Zhen, L., L. H. Lee and E. P. Chew (2011). "A decision model for berth allocation under uncertainty." European Journal of Operational Research 212(1): 54-68.
 
Zhou, P.-f. and H.-g. Kang (2008). "Study on berth and quay-crane allocation under stochastic environments in container terminal." Systems Engineering-Theory & Practice 28(1): 161-169.
Quarterly Journal of Transportation Engineering
Volume 15, Issue 1 - Serial Number 58
October 2023
Pages 3203-3229

Files

History

  • Receive Date: 08 November 2021
  • Revise Date: 29 December 2021
  • Accept Date: 03 January 2022

Share

How to cite

Statistics