Conflict-based berth allocation method and device, equipment and storage medium

By constructing a conflict-based berth allocation model and iterative solution technology, the accurate solution of berth allocation problems under uncertainty is solved, and the robustness and efficiency of dock operations are improved.

CN119090212APending Publication Date: 2024-12-06BEIJING INST OF TECH
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411155307.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-22
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

The prior art is difficult to accurately solve the berth allocation problem under uncertainty, especially during peak periods or severe weather conditions at container terminals, resulting in high recovery costs and stochastic planning models that are difficult to find feasible when data uncertainty is high. Solution.

Method used

Construct a conflict-based target berth allocation model, and determine the baseline allocation plan and the upper bound of the actual problem by iteratively solving and presetting uncertain scenarios. If the preset conditions are met, the target allocation plan will be output, otherwise the uncertain scenario will be optimized to improve robustness. .

Benefits of technology

In the uncertainty situation, the precise solution to the berth allocation problem is achieved, which significantly improves the robustness and allocation efficiency of the system and reduces the recovery cost.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119090212A_ABST
    Figure CN119090212A_ABST
Patent Text Reader

Abstract

The invention provides a conflict-based berth allocation method and device, equipment and a storage medium, and the method comprises the steps: constructing a conflict-based target berth allocation model; solving the parking space distribution model under the current iteration to obtain a baseline distribution plan and the total distribution cost; based on the baseline allocation plan and each uncertain scene in at least one preset uncertain set, determining an actual problem upper bound under the current iteration; if it is determined that a preset condition is met according to the actual problem upper bound and the total distribution cost, determining the baseline distribution plan as a target distribution plan and outputting the target distribution plan; and if it is determined that a preset condition is not met according to the upper bound of the actual problem and the total allocation cost, determining at least one target uncertain scene, inputting the target uncertain scene into the parking space allocation model, returning to execute the solving step, and adding one to the number of iterations. By constructing the target berth allocation model based on conflicts, the berth allocation problem is accurately solved under uncertainty, and the robustness of the system is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of berth allocation, and in particular to a conflict-based berth allocation method, device, equipment and storage medium. Background Art

[0002] The berth allocation problem of determining the berthing time and location of ships arriving within a given time period plays an important role in the management of container terminals. The utilization rate of berths directly affects the service quality of the port. The existing technology mainly considers the comprehensive optimization of berth allocation in a deterministic environment, that is, when there is no external interference in the system, the arrival and departure time of ships in the liner is determined, the problem is abstracted into a mathematical model, and solved by an algorithm to allocate appropriate berths and berthing time to ships about to arrive at the port to optimize the efficiency of loading and unloading cargo at the container terminal. When the peak period of container loading / unloading occurs or when the ship encounters severe weather conditions, interruptions such as late arrival, equipment failure and other unpredictable events may occur. If these uncertainties are ignored when formulating the benchmark plan, high recovery costs are required. In addition, the existing technology mainly uses random programming methods for optimizing system costs. Random programming needs to rely on accurate probability distribution to quantify data uncertainty, but the market demand in reality fluctuates greatly and the data information is limited. In many cases, there is no accurate method, and the data is always insufficient to be represented by probability distribution. The random programming model may not be able to find a feasible solution in this case. In addition, the existing technologies for solving berth allocation problems under uncertainty are mostly solved by heuristic algorithms, and few studies are conducted on solving berth allocation problems under uncertainty. Therefore, how to accurately solve the berth allocation problem under uncertainty has become a research direction in this technical field. Summary of the invention

[0003] The technical purpose to be achieved by the embodiments of the present application is to provide a conflict-based berth allocation method, device, equipment and storage medium to solve the current problem of being unable to accurately solve the berth allocation problem under uncertainty.

[0004] In order to solve the above technical problems, an embodiment of the present application provides a conflict-based berth allocation method, comprising:

[0005] Constructing a conflict-based target berth allocation model;

[0006] Solving the berth allocation model in the current iteration to obtain a baseline allocation plan and a total allocation cost corresponding to the baseline allocation plan;

[0007] Determine an upper bound of an actual problem in a current iteration based on the baseline allocation plan and each uncertain scenario in at least one preset uncertainty set;

[0008] If it is determined that a preset condition is met according to the upper bound of the actual problem and the total allocation cost, the baseline allocation plan is determined as the target allocation plan and output, and the preset condition is that the quotient obtained by dividing the difference between the upper bound of the actual problem and the total allocation cost by the total allocation cost is less than or equal to a preset threshold;

[0009] If it is determined according to the upper bound of the actual problem and the total allocation cost that the preset conditions are not met, at least one target uncertain scenario is determined from the uncertainty set, the target uncertain scenario is input into the berth allocation model, and the step of solving the berth allocation model to obtain a baseline allocation plan and the total allocation cost corresponding to the baseline allocation plan is returned to execute, and the number of iterations is increased by one uncertainty set.

[0010] Preferably, in the method as described above, the step of constructing the conflict-based target berth allocation model is:

[0011] According to preset assumptions, a conflict robust optimization berth allocation problem model is constructed, and the conflict robust optimization berth allocation problem model is determined as the target berth allocation model, wherein the preset assumptions include: for the baseline cost, only the delay cost of the ship's berthing time and the penalty cost of berthing deviation from the optimal berthing position are considered; for the conflict between ships, the conflict is eliminated by adjusting the berthing time or position of the corresponding ship;

[0012] Alternatively, on the basis of constructing the conflict robust optimization berth allocation problem model, an extended conflict robust optimization berth allocation problem model is constructed according to a first preset definition, and the extended conflict robust optimization berth allocation problem model is determined as the target berth allocation model, wherein the first preset definition includes: the uncertainty set is divided according to the degree of deviation from the expected arrival and operation time; the weight represents the protection level of the decision maker;

[0013] Alternatively, on the basis of constructing the extended conflict robust optimization berth allocation problem model, hard constraints are imposed on the performance of the worst scenarios in each uncertainty set corresponding to the extended conflict robust optimization berth allocation problem model, a risk constraint conflict robust optimization berth allocation problem model is constructed, and the risk constraint robust optimization berth allocation problem model is determined as the target berth allocation model.

[0014] Specifically, in the above method, determining the upper bound of the actual problem in the current iteration based on the baseline allocation plan and each uncertain scenario in at least one preset uncertainty set includes:

[0015] According to the baseline allocation plan, obtaining the operating cost of the baseline allocation plan and respectively obtaining the total recovery cost corresponding to each uncertain scenario;

[0016] Determine the sum of the maximum value of the total recovery cost and the running cost, and allocate the total cost to the target in the current iteration;

[0017] The smaller value between the total cost of the target allocation and the upper bound of the historical problem corresponding to the previous iteration is determined as the upper bound of the actual problem in the current iteration.

[0018] Furthermore, in the above method, obtaining the total restoration cost corresponding to each uncertain scenario according to the baseline allocation plan includes:

