loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: A. S. Simrin ; N. N. Alkawaleet and A. H. Diabat

Affiliation: Masdar Institute of Science and Technology, United Arab Emirates

Keyword(s): Container Terminal, Linear Program, Static Berth Allocation, Lagrangian Relaxation, Cutting Plane Method.

Abstract: One of the important seaside operations problems that received a lot of attention in the literature is the assignment of quay space and service time to vessels that have to be unloaded and loaded at a terminal. This problem is commonly referred to as the Berth Allocation Problem (BAP). Different approaches exist in the literature for the berth allocation problem (BAP). Some of those approaches consider static arrival of vessels, so called the static berth allocation problem (SBAP), while other approaches consider dynamic arrival of vessels, called the dynamic berth allocation problem (DBAP). Approaches also differ in the layout used for the quay. In this paper we study one of the SBAP models presented in literature. Since the SBAP is a non-deterministic polynomial-time (NP) problem, we applied a Lagrangian Relaxation heuristic technique with the application of cutting plane method on our problem. We coded the cutting plane method in Matlab, and ran it on different instances of the pr oblem. In most of the cases that we studied, our solution technique converged to an optimal solution. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.145.77.114

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
S. Simrin, A.; N. Alkawaleet, N. and H. Diabat, A. (2013). A Lagrangian Relaxation based Heuristic for the Static Berth Allocation Problem using the Cutting Plane Method. In Proceedings of the 15th International Conference on Enterprise Information Systems (ICEIS 2013) - Volume 3: SSOS; ISBN 978-989-8565-59-4; ISSN 2184-4992, SciTePress, pages 565-569. DOI: 10.5220/0004628105650569

@conference{ssos13,
author={A. {S. Simrin}. and N. {N. Alkawaleet}. and A. {H. Diabat}.},
title={A Lagrangian Relaxation based Heuristic for the Static Berth Allocation Problem using the Cutting Plane Method},
booktitle={Proceedings of the 15th International Conference on Enterprise Information Systems (ICEIS 2013) - Volume 3: SSOS},
year={2013},
pages={565-569},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004628105650569},
isbn={978-989-8565-59-4},
issn={2184-4992},
}

TY - CONF

JO - Proceedings of the 15th International Conference on Enterprise Information Systems (ICEIS 2013) - Volume 3: SSOS
TI - A Lagrangian Relaxation based Heuristic for the Static Berth Allocation Problem using the Cutting Plane Method
SN - 978-989-8565-59-4
IS - 2184-4992
AU - S. Simrin, A.
AU - N. Alkawaleet, N.
AU - H. Diabat, A.
PY - 2013
SP - 565
EP - 569
DO - 10.5220/0004628105650569
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic