A Port Vessel Traffic Organization Optimization Method for Multi-Basin Mixed Navigation

By employing a hybrid heuristic approach combining NSGA-II and TS algorithms, the organization of vessel traffic in multi-port basin mixed navigation is optimized, solving the problem of minimizing vessel scheduling and waiting times, and achieving efficient and safe organization of port vessel traffic.

CN116468235BActive Publication Date: 2026-11-17YANTAI UNIV
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202310381083.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-04-11
Publication Date
2026-11-17
Estimated Expiration
2043-04-11

AI Technical Summary

Technical Problem

Existing technologies lack effective methods to optimize vessel traffic organization under mixed navigation conditions in multiple port basins. In particular, considering constraints such as the continuity of vessel traffic in and out of ports, tide times, mixed navigation modes, and traffic conflict resolution, it is difficult to minimize vessel scheduling time and waiting time.

Method used

A hybrid heuristic algorithm combining NSGA-II and TS is used to construct a multi-objective optimization model. By using chromosome generation, local optimal navigation operators, navigation mode rationality repair, and the strategy of leaving first and then berthing at the same berth, the order of ships entering and leaving the port and the navigation mode are optimized to ensure that various constraints are met.

Benefits of technology

It minimizes vessel scheduling and waiting times under mixed navigation conditions in multiple port basins, provides a reasonable navigation mode and port entry/exit sequence, and improves the efficiency and safety of port vessel traffic organization.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116468235B_ABST
    Figure CN116468235B_ABST
Patent Text Reader

Abstract

This invention provides a method for optimizing port vessel traffic organization in multi-basin mixed-navigation areas, relating to the field of scheduling technology for vessels entering and leaving ports in multi-basin areas. The method includes the following steps: considering constraints such as tidal constraints for vessels entering and leaving the port, traffic conflict resolution constraints for vessels entering and leaving the port in different waterways, and coordination of mixed-navigation modes, a multi-objective optimization model for vessel traffic organization in multi-basin mixed-navigation channels is established. A hybrid heuristic algorithm combining NSGA-II and TS is designed to solve the problem, obtaining the optimized traffic organization scheme. This method solves the scheduling problem with the objective of minimizing the scheduling time and waiting time of all vessels. It arranges reasonable navigation modes and entry / exit sequences for all vessels entering and leaving the port within the planning period, minimizing the scheduling time and waiting time of all vessels. This method has significant reference value for the rational arrangement of vessel entry and exit plans in multi-basin mixed-navigation ports.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of scheduling technology for vessels entering and leaving ports in multiple port basins, and more particularly to a method for optimizing port vessel traffic organization in multi-port basin mixed navigation. Background Technology

[0002] Currently, strengthening the functions of waterway channels and port hubs is of paramount importance. Improving the volume of vessel traffic entering and exiting the channels per unit time within the planned period and reducing channel occupancy time are the primary objectives chosen by port management departments. For ports with multi-basin mixed-type navigation channels, the water depth limitation of the mixed-type navigation channels requires vessels with larger drafts to enter and exit the port according to the tide times, and vessels need to switch between single- or two-way mixed navigation modes while navigating within the channel. Furthermore, the spatial limitations of multiple basins prevent two vessels from entering or exiting the same basin simultaneously.

[0003] Current technologies lack research on vessel traffic organization under mixed navigation conditions in multiple port basins. Mixed navigation channels must consider not only the continuity of vessel traffic entering and leaving the port, but also the resolution of traffic conflicts between vessels entering and leaving the port in different waterways. Currently, traditional manual experience-based methods are commonly used for vessel scheduling. Therefore, the key to studying the optimization of port vessel traffic organization under mixed navigation conditions in multiple port basins is to consider the above factors while arranging reasonable navigation patterns and entry / exit sequences for all vessels entering and leaving the port within the planning period, minimizing both scheduling time and waiting time for all vessels. Summary of the Invention

[0004] This invention takes into account the constraints of tidal flow for vessels entering and leaving the port, the continuity of traffic for vessels entering and leaving the port, coordinated mixed navigation modes, vessel speed rules for entering and leaving the port, conflict resolution of traffic for vessels entering and leaving the port in various waters, and non-negativity of vessel traffic in multiple port basins. It designs a hybrid heuristic algorithm combining NSGA-II and TS to solve the scheduling problem with the goal of minimizing the scheduling time and waiting time of all vessels.

[0005] The technical means employed in this invention are as follows:

[0006] A method for optimizing port vessel traffic organization in multi-basin mixed-navigation areas includes the following steps:

[0007] With constraints such as the tide of vessels entering and leaving the port in various waters, the continuity of vessel traffic, the coordinated mixed navigation mode, the speed rules for vessels entering and leaving the port, the resolution of traffic conflicts for vessels entering and leaving the port in various waters, and the non-negativity of vessel traffic in multiple port basins, and with the objective function of minimizing the scheduling time and waiting time of all vessels, a multi-objective optimization model for vessel traffic organization in a mixed navigation channel in multiple port basins is constructed.

[0008] Based on the characteristics of the multi-objective optimization model, a hybrid heuristic algorithm combining NSGA-II and TS is designed to solve the multi-objective optimization model and obtain the optimized traffic organization scheme.

[0009] Furthermore, a hybrid heuristic algorithm combining NSGA-II and TS is designed to solve the multi-objective optimization model, including the following steps:

[0010] Substituting the ship number, navigation mode, port basin number, and berth number into the chromosome generation algorithm, the generated chromosome represents a ship traffic organization scheme. The length of the chromosome is the number of ships entering and leaving the port, and the gene position of the chromosome represents the entry and exit order of a ship in the scheme.

[0011] The local optimal navigation operator is used to generate a neighborhood solution set. Any individual with the smallest ranking level in the fast non-dominated sorting is selected as the initial solution of the TS algorithm. The optimal solution is then found as the current solution and output.

[0012] The initial population was repaired by adopting a navigation mode rationality repair strategy and a first departure and then berthing repair strategy at the same berth, resulting in chromosomes that conform to the actual situation of the ship traffic organization scheme.

[0013] Furthermore, the initial chromosome adopts a four-layer real number encoding method, with each gene position corresponding to four layers of basic information, including ship number, navigation mode, port basin number, and berth number; each chromosome represents a ship traffic organization scheme, the length of each chromosome is the number of ships entering and leaving the port, and the gene position represents the order of entering and leaving the port in a scheme of a ship. Based on the chromosome encoding method and the set population size, an initial population is formed.

[0014] Furthermore, in the chromosome generation algorithm, the selection operation strategy is optimal navigation selection, retaining a portion of individuals with the optimal navigation pattern and directly advancing them to the next generation until the number of selected individuals reaches the number of retained optimal individuals. The remaining individuals in the population undergo crossover and mutation operations. A ship exchange crossover operator is used as the crossover operation strategy. Based on the set crossover probability PC, two ship crossover points are randomly selected in the interval [1, m], where m represents the number of ships. Then, a portion of the gene positions between the two ship gene positions in the two parent generations are exchanged. A mixed channel reversal mutation operator is used as the mutation operation strategy. Based on the set mutation probability PM, two channel reversal point gene positions are randomly selected in the interval [1, m], where m represents the number of ships. Then, two gene positions in the individuals are exchanged.

[0015] Furthermore, the navigation mode rationality correction strategy includes: adjusting the navigation mode assigned to each vessel according to port navigation rules to ensure rationality; when two vessels are sailing in opposite directions within the same period and do not meet the conditions for a mixed navigation mode, the vessels already assigned to the mixed navigation mode should be reassigned to a one-way navigation mode; when a vessel is assigned to a mixed navigation mode, and there are no vessels sailing in opposite directions within the start and end time of the vessel's scheduling, its navigation mode can be adjusted to a one-way navigation mode.

[0016] Furthermore, the same berth departure-then-berthing repair strategy includes: adjusting the order of ships entering and leaving the port according to the principle of first departure and then entry for the same berth. When there are ships with the same berth number and the entering ship is dispatched before the departing ship, the order of the two ships entering and leaving the port needs to be swapped to ensure that only one ship is allowed to berth at the same berth.

[0017] Furthermore, the ship tide constraints of the multi-objective optimization model include:

[0018] Vessels entering the port at high tide need to adjust their application time according to the start time of the high tide time window, while ensuring that the vessel arrives at the entrance waters of the multi-harbor basin before the end time of the high tide time window, as shown in the following formula:

[0019]

[0020] Among them, Tt ei Indicates the end time of the tide-following time window for vessel i; T 3i Indicates the time when vessel i arrives at the entrance waters of the multi-harbor basin; a i 'Indicates the time when vessel i requests adjustment; Tt si Indicates the start time of the tide-following time window for ship i; M represents a positive integer with a maximum value; IO i If vessel i is sailing in the direction of entering the port, the value is 1; otherwise, the value is 0. i If ship i needs to enter or leave the port with the tide, the value is 1; otherwise, the value is 0.

[0021] Vessels departing at high tide need to adjust their application time according to the start time of the high tide time window, while ensuring that the vessel arrives at the channel entrance waters before the end time of the high tide time window, as shown in the following formula:

[0022]

[0023] Among them, f i Indicates the time when ship i's scheduling is completed;

[0024] Ensure that the start time of vessel scheduling is not earlier than its requested time or the adjusted requested time, as shown in the following formula:

[0025]

[0026] Among them, S i Indicates the start time of ship i's scheduling; a i This indicates the time when vessel i applied for the service.

[0027] Furthermore, the constraints of the coordinated hybrid navigation mode include:

[0028] According to port navigation rules, vessels are assigned either one-way or two-way navigation modes. If the length or beam of a single vessel exceeds the prescribed value, or the sum of the beams of two vessels exceeds the prescribed value, the vessel is assigned a one-way navigation mode; otherwise, the vessel is assigned a mixed navigation mode, as shown in the following formula:

[0029]

[0030] Among them, X i X is a 0-1 decision variable. i =1 indicates that ship i is assigned a one-way navigation mode; X i =0 indicates that vessel i is assigned to a mixed navigation mode; length i Indicates the length of ship i; length 1m The specified value representing the length of a single ship; breadth i Indicates the width of ship i; breadth 1m The specified value for the breadth of a single ship; breadth 2m This refers to the specified value representing the sum of the widths of the two ships.

[0031] Furthermore, the constraints for resolving traffic conflicts between vessels entering and leaving the ports in the aforementioned waterways include:

[0032] To avoid overtaking situations between outbound flows in different harbor basins, outbound vessels must maintain a minimum safe time interval while ensuring that the speed of the following vessel does not exceed that of the preceding vessel, as shown in the following formula:

[0033]

[0034] Among them, T 3i δ1 represents the time when vessel i arrives at the entrance waters of the multi-port basin; δ1 represents the minimum safe time interval required for vessels to avoid overtaking; M represents a maximum positive integer; IO i If vessel i is sailing in the direction of entering the port, the value is 1; otherwise, the value is 0. ii' Y is a 0-1 decision variable. ii' =1 indicates that ship i is sailing ahead of ship i'; Y ii' =0 indicates that ship i' is sailing ahead of ship i; ψ ii'If vessel i and vessel i' sail through different harbor basins, the value is 1; otherwise, the value is 0.

[0035] To avoid crossover between inbound and outbound flows, when two vessels from different port basins are assigned to a mixed navigation mode and have different directions of travel, inbound and outbound vessels need to maintain a minimum safe time interval, as shown in the following formula.

[0036]

[0037] Where δ3 represents the minimum safe time interval required for ships to avoid a cross-encounter situation; X i X is a 0-1 decision variable. i =1 indicates that ship i is assigned a one-way navigation mode; X i =0 indicates that vessel i is assigned to a mixed navigation mode; Z ii' Z is a 0-1 decision variable. ii' =1 indicates that ship i' is sailing in the direction of departure and ship i is sailing in the direction of arrival; Z ii' =0 indicates that ship i' is sailing in the direction of entering the port and ship i is sailing in the direction of leaving the port;

[0038] When arriving and departing vessels berthed at different berths pass through the same harbor basin, the departing and arriving vessels must maintain a minimum safe time interval, as shown in the following formula;

[0039]

[0040] Wherein, δ2 represents the minimum safe time interval required for ships to avoid a head-on confrontation; f i Indicates the time when ship i's scheduling is completed; ζ ii' The value is 1 if the berth where ship i is docked is different from the berth where ship i' is docked, and 0 otherwise.

[0041] Compared with the prior art, the present invention has the following advantages:

[0042] This invention provides a multi-objective optimization model for vessel traffic organization in multi-port basin mixed-type navigation channels. By designing a hybrid heuristic algorithm combining NSGA-II and TS, it solves the scheduling problem with the goal of minimizing the scheduling time and waiting time of all vessels. It arranges reasonable navigation patterns and entry / exit sequences for all vessels entering and leaving the port during the planning period, minimizing both scheduling and waiting times. This model has significant reference value for the rational planning of vessel entry and exit schedules in multi-port basin mixed-type navigation ports. Attached Figure Description

[0043] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0044] Figure 1 This is a flowchart of the method of the present invention.

[0045] Figure 2 This is a schematic diagram of a port channel in an embodiment of the present invention.

[0046] Figure 3 This is a flowchart of the NSGA-II-TS algorithm of the present invention.

[0047] Figure 4 This is the Pareto optimal frontal plane diagram for the 15 ships of this invention. Detailed Implementation

[0048] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.

[0049] First, the meanings of the parameters and variables appearing in at least some embodiments of the present invention are explained: V represents the set of ships within the planning period; i represents the ship number within the planning period; i' represents any ship number other than i, (i,i')∈V and i≠i'; H represents the set of harbor basins; h represents the harbor basin number, h∈H; B represents the set of berths within the harbor; b represents the berth number within the harbor, b∈B; d 1i d1 represents the distance from the anchorage of vessel i to the channel entrance waters, i∈V; d2 represents the distance from the channel entrance waters to the one-way / two-way connecting waters, i.e., the distance of the one-way navigation section; d3 represents the distance from the one-way / two-way connecting waters to the multi-port basin entrance waters, i.e., the distance of the two-way navigation section; d 4i This indicates the distance from the entrance waters of the multi-harbor basin to the berth of vessel i; v i Indicates the speed of ship i; v min Indicates the minimum speed limit; v max Indicates the maximum speed limit; length i Indicates the length of ship i; length 1m The specified value representing the length of a single ship; breadth iIndicates the width of ship i; breadth 1m The specified value for the breadth of a single ship; breadth 2m Tt represents the specified value of the sum of the beams of two ships. si Indicates the start time of the tide-following time window for vessel i; Tt ei Indicates the end time of the tide-following time window for vessel i; a i δ1 represents the time when vessel i requests permission; M represents a positive integer with a maximum value; δ1 represents the minimum safe time interval required to avoid overtaking; δ2 represents the minimum safe time interval required to avoid encountering another vessel; δ3 represents the minimum safe time interval required to avoid a crossover encounter; IO i If vessel i is sailing in the direction of entering the port, the value is 1; otherwise, the value is 0. i If vessel i needs to enter or leave the port with the tide, the value is 1; otherwise, the value is 0. ii' If vessel i and vessel i' sail through different harbor basins, the value is 1; otherwise, the value is 0. ii' The value is 1 if the berth where ship i is berthed is different from the berth where ship i' is berthed; otherwise, the value is 0. s Indicates the scheduling time for all ships; T w Indicates the waiting time for all ships; T 1i Indicates the time when vessel i arrives at the entrance waters of the channel; T 2i Indicates the time when vessel i arrives at the one-way / two-way connecting waterway; T 3i Indicates the time when vessel i arrives at the entrance waters of the multi-harbor basin; a i 'Indicates the time when vessel i requests adjustment; S i Indicates the start time of ship i's scheduling; S min Indicates the minimum start time of scheduling among all ships; f i Indicates the time when ship i's scheduling is completed; f max Indicates the maximum scheduling completion time among all ships; X i X is a 0-1 decision variable. i =1 indicates that ship i is assigned a one-way navigation mode; X i =0 indicates that vessel i is assigned to a mixed navigation mode; Y ii' Y is a 0-1 decision variable. ii' =1 indicates that ship i is sailing ahead of ship i'; Y ii' =0 indicates that ship i' is sailing ahead of ship i; Z ii' Z is a 0-1 decision variable. ii' =1 indicates that ship i' is sailing in the direction of departure and ship i is sailing in the direction of arrival; Z ii' =0 indicates that ship i' is sailing in the direction of entering the port and ship i is sailing in the direction of leaving the port.