[0019] According to the baseline allocation plan, the actual berthing time of each ship in a target-determined scenario is obtained, wherein the target-uncertain scenario is any uncertain scenario in the at least one uncertain set;

[0020] Determining the actual conflict situation between the ships according to the actual berthing time and the actual departure time of the previous ship;

[0021] The total restoration cost corresponding to the target uncertainty scenario is obtained according to the actual conflict situation.

[0022] Specifically, in the method as described above, the determining at least one target uncertain scene from the uncertainty set includes one of the following:

[0023] In the case where the conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertainty scenario is the scenario corresponding to the largest total recovery cost in all uncertainty sets;

[0024] In the case where the extended conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertainty scenario is the scenario corresponding to the maximum total recovery cost in each uncertainty set;

[0025] In the case where the risk constraint conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertainty scenario is a scenario in which the total recovery cost corresponding to the scenarios in each uncertainty set is greater than the performance limit of the corresponding uncertainty set.

[0026] Specifically, in the method described above, the first objective function corresponding to the conflict robust optimization berth allocation problem model is:

[0027]

[0028] Where V is the set of ships;

[0029] c 1k is the waiting penalty cost within the arrival time of ship k;

[0030] c 2kThe penalty fee for the departure delay of vessel k;

[0031] x k is the starting berthing time of ship k in the baseline allocation plan;

[0032] a k is the estimated arrival time of ship k in the baseline allocation plan;

[0033] v k is the departure delay time of ship k in the baseline allocation plan;

[0034] RC max is the maximum total recovery cost in all uncertain scenarios;

[0035] The first constraint condition corresponding to the first objective function includes at least one of the following:

[0036] Each vessel can only be allocated one berth;

[0037] There is no conflict between the two vessels in terms of berthing time and position;

[0038] The vessel cannot commence berthing before its estimated time of arrival;

[0039] Vessels cannot be moored outside the pier;

[0040] The maximum total recovery cost in all uncertain scenarios is greater than or equal to the total recovery cost corresponding to any scenario, where the total recovery cost corresponding to scenario S is RC S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ in uncertain scenario s;

[0041] The delay time of the ship's departure is greater than or equal to the difference between the sum of the ship's estimated starting berthing time and the estimated operation time and the estimated departure time;

[0042] The actual departure time of the preceding ship is less than the conflicting time with the succeeding ship.

[0043] Specifically, in the method described above, the second objective function corresponding to the extended conflict robust optimization berth allocation problem model is:

[0044]

[0045] Where V is the set of ships;

[0046] c 1k is the waiting penalty cost within the arrival time of ship k;

[0047] c2k The penalty fee for the departure delay of vessel k;

[0048] x k is the starting berthing time of ship k in the baseline allocation plan;

[0049] a k is the estimated arrival time of ship k in the baseline allocation plan;

[0050] g k is the estimated operation time of ship k;

[0051] d k is the estimated departure time of vessel k;

[0052] H is the total number of uncertain sets;

[0053] Ω h is the hth uncertain set;

[0054] ρh is the weight associated with the hth uncertainty set;

[0055] RC s is the total recovery cost in the uncertain scenario s, RC S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ in uncertain scenario s;

[0056] The second constraint condition corresponding to the second objective function includes at least one of the following:

[0057] Each vessel can only be allocated one berth;

[0058] There is no conflict between the two vessels in terms of berthing time and position;

[0059] The vessel cannot commence berthing before its estimated time of arrival;

[0060] Vessels cannot be moored outside the pier;

[0061] The total recovery cost corresponding to each scenario is the product of the number of conflicts in the corresponding scenario and the expected recovery cost of the conflict;

[0062] The actual departure time of the preceding ship is less than the conflicting time with the succeeding ship.

[0063] Specifically, according to the method described above, the third objective function corresponding to the risk constraint conflict robust optimization berth allocation problem model is:

[0064]

[0065] Where V is the set of ships;

[0066] c 1k is the waiting penalty cost within the arrival time of ship k;

[0067] c 2k The penalty fee for the departure delay of vessel k;

[0068] x k is the starting berthing time of ship k in the baseline allocation plan;

[0069] a k is the estimated arrival time of ship k in the baseline allocation plan;

[0070] g k is the estimated operation time of ship k;

[0071] d k is the estimated departure time of vessel k;

[0072] Ω h is the hth uncertain set;

[0073] RC s is the total recovery cost in the uncertain scenario s, RC S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ in uncertain scenario s;

[0074] The third constraint condition corresponding to the third objective function includes at least one of the following:

[0075] Each vessel can only be allocated one berth;

[0076] Each vessel can only be allocated one berth;

[0077] There is no conflict between the two vessels in terms of berthing time and position;

[0078] The vessel cannot commence berthing before its estimated time of arrival;

[0079] Vessels cannot be moored outside the pier;

[0080] The total recovery cost corresponding to each scenario is the product of the number of conflicts in the corresponding scenario and the expected recovery cost of the conflict;

[0081] The actual departure time of the preceding ship is less than the conflicting time with the succeeding ship;

[0082] The maximum total recovery cost does not exceed the performance limit of the corresponding uncertainty set.

[0083] Another embodiment of the present application further provides a conflict-based berth allocation control device, comprising: a model building module, for building a conflict-based target berth allocation model;

[0084] A first processing module is used to solve the berth allocation model in the current iteration to obtain a baseline allocation plan and a total allocation cost corresponding to the baseline allocation plan;

[0085] A second processing module is used to determine an upper bound of the actual problem in the current iteration based on the baseline allocation plan and each uncertain scenario in at least one preset uncertainty set;

[0086] A third processing module is used for determining the baseline allocation plan as the target allocation plan and outputting it if a preset condition is satisfied according to the upper bound of the actual problem and the total allocation cost, wherein the preset condition is that the quotient obtained by dividing the difference between the upper bound of the actual problem and the total allocation cost by the total allocation cost is less than or equal to a preset threshold;

[0087] The fourth processing module is used to determine at least one target uncertain scenario from the uncertainty set if it is determined that the preset conditions are not met according to the upper bound of the actual problem and the total allocation cost, input the target uncertain scenario into the berth allocation model, and return to execute the step of solving the berth allocation model to obtain a baseline allocation plan and the total allocation cost corresponding to the baseline allocation plan, and add one uncertainty set to the number of iterations.

[0088] Yet another embodiment of the present application provides an electronic device, comprising a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein the computer program implements the steps of the conflict-based berth allocation method described above when executed by the processor.

[0089] Yet another embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the conflict-based berth allocation method as described above are implemented.

[0090] Another embodiment of the present application further provides a computer program product, comprising computer instructions, which, when executed by a processor, implement the steps of the conflict-based berth allocation method as described above.

[0091] Compared with the prior art, the conflict-based berth allocation method, device, equipment and storage medium provided in the embodiments of the present application have at least the following beneficial effects:

