This chapter is dedicated to the use of metaheuristic algorithms to optimize seaside operations. In fact, every population is optimized on an individual processor to speed up the optimization process. The chapter reviews the important problem of berth allocation for container terminals (CTs). It explores the berth allocation problem (BAP) in bulk seaports. BAP is the maritime operations problem that deals with the most unreliable information, as the ships arrival time can be affected by weather conditions and mechanical issues. The chapter then focuses on the optimization of handling operations of quay cranes, and the integrated scheduling and/or allocation problem for the berth area and the quay cranes. Quay cranes are an interface between landside and seaside operations in container terminals. Most of the scheduling and planning solutions for the CTs can be implemented in the bulk seaports with minor modifications.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimization of Seaside Operations


    Contributors:


    Publication date :

    2018-04-30


    Size :

    48 pages




    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English






    Seaside garage

    Engineering Index Backfile | 1963


    Seaside service for sailors

    Evans, G.A. / Vaughan, B. | Tema Archive | 1978


    British seaside piers

    Wills, Anthony / Phillips, Tim | TIBKAT | 2014