[0050] like Figure 1 As shown, this invention provides a method for optimizing port vessel traffic organization in multi-basin mixed-type navigation, comprising the following steps:

[0051] S1. Taking the resolution of vessel traffic conflicts in various waterways, vessel tide conditions, entry and exit speeds, vessel navigation continuity, and port navigation rules as constraints, and taking the minimization of scheduling time and waiting time of all vessels as objective functions, a multi-objective optimization model for vessel traffic organization in multi-port basin mixed navigation channels is constructed.

[0052] S2. Based on the characteristics of the multi-objective optimization model, a hybrid heuristic algorithm combining NSGA-II and TS is designed to solve the multi-objective optimization model and obtain the optimized traffic organization scheme.

[0053] In S1:

[0054] Objective function for multi-port basin vessel traffic scheduling:

[0055]

[0056] Equation (1) represents the minimum scheduling time for all vessels, which is the minimum difference between the maximum scheduling completion time and the minimum scheduling start time among all vessels. The scheduling completion time refers to the time when an inbound vessel reaches its berth or an outbound vessel reaches the channel entrance, and the scheduling start time refers to the time when an inbound vessel leaves its anchorage or an outbound vessel leaves its berth.

[0057]

[0058] Equation (2) represents the minimum waiting time for all vessels, which is the minimum sum of the differences between the start time of all vessel scheduling and the corresponding application time. The vessel application time refers to the time when an inbound vessel submits its application to enter the port at the anchorage or when a departing vessel submits its application to leave the port at the berth.

[0059] Constraints:

[0060] Restrictions on vessels entering and leaving port during high tide:

[0061]

[0062] Equation (3) indicates that vessels entering the port by tide need to adjust their application time according to the start time of the tide time window, while ensuring that the vessel reaches the entrance waters of the multi-port basin at a time less than the end time of the tide time window.

[0063]

[0064] Equation (4) indicates that vessels departing at high tide need to adjust their application time according to the start time of the high tide time window, while ensuring that the vessel reaches the waterway entrance water at a time less than the end time of the high tide time window.

[0065]

[0066] Equation (5) means ensuring that the start time of ship scheduling is not earlier than the application time or the adjusted application time.

[0067] Constraints on the continuity of traffic and navigation for vessels entering the port:

[0068]

[0069]

[0070]

[0071]

[0072] Equation (6-9) represents the continuity of navigation during the ship's entry into the port, and can sequentially determine the time when the ship arrives at the entrance waters of the mixed-type navigation channel, the single / two-way connecting waters, the entrance waters of the multi-basin waters, and the port basin waters (i.e., the berth where it is moored).

[0073] Constraints on the continuity of traffic and navigation for departing vessels:

[0074]

[0075]

[0076]

[0077] Equation (10-12) represents the continuity of navigation during the departure process of a ship, and can sequentially determine the time for the ship to arrive at the entrance waters of the multi-port basin, the single / double-direction connecting waters, and the entrance waters of the mixed navigation channel.

[0078] Coordinated Hybrid Navigation Mode Constraints:

[0079]

[0080] Equation (13) indicates that a vessel is assigned a one-way or two-way navigation mode according to the port navigation rules. If the length or width of a single vessel exceeds the specified value (single vessel length or single vessel width) or the sum of the widths of two vessels exceeds the specified value (sum of the widths of two vessels), the vessel is assigned a one-way navigation mode; otherwise, the vessel is assigned a mixed navigation mode.

[0081] Ship speed rules for entering and leaving the port:

[0082]

[0083] Equation (14) indicates that the speed of a ship entering or leaving the port should be within the limits of the port navigation rules.

[0084] Resolving and controlling traffic conflicts between vessels entering and leaving ports in various waterways:

[0085] Spatiotemporal distribution constraints of traffic merging flows in the waterway entrance area:

[0086]

[0087] Equation (15) indicates that to avoid overtaking between inbound vessels, it is necessary to maintain a minimum safe time interval between inbound vessels while ensuring that the speed of the following vessel is not greater than that of the preceding vessel.

[0088] Equation (16-18) indicates that the inbound flow and outbound flow should avoid a head-on encounter.

[0089]

[0090] Equation (16) indicates that when two vessels are assigned to a mixed navigation mode and have different directions of navigation, the inbound vessel and the outbound vessel need to maintain a minimum safe time interval.

[0091]

