A rolling horizon approach for the integrated multi-quays berth allocation and crane assignment problem for bulk ports

Abstract

In this paper, an efficient rolling horizon-based heuristic is presented to solve the integrated berth allocation and crane assignment problem in bulk ports. We were guided by a real case study of a multi-terminal port, owned by our Moroccan industrial partner, under several restrictions as high tides and installation's availability. First, we proposed a mixed integer programming model for the problem. Then, we investigated a strategy to dissipate the congestion within the presented rolling horizon. A variety of experiments were conducted, and the obtained results show that the proposed methods were efficient from a practical point of view.

Collaborative Scheduling Optimization of Container Port Berths and Cranes under Low-Carbon Environment

“…They used this approach to construct a robust optimization model, aiming to minimize both the positional deviation and departure delay costs. Krimi et al [15] investigated the multi-terminal BAP and QCAP, employing a heuristic algorithm centered around the rolling strategy. Their study specifically targeted bulk ports, limiting the applicability of their findings to container terminals.…”

Integrated Inbound and Outbound Scheduling for Coal Port: Constraint Programming and Adaptive Local Search

“…Pratap et al [7] and Hu [18] both utilized a meta-heuristic algorithm based on the genetic algorithm to optimize the joint allocation of berth and ship unloader configuration in bulk ports. Krimi et al [19] proposed an efficient heuristic algorithm based on the rolling horizon approach to solve the integrated problem of berth allocation and crane allocation in bulk ports. Peng et al [20], considering the minimization of port carbon emissions, utilized the multi-objective particle swarm optimization algorithm to achieve the collaborative allocation of bulk port berths and shore power.…”

Integrated laycan and berth allocation problem with ship stability and conveyor routing constraints in bulk ports

“…The authors also develop a tailored adaptive large neighborhood search algorithm to solve the integrated problem within a reasonable time. Krimi et al (2019Krimi et al ( , 2020 study the integrated Berth allocation and Quay Crane Assignment Problem in tidal bulk ports with multiple quays, vessels with multiple cargo types, and unavailability constraints due to preventive maintenance of quay cranes and bad weather conditions. The authors develop a general variable neighborhood searchbased approach to solve instances the commercial solver failed to solve optimally.…”