[0092] This embodiment constructs a conflict-based target berth allocation model and iteratively solves the target berth allocation model to obtain a target baseline allocation plan that meets preset conditions, thereby achieving an accurate solution to the berth allocation problem under uncertainty and significantly improving the robustness of the system. BRIEF DESCRIPTION OF THE DRAWINGS

[0093] Figure 1 One of the flowcharts of the conflict-based berth allocation method in this application;

[0094] Figure 2 This is the second flow chart of the conflict-based berth allocation method in this application;

[0095] Figure 3 This is the third flow chart of the conflict-based berth allocation method in this application;

[0096] Figure 4 This is a flow chart of a control device for conflict-based berth allocation in the present application. DETAILED DESCRIPTION

[0097] In order to make the technical problems, technical solutions and advantages to be solved by the application clearer, the following will be described in detail in conjunction with the accompanying drawings and specific embodiments. In the following description, specific details such as specific configurations and components are provided only to help fully understand the embodiments of the application. Therefore, it should be clear to those skilled in the art that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of the application. In addition, for clarity and brevity, the description of known functions and structures has been omitted.

[0098] It should be understood that the references to "one embodiment" or "an embodiment" throughout the specification mean that the specific features, structures, or characteristics associated with the embodiment are included in at least one embodiment of the present application. Therefore, the references to "in one embodiment" or "in an embodiment" appearing throughout the specification do not necessarily refer to the same embodiment. In addition, these specific features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0099] In the various embodiments of the present application, it should be understood that the size of the serial numbers of the following processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0100] It should be understood that the term "and / or" in this article is only a description of the association relationship of the associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.

[0101] In the embodiments provided in the present application, it should be understood that "B corresponding to A" means that B is associated with A, and B can be determined according to A. However, it should also be understood that determining B according to A does not mean determining B only according to A, and B can also be determined according to A and / or other information.

[0102] When describing the embodiments of the present application, some symbols used in the following description are first explained.

[0103] V: ship set, V = {1, 2, ..., n};

[0104] k: ship index, k = 1, 2, ..., n;

[0105] n: total number of ships;

[0106] Q: berth set, Q = {1, 2, ..., m};

[0107] m: total number of berths;

[0108] q: berth index;

[0109] Ω: Discrete future scenario set, i.e., uncertainty set, Ω = {1, 2, ..., S}

[0110] S: total number of uncertain scenarios;

[0111] s: uncertain scene index;

[0112] L: pier length;

[0113] L q : berth length;

[0114] c 1k : waiting penalty cost within the arrival time of ship k, k∈V;

[0115] c 2k : Departure delay penalty cost of ship k, k∈V;

[0116] x k : The starting berthing time of ship k, k∈V;

[0117] a k : estimated arrival time of ship k, k∈V;

[0118] g k : The estimated operation time of ship k, k∈V;

[0119] d k : The expected departure time of ship k, k∈V;

[0120] H: total number of uncertain sets;

[0121] Ω h : the hth uncertain set;

[0122] ρh: weight associated with the hth uncertainty set;

[0123] λ: the expected cost of recovery from a conflict, which can be estimated from the historical records of conflicts;

[0124] a ks : The actual arrival time of ship k in scenario s, k∈V, s∈Ω;

[0125] T: planning cycle;

[0126] M: large positive number;

[0127] The actual berthing time of ship k in scenario s, k∈V, s∈Ω;

[0128] θ kq : Berth allocation of ship k, if ship k is allocated to berth q, it is 1, otherwise it is 0, k∈V, q∈Q;

[0129] y k : berthing position of ship k, k∈V;

[0130] The berth occupancy time of ship k′ and ship k. If ship k leaves before ship k′ berths, it is 1, otherwise it is 0, k, k′∈V;

[0131] The berth occupation position of ship k′ and ship k. If ship k′ is located below ship k, it is 1, otherwise it is 0, k,k′∈V;

[0132] RC s : The total recovery cost of a conflict in uncertain scenario s

[0133] τ kk′s : The conflict between ship k and ship k′ in uncertain scenario s, if a conflict occurs, it is 1, otherwise it is 0, s∈Ω;

[0134] ∈ ks : is an intermediate decision variable, which can be expressed as the expected berthing time of ship k under scenario s;

[0135] ξ ks : is an intermediate decision variable, which can be expressed as whether the ship k arrives on time in scenario s. If the ship k arrives on time, it is 1, otherwise it is 0.

[0136] Based on the above symbols, a conflict-based berth allocation method, device, equipment and storage medium provided by the present application are described in detail below in combination with the accompanying drawings and specific embodiments.

[0137] See also Figure 1 An embodiment of the present application provides a conflict-based berth allocation method, comprising:

[0138] Step S101, constructing a conflict-based target berth allocation model;

[0139] Step S102, solving the berth allocation model in the current iteration to obtain a baseline allocation plan and a total allocation cost corresponding to the baseline allocation plan;

[0140] Step S103, determining an upper bound of an actual problem in a current iteration based on the baseline allocation plan and each uncertain scenario in at least one preset uncertainty set;

[0141] Step S104: if it is determined that a preset condition is met according to the upper bound of the actual problem and the total allocation cost, the baseline allocation plan is determined as the target allocation plan and outputted, and the preset condition is that the quotient obtained by dividing the difference between the upper bound of the actual problem and the total allocation cost by the total allocation cost is less than or equal to a preset threshold;

[0142] Step S105: If it is determined according to the upper bound of the actual problem and the total allocation cost that the preset conditions are not met, at least one target uncertain scenario is determined from the uncertainty set, the target uncertain scenario is input into the berth allocation model, and the step of solving the berth allocation model to obtain a baseline allocation plan and the total allocation cost corresponding to the baseline allocation plan is returned to execute, and the number of iterations is increased by one uncertainty set.

[0143] In this embodiment, when performing berth allocation, the berth allocation problem with uncertain ship arrival time is considered, the concept of conflict is introduced to describe the robustness of scheduling, and a conflict-based target berth allocation model is constructed. The target berth allocation model is constructed based on a two-stage conflict robust optimization model, wherein the first stage is used to determine the baseline berthing time and position, and the second stage takes the minimum conflict as the goal, and the uncertainty factors of the target berth allocation model are characterized by an uncertainty set;

[0144] Furthermore, by solving the berth allocation model in the current iteration, the optimal baseline allocation plan in the current iteration and the total allocation cost corresponding to the baseline allocation plan can be obtained, and the total allocation cost can be used as the lower bound of the problem in the current iteration. In order to verify the feasibility of the baseline allocation plan in the uncertain scenario, calculations are performed based on the baseline allocation plan and each uncertain scenario in at least one preset uncertainty set to determine the upper bound of the actual problem in the current iteration.