[0092] Equation (17) indicates that when two vessels are assigned to a one-way navigation mode and sail in different directions, the vessel entering the port and the vessel leaving the port need to maintain a minimum safe time interval.

[0093]

[0094] Equation (18) indicates that when two vessels are assigned to a mixed navigation mode and have different directions of navigation, the vessel entering the port and the vessel leaving the port need to maintain a minimum safe time interval.

[0095] Single / bidirectional connection water area mixing flow conversion constraints:

[0096]

[0097] Equation (19) indicates that the inbound and outbound flows should avoid a head-on situation. That is, when two vessels are assigned to a mixed navigation mode and have different directions of navigation, the outbound and inbound vessels need to maintain a minimum safe time interval.

[0098] Coordination constraints for flow conversion in the inlet waters of multiple harbor basins:

[0099]

[0100] Equation (20) indicates that to avoid overtaking situations between outbound flows in different port basins, outbound vessels need to maintain a minimum safe time interval while ensuring that the speed of the following vessel is not greater than that of the preceding vessel.

[0101] Equations (21-22) indicate that the inbound and outbound flows should avoid a head-on collision.

[0102]

[0103] Equation (21) indicates that when two vessels in different harbor basins are assigned to a one-way navigation mode and have different directions of navigation, the vessel entering the port and the vessel leaving the port need to maintain a minimum safe time interval.

[0104]

[0105] Equation (22) indicates that when two vessels in different port basins are assigned to a mixed navigation mode and have different directions of navigation, the inbound and outbound vessels need to maintain a minimum safe time interval.

[0106]

[0107] Equation (23) indicates that the inbound and outbound flows should avoid crossing each other. That is, when two ships in different port basins are assigned to a mixed navigation mode and have different directions of navigation, the inbound and outbound ships need to maintain a minimum safe time interval.

[0108] Multi-port basin waterway traffic flow conflict mitigation constraints:

[0109]

[0110] Equation (24) indicates that when inbound and outbound vessels berthed at different berths sail through the same harbor basin, the outbound and inbound vessels need to maintain a minimum safe time interval.

[0111]

[0112] Equation (25) indicates that when inbound and outbound vessels berthed at the same berth sail through the same harbor basin, they need to maintain a safe time interval.

[0113]

[0114] Equation (26) indicates that to avoid overtaking between outgoing vessels, two outgoing vessels in the same port basin need to maintain a minimum safe time interval while ensuring that the speed of the following vessel is not greater than that of the preceding vessel.

[0115] Non-negative constraints on vessel traffic in multiple port basins:

[0116]

[0117]

[0118] Equations (27-28) define the range of values ​​for the variables in the model.

[0119] In S2:

[0120] Based on the characteristics of the established model, a hybrid heuristic algorithm combining NSGA-II and TS is designed to solve the model, namely the Non-Dominated Sorting Genetic-Taboo Search Algorithm (NSGA-II-TS). The NSGA-II-TS algorithm flow is as follows: Figure 3 As shown in the figure. Here, the current iteration number of NSGA-II is gen, the maximum iteration number of NSGA-II is MAXGEN, the current iteration number of TS is λ, and the maximum iteration number of TS is μ.

[0121] The hybrid heuristic algorithm combining NSGA-II and TS includes chromosome generation algorithm, tabu algorithm, and chromosome repair strategy;

[0122] The chromosome generation algorithm considers the influence of ship number, navigation mode, port basin location, and berth location on the objective function. Therefore, the initial chromosome adopts a four-layer real-number encoding method, where each gene bit corresponds to four basic pieces of information: ship number, navigation mode, port basin number, and berth number. Each chromosome represents a ship traffic organization scheme, with its length equal to the number of ships entering and leaving the port, and the gene bit representing the entry and exit order of a ship in the scheme. Chromosome decoding can be seen as the reverse process of chromosome encoding. Based on the chromosome encoding method and the set population size (PS), an initial population is formed.

[0123] The selection strategies include retaining a subset of individuals with optimal navigation patterns using the optimal navigation selection method, directly advancing them to the next generation, until the number of selected individuals reaches the number of retained optimal individuals. The remaining individuals in the population undergo crossover and mutation operations. The ship-exchange crossover operator is used as the crossover strategy. Based on a set crossover probability PC, two ship crossover points are randomly selected in the interval [1, m], where m represents the number of ships. Then, a portion of the gene positions between the two ship gene positions in the two parent generations are exchanged. The mixed-channel reversal mutation operator is used as the mutation strategy. Based on a set mutation probability PM, two channel reversal point gene positions are randomly selected in the interval [1, m], where m represents the number of ships. Then, two gene positions in the individuals are exchanged.

[0124] The crossover strategy includes using the ship exchange crossover operator. The mutation strategy uses the mixed channel reversal mutation operator. The generation of a new offspring population is determined by using the generation gap (GGAP) to determine the proportion of individuals in the new offspring population that have been covered by crossover and mutation operations. Then, the best individual obtained from the TS algorithm is used to generate the worst individual in the new offspring population. Finally, a new offspring population is formed based on the population size (PS).

[0125] The tabu algorithm involves using the local optimal navigation operator to generate a neighborhood solution set, recording the found optimal points in a tabu list, and avoiding repeated searches of the optimal points recorded in the tabu list during the search process. Any individual with the smallest ranking rank in the fast non-dominated sorting algorithm is selected as the initial solution for the TS algorithm, with the minimum sum of the two objective function values ​​used as the pardon criterion.

