A lagrangian relaxation based heuristic for the static berth allocation problem using the cutting plane method

A. S. Simrin, N. N. Alkawaleet, Ali Diabat

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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 problem. In most of the cases that we studied, our solution technique converged to an optimal solution.

    Original languageEnglish (US)
    Title of host publicationICEIS 2013 - Proceedings of the 15th International Conference on Enterprise Information Systems
    Pages565-569
    Number of pages5
    Volume1
    StatePublished - Nov 21 2013
    Event15th International Conference on Enterprise Information Systems, ICEIS 2013 - Angers, France
    Duration: Jul 4 2013Jul 7 2013

    Other

    Other15th International Conference on Enterprise Information Systems, ICEIS 2013
    CountryFrance
    CityAngers
    Period7/4/137/7/13

    Fingerprint

    Polynomials
    Heuristics
    Lagrangian relaxation
    Cutting planes
    Allocation problem
    Optimal solution
    Assignment
    Layout

    Keywords

    • Container terminal
    • Cutting plane method
    • Lagrangian relaxation
    • Linear program
    • Static berth allocation

    ASJC Scopus subject areas

    • Information Systems
    • Information Systems and Management

    Cite this

    Simrin, A. S., Alkawaleet, N. N., & Diabat, A. (2013). A lagrangian relaxation based heuristic for the static berth allocation problem using the cutting plane method. In ICEIS 2013 - Proceedings of the 15th International Conference on Enterprise Information Systems (Vol. 1, pp. 565-569)

    A lagrangian relaxation based heuristic for the static berth allocation problem using the cutting plane method. / Simrin, A. S.; Alkawaleet, N. N.; Diabat, Ali.

    ICEIS 2013 - Proceedings of the 15th International Conference on Enterprise Information Systems. Vol. 1 2013. p. 565-569.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Simrin, AS, Alkawaleet, NN & Diabat, A 2013, A lagrangian relaxation based heuristic for the static berth allocation problem using the cutting plane method. in ICEIS 2013 - Proceedings of the 15th International Conference on Enterprise Information Systems. vol. 1, pp. 565-569, 15th International Conference on Enterprise Information Systems, ICEIS 2013, Angers, France, 7/4/13.
    Simrin AS, Alkawaleet NN, Diabat A. A lagrangian relaxation based heuristic for the static berth allocation problem using the cutting plane method. In ICEIS 2013 - Proceedings of the 15th International Conference on Enterprise Information Systems. Vol. 1. 2013. p. 565-569
    Simrin, A. S. ; Alkawaleet, N. N. ; Diabat, Ali. / A lagrangian relaxation based heuristic for the static berth allocation problem using the cutting plane method. ICEIS 2013 - Proceedings of the 15th International Conference on Enterprise Information Systems. Vol. 1 2013. pp. 565-569
    @inproceedings{1e4e5477ec0147c196cb50c3e43ac835,
    title = "A lagrangian relaxation based heuristic for the static berth allocation problem using the 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 problem. In most of the cases that we studied, our solution technique converged to an optimal solution.",
    keywords = "Container terminal, Cutting plane method, Lagrangian relaxation, Linear program, Static berth allocation",
    author = "Simrin, {A. S.} and Alkawaleet, {N. N.} and Ali Diabat",
    year = "2013",
    month = "11",
    day = "21",
    language = "English (US)",
    isbn = "9789898565594",
    volume = "1",
    pages = "565--569",
    booktitle = "ICEIS 2013 - Proceedings of the 15th International Conference on Enterprise Information Systems",

    }

    TY - GEN

    T1 - A lagrangian relaxation based heuristic for the static berth allocation problem using the cutting plane method

    AU - Simrin, A. S.

    AU - Alkawaleet, N. N.

    AU - Diabat, Ali

    PY - 2013/11/21

    Y1 - 2013/11/21

    N2 - 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 problem. In most of the cases that we studied, our solution technique converged to an optimal solution.

    AB - 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 problem. In most of the cases that we studied, our solution technique converged to an optimal solution.

    KW - Container terminal

    KW - Cutting plane method

    KW - Lagrangian relaxation

    KW - Linear program

    KW - Static berth allocation

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

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

    M3 - Conference contribution

    AN - SCOPUS:84887740239

    SN - 9789898565594

    VL - 1

    SP - 565

    EP - 569

    BT - ICEIS 2013 - Proceedings of the 15th International Conference on Enterprise Information Systems

    ER -