The Dynamic Berth Allocation Problem: A linearized formulation

Ahmed Simrin, Ali Diabat

    Research output: Contribution to journalArticle

    Abstract

    International shipping is a multi-billion dollar business which has undergone significant growth during the last decade. Considerable benefits could be gained by improving and optimizing container terminal operations. One specific challenge facing container terminals is the berth allocation problem, referred to as (BAP). In this paper, a new formulation is proposed for the dynamic berth allocation problem (DBAP). Initially the problem was formulated as a non-linear mixed integer program, followed by incorporating techniques to present an equivalent mixed integer program (MIP). A genetic algorithm (GA) heuristic was developed and applied to different instances of the problems, and through computational experiments the best, average, and worst case performances were analyzed to determine the efficiency of the algorithms.

    Original languageEnglish (US)
    Pages (from-to)473-494
    Number of pages22
    JournalRAIRO - Operations Research
    Volume49
    Issue number3
    DOIs
    StatePublished - Jan 1 2015

    Fingerprint

    Containers
    Container Terminal
    Mixed Integer Program
    Formulation
    Freight transportation
    Genetic algorithms
    Worst-case Performance
    Computational Experiments
    Industry
    Experiments
    Genetic Algorithm
    Heuristics
    Allocation problem
    Container terminal
    Mixed integer program
    Genetic algorithm
    Shipping
    Experiment

    Keywords

    • Container terminal
    • Dynamic berth allocation
    • Linear program
    • Non-linear program

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science Applications
    • Management Science and Operations Research

    Cite this

    The Dynamic Berth Allocation Problem : A linearized formulation. / Simrin, Ahmed; Diabat, Ali.

    In: RAIRO - Operations Research, Vol. 49, No. 3, 01.01.2015, p. 473-494.

    Research output: Contribution to journalArticle

    @article{f0d11abeeb874dbb9efd9c468a28b147,
    title = "The Dynamic Berth Allocation Problem: A linearized formulation",
    abstract = "International shipping is a multi-billion dollar business which has undergone significant growth during the last decade. Considerable benefits could be gained by improving and optimizing container terminal operations. One specific challenge facing container terminals is the berth allocation problem, referred to as (BAP). In this paper, a new formulation is proposed for the dynamic berth allocation problem (DBAP). Initially the problem was formulated as a non-linear mixed integer program, followed by incorporating techniques to present an equivalent mixed integer program (MIP). A genetic algorithm (GA) heuristic was developed and applied to different instances of the problems, and through computational experiments the best, average, and worst case performances were analyzed to determine the efficiency of the algorithms.",
    keywords = "Container terminal, Dynamic berth allocation, Linear program, Non-linear program",
    author = "Ahmed Simrin and Ali Diabat",
    year = "2015",
    month = "1",
    day = "1",
    doi = "10.1051/ro/2014039",
    language = "English (US)",
    volume = "49",
    pages = "473--494",
    journal = "RAIRO - Operations Research",
    issn = "0399-0559",
    publisher = "EDP Sciences",
    number = "3",

    }

    TY - JOUR

    T1 - The Dynamic Berth Allocation Problem

    T2 - A linearized formulation

    AU - Simrin, Ahmed

    AU - Diabat, Ali

    PY - 2015/1/1

    Y1 - 2015/1/1

    N2 - International shipping is a multi-billion dollar business which has undergone significant growth during the last decade. Considerable benefits could be gained by improving and optimizing container terminal operations. One specific challenge facing container terminals is the berth allocation problem, referred to as (BAP). In this paper, a new formulation is proposed for the dynamic berth allocation problem (DBAP). Initially the problem was formulated as a non-linear mixed integer program, followed by incorporating techniques to present an equivalent mixed integer program (MIP). A genetic algorithm (GA) heuristic was developed and applied to different instances of the problems, and through computational experiments the best, average, and worst case performances were analyzed to determine the efficiency of the algorithms.

    AB - International shipping is a multi-billion dollar business which has undergone significant growth during the last decade. Considerable benefits could be gained by improving and optimizing container terminal operations. One specific challenge facing container terminals is the berth allocation problem, referred to as (BAP). In this paper, a new formulation is proposed for the dynamic berth allocation problem (DBAP). Initially the problem was formulated as a non-linear mixed integer program, followed by incorporating techniques to present an equivalent mixed integer program (MIP). A genetic algorithm (GA) heuristic was developed and applied to different instances of the problems, and through computational experiments the best, average, and worst case performances were analyzed to determine the efficiency of the algorithms.

    KW - Container terminal

    KW - Dynamic berth allocation

    KW - Linear program

    KW - Non-linear program

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

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

    U2 - 10.1051/ro/2014039

    DO - 10.1051/ro/2014039

    M3 - Article

    AN - SCOPUS:84942084967

    VL - 49

    SP - 473

    EP - 494

    JO - RAIRO - Operations Research

    JF - RAIRO - Operations Research

    SN - 0399-0559

    IS - 3

    ER -