Collaborative optimization for loading operation planning and vessel traffic scheduling in dry bulk ports

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

“…Although previous research has extensively focused on ship scheduling and loading operation scheduling, there is a lack of discussion on the coupling relationship between inbound and outbound operations. However, some of them [14,15] provide valuable descriptions and explanations regarding the problem background and related constraints that are relevant to this paper. By referring to these sources, readers can acquire a more comprehensive understanding of the specific problem context addressed in this paper.…”

“…By referring to these sources, readers can acquire a more comprehensive understanding of the specific problem context addressed in this paper. Zhang et al [15] established a multi-objective mathematical model for the loading operation and vessel traffic scheduling problem in Huanghua Port, and used a heuristic algorithm combining the variable neighborhood search and non-dominated sorting genetic algorithm II to solve the problem. A mixed-integer programming model for berth allocation and shiploader scheduling problem in Huanghua Port was established by Cao et al [14], and the exact solution is obtained by using the logical Benders decomposition.…”

“…The genetic algorithm has proven to be an effective and versatile approach for solving combinatorial optimization problems, particularly resource-constrained scheduling problems [56]. Zhang et al proposed a heuristic algorithm based on NSGA-II and VNS to address the combination problem of loading operation planning and ship traffic scheduling in bulk ports [15]. Building upon Zhang et al's work, this paper devises a genetic algorithm tailored to the CPIIOS problem.…”

Research on safety and efficiency warranted vessel scheduling in unidirectional multi-junction waterways of port waters

“…The berthing operation plan has been formulated in advance (see e.g., Zhang et al, 2016;Zhang et al, 2018); (2) Vessels sailing in the waterway at average speed (see e.g., Li and Jia, 2019); (3) All the check and test-related procedures and formalities have finished before arrival and departure times; (4) It is momentary behavior for a vessel to keep a vessel-following state (see e. g., Liu et al, 2021c); (5) Weather, obstructing navigation, emergency situations, failures of vessel schedules are not considered in this study. All resources are operating at a normal working status during the scheduling horizon (see e.g., Zhang et al, 2019;Zhang et al, 2022;Xia et al, 2021).…”

“…Heuristic algorithm is widely used to solve vessel scheduling problems (Gan et al, 2021;Hill et al, 2019;Lalla-Ruiz et al, 2018;Li et al, 2021;Liang et al, 2019;Liu et al, 2021c;Wang et al, 2018b;Zhang et al, 2016;Zhang et al, 2018;Zhang et al, 2019;Zhang et al, 2022). Approximate solutions can usually be obtained efficiently and quickly by designing heuristic algorithms, which has been broadly used for solving problems in this field.…”