This research proposes two optimization models to deal with the berth allocation problem. The first model considers the berth allocation problem under regular vessel arrivals to minimize the flow time of vessels in the marine container terminal, minimize the tardiness penalty costs, and maximize the satisfaction level of vessels’ operators on preferred times of departure. The second model optimizes the berth allocation problem under emergency conditions by maximizing the number of assigned vessels, minimizing the vessel’s waiting time, and maximizing the satisfaction level on the served ships. Two real examples are provided for model illustration under regular and emergent vessel arrivals. Results show that the proposed models effectively provide optimal vessel scheduling in the terminal, reduce costs at an acceptable satisfaction level of vessels’ operators, decrease the waiting time of vessels, and shorten the delay in departures under both regular and emergent vessel arrivals. In conclusion, the proposed models may provide valuable assistance to decision-makers in marine container terminals on determining optimal berth allocation under daily and emergency vessel arrivals. Future research considers quay crane assignment and scheduling problems.
Priority control of berth allocation problem in container terminals