[0126] The TS algorithm uses a local optimal navigation operator to generate a neighborhood solution set, and selects any individual with the smallest ranking level in the fast non-dominated sorting as the initial solution of the TS algorithm, with the minimum sum of the two objective function values ​​as the amnesty criterion.

[0127] The specific steps of the TS algorithm are as follows:

[0128] (1) Obtain the initial solution and initialize the TS algorithm parameters: tabu list χ=λ, tabu step size τ, number of iterations λ=1, maximum number of iterations μ.

[0129] (2) Two-element optimization is adopted, the maximum number of iterations operator generates the neighborhood solution set of the current solution, and all chromosomes in the solution set are repaired;

[0130] (3) Calculate the objective function value of the chromosome;

[0131] (4) Determine whether there exists a better solution than the currently found optimal solution in the neighborhood of the current solution. If there is a better solution than the currently found optimal solution, then the amnesty criterion is satisfied, and this solution is taken as the optimal solution of the current solution; if there is no better solution than the currently found optimal solution, then the amnesty criterion is not satisfied, and the optimal solution in the non-taboo list χ in the neighborhood of the current solution is taken as the current solution;

[0132] (5) Update the taboo list χ;

[0133] (6) Determine if the maximum number of iterations has been reached. If the maximum number of iterations has not been reached, repeat the tabu search process described above; if the maximum number of iterations has been reached, terminate the tabu search process and output the optimal solution of the tabu table χ.

[0134] After population initialization, TS algorithm and mutation operation, in order to ensure that the ship traffic organization scheme represented by the chromosome conforms to the actual situation, a navigation mode rationality repair strategy and a first departure and then berthing repair strategy for the same berth are proposed to repair the generated initial population.

[0135] Navigation mode rationality correction strategy: Adjust the navigation mode assigned to each vessel according to port navigation rules to ensure rationality. For example, if two vessels are sailing in opposite directions within the same period and do not meet the conditions for a mixed navigation mode, the vessels already assigned to the mixed navigation mode should be reassigned to a one-way navigation mode. Furthermore, if a vessel is assigned to a mixed navigation mode and there are no vessels sailing in the opposite direction during the start and end times of its scheduling, its navigation mode can be adjusted to a one-way navigation mode.

[0136] The "first-departure, then-berth" repair strategy for the same berth: Adjust the order of vessel arrival and departure according to the principle of "first-out, then-entry" for the same berth. For example, if there are vessels with the same berth number and the arriving vessel is dispatched before the departing vessel, the arrival and departure orders of the two vessels need to be swapped to ensure that only one vessel is allowed to berth at the same berth.

[0137] Example

[0138] like Figure 2 As shown, a simulation experiment was conducted using a port area waterway as an example. The impact of different parameters on the algorithm performance was analyzed, and the rationality of the model was verified through ship simulation results. Simulation examples with different numbers of ships of different sizes were calculated to determine the appropriate parameter combination for the algorithm.

[0139] This invention uses a port area waterway as an example for simulation experiments. The port area has 3 anchorages, 3 harbor basins, and 17 coal berths. The three harbor basins share a single waterway, and space in the multiple basins is limited. The navigation rules are as follows: when a single vessel is longer than 225m or wider than 32.3m, the waterway traffic mode is one-way; when two vessels are both no longer than 225m and no wider than 32.3m, and the sum of their widths is less than 61m, the waterway traffic mode is a mixed one-way and two-way traffic mode. To ensure the safety of vessels entering and leaving the port, the maximum speed for vessels in the waterway is 10 knots, and the minimum speed is 8 knots. Specifically, the distance between buoys 22 and 32 is 4.66 nm, the distance between buoy 32 and 40 is 3.38 nm, and the distance between buoy 40 and 46 is 2.74 nm. The distances between anchorages 1-3 and buoy 22 are 4.4 nm, 11 nm, and 17.8 nm, respectively. The distances between each berth and buoy 46 are shown in Table 1.

[0140] Table 1. Distances between each berth and buoy No. 46

[0141]

[0142]

[0143] A simulation experiment was conducted using 15 ships randomly selected from a port area on a specific day during the planned period. The corresponding port entry and exit plans are shown in Table 2. The table shows that ships 2, 14, and 15 need to utilize the tide window for entry and exit. Due to the different drafts of these ships, the tide window will vary. For example, ship 1's application time is 0 min, i.e., 00:00 (midnight); ship 15's application time is 648 min, i.e., 10:48 (morning). Based on field research, parameters 61, 62, and 63 in the model were set to 10 min. The parameters for the NSGA-II-TS algorithm are as follows: NSGA-II algorithm maximum iteration count (MAXGEN) is 300, population size (PS) is 200, generation gap (GGAP) is 0.8, crossover probability (PC) is 0.8, mutation probability (PM) is 0.05, TS algorithm maximum iteration count (μ) is 100, and tabu step size (T) is 100.

[0144] Table 2. Port entry and exit plans for 15 vessels

[0145]

[0146]

