Recoverable robustness in weekly berth and quay crane planning
The performance of a container terminal heavily relies on how efficiently the quayside resources, which are mainly berth and quay cranes, are used. The quayside related planning problems face uncertainty in various parameters, and this makes the efficient planning of these operations even more compl...
Saved in:
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/151529 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-151529 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1515292021-06-29T08:40:06Z Recoverable robustness in weekly berth and quay crane planning Iris, Çağatay Lam, Jasmine Siu Lee School of Civil and Environmental Engineering Engineering::Civil engineering Recoverable Robustness Container Terminals The performance of a container terminal heavily relies on how efficiently the quayside resources, which are mainly berth and quay cranes, are used. The quayside related planning problems face uncertainty in various parameters, and this makes the efficient planning of these operations even more complicated. This study aims at developing a recoverable robust optimization approach for the weekly berth and quay crane planning problem. In order to build systematic recoverable robustness, a proactive baseline schedule with reactive recovery costs has been suggested. The uncertainty of vessel arrivals and the fluctuation in the container handling rate of quay cranes are considered. The baseline schedule includes berthing positions, times and quay crane assignments for all vessels along with vessel-specific buffer times and buffer quay cranes. The problem also introduces recovery plans for each scenario. The objective is to minimize the cost of baseline schedule, the recovery costs from the baseline schedule and the cost of scenario solutions for different realizations of uncertain parameters. A mathematical model and an adaptive large neighborhood based heuristic framework are presented to solve the novel problem. Computational results point out the strength of the solution methods and practical relevance for container terminals. Nanyang Technological University This study is supported by project ref. M4061473 at Nanyang Technological University. 2021-06-29T08:40:06Z 2021-06-29T08:40:06Z 2019 Journal Article Iris, Ç. & Lam, J. S. L. (2019). Recoverable robustness in weekly berth and quay crane planning. Transportation Research Part B : Methodological, 122, 365-389. https://dx.doi.org/10.1016/j.trb.2019.02.013 0191-2615 0000-0001-5422-354X 0000-0001-7920-2665 https://hdl.handle.net/10356/151529 10.1016/j.trb.2019.02.013 2-s2.0-85062827048 122 365 389 en M4061473 Transportation Research Part B : Methodological © 2019 Elsevier Ltd. All rights reserved. |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Civil engineering Recoverable Robustness Container Terminals |
spellingShingle |
Engineering::Civil engineering Recoverable Robustness Container Terminals Iris, Çağatay Lam, Jasmine Siu Lee Recoverable robustness in weekly berth and quay crane planning |
description |
The performance of a container terminal heavily relies on how efficiently the quayside resources, which are mainly berth and quay cranes, are used. The quayside related planning problems face uncertainty in various parameters, and this makes the efficient planning of these operations even more complicated. This study aims at developing a recoverable robust optimization approach for the weekly berth and quay crane planning problem. In order to build systematic recoverable robustness, a proactive baseline schedule with reactive recovery costs has been suggested. The uncertainty of vessel arrivals and the fluctuation in the container handling rate of quay cranes are considered. The baseline schedule includes berthing positions, times and quay crane assignments for all vessels along with vessel-specific buffer times and buffer quay cranes. The problem also introduces recovery plans for each scenario. The objective is to minimize the cost of baseline schedule, the recovery costs from the baseline schedule and the cost of scenario solutions for different realizations of uncertain parameters. A mathematical model and an adaptive large neighborhood based heuristic framework are presented to solve the novel problem. Computational results point out the strength of the solution methods and practical relevance for container terminals. |
author2 |
School of Civil and Environmental Engineering |
author_facet |
School of Civil and Environmental Engineering Iris, Çağatay Lam, Jasmine Siu Lee |
format |
Article |
author |
Iris, Çağatay Lam, Jasmine Siu Lee |
author_sort |
Iris, Çağatay |
title |
Recoverable robustness in weekly berth and quay crane planning |
title_short |
Recoverable robustness in weekly berth and quay crane planning |
title_full |
Recoverable robustness in weekly berth and quay crane planning |
title_fullStr |
Recoverable robustness in weekly berth and quay crane planning |
title_full_unstemmed |
Recoverable robustness in weekly berth and quay crane planning |
title_sort |
recoverable robustness in weekly berth and quay crane planning |
publishDate |
2021 |
url |
https://hdl.handle.net/10356/151529 |
_version_ |
1705151304790179840 |