A berth-tugboat-quay crane scheduling optimization method based on CQSOA
By introducing a CQSOA-based berth-tugboat-shore bridge scheduling optimization method in container ports, the planning model of economic factors and chaotic quantum algorithms are used to optimize the allocation of berths, tugboats and shore bridges, the problems of high port operation efficiency and cost are solved. , achieving more efficient port scheduling.
Patent Information
- Application Number
- CN202410917042.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-10
- Publication Date
- 2024-11-19
- Estimated Expiration
- 2044-07-10
AI Technical Summary
The existing technology has limited joint scheduling methods for berths, tugboats and shore bridges in container ports, resulting in low operating efficiency and management level of ports and high costs.
Based on CQSOA, the berth-tugboat-shore bridge scheduling optimization method is proposed, and the CQSOA algorithm based on chaotic mapping and quantum computing is proposed to optimize the allocation strategies of berth, tugboat and shore bridges, using the objective function and Constraint conditions, combining coding rules, feasible integer algorithms and solution methods, design efficient and stable scheduling optimization solutions.
It has achieved the reduction of container port costs on the basis of taking into account economic factors, improves the economic benefits and loading and unloading efficiency of the port, and provides a better scheduling optimization solution.
Smart Images

Figure CN118469253B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of joint dispatching of container port operations, and in particular to a berth-tugboat-quay crane dispatching optimization method based on CQSOA. Background Art
[0002] Container ports are important water and land hubs that provide loading and unloading operations and short-term storage and transshipment for containers. They are the main body of modern port logistics and the key support for the development of world trade. The scientific and reasonable allocation and scheduling of berths, tugboats, quay cranes and other related resources have far-reaching practical significance for improving the production efficiency and service level of ports.
[0003] Existing methods provide solutions to the joint scheduling of berths and quay cranes in container ports. However, in the actual berthing process, ships usually need tugboats to assist in entering the port. However, the current research on the joint scheduling methods of berths, tugboats and quay cranes is limited, the operating efficiency and management level of container ports are not high, and the port operating costs are high.
[0004] Therefore, it is necessary to provide a berth-tugboat-quay crane scheduling optimization method based on CQSOA to solve the above problems. Summary of the invention
[0005] In view of the deficiencies in the prior art, an embodiment of the present invention aims to provide a berth-tugboat-quay crane scheduling optimization method based on CQSOA to solve the problems in the above-mentioned background technology.
[0006] To achieve the above object, the present invention provides the following technical solutions:
[0007] A berth-tugboat-quay crane scheduling optimization method based on CQSOA includes the following steps:
[0008] Step S1: From the perspective of economic cost of container ports, a berth-tugboat-quay crane joint scheduling planning model considering economic factors is established;
[0009] Step S2, proposing a CQSOA algorithm based on chaos mapping and quantum computing;
[0010] Step S3: construct a berth-tugboat-quay crane scheduling optimization method based on the CQSOA algorithm.
[0011] As a further solution of the present invention, in step S1, starting from the perspective of the economic cost of the container port, a berth-tugboat-quay crane joint scheduling planning model considering economic factors is established, including the selection of optimization variables, the establishment of the objective function, the proposal of constraints and the determination of dependent variables, wherein the determination of the dependent variables is used to determine the relevant dependent variables of the berth-tugboat-quay crane joint scheduling planning model considering economic factors.
[0012] As a further solution of the present invention, the optimization variables include the ship berthing order (VO), the berthing berth number (VB), the allocated quay crane number (VC) and the ship allocated tugboat number (VU).
[0013] As a further solution of the present invention, the objective function is to minimize the ship's time cost in port, the additional transportation distance cost of container trucks, the tugboat operation cost and the quay crane loading and unloading operation cost taking into account economic factors, which is determined by the following formula:
[0014] F=ω1·c1·F1+ω2·c2·F2+ω3·c3·F3+ω4·c4·F4,
[0015] Among them, F is the objective function, ω1, ω2, ω3 and ω4 are weight adjustment factors and ω1+ω2+ω3+ω4=1, c1, c2, c3 and c4 are magnitude balance coefficients and c1=0.1, c2=0.1, c3=1, c4=1, F1, F2, F3 and F4 are the first sub-objective function, the second sub-objective function, the third sub-objective function and the fourth sub-objective function respectively.
[0016] As a further solution of the present invention, the first sub-objective function is to minimize the time cost of the ship in port, which is defined by the following formula:
[0017]
[0018] Among them, F1 is the first sub-objective function, C 1i is the unit time cost of ship i in port, TF i is the departure time of ship i, TA i is the actual arrival time of vessel i.
[0019] As a further solution of the present invention, the second sub-objective function is to minimize the additional transportation distance cost of the container truck, which is defined by the following formula:
[0020]
[0021] Wherein, F2 is the second sub-objective function, C 2i is the additional unit distance cost of the container truck caused by the ship i not stopping at the numbered berth, V Ei is the loading and unloading volume, VSD i It is the distance between the numbered berth and the actual berth where the ship is moored.
[0022] As a further solution of the present invention, the third sub-objective function is the fuel cost generated by the tugboat auxiliary operation, which is defined by the following formula:
[0023]
[0024] Wherein, F3 is the third sub-objective function, C 3i is the fuel cost per unit time of tugboat operation when ship i is operating, TC i is the berthing time of ship i, that is, the time when the tugboat ends the operation during the berthing process of ship i, TB i is the allowed berthing time for ship i, that is, the time when the tugboat starts operating during the berthing process of ship i, TF i is the departure time of ship i, that is, the time when the tugboat ends the operation during the departure process of ship i, TD i It is the time when the loading and unloading operation of ship i ends, that is, the time when the tugboat starts the operation during the departure of ship i.
[0025] As a further solution of the present invention, the fourth sub-objective function is to minimize the quay crane operation cost, which is defined by the following formula:
[0026]
[0027] Among them, F4 is the fourth sub-objective function, C 4i is the unit operation time cost of the quay crane when ship i is operating, TD i is the time when the loading and unloading operation of ship i ends, TS i is the time when the loading and unloading operation of vessel i starts.
[0028] As a further solution of the present invention, the constraints include time constraints of the ship berthing process, constraints of the tugboat operation process, ship berthing constraints and quay crane loading and unloading operation constraints.
[0029] As a further solution of the present invention, the construction of the berth-tugboat-quay crane scheduling optimization method based on the CQSOA algorithm in step S3 includes the formulation of coding rules, the proposal of a feasible integerization algorithm and the design of a solution method flow;
[0030] The coding rules are formulated to facilitate the expression of optimization variables in the model solution process. The number of columns in the coding matrix is v, which is determined by the number of ships arriving at the port. The number of rows in the matrix is seven. The first row is the berthing order (VO), the second row is the berthing berth number (VB), the third row is the number of allocated quay cranes (VC), and the fourth and fifth rows are the tugboats allocated during the berthing operation (VU). i1 ); the sixth and seventh rows are the tugboats assigned during the departure operation (VU i2 );
[0031] The feasible integerization algorithm is used to integerize the real number coding matrix optimized by CQSOA into a natural number coding matrix;
[0032] The solution method process design is used to formulate a specific process for solving the berth-tugboat-quay crane joint scheduling planning model based on CQSOA.
[0033] In summary, compared with the prior art, the embodiments of the present invention have the following beneficial effects:
[0034] 1. The berth-tugboat-quay crane joint scheduling planning model considering economic factors provided in this application fully considers the impact of economic factors on port costs, filling the gap in existing research. While considering the economic benefits and loading and unloading efficiency of container ports, it can meet the new challenge of reducing container port costs;
[0035] 2. The CQSOA algorithm proposed by the present invention based on chaos mapping and quantum theory can provide an efficient and stable solution method for the berth-tugboat-quay crane joint scheduling planning model considering economic factors;
[0036] 3. Experiments have shown that the CQSOA-based berth-tugboat-quay crane joint scheduling optimization method proposed in the present invention can provide a better scheduling optimization solution for container ports.
[0037] In order to more clearly illustrate the structural features and effects of the present invention, the present invention is described in detail below in conjunction with the accompanying drawings and specific embodiments. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] Figure 1 It is a schematic diagram of the steps of the berth-tugboat-quay crane scheduling optimization method based on CQSOA in an embodiment of the invention.
[0039] Figure 2 The following is a flowchart for determining dependent variables in an embodiment of the invention.
[0040] Figure 3 It is the pseudo code of CQSOA in the embodiment of the invention.
[0041] Figure 4 It is a schematic diagram of the encoding rules in the embodiment of the invention.
[0042] Figure 5 The figure is a flowchart of a feasible integerization algorithm in an embodiment of the invention.
[0043] Figure 6 It is the pseudo code of the berth-tugboat-quay crane scheduling solution method based on CQSOA in the embodiment of the invention. DETAILED DESCRIPTION
[0044] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.
[0045] The specific implementation of the present invention is described in detail below in conjunction with specific embodiments.
[0046] In one embodiment of the present invention, participating Figure 1 The berth-tugboat-quay crane scheduling optimization method based on CQSOA comprises the following steps:
[0047] Step S1: From the perspective of economic cost of container ports, a berth-tugboat-quay crane joint scheduling planning model considering economic factors is established;
[0048] Step S2, proposing a CQSOA algorithm based on chaos mapping and quantum computing;
[0049] Step S3: construct a berth-tugboat-quay crane scheduling optimization method based on the CQSOA algorithm.
[0050] In this embodiment, in step S1, starting from the perspective of the economic cost of the container port, establishing a berth-tugboat-quay crane joint scheduling planning model considering economic factors includes selecting optimization variables, establishing an objective function, proposing constraint conditions and determining dependent variables;
[0051] The optimization variables include the ship berthing order (VO), the berthing berth number (VB), the allocated quay crane number (VC) and the ship allocated tugboat number (VU);
[0052] The objective function is to minimize the ship's time cost in port, the additional transportation distance cost of container trucks, the tugboat operation cost and the quay crane loading and unloading operation cost taking into account economic factors, which is determined by the following formula:
[0053] F=ω1·c1·F1+ω2·c2·F2+ω3·c3·F3+ω4·c4·F4 (1),
[0054] Wherein, F is the objective function, ω1, ω2, ω3 and ω4 are weight adjustment factors, c1, c2, c3 and c4 are magnitude balance coefficients and c1=0.1, c2=0.1, c3=1, c4=1, F1, F2, F3 and F4 are the first sub-objective function, the second sub-objective function, the third sub-objective function and the fourth sub-objective function respectively;
[0055] Considering that container ports pay different attention to economic factors under different working conditions, a weight adjustment factor is designed to optimize the corresponding scheduling plan according to the different attention of the port in different periods. The following expression should be satisfied:
[0056] ω1+ω2+ω3+ω4=1 (2),
[0057] In order to deal with the problem of different magnitudes of sub-objective functions, the magnitude balance coefficient is introduced to ensure that the influence weights of each sub-objective function are equal. The magnitude balance coefficient can be determined by the magnitude of the objective function in the specific calculation example. The present invention recommends the following values: c1 = 0.1, c2 = 0.1, c3 = 1 and c4 = 1.
[0058] The first sub-objective function is to minimize the time cost of the ship in port, which is defined by the following formula:
[0059]
[0060] Among them, F1 is the first sub-objective function, C 1i is the unit time cost of ship i in port, TF i is the departure time of ship i, TA i is the actual arrival time of vessel i;
[0061] The second sub-objective function is to minimize the additional transportation distance cost of the container truck, which is defined by the following formula:
[0062]
[0063] Wherein, F2 is the second sub-objective function, C 2i is the additional unit distance cost of the container truck caused by the ship i not stopping at the numbered berth, V Ei is the loading and unloading volume, VSD i It is the distance between the numbered berth and the actual berth where the ship is moored;
[0064] The third sub-objective function is the fuel cost generated by the tugboat auxiliary operation, which is defined by the following formula:
[0065]
[0066] Wherein, F3 is the third sub-objective function, C 3i is the fuel cost per unit time of tugboat operation when ship i is operating, TC i is the berthing time of ship i, that is, the time when the tugboat ends the operation during the berthing process of ship i, TB i is the allowed berthing time for ship i, that is, the time when the tugboat starts operating during the berthing process of ship i, TF i is the departure time of ship i, that is, the time when the tugboat ends the operation during the departure process of ship i, TD i The time when the loading and unloading operation of ship i ends, that is, the time when the tugboat starts the operation during the departure of ship i;
[0067] The fourth sub-objective function is to minimize the cost of quay crane operation, which is defined by the following formula:
[0068]
[0069] Among them, F4 is the fourth sub-objective function, C 4i is the unit operation time cost of the quay crane when ship i is operating, TD i is the time when the loading and unloading operation of ship i ends, TS i The time when the loading and unloading operation of vessel i starts;
[0070] The constraints include time constraints for the ship berthing process, constraints for the tugboat operation process, ship berthing constraints and quay crane loading and unloading operation constraints;
[0071] The time constraint of the ship berthing process is defined by the following formula:
[0072]
[0073] Among them, formula (7) indicates that the ship's allowed berthing time (the time when the tugboat starts operating during the berthing process) is greater than the ship's arrival time, formula (8) indicates the calculation formula for the ship's berthing time (the time when the tugboat ends operating during the berthing process), formula (9) indicates that the ship's loading and unloading time should be greater than the ship's berthing time, formula (10) indicates the calculation method for the ship's actual loading and unloading time, and formula (11) indicates the calculation method for the ship's departure time (the time when the tugboat ends operating during the departure process);
[0074] The tugboat operation process constraints are defined by the following formula:
[0075] VUS t ≤u (12),
[0076]
[0077] Among them, formula (12) indicates that the total number of tugboats working at any moment must not exceed the total number of tugboats available in the port, and formula (13) indicates that the horsepower value generated by all tugboats operating on ship i meets the minimum horsepower value required by ship i;
[0078] The ship berthing constraint is defined by the following formula:
[0079]
[0080] Among them, formulas (14) and (15) indicate that the berthing of a ship must meet the requirements of ship length and draft; formula (16) indicates that only one ship is allowed to carry out loading and unloading services at the same berth at the same time; formula (17) indicates that ship i can only berth at berth j once in order k;
[0081] The constraint condition of the quay crane loading and unloading operation is defined by the following formula:
[0082]
[0083] Among them, formula (18) indicates that each quay crane can only serve one ship at the same time; formula (19) indicates the relationship between the number of allocated quay cranes and VC i ; Formulas (20) and (21) indicate that the number of quay cranes serving ship i must meet the requirements of the maximum / minimum number of quay cranes for loading and unloading; Formula (22) requires that the number of working quay cranes is less than the total number of quay cranes in the container port; Formula (23) indicates that during the quay crane loading and unloading operation, the quay crane is not allowed to cross other quay cranes and only other quay cranes are allowed to be selected on the left and right of a certain service quay crane as the loading and unloading operation machinery of ship i.
[0084] The determination of the dependent variables is used to determine the relevant dependent variables of the berth-tugboat-quay crane joint scheduling planning model considering economic factors. The specific flow chart is as follows: Figure 2 As shown;
[0085] In step S2, the CQSOA based on chaos mapping and quantum computing is aimed at solving the problem of berth-tugboat-quay crane joint scheduling planning model considering economic factors in step S1. Based on chaos mapping and quantum computing, a new optimization algorithm is improved to solve the problem that the Seagull Optimization Algorithm (SOA) has weak global perturbation ability and is easy to fall into local optimal solutions. CQSOA introduces Cat mapping to improve the convergence speed and accuracy of the algorithm; uses quantum revolving gates to improve the convergence speed and accuracy of the algorithm; and uses quantum NOT gate theory to improve the global search ability of the algorithm. The CQSOA pseudo code is as follows: Figure 3 As shown;
[0086] In step S3, a CQSOA-based berth-tugboat-quay crane scheduling optimization method includes three sub-steps: formulation of coding rules, proposal of feasible integerization algorithm, and design of solution method flow;
[0087] The coding rules are formulated to facilitate the expression of optimized variables in the model solution process. The number of columns in the coding matrix is v, which is determined by the number of ships arriving at the port (v is the total number of ships arriving at the port), and the number of rows in the matrix is seven. The first row is the berthing order (VO); the second row is the berthing berth number (VB); the third row is the number of allocated quay cranes (VC); since there are two tugboats serving one ship together, for this problem, the model considers using two rows in the coding matrix to express the tugboat number serving the ship during the berthing process, so the fourth and fifth rows are the tugboats allocated during the berthing operation (VU i1 ); the sixth and seventh rows are the tugboats assigned during the departure operation (VU i2 ), the coding rule diagram is as follows Figure 4 As shown;
[0088] The feasible integerization algorithm is used to integerize the real number coding matrix optimized by CQSOA into a natural number coding matrix. The flowchart of the feasible integerization algorithm is as follows: Figure 5 As shown;
[0089] The solution method process design is used to formulate the specific process of the solution method of the berth-tugboat-quay crane joint scheduling planning model based on CQSOA. The pseudo code is as follows: Figure 6 shown.
[0090] Compared with the prior art, the present invention has the following beneficial effects:
[0091] 1) The berth-tugboat-quay crane joint scheduling planning model considering economic factors provided by the present invention fully considers the impact of economic factors on port costs, filling the gap in existing research. While considering the economic benefits and loading and unloading efficiency of container ports, it can meet the new challenge of reducing container port costs.
[0092] 2) The CQSOA algorithm proposed by the present invention based on chaos mapping and quantum theory can provide an efficient and stable solution method for the berth-tugboat-quay crane joint scheduling planning model considering economic factors.
[0093] 3) Experiments show that the CQSOA-based berth-tugboat-quay crane joint scheduling optimization method proposed in the present invention can provide a better scheduling optimization solution for container ports.
[0094] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.
Claims
1. A berth-tugboat-quay crane scheduling optimization method based on CQSOA, characterized in that: The following steps are involved: Step S1: From the perspective of economic cost of container ports, a berth-tugboat-quay crane joint scheduling planning model considering economic factors is established; Step S2, proposing a CQSOA algorithm based on chaos mapping and quantum computing; Step S3, constructing a berth-tugboat-quay crane scheduling optimization method based on the CQSOA algorithm; In step S1, starting from the perspective of the economic cost of the container port, establishing a berth-tugboat-quay crane joint scheduling planning model considering economic factors includes selecting optimization variables, establishing an objective function, proposing constraint conditions and determining dependent variables, wherein the determination of the dependent variables is used to determine the relevant dependent variables of the berth-tugboat-quay crane joint scheduling planning model considering economic factors; The optimization variables include the ship berthing order, berthing berth number, allocated quay crane number and ship allocated tugboat number; The objective function is to minimize the ship's time cost in port, the additional transportation distance cost of container trucks, the tugboat operation cost and the quay crane loading and unloading operation cost taking into account economic factors, which is determined by the following formula: F=ω1·c1·F1+ω2·c2·F2+ω3·c3·F3+ω4·c4·F4, Wherein, F is the objective function, ω1, ω2, ω3 and ω4 are weight adjustment factors and ω1+ω2+ω3+ω4=1, c1, c2, c3 and c4 are magnitude balance coefficients and c1=0.1, c2=0.1, c3=1, c4=1, F1, F2, F3 and F4 are the first sub-objective function, the second sub-objective function, the third sub-objective function and the fourth sub-objective function respectively; The constraints include time constraints for the ship berthing process, constraints for the tugboat operation process, ship berthing constraints and quay crane loading and unloading operation constraints; The construction of the berth-tugboat-quay crane scheduling optimization method based on the CQSOA algorithm in step S3 includes the formulation of coding rules, the proposal of a feasible integerization algorithm and the design of a solution method flow; Among them, the coding rules are formulated to facilitate the expression of optimized variables in the process of model solution. The number of columns in the coding matrix is v, which is determined by the number of ships arriving at the port. The number of rows in the matrix is seven. The first row is the order of berthing in the port, the second row is the berthing berth number of the ship, the third row is the number of allocated quay cranes, the fourth and fifth rows are the tugboats allocated during the berthing operation; the sixth and seventh rows are the tugboats allocated during the departure operation. The feasible integerization algorithm is used to integerize the real number coding matrix optimized by CQSOA into a natural number coding matrix; The solution method process design is used to formulate a specific process for solving the berth-tugboat-quay crane joint scheduling planning model based on CQSOA.
2. The CQSOA-based berth-tugboat-quay crane scheduling optimization method according to claim 1 is characterized in that: The first sub-objective function is to minimize the time cost of the ship in port, which is defined by the following formula: Among them, F1 is the first sub-objective function, C 1i is the unit time cost of ship i in port, TF i is the departure time of ship i, TA i is the actual arrival time of vessel i.
3. The CQSOA-based berth-tugboat-quay crane scheduling optimization method according to claim 2 is characterized in that: The second sub-objective function is to minimize the additional transportation distance cost of the container truck, which is defined by the following formula: Wherein, F2 is the second sub-objective function, C 2i is the additional unit distance cost of the container truck caused by the ship i not stopping at the numbered berth, V Ei is the loading and unloading volume, VSD i It is the distance between the numbered berth and the actual berth where the ship is moored.
4. The CQSOA-based berth-tugboat-quay crane scheduling optimization method according to claim 3 is characterized in that: The third sub-objective function is the fuel cost generated by the tugboat auxiliary operation, which is defined by the following formula: Wherein, F3 is the third sub-objective function, C 3i is the fuel cost per unit time of tugboat operation when ship i is operating, TC i is the berthing time of ship i, that is, the time when the tugboat ends the operation during the berthing process of ship i, TB i is the allowed berthing time for ship i, that is, the time when the tugboat starts operating during the berthing process of ship i, TF i is the departure time of ship i, that is, the time when the tugboat ends the operation during the departure process of ship i, TD i It is the time when the loading and unloading operation of ship i ends, that is, the time when the tugboat starts the operation during the departure of ship i.
5. The CQSOA-based berth-tugboat-quay crane scheduling optimization method according to claim 4 is characterized in that: The fourth sub-objective function is to minimize the cost of quay crane operation, which is defined by the following formula: Among them, F4 is the fourth sub-objective function, C 4i is the unit operation time cost of the quay crane when ship i is operating, TD i is the time when the loading and unloading operation of ship i ends, TS i is the time when the loading and unloading operation of vessel i starts.