[0147] After 300 generations of calculations, the minimum scheduling time and minimum waiting time for the 15 ships tended to plateau in the 82nd and 95th generations, respectively, with corresponding values ​​of 315 min and 947 min. The final Pareto optimal frontier for the 15 ships contained 9 optimal solution schemes, such as... Figure 4 As shown in Table 3, the corresponding target values ​​are as follows. Table 3 shows that the minimum scheduling time for 15 ships is 315 minutes, at which point the waiting time for the 15 ships is 9412 minutes; the minimum waiting time for the 15 ships is 947 minutes, at which point the scheduling time for the 15 ships is 995 minutes.

[0148] Table 3. Objective values ​​corresponding to the optimal Pareto front.

[0149]

[0150] Taking the chromosome with the shortest waiting time as an example for analysis, the rationality of the model is verified by determining whether the scheme satisfies the following constraints: tide for vessels entering and leaving the port, continuity of vessel traffic, coordinated mixed navigation mode, vessel speed rules for entering and leaving the port, resolution of traffic conflicts in different waterways, and non-negativity of vessel traffic in multiple port basins. The decoding of the chromosome with the shortest waiting time for 15 vessels is shown in Table 4. Analysis of its decoding yields the navigation time and speed of vessels entering and leaving the port under the mixed navigation mode, as shown in Table 8. Specific analysis follows:

[0151] Table 4. Chromosome Decoding with Minimum Waiting Time for 15 Ships

[0152]

[0153]

[0154] Table 5. Sailing Time of Vessels Entering Port under One-Way Navigation Mode

[0155]

[0156] Table 6. Sailing Time of Departing Vessels under One-Way Navigation Mode

[0157]

[0158] Table 7. Sailing Time of Vessels Entering Port under Mixed Navigation Mode

[0159]

[0160] Table 8. Sailing Time of Departing Vessels under Mixed Navigation Mode

[0161]

[0162] In summary, from Figure 4 As can be seen from Tables 5-8, all vessels maintain the corresponding minimum safe time intervals when navigating through the mixed navigation channel entrance waters, single / two-way connecting waters, multi-port basin entrance waters, and each port basin waters. This satisfies the constraints proposed in this invention, including tidal flow for vessels entering and leaving the port, continuity of traffic for vessels entering and leaving the port, coordinated mixed navigation mode, vessel speed rules for entering and leaving the port, resolution of traffic conflicts for vessels entering and leaving the port in each waterway, and non-negative traffic conditions for vessels in multiple port basins. This avoids overtaking, encountering, and cross-encounter situations in the mixed navigation channel of multiple port basins, thus demonstrating the rationality and effectiveness of the port vessel traffic organization optimization method for mixed navigation in multiple port basins proposed in this invention.

[0163] The sequence numbers of the above embodiments of the present invention are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments.

[0164] In the above embodiments of the present invention, the descriptions of each embodiment have different focuses. For parts not described in detail in a certain embodiment, please refer to the relevant descriptions of other embodiments.

[0165] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some or all of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for optimizing port vessel traffic organization in multi-basin mixed navigation, characterized in that, Includes the following steps: Considering the constraints of tidal constraints for vessels entering and leaving the port, the constraints of traffic conflict resolution for vessels entering and leaving the port in various waterways, and the constraints of coordinated mixed navigation mode, a multi-objective optimization model for vessel traffic organization in multi-port basin mixed navigation channels is constructed with the objective function of minimizing the scheduling time and waiting time of all vessels. Based on the characteristics of the multi-objective optimization model, a hybrid heuristic algorithm combining NSGA-II and TS is designed to solve the multi-objective optimization model and obtain the optimized traffic organization scheme. A hybrid heuristic algorithm combining NSGA-II and TS is designed to solve multi-objective optimization models, including the following steps: Substituting the ship number, navigation mode, port basin number, and berth number into the chromosome generation algorithm, the generated chromosome represents a ship traffic organization scheme. The length of the chromosome is the number of ships entering and leaving the port, and the gene position of the chromosome represents the entry and exit order of a ship in the scheme. The local optimal navigation operator is used to generate a neighborhood solution set. Any individual with the smallest ranking level in the fast non-dominated sorting is selected as the initial solution of the TS algorithm. The optimal solution is then found as the current solution and output. The initial population was repaired by adopting a navigation mode rationality repair strategy and a first departure and then berthing repair strategy at the same berth, resulting in chromosomes that conform to the actual situation of the ship traffic organization scheme; The constraints on conflict resolution for vessels entering and leaving ports in the aforementioned waterways include: To avoid overtaking situations between outbound flows in different harbor basins, outbound vessels must maintain a minimum safe time interval while ensuring that the speed of the following vessel does not exceed that of the preceding vessel, as shown in the following formula: in, Indicates a ship The moment of arrival at the entrance waters of the multi-harbor basin This indicates that vessels need to maintain a minimum safe time interval to avoid overtaking situations; A positive integer representing a maximum value; Indicates a ship i If the ship is sailing in the direction of entering the port, the value is 1; otherwise, the value is 0. for Decision variables Indicates a ship Sailing on the ship Front; Indicates a ship Sailing on the ship Front; Indicates a ship and ships The value is 1 if the voyage passes through different harbor basins, and 0 otherwise. To avoid crossover between inbound and outbound flows, when two vessels from different port basins are assigned to a mixed navigation mode and have different directions of travel, inbound and outbound vessels need to maintain a minimum safe time interval, as shown in the following formula. in, This indicates that ships need to maintain a minimum safe time interval to avoid a crossover situation; for Decision variables Indicates a ship Assigned one-way traffic mode; Indicates a ship Assigned a mixed air traffic mode; for Decision variables Indicates a ship For ships sailing in the direction of departure Sailing towards the port; Indicates a ship For ships navigating towards the port Sailing in the direction of departure; When arriving and departing vessels berthed at different berths pass through the same harbor basin, the departing and arriving vessels must maintain a minimum safe time interval, as shown in the following formula; in, This indicates that to avoid a head-on confrontation, ships need to maintain a minimum safe time interval; Indicates a ship Scheduling completion time; Indicates a ship Berths and ships If the berths are different, the value is 1; otherwise, the value is 0.