[0145] After obtaining the lower bound of the problem and the upper bound of the actual problem, the lower bound of the problem and the upper bound of the actual problem are judged based on the preset conditions. If they meet the preset conditions, it is determined that the baseline allocation plan is the optimal plan for adapting to different uncertain scenarios, so it is used as the target allocation plan and output, so as to allocate berths based on the target allocation plan, thereby reducing the total allocation cost. Specifically, the preset condition is used to determine whether the upper bound of the actual problem is within a controllable range, so the preset condition is specifically the difference between the upper bound of the actual problem and the total allocation cost, and the quotient obtained by dividing the total allocation cost is less than or equal to the preset threshold.

[0146] If it is determined based on the lower bound of the problem and the upper bound of the actual problem that the preset conditions are not met, it means that the current baseline allocation plan still needs further optimization. Therefore, at least one target determination scenario is determined from the uncertainty set as the model input to train the model, and return to the above-mentioned berth allocation model to obtain the baseline allocation plan and the total allocation cost corresponding to the baseline allocation plan. In order to facilitate the distinction between the two solutions, the number of iterations is increased by one.

[0147] In summary, this embodiment achieves accurate solution of the berth allocation problem under uncertainty and significantly improves the robustness of the system by constructing a conflict-based target berth allocation model and iteratively solving the target berth allocation model to obtain a target baseline allocation plan that meets preset conditions.

[0148] Preferably, in the method as described above, the step of constructing the conflict-based target berth allocation model is:

[0149] According to preset assumptions, a conflict robust optimization berth allocation problem model is constructed, and the conflict robust optimization berth allocation problem model is determined as the target berth allocation model, wherein the preset assumptions include: for the baseline cost, only the delay cost of the ship's berthing time and the penalty cost of berthing deviation from the optimal berthing position are considered; for the conflict between ships, the conflict is eliminated by adjusting the berthing time or position of the corresponding ship;

[0150] Alternatively, on the basis of constructing the conflict robust optimization berth allocation problem model, an extended conflict robust optimization berth allocation problem model is constructed according to a first preset definition, and the extended conflict robust optimization berth allocation problem model is determined as the target berth allocation model, wherein the first preset definition includes: the uncertainty set is divided according to the degree of deviation from the expected arrival and operation time; the weight represents the protection level of the decision maker;

[0151] Alternatively, on the basis of constructing the extended conflict robust optimization berth allocation problem model, hard constraints are imposed on the performance of the worst scenarios in each uncertainty set corresponding to the extended conflict robust optimization berth allocation problem model, a risk constraint conflict robust optimization berth allocation problem model is constructed, and the risk constraint robust optimization berth allocation problem model is determined as the target berth allocation model.

[0152] In this embodiment, three berth allocation problem models are proposed, so that users can selectively use them based on their needs.

[0153] The first berth allocation problem model is a conflict robust optimization berth allocation problem model based on the berth allocation problem model. It is constructed according to the preset assumptions. The method of constructing the conflict robust optimization berth allocation problem model is relatively conventional and will not be repeated here. Specifically, the preset assumption is that for the baseline cost, only the delay cost of the ship's berthing time and the penalty cost of berthing deviation from the optimal berthing position are considered, and the cost caused by the ship's early arrival is not considered, because the early arrival of the ship usually does not cause additional costs to the terminal; for conflicts between ships, they are eliminated by adjusting the berthing time or position of the corresponding ship.

[0154] The second berth allocation problem model is based on the first berth allocation problem model and is extended by combining the preset definition to obtain the extended conflict robust optimization berth allocation problem model. During the extension, the uncertain scenarios are divided into multiple uncertain sets, and weights are assigned according to the performance of the worst scenario in each uncertain set. The preset positioning includes: defining the division of uncertain sets according to the degree of deviation from the expected arrival and operation time; the weights represent the protection level of the decision maker;

[0155] The third berth allocation problem model is based on the first or second berth allocation problem model, imposes hard constraints on the performance of the worst scenario in each uncertainty set, and constructs a risk constraint conflict robust optimization berth allocation problem model, wherein the imposed hard constraints include but are not limited to the performance of the worst scenario in each uncertainty set being less than or equal to the performance limit of the corresponding uncertainty set.

[0156] Among them, the second and third berth allocation problem models are both variants of the first berth allocation problem model. They can effectively deal with the problems that using only one uncertainty set to capture randomness may not achieve the expected results, small uncertainty sets are difficult to capture randomness, and may be unreliable for uncertainty, and large uncertainty sets often have over-protection problems, thereby providing decision makers with a good trade-off between system cost and computing time, achieving accurate solution of the model, and significantly improving the robustness of the system when the number of conflicts increases slightly.

[0157] See also Figure 2Specifically, in the method described above, determining the upper bound of the actual problem in the current iteration based on the baseline allocation plan and each uncertain scenario in at least one preset uncertainty set includes:

[0158] Step S201, according to the baseline allocation plan, obtaining the operating cost of the baseline allocation plan and respectively obtaining the total recovery cost corresponding to each uncertain scenario;

[0159] Step S202, determining the sum of the maximum value of the total recovery cost and the operating cost, and allocating the total cost to the target in the current iteration;

[0160] Step S203, determining the smaller value of the target allocation total cost and the corresponding historical problem upper bound in the previous iteration as the actual problem upper bound in the current iteration.

[0161] In this embodiment, an example is given of how to determine the upper bound of the actual problem, wherein a baseline allocation plan is first obtained based on the solution, the operating cost required for the implementation of the baseline allocation plan is obtained, and it is applied to each uncertain scenario respectively, and the total recovery cost corresponding to the baseline allocation plan in each uncertain scenario is obtained, wherein the total recovery cost is the cost of resolving all conflicts when conflicts occur in the corresponding uncertain scenario. After obtaining the operating cost and the total recovery cost corresponding to each uncertain scenario, they are summed up respectively to obtain the total allocation cost corresponding to each uncertain scenario, and then the maximum value is determined as the target allocation total cost under the current iteration. Further, in order to ensure that the actual problem upper bound finally determined is the baseline allocation plan obtained under the current iteration as a better solution, the smaller value between the target allocation total cost and the upper bound of the historical problem corresponding to the previous iteration is determined as the upper bound of the actual problem under the current iteration. It should be noted that when the current iteration is the first iteration, the upper bound of the historical problem is positive infinity.

[0162] See also Figure 3 , further, the method as described above, according to the baseline allocation plan, respectively obtains the total recovery cost corresponding to each uncertain scenario, including:

[0163] Step S301, according to the baseline allocation plan, obtaining the actual berthing time and the actual departure time of each ship in a target-determined scenario, wherein the target-uncertain scenario is any uncertain scenario in the at least one uncertain set;

[0164] Step S302, determining the actual conflict situation between the ships according to the actual berthing time and the actual departure time of the previous ship;

[0165] Step S303: acquiring the total restoration cost corresponding to the target uncertainty scenario according to the actual conflict situation.

