Mathematical programming formulations for the strategic berth template problem

The strategic berth template problem (SBTP) is an important strategic problem arising at the seaside of container terminals. It aims at supporting terminal managers in deciding which calling ships should be accepted, and it covers determining the most appropriate berth template for the accepted inco...

Full description

Saved in:
Bibliographic Details
Main Authors: Iris, Çağatay, Lalla-Ruiz, Eduardo, Lam, Jasmine Siu Lee, Voß, Stefan
Other Authors: School of Civil and Environmental Engineering
Format: Article
Language:English
Published: 2020
Subjects:
Online Access:https://hdl.handle.net/10356/141032
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-141032
record_format dspace
spelling sg-ntu-dr.10356-1410322020-06-03T08:04:20Z Mathematical programming formulations for the strategic berth template problem Iris, Çağatay Lalla-Ruiz, Eduardo Lam, Jasmine Siu Lee Voß, Stefan School of Civil and Environmental Engineering Engineering::Civil engineering Maritime Transportation Berth Allocation Problem The strategic berth template problem (SBTP) is an important strategic problem arising at the seaside of container terminals. It aims at supporting terminal managers in deciding which calling ships should be accepted, and it covers determining the most appropriate berth template for the accepted incoming traffic. In this work, we propose and evaluate two formulations. One is based on a conceptual but yet unexplored mathematical model and another is based on a generalized set-packing problem (GSP). Both formulations are assessed on a well-defined set of problem instances. The results indicate that the GSP-based optimization model exhibits a relevant performance, providing optimal solutions within reasonable time for most of the instances considered. 2020-06-03T08:04:19Z 2020-06-03T08:04:19Z 2018 Journal Article Iris, Ç., Lalla-Ruiz, E., Lam, J. S. L., & Voß, S. (2018). Mathematical programming formulations for the strategic berth template problem. Computers & Industrial Engineering, 124, 167-179. doi:10.1016/j.cie.2018.07.003 0360-8352 https://hdl.handle.net/10356/141032 10.1016/j.cie.2018.07.003 2-s2.0-85050145666 124 167 179 en Computers & Industrial Engineering © 2018 Elsevier Ltd. All rights reserved.
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic Engineering::Civil engineering
Maritime Transportation
Berth Allocation Problem
spellingShingle Engineering::Civil engineering
Maritime Transportation
Berth Allocation Problem
Iris, Çağatay
Lalla-Ruiz, Eduardo
Lam, Jasmine Siu Lee
Voß, Stefan
Mathematical programming formulations for the strategic berth template problem
description The strategic berth template problem (SBTP) is an important strategic problem arising at the seaside of container terminals. It aims at supporting terminal managers in deciding which calling ships should be accepted, and it covers determining the most appropriate berth template for the accepted incoming traffic. In this work, we propose and evaluate two formulations. One is based on a conceptual but yet unexplored mathematical model and another is based on a generalized set-packing problem (GSP). Both formulations are assessed on a well-defined set of problem instances. The results indicate that the GSP-based optimization model exhibits a relevant performance, providing optimal solutions within reasonable time for most of the instances considered.
author2 School of Civil and Environmental Engineering
author_facet School of Civil and Environmental Engineering
Iris, Çağatay
Lalla-Ruiz, Eduardo
Lam, Jasmine Siu Lee
Voß, Stefan
format Article
author Iris, Çağatay
Lalla-Ruiz, Eduardo
Lam, Jasmine Siu Lee
Voß, Stefan
author_sort Iris, Çağatay
title Mathematical programming formulations for the strategic berth template problem
title_short Mathematical programming formulations for the strategic berth template problem
title_full Mathematical programming formulations for the strategic berth template problem
title_fullStr Mathematical programming formulations for the strategic berth template problem
title_full_unstemmed Mathematical programming formulations for the strategic berth template problem
title_sort mathematical programming formulations for the strategic berth template problem
publishDate 2020
url https://hdl.handle.net/10356/141032
_version_ 1681058846652497920