2. The multi-berth hybrid navigable port vessel traffic service optimization method according to claim 1, characterized in that, The initial chromosome adopts a four-layer real number encoding method, with each gene position corresponding to four layers of basic information, including ship number, navigation mode, port basin number, and berth number; each chromosome represents a ship traffic organization scheme, the length of each chromosome is the number of ships entering and leaving the port, and the gene position represents the order of entry and exit of a ship in the scheme. Based on the chromosome encoding method and the set population size, an initial population is formed.

3. The multi-berth hybrid navigable port vessel traffic service optimization method according to claim 1, characterized in that, In the chromosome generation algorithm, the selection operation strategy is optimal navigation selection, which retains a portion of individuals with the optimal navigation pattern and directly enters the next generation until the number of selected individuals reaches the number of retained optimal individuals. The remaining individuals in the population undergo crossover and mutation operations. The ship exchange crossover operator is used as the crossover operation strategy. According to the set crossover probability PC, two ship crossover points are randomly selected in the interval [1, m], where m represents the number of ships. Then, some gene positions between the two ship gene positions in the two parents are exchanged. The mixed channel reversal mutation operator is used as the mutation operation strategy. According to the set mutation probability PM, two channel reversal point gene positions are randomly selected in the interval [1, m], where m represents the number of ships. Then, two gene positions in the individuals are exchanged.

4. The multi-berth hybrid navigable port vessel traffic service optimization method of claim 1, wherein, The navigation mode rationality correction strategy includes: adjusting the navigation mode assigned to each vessel according to port navigation rules to ensure rationality; when two vessels are sailing in opposite directions within the same period and do not meet the conditions for a mixed navigation mode, the vessels already assigned to the mixed navigation mode should be reassigned to a one-way navigation mode; for vessels already assigned to the mixed navigation mode, if there are no vessels sailing in opposite directions during the scheduling period of vessels already assigned to the mixed navigation mode, the navigation mode of the vessels already assigned to the mixed navigation mode should be adjusted to a one-way navigation mode.

5. The multi-berth hybrid navigable port vessel traffic service optimization method of claim 1, wherein, The same berth first departure then berthing repair strategy includes: adjusting the order of ships entering and leaving the port according to the principle of first departure then entry for the same berth. When there are ships with the same berth number and the ship entering the port is dispatched before the ship leaving the port, the order of the two ships entering and leaving the port needs to be swapped to ensure that only one ship is allowed to berth at the same berth.

6. The multi-berth hybrid navigable port vessel traffic service optimization method of claim 1, wherein, The ship tide-following constraints of the multi-objective optimization model include: Vessels entering the port at high tide need to adjust their application time according to the start time of the high tide time window, while ensuring that the vessel arrives at the entrance waters of the multi-harbor basin before the end time of the high tide time window, as shown in the following formula: in, Indicates a ship i The end of the tide-riding window; Indicates a ship The moment of arrival at the entrance waters of the multi-harbor basin; Indicates a ship Adjust application time; Indicates a ship i The start of the tide-riding time window; A positive integer representing a maximum value; Indicates a ship i If the ship is sailing in the direction of entering the port, the value is 1; otherwise, the value is 0. Indicates a ship If the port needs to be entered or exited by tide, the value is 1; otherwise, the value is 0. Vessels departing at high tide need to adjust their application time according to the start time of the high tide time window, while ensuring that the vessel arrives at the channel entrance waters before the end time of the high tide time window, as shown in the following formula: in, Indicates a ship Scheduling completion time; Ensure that the start time of vessel scheduling is not earlier than its requested time or the adjusted requested time, as shown in the following formula: in, Indicates a ship Scheduling start time; Indicates a ship i The application time.

7. The port vessel traffic organization optimization method for multi-basin mixed navigation according to claim 1, characterized in that, The constraints of the coordinated hybrid air traffic mode include: According to port navigation rules, vessels are assigned either one-way or two-way navigation modes. A vessel is assigned a one-way navigation mode if its length exceeds a specified value, its beam exceeds a specified value, or the sum of the beams of two vessels exceeds a specified value; otherwise, the vessel is assigned a mixed navigation mode, as shown in the following formula: in, for Decision variables Indicates a ship Assigned one-way traffic mode; Indicates a ship Assigned a mixed air traffic mode; Indicates a ship i Length; The specified value representing the length of a single ship; Indicates a ship i The width; The specified value indicating the beam of a single ship; This refers to the specified value representing the sum of the widths of the two ships.

Citation Information

Patent Citations

  • Optimization method of vessel traffic organization in compound channel waters

    CN107341573A

  • Global traffic organization and optimization method for entering and leaving large harbor complex navigation channel

    CN108346319A