강건한 선석 계획을 위한 가우시안 혼합 모델 기반의 완충 시간 적용
Robust berth scheduling with GMM-based buffer time
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
.
Abstract
With global changes as the spread of COVID-19, resource management of container terminals has become more difficult. For this reason, terminal managers have to come up with robust schedules to manage vessels, and many research have conducted to provide robust berth schedule from disruptions such as vessel delays. In this paper, a two-phase mathematical model is proposed to generate a robust berth schedule with GMM(gaussian mixture model)-based buffer time. In phase 1, tardiness cost is minimized and the best berthing position is determined. In phase 2, the schedule is rescheduled to minimize the deviation from the baseline schedule obtained by phase 1. At the same time, in order to assign optimal buffer time to each vessel, historical data is analyzed and applied to the proposed model by utilizing machine learning techniques. The proposed method, compared to conventional methods, showed improvement in reducing the total cost incurred for a terminal when encountered with disruptions.
참고문헌 (28)
- Bierwirth, C., "A survey of berth allocation and quay crane scheduling problems in container terminals", European Journal of Operational Research, 202(3), pp.615~627 (2010)
- Bierwirth, C., "A follow-up survey of berth allocation and quay crane scheduling problems in container terminals", European Journal of Operational Research, 244(3), pp.675~689 (2015)
- Du, Y., "A feedback procedure for robust berth allocation with stochastic vessel delays, In Intelligent control and automation(WCICA)", 2010 8th World Congress, pp.2210~2215 (2010)
- Guan, Y., "The berth allocation problem : models and solution methods", Or Spectrum, 26(1), pp.75~92 (2004)
- Guan, Y., "A multiprocessor task scheduling model for berth allocation : heuristic and worst-case analysis", Operations Research Letters, 30(5), pp.343~350 (2002)
- Imai, A., "Efficient planning of berth allocation for container terminals in Asia", Journal of Advanced transportation, 31(1), pp.75~94 (1997)
- Imai, A., "Berth allocation at indented berths for mega-containerships", European Journal of Operational Research, 179(2), pp.579~593 (2007)
- Imai, A., "The dynamic berth allocation problem for a container port", Transportation Research Part B : Methodological, 35(4), pp.401~417 (2001)
- Iris, C., "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, pp.123~147 (2017)
- Karafa, J., "The berth allocation problemwith stochastic vessel handling times", The International Journal of Advanced Manufacturing Technology, 65(1-4), pp.473~484 (2013)
- Kim, A., "Rescheduling Strategy for Berth Planning in Container Terminals : An Empirical Study from Korea", Journal of Marine Science and Engineering, 9(5), pp.527~ (2021)
- Kim, K. H., "Berth scheduling by simulated annealing", Transportation Research Part B : Methodological, 37(6), pp.541~560 (2003)
- Kim, K. H., "A crane scheduling method for port container terminals", European Journal of operational research, 156(3), pp.752~768 (2004)
- Lai, K. K., "A study of container berth allocation", Journal of advanced transportation, 26(1), pp.45~60 (1992)
- Larsen, R., "A framework for dynamic rescheduling problems", International Journal of Production Research, 57(1), pp.16~33 (2019)
- Liu, C., "A two-stage robust optimization approach for the berth allocation problem under uncertainty", Flexible Services and Manufacturing Journal, 32(2), pp.425~452 (2020)
- Lu, Z. Q., "A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time", European Journal of Operational Research, 207(3), pp.1327~1340 (2010)
- Meisel, F., "Heuristics for the integration of crane productivity in the berth allocation problem", Transportation Research Part E : Logistics and Transportation Review, 45(1), pp.196~209 (2009)
- Moorthy, R., "Berth management in container terminal: the template design problem. In Container Terminals and Cargo Systems", pp.63~86 (2007)
- Park, K. T., "Berth scheduling for container terminals by using a sub-gradient optimization technique", Journal of the operational research society, 53(9), pp.1054~1062 (2002)
- Park, Y. M., "A scheduling method for berth and quay cranes, In Container terminals and automated transport systems", pp.159~181 (2005)
- Shang, X. T., "A robust optimization approach to the integrated berth allocation and quay crane assignment problem", Transportation Research Part E : Logistics and Transportation Review, 94, pp.44~65 (2016)
- Ting, C. J., "Particle swarm optimization algorithm for the berth allocation problem", Expert Systems with Applications, 41(4), pp.1543~1550 (2014)
- Ursavas, E., "Optimal policies for the berth allocation problem under stochastic nature", European Journal of Operational Research, 255(2), pp.380~387 (2016)
- Wang, F., "A stochastic beam search for the berth allocation problem", Decision support systems, 42(4), pp.2186~2196 (2007)
- Xiao, L., "Berth allocation problem with quay crane assignment for container terminals based on rolling-horizon strategy", Mathematical Problems in Engineering (2014)
- Zeng, Q., "Disruption recovery model for berth and quay crane scheduling in container terminals", Engineering Optimization, 43(9), pp.967~983 (2011)
- Zhou, P. F., "Study on berth and quay-crane allocation under stochastic environments in container terminal", Systems Engineering-Theory & Practice, 28(1), pp.161~169 (2008)
