Mathematical programming formulations for the strategic berth template problem

Çağatay Iris; Eduardo Lalla-Ruiz; Jasmine Siu Lee Lam; Stefan Voß

doi:10.1016/j.cie.2018.07.003

Mathematical programming formulations for the strategic berth template problem

Çağatay Iris (Corresponding Author), Eduardo Lalla-Ruiz, Jasmine Siu Lee Lam^*, Stefan Voß

^*Corresponding author for this work

Industrial Engineering & Business Information Systems

Research output: Contribution to journal › Article › Academic › peer-review

28 Citations (Scopus)

62 Downloads (Pure)

Abstract

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.

Original language	English
Pages (from-to)	167-179
Number of pages	13
Journal	Computers & industrial engineering
Volume	124
DOIs	https://doi.org/10.1016/j.cie.2018.07.003
Publication status	Published - 1 Oct 2018

Keywords

Berth allocation problem
Maritime transportation
Set-packing formulation
Strategic planning
Heuristics
Mathematical Programming
Optimization
22/4 OA procedure

Access to Document

10.1016/j.cie.2018.07.003

Iris2018mathematicalFinal published version, 532 KBLicence: Taverne

Cite this

@article{0ad00443ecf84a42b7851900dd186db5,

title = "Mathematical programming formulations for the strategic berth template problem",

abstract = "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.",

keywords = "Berth allocation problem, Maritime transportation, Set-packing formulation, Strategic planning, Heuristics, Mathematical Programming, Optimization, 22/4 OA procedure",

author = "{\c C}ağatay Iris and Eduardo Lalla-Ruiz and Lam, {Jasmine Siu Lee} and Stefan Vo{\ss}",

year = "2018",

month = oct,

day = "1",

doi = "10.1016/j.cie.2018.07.003",

language = "English",

volume = "124",

pages = "167--179",

journal = "Computers & industrial engineering",

issn = "0360-8352",

publisher = "Elsevier",

}

TY - JOUR

T1 - Mathematical programming formulations for the strategic berth template problem

AU - Iris, Çağatay

AU - Lalla-Ruiz, Eduardo

AU - Lam, Jasmine Siu Lee

AU - Voß, Stefan

PY - 2018/10/1

Y1 - 2018/10/1

N2 - 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.

AB - 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.

KW - Berth allocation problem

KW - Maritime transportation

KW - Set-packing formulation

KW - Strategic planning

KW - Heuristics

KW - Mathematical Programming

KW - Optimization

KW - 22/4 OA procedure

UR - http://www.scopus.com/inward/record.url?scp=85050145666&partnerID=8YFLogxK

U2 - 10.1016/j.cie.2018.07.003

DO - 10.1016/j.cie.2018.07.003

M3 - Article

AN - SCOPUS:85050145666

SN - 0360-8352

VL - 124

SP - 167

EP - 179

JO - Computers & industrial engineering

JF - Computers & industrial engineering

ER -

Mathematical programming formulations for the strategic berth template problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this