Maritime transport is the backbone of global supply chain. Around 80 % of global trade by volume is carried by sea and is handled by ports worldwide. The fierce competition among different ports forces the container port operators to improve the terminal operation efficiency and competitiveness. This research addresses the dynamic and discrete berth allocation problem (BAP) which is critical to the terminal operations. The objective is to minimize the total service times for vessels. To solve the NP-hard BAP problem, we develop a simulated annealing (SA) algorithm to obtain the near optimal solutions. Benchmark instances from the literature are tested for the effectiveness of the proposed SA and compared with other leading heuristics in the literature. Computational results show that our SA is competitive and find the optimal solutions in all instances.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Simulated Annealing Algorithm for Berth Allocation Problems


    Contributors:


    Publication date :

    2013-07-12


    Size :

    8 pages




    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Berth scheduling by simulated annealing

    Kim, Kap Hwan | Online Contents | 2003


    Berth scheduling by simulated annealing

    Kim, Kap Hwan / Moon, Kyung Chan | Elsevier | 2002


    Enhanced Berth Allocation Using the Cuckoo Search Algorithm

    Aslam, Sheraz / Michaelides, Michalis P. / Herodotou, Herodotos | Springer Verlag | 2022


    Berth allocation with service priority

    Imai, Akio | Online Contents | 2003


    Berth allocation with service priority

    Imai, Akio / Nishimura, Etsuko / Papadimitriou, Stratos | Elsevier | 2002