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

Krimi, Issam; Benmansour, Rachid; Cadi, Abdessamad Ait El; Deshayes, Laurent; Duvivier, David; Elhachemi, Nizar

doi:10.5267/j.ijiec.2019.4.003

Cited by 5 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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.…”

Section: Literature Reviewmentioning

confidence: 99%

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

Jiang,

Ma,

Zhang

et al. 2024

Sustainability

View full text Add to dashboard Cite

Motivated by the need for a green and low-carbon economy, we explore the co-scheduling optimization of berths and cranes. Our aim is to balance the carbon tax and operating costs of ports under uncertain conditions, proposing an innovative nonlinear mixed-integer programming formulation. To address this optimization challenge, we have developed an enhanced version of the adaptive spiral flying dung beetle algorithm (ASFDBO). In order to evaluate the performance of the ASFDBO algorithm, we performed a benchmark function test and a convergence analysis with other recognized metaheuristics. In addition, we verified the practical applicability of the ASFDBO algorithm in different test scenarios. Through numerical experiments, we analyze the feasibility and effectiveness of the algorithm’s scheduling solutions and improvement strategies. Results indicate that our collaborative scheduling optimization, which considers both carbon and production costs, achieves feasible solutions and reduces carbon expenses. Finally, we investigate the impact of different carbon tax rates on the joint scheduling optimization of berths and quay cranes, and the results show that a reasonable carbon tax policy can effectively reduce the carbon emissions of ports.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

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

Jiang,

Ma,

Zhang

et al. 2024

Sustainability

View full text Add to dashboard Cite

show abstract

“…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.…”

Section: 1bap Literaturementioning

confidence: 99%

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

Bouzekri

Alpan

Giard

2023

Computers & Industrial Engineering

View full text Add to dashboard Cite

“…They also evaluated how dredging may affect marine container terminal operations in terms of allowing vessels better navigation and reducing delayed vessel departures. Finally, Krimi et al (2019) proposed a mixed integer programming model and a rolling horizon-based heuristic to solve the continuous time-invariant BACAP in bulk ports with multiple quays under availability and high tides restrictions. Indeed, the authors defined unavailability periods of the port due to preventive maintenance of quay cranes or bad weather conditions, and high tide intervals, which stipulate that vessels should leave the port only within these intervals.…”

Section: Bap and Bacap In Tidal Ports And Ports With Multiple Quaysmentioning

confidence: 99%

Integrated Laycan and Berth Allocation and time-invariant Quay Crane Assignment Problem in tidal ports with multiple quays

Bouzekri

Alpan

Giard

2021

European Journal of Operational Research

View full text Add to dashboard Cite

Efficient management of port resources plays a crucial role in reducing vessel stay times and avoiding the payment of demurrage charges. In this paper, we focus on the integrated Laycan and Berth Allocation and Quay Crane Assignment Problem (LBACAP), which considers three problems in an integrated way: the Laycan Allocation Problem, the dynamic continuous Berth Allocation Problem and the time-invariant Quay Crane Assignment Problem. Since these problems have different decision levels, a change of decision time scale is made inside the planning horizon. To ensure that this integrated problem is as close as possible to reality, we consider non-working periods and tidal ports with multiple quays that have different water depths. The integer programming model proposed for the LBACAP aims to find an efficient schedule for berthing chartered vessels with an efficient quay crane assignment, and to propose laycans (laydays and canceling) to new vessels to charter. In a second part, we focus on the integrated Laycan and Berth Allocation and Specific Quay Crane Assignment Problem (LBACASP), which extends the LBACAP model to include the assignment of a set of specific quay cranes to each vessel, considering the productivity of quay cranes (homogeneous or heterogeneous) and their maximum outreach. Moreover, we use predicates in the formulation of both models, which ensure maximum flexibility in their implementation, thereby improving significantly their computational performance. Finally, the computational study on several classes of generated test instances shows that problems with up to 100 vessels can be solved to optimality.

show abstract

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

Cited by 5 publications

References 23 publications

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

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

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

Integrated Laycan and Berth Allocation and time-invariant Quay Crane Assignment Problem in tidal ports with multiple quays

Contact Info

Product

Resources

About