[0166] In this embodiment, an example is given of how to obtain the total recovery cost corresponding to each uncertain scenario according to the baseline allocation plan, wherein each uncertain scenario is calculated independently, that is, according to the baseline allocation plan, the actual berthing time and the actual departure time of each ship in the target determination scenario are obtained, and the target uncertain scenario is any uncertain scenario in at least one uncertainty set. After obtaining the actual berthing time and the actual departure time of each ship, the actual conflict situation of the ship in the target uncertain scenario can be determined, and then recovery processing can be performed according to the actual conflict situation, and the total recovery cost corresponding to the target uncertain scenario can be obtained.

[0167] Specifically, in the method as described above, the determining at least one target uncertain scene from the uncertainty set includes one of the following:

[0168] In the case where the conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertainty scenario is the scenario corresponding to the largest total recovery cost in all uncertainty sets;

[0169] In the case where the extended conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertainty scenario is the scenario corresponding to the maximum total recovery cost in each uncertainty set;

[0170] In the case where the risk constraint conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertainty scenario is a scenario in which the total recovery cost corresponding to the scenarios in each uncertainty set is greater than the performance limit of the corresponding uncertainty set.

[0171] In this embodiment, the step of determining at least one target uncertain scenario from the uncertain set is implemented. When determining the target uncertain scenario, due to different target berth allocation problem models, the determination conditions of different target determination scenarios may be different.

[0172] Specifically, in the case where the conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertainty scenario is the scenario corresponding to the largest total recovery cost in all uncertainty sets. When there is only one uncertainty set, the target uncertainty scenario is the scenario corresponding to the largest total recovery cost in the uncertainty set; when there are multiple uncertainty sets, the target uncertainty scenario is the scenario corresponding to the largest total recovery cost in all uncertainty sets.

[0173] In the case where the extended conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertainty scenario is the scenario corresponding to the maximum total recovery cost in each uncertainty set.

[0174] In the case where the risk-constrained conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertain scenario is a scenario in which the total recovery cost corresponding to the scenarios in each uncertain set is greater than the performance limit of the corresponding uncertain set. Specifically, when there are multiple uncertain scenarios in the same uncertain set and the total recovery cost corresponding to them is greater than the performance limit of the corresponding uncertain set, it is determined that all the uncertain scenarios are target uncertain scenarios.

[0175] To facilitate understanding by those skilled in the art, three berth allocation problem models are exemplified below.

[0176] Specifically, in the method described above, the first objective function corresponding to the conflict robust optimization berth allocation problem model is:

[0177]

[0178] Where V is the set of ships;

[0179] c 1k is the waiting penalty cost within the arrival time of ship k;

[0180] c 2k The penalty fee for the departure delay of vessel k;

[0181] x k is the starting berthing time of ship k in the baseline allocation plan;

[0182] a k is the estimated arrival time of ship k in the baseline allocation plan;

[0183] v k is the departure delay time of ship k in the baseline allocation plan;

[0184] RC max is the maximum total recovery cost in all uncertain scenarios;

[0185] The first constraint condition corresponding to the first objective function includes at least one of the following:

[0186] Each vessel can only be allocated one berth, i.e.

[0187] There is no conflict between the two ships in terms of berthing time and position.

[0188] The vessel cannot commence berthing before its estimated time of arrival,

[0189] Vessels cannot be moored outside the pier.

[0190] For the above constraints,

[0191] The maximum total recovery cost in all uncertain scenarios is greater than or equal to the total recovery cost corresponding to any scenario, that is, RC max ≥RC s , where the total recovery cost corresponding to scenario S is RC S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ in uncertain scenario s;

[0192] The departure delay time of a ship is greater than or equal to the difference between the sum of the estimated start berthing time and the estimated operation time of the ship and the estimated departure time.

[0193] The actual departure time of the first ship is less than the conflicting time with the second ship.

[0194] The actual berthing time of the ship is

[0195]

[0196] It should be noted that when constructing the conflict robust optimization berth allocation problem model, the first initial objective function is constructed first:

[0197]

[0198] The defined constraints are:

[0199] Each vessel can only be allocated one berth, i.e.

[0200] There is no conflict between the two ships in terms of berthing time and position.

[0201] The vessel cannot commence berthing before its estimated time of arrival,

[0202] Vessels cannot be moored outside the pier.

[0203] For the above constraints,

[0204] The maximum total recovery cost in all uncertain scenarios is greater than or equal to the total recovery cost corresponding to any scenario, that is, RC max ≥RC s , where the total recovery cost RC corresponding to scenario S is S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ in uncertain scenario s;

[0205] The actual departure time of the first ship is less than the conflicting time with the second ship.

[0206] The actual berthing time of the ship is,

[0207] Among them, τ kk′s ∈{0,,1},

[0208] Due to the first initial objective function and constraints (for example: ) There are some nonlinear forms. In order to linearize these nonlinear forms, some additional decision variables are needed, so the auxiliary variable v is introduced. k ,θ k ,RC max ,∈ ks and ks and through RC max To represent the maximum total recovery cost in all uncertain scenarios, the first objective function mentioned above is obtained.

[0209] Specifically, in the method described above, the second objective function corresponding to the extended conflict robust optimization berth allocation problem model is:

[0210]

[0211] Where V is the set of ships;

[0212] c 1k is the waiting penalty cost within the arrival time of ship k;

[0213] c 2k The penalty fee for the departure delay of vessel k;

[0214] x k is the starting berthing time of ship k in the baseline allocation plan;

[0215] a k is the estimated arrival time of ship k in the baseline allocation plan;

[0216] g k is the estimated operation time of ship k;

[0217] d k is the estimated departure time of vessel k;

[0218] H is the total number of uncertain sets;

[0219] Ω h is the hth uncertain set;

[0220] ρh is the weight associated with the hth uncertainty set, where 0≤ρ h ≤1, and∑ h ρ h =1;

[0221] RC s is the total recovery cost in the uncertain scenario s, RC S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ in uncertain scenario s;

[0222] The second constraint condition corresponding to the second objective function includes at least one of the following:

[0223] Each vessel can only be allocated one berth, i.e.

[0224] There is no conflict between the two ships in terms of berthing time and position.

[0225] The vessel cannot commence berthing before its estimated time of arrival,

[0226] Vessels cannot be moored outside the pier.

[0227] For the above constraints,

[0228] The total recovery cost corresponding to each scenario is the product of the number of conflicts in the corresponding scenario and the expected recovery cost of the conflict, RC S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ in uncertain scenario s;

[0229] The actual departure time of the first ship is less than the conflicting time with the second ship.

[0230] The actual berthing time of the ship is,

[0231] Among them, τ kk′s ∈{0,,1}, Here is the actual berthing time of nonlinearization.

[0232] Specifically, according to the method described above, the third objective function corresponding to the risk constraint conflict robust optimization berth allocation problem model is:

[0233]

[0234] Where V is the set of ships;

[0235] c 1k is the waiting penalty cost within the arrival time of ship k;

[0236] c 2k The penalty fee for the departure delay of vessel k;

[0237] x k is the starting berthing time of ship k in the baseline allocation plan;

[0238] a k is the estimated arrival time of ship k in the baseline allocation plan;

[0239] g k is the estimated operation time of ship k;

[0240] d k is the estimated departure time of vessel k;

[0241] Ω h is the hth uncertain set;

[0242] RC s is the total recovery cost in the uncertain scenario s, RC S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ in uncertain scenario s;

[0243] The third constraint condition corresponding to the third objective function includes at least one of the following:

[0244] Each vessel can only be allocated one berth, i.e.

[0245] There is no conflict between the two ships in terms of berthing time and position.

[0246] The vessel cannot commence berthing before its estimated time of arrival,

[0247] Vessels cannot be moored outside the pier.

[0248] For the above constraints,

[0249] The total recovery cost corresponding to each scenario is the product of the number of conflicts in the corresponding scenario and the expected recovery cost of the conflict, RC S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ in uncertain scenario s;

[0250] The actual departure time of the first ship is less than the conflicting time with the second ship.

[0251] The actual berthing time of the ship is the larger value of the estimated berthing time and the estimated arrival time.

[0252]

[0253] Among them, τ kk′s ∈{0,,1},

[0254] The maximum total recovery cost does not exceed the performance limit of the corresponding uncertainty set,

[0255] The actual berthing time of the ship is

[0256]

[0257] Among them, at this time is the linearized actual berthing time.

[0258] See also Figure 4 Another embodiment of the present application further provides a conflict-based berth allocation control device, comprising:

[0259] A model building module 401 is used to build a conflict-based target berth allocation model;

[0260] The first processing module 402 is used to solve the berth allocation model in the current iteration to obtain a baseline allocation plan and a total allocation cost corresponding to the baseline allocation plan;

[0261] The second processing module 403 is used to determine the upper bound of the actual problem in the current iteration based on the baseline allocation plan and each uncertain scenario in at least one preset uncertainty set;

[0262] A third processing module 404 is used to determine the baseline allocation plan as the target allocation plan and output it if a preset condition is satisfied according to the actual problem upper bound and the allocation total cost, wherein the preset condition is that the quotient obtained by dividing the difference between the actual problem upper bound and the allocation total cost by the allocation total cost is less than or equal to a preset threshold;

[0263] The fourth processing module 405 is used to determine at least one target uncertain scenario from the uncertainty set if it is determined that the preset conditions are not met according to the upper bound of the actual problem and the total allocation cost, input the target uncertain scenario into the berth allocation model, and return to execute the step of solving the berth allocation model to obtain a baseline allocation plan and the total allocation cost corresponding to the baseline allocation plan, and add one uncertainty set to the number of iterations.

[0264] Specifically, in the above device, the model building module includes:

[0265] The first construction unit is used to construct a conflict robust optimization berth allocation problem model according to preset assumptions, and determine the conflict robust optimization berth allocation problem model as the target berth allocation model, wherein the preset assumptions include: for the baseline cost, only the delay cost of the ship's berthing time and the penalty cost of berthing deviation from the optimal berthing position are considered; for the conflict between ships, the conflict is eliminated by adjusting the berthing time or position of the corresponding ship;

[0266] Alternatively, a second construction unit is used to construct an extended conflict robust optimization berth allocation problem model based on the construction of the conflict robust optimization berth allocation problem model according to a first preset definition, and determine the extended conflict robust optimization berth allocation problem model as the target berth allocation model, wherein the first preset definition includes: the uncertainty set is divided according to the degree of deviation from the expected arrival and operation time; the weight represents the protection level of the decision maker;

[0267] Alternatively, a third construction unit is used to impose hard constraints on the performance of the worst scenarios in each uncertainty set corresponding to the extended conflict robust optimization berth allocation problem model on the basis of constructing the extended conflict robust optimization berth allocation problem model, construct a risk constraint conflict robust optimization berth allocation problem model, and determine the risk constraint robust optimization berth allocation problem model as the target berth allocation model.

[0268] Specifically, in the above-mentioned device, the second processing module includes:

[0269] A first processing unit, configured to obtain, according to the baseline allocation plan, an operating cost of the baseline allocation plan and respectively obtain a total recovery cost corresponding to each uncertain scenario;

[0270] A second processing unit is used to determine the sum of the maximum value of the total recovery cost and the running cost, and allocate the total cost to the target in the current iteration;

[0271] The third processing unit is used to determine the smaller value between the total cost of the target allocation and the upper bound of the historical problem corresponding to the previous iteration as the actual upper bound of the problem in the current iteration.

[0272] Specifically, in the above-mentioned device, the first processing unit includes:

[0273] A first sub-processing unit is configured to obtain, according to the baseline allocation plan, an actual berthing time of each ship in a target-determined scenario, wherein the target-uncertain scenario is any uncertain scenario in the at least one uncertain set;

[0274] A second sub-processing unit is used to determine the actual conflict situation between the ships according to the actual berthing time and the actual departure time of the previous ship;

[0275] The third sub-processing unit is used to obtain the total restoration cost corresponding to the target uncertainty scenario according to the actual conflict situation.

[0276] Specifically, in the above-mentioned device, the fourth processing module includes the following:

[0277] A fourth processing unit is configured to, when the conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertainty scenario is a scenario corresponding to the maximum total restoration cost in all uncertainty sets;

[0278] A fifth processing unit, configured to, when the extended conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertainty scenario is a scenario corresponding to the maximum total restoration cost in each uncertainty set;

[0279] A sixth processing unit is used for, when the risk constraint conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertain scenario is a scenario in which the total recovery cost corresponding to the scenarios in each uncertain set is greater than the performance limit of the corresponding uncertain set.

[0280] Specifically, in the above-mentioned device, the first objective function corresponding to the conflict robust optimization berth allocation problem model is:

[0281]

[0282] Where V is the set of ships;

[0283] c 1k is the waiting penalty cost within the arrival time of ship k;

[0284] c 2k The penalty fee for the departure delay of vessel k;

[0285] x k is the starting berthing time of ship k in the baseline allocation plan;

[0286] a k is the estimated arrival time of ship k in the baseline allocation plan;

[0287] v k is the departure delay time of ship k in the baseline allocation plan;

[0288] RC max is the maximum total recovery cost in all uncertain scenarios;

[0289] The first constraint condition corresponding to the first objective function includes at least one of the following:

[0290] Each vessel can only be allocated one berth;

[0291] There is no conflict between the two vessels in terms of berthing time and position;

[0292] The vessel cannot commence berthing before its estimated time of arrival;

[0293] Vessels cannot be moored outside the pier;

[0294] The maximum total recovery cost in all uncertain scenarios is greater than or equal to the total recovery cost corresponding to any scenario, where the total recovery cost corresponding to scenario S is RC S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ in uncertain scenario s;

[0295] The delay time of the ship's departure is greater than or equal to the difference between the sum of the ship's estimated starting berthing time and the estimated operation time and the estimated departure time;

[0296] The actual departure time of the preceding ship is less than the conflicting time with the succeeding ship.

[0297] Specifically, in the above-mentioned device, the second objective function corresponding to the extended conflict robust optimization berth allocation problem model is:

[0298]

[0299] Where V is the set of ships;

[0300] c 1k is the waiting penalty cost within the arrival time of ship k;

[0301] c 2k The penalty fee for the departure delay of vessel k;

[0302] x k is the starting berthing time of ship k in the baseline allocation plan;

[0303] a k is the estimated arrival time of ship k in the baseline allocation plan;

[0304] g k is the estimated operation time of ship k;

[0305] d k is the estimated departure time of vessel k;

[0306] H is the total number of uncertain sets;

[0307] Ω h is the hth uncertain set;

[0308] ρh is the weight associated with the hth uncertainty set;

[0309] RC s is the total recovery cost in the uncertain scenario s, RC S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ in uncertain scenario s;

[0310] The second constraint condition corresponding to the second objective function includes at least one of the following:

[0311] Each vessel can only be allocated one berth;

[0312] There is no conflict between the two vessels in terms of berthing time and position;

[0313] The vessel cannot commence berthing before its estimated time of arrival;

[0314] Vessels cannot be moored outside the pier;

[0315] The total recovery cost corresponding to each scenario is the product of the number of conflicts in the corresponding scenario and the expected recovery cost of the conflict;

[0316] The actual departure time of the preceding ship is less than the conflicting time with the succeeding ship.

[0317] Specifically, for the above-mentioned device, the third objective function corresponding to the risk constraint conflict robust optimization berth allocation problem model is:

[0318]

[0319] Where V is the set of ships;

[0320] c 1k is the waiting penalty cost within the arrival time of ship k;

[0321] c 2k The penalty fee for the departure delay of vessel k;

[0322] x k is the starting berthing time of ship k in the baseline allocation plan;

[0323] a k is the estimated arrival time of ship k in the baseline allocation plan;

[0324] g k is the estimated operation time of ship k;

[0325] d k is the estimated departure time of vessel k;

[0326] Ω h is the hth uncertain set;

[0327] RC s is the total recovery cost in the uncertain scenario s, RC S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ in uncertain scenario s;

[0328] The third constraint condition corresponding to the third objective function includes at least one of the following:

[0329] Each vessel can only be allocated one berth;

[0330] Each vessel can only be allocated one berth;

[0331] There is no conflict between the two vessels in terms of berthing time and position;

[0332] The vessel cannot commence berthing before its estimated time of arrival;

[0333] Vessels cannot be moored outside the pier;

[0334] The total recovery cost corresponding to each scenario is the product of the number of conflicts in the corresponding scenario and the expected recovery cost of the conflict;

[0335] The actual departure time of the preceding ship is less than the conflicting time with the succeeding ship;

[0336] The maximum total recovery cost does not exceed the performance limit of the corresponding uncertainty set.

[0337] The conflict-based berth allocation control device embodiment of the present application is a device corresponding to the embodiment of the conflict-based berth allocation method described above. All implementation means in the above method embodiment are applicable to the embodiment of the device and can achieve the same technical effect. The conflict-based berth allocation control device provided in the embodiment of the present application can implement all the method steps implemented in the above method embodiment and can achieve the same technical effect. The parts and beneficial effects of this embodiment that are the same as those in the method embodiment will not be described in detail here.

[0338] Yet another embodiment of the present application provides an electronic device, including a processor, a memory, and a computer program stored in the memory and executable on the processor. When the computer program is executed by the processor, the steps of the conflict-based berth allocation method described above are implemented, and the same technical effect can be achieved. To avoid repetition, it will not be described here.

[0339] Another embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the conflict-based berth allocation method as described above are implemented, and the same technical effect can be achieved. To avoid repetition, it will not be described here.

[0340] Another embodiment of the present application further provides a computer program product, including computer instructions, which, when executed by a processor, implement the steps of the conflict-based berth allocation method as described above and can achieve the same technical effect. To avoid repetition, they are not described again here.

[0341] In addition, the present application may repeat reference numerals and / or letters in different examples. This repetition is for the purpose of simplicity and clarity, and does not in itself indicate the relationship between the various embodiments and / or settings discussed.

[0342] It should also be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusions.

[0343] The above is a preferred embodiment of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles described in the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.

Claims

1. A conflict-based berth allocation method, characterized in that: include: Constructing a conflict-based target berth allocation model; Solving the berth allocation model in the current iteration to obtain a baseline allocation plan and a total allocation cost corresponding to the baseline allocation plan; Determining an upper bound of an actual problem in a current iteration based on the baseline allocation plan and each uncertain scenario in at least one preset uncertainty set; If a preset condition is determined to be satisfied based on the actual problem upper bound and the total allocation cost, the baseline allocation plan is determined as the target allocation plan and outputted, wherein the preset condition is that the quotient obtained by dividing the difference between the actual problem upper bound and the total allocation cost by the total allocation cost is less than or equal to a preset threshold; If it is determined based on the upper bound of the actual problem and the total allocation cost that the preset conditions are not met, at least one target uncertain scenario is determined from the uncertainty set, the target uncertain scenario is input into the berth allocation model, and the step of solving the berth allocation model to obtain a baseline allocation plan and the total allocation cost corresponding to the baseline allocation plan is returned to execute, and the number of iterations is increased by one.

2. The method according to claim 1, characterized in that The steps of constructing the conflict-based target berth allocation model are as follows: Based on preset assumptions, a conflict robust optimization berth allocation problem model is constructed, and the conflict robust optimization berth allocation problem model is determined as the target berth allocation model. The preset assumptions include: for baseline costs, only the delay cost of the ship's berthing time and the penalty cost of berthing deviating from the optimal berthing position are considered; conflicts between ships are eliminated by adjusting the berthing time or position of the corresponding ships; Alternatively, based on the construction of the conflict robust optimization berth allocation problem model, an extended conflict robust optimization berth allocation problem model is constructed according to a first preset definition, and the extended conflict robust optimization berth allocation problem model is determined as the target berth allocation model, wherein the first preset definition includes: the uncertainty set is divided according to the degree of deviation from the expected arrival and operation time; the weight represents the protection level of the decision maker; Alternatively, on the basis of constructing the extended conflict robust optimization berth allocation problem model, hard constraints are imposed on the performance of the worst scenarios in each uncertainty set corresponding to the extended conflict robust optimization berth allocation problem model, a risk-constrained conflict robust optimization berth allocation problem model is constructed, and the risk-constrained robust optimization berth allocation problem model is determined as the target berth allocation model.

3. The method according to claim 2, characterized in that Determining the upper bound of the actual problem in the current iteration based on the baseline allocation plan and each uncertain scenario in at least one preset uncertainty set includes: According to the baseline allocation plan, obtaining the operating cost of the baseline allocation plan and respectively obtaining the total recovery cost corresponding to each uncertain scenario; Determine the sum of the maximum value of the total recovery cost and the running cost, and allocate the total cost to the target in the current iteration; The smaller value between the target allocation total cost and the corresponding historical problem upper bound in the previous iteration is determined as the actual problem upper bound in the current iteration.

4. The method according to claim 3, characterized in that Obtaining the total recovery cost corresponding to each uncertain scenario according to the baseline allocation plan includes: Obtaining, according to the baseline allocation plan, an actual berthing time of each ship in a target-determined scenario, wherein the target-uncertain scenario is any uncertain scenario in the at least one uncertain set; determining an actual conflict situation between the ships based on the actual berthing time and the actual departure time of the previous ship; The total restoration cost corresponding to the target uncertainty scenario is obtained according to the actual conflict situation.

5. The method according to claim 3, characterized in that Determining at least one target uncertainty scenario from the uncertainty set includes one of the following: In a case where the conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertainty scenario is the scenario corresponding to the maximum total recovery cost in all uncertainty sets; In a case where the extended conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertainty scenario is the scenario corresponding to the maximum total recovery cost in each uncertainty set; When the risk-constrained conflict robust optimization berth allocation problem model is the target berth allocation model, the target uncertainty scenario is a scenario in which the total recovery cost corresponding to the scenarios in each uncertainty set is greater than the performance limit of the corresponding uncertainty set.

6. The method according to claim 2, characterized in that The first objective function corresponding to the conflict robust optimization berth allocation problem model is: Where V is the set of ships; c 1k is the waiting penalty cost within the arrival time of ship k; c 2k The penalty fee for the departure delay of vessel k; x k is the starting berthing time of ship k in the baseline allocation plan; a k is the estimated arrival time of ship k in the baseline allocation plan; v k is the departure delay time of ship k in the baseline allocation plan; RC max is the maximum total recovery cost in all uncertain scenarios; The first constraint corresponding to the first objective function includes at least one of the following: Each vessel can only be allocated one berth; There is no conflict between the two vessels in terms of berthing time and position; The vessel cannot commence berthing before its estimated time of arrival; Vessels cannot be moored outside the pier; The maximum total recovery cost in all uncertain scenarios is greater than or equal to the total recovery cost corresponding to any scenario, where the total recovery cost corresponding to scenario S is RC S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ under uncertain scenario s; The delay time of the vessel's departure is greater than or equal to the difference between the sum of the vessel's estimated starting berthing time and the estimated operation time and the estimated departure time; The actual departure time of the preceding ship is less than the conflict time with the following ship.

7. The method according to claim 2, characterized in that The second objective function corresponding to the extended conflict robust optimization berth allocation problem model is: Where V is the set of ships; c 1k is the waiting penalty cost within the arrival time of ship k; c 2k The penalty fee for the departure delay of vessel k; x k is the starting berthing time of ship k in the baseline allocation plan; a k is the estimated arrival time of ship k in the baseline allocation plan; g k is the estimated operation time of vessel k; d k is the estimated departure time of vessel k; H is the total number of uncertain sets; Ω h is the hth uncertain set; ρh is the weight associated with the hth uncertainty set; RC s is the total recovery cost in the uncertain scenario s, RC S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ under uncertain scenario s; The second constraint corresponding to the second objective function includes at least one of the following: Each vessel can only be allocated one berth; There is no conflict between the two vessels in terms of berthing time and position; The vessel cannot commence berthing before its estimated time of arrival; Vessels cannot be moored outside the pier; The total recovery cost corresponding to each scenario is the product of the number of conflicts in the corresponding scenario and the expected recovery cost of the conflict; The actual departure time of the preceding ship is less than the conflict time with the following ship.

8. The method according to claim 2, characterized in that The third objective function corresponding to the risk constraint conflict robust optimization berth allocation problem model is: Where V is the set of ships; c 1k is the waiting penalty cost within the arrival time of ship k; c 2k The penalty fee for the departure delay of vessel k; x k is the starting berthing time of ship k in the baseline allocation plan; a k is the estimated arrival time of ship k in the baseline allocation plan; g k is the estimated operation time of vessel k; d k is the estimated departure time of vessel k; Ω h is the hth uncertain set; RC s is the total recovery cost in the uncertain scenario s, RC S =λ∑ k∈V ∑ k′∈V,k′≠k τ kk′s ,λ is the expected recovery cost of the conflict;τ kk′s is the conflict between ship k and ship k′ under uncertain scenario s; The third constraint condition corresponding to the third objective function includes at least one of the following: Each vessel can only be allocated one berth; There is no conflict between the two vessels in terms of berthing time and position; The vessel cannot commence berthing before its estimated time of arrival; Vessels cannot be moored outside the pier; The total recovery cost corresponding to each scenario is the product of the number of conflicts in the corresponding scenario and the expected recovery cost of the conflict; The actual departure time of the preceding vessel is less than the conflicting time with the following vessel; The maximum total recovery cost does not exceed the performance limit of the corresponding uncertainty set.

9. A conflict-based berth allocation control device, characterized in that: include: A model building module for building a conflict-based target berth allocation model; A first processing module is configured to solve the berth allocation model in a current iteration to obtain a baseline allocation plan and a total allocation cost corresponding to the baseline allocation plan; A second processing module is configured to determine an upper bound of an actual problem in a current iteration based on the baseline allocation plan and each uncertain scenario in at least one preset uncertainty set; a third processing module, configured to determine and output the baseline allocation plan as a target allocation plan if a preset condition is satisfied based on the actual problem upper bound and the total allocation cost, wherein the preset condition is that a quotient obtained by dividing the difference between the actual problem upper bound and the total allocation cost by the total allocation cost is less than or equal to a preset threshold; The fourth processing module is used to determine at least one target uncertain scenario from the uncertainty set if it is determined that the preset conditions are not met based on the upper bound of the actual problem and the total allocation cost, input the target uncertain scenario into the berth allocation model, and return to execute the step of solving the berth allocation model to obtain a baseline allocation plan and the total allocation cost corresponding to the baseline allocation plan, and increase the number of iterations by one.

10. An electronic device, characterized in that: The method comprises a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein when the computer program is executed by the processor, the steps of the conflict-based berth allocation method according to any one of claims 1 to 8 are implemented.

11. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the conflict-based berth allocation method according to any one of claims 1 to 8 are implemented.

12. A computer program product, characterized in that The method comprises computer instructions, which, when executed by a processor, implement the steps of the conflict-based berth allocation method according to any one of claims 1 to 8.