CN116050810A - Multistage intermodal ship lock scheduling method and system - Google Patents
Multistage intermodal ship lock scheduling method and system Download PDFInfo
- Publication number
- CN116050810A CN116050810A CN202310331350.5A CN202310331350A CN116050810A CN 116050810 A CN116050810 A CN 116050810A CN 202310331350 A CN202310331350 A CN 202310331350A CN 116050810 A CN116050810 A CN 116050810A
- Authority
- CN
- China
- Prior art keywords
- ship
- lock
- gate
- intermodal
- stage
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 64
- 238000005457 optimization Methods 0.000 claims abstract description 18
- 230000008859 change Effects 0.000 claims abstract description 10
- 210000000349 chromosome Anatomy 0.000 claims description 76
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 claims description 75
- 108090000623 proteins and genes Proteins 0.000 claims description 35
- 230000003044 adaptive effect Effects 0.000 claims description 16
- 230000035772 mutation Effects 0.000 claims description 8
- 238000012544 monitoring process Methods 0.000 claims description 6
- 239000008277 atmospheric particulate matter Substances 0.000 claims description 3
- 238000010276 construction Methods 0.000 claims description 3
- 238000011217 control strategy Methods 0.000 abstract description 5
- 230000006870 function Effects 0.000 description 77
- 230000008569 process Effects 0.000 description 9
- 238000004891 communication Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 238000004590 computer program Methods 0.000 description 2
- 230000002068 genetic effect Effects 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 238000001514 detection method Methods 0.000 description 1
- 238000000802 evaporation-induced self-assembly Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 101150097685 metI gene Proteins 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02A—TECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE
- Y02A10/00—TECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE at coastal zones; at river basins
- Y02A10/30—Flood prevention; Flood or storm water management, e.g. using flood barriers
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Biophysics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Entrepreneurship & Innovation (AREA)
- Health & Medical Sciences (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- Evolutionary Biology (AREA)
- General Business, Economics & Management (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Tourism & Hospitality (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Development Economics (AREA)
- Artificial Intelligence (AREA)
- Evolutionary Computation (AREA)
- Genetics & Genomics (AREA)
- Educational Administration (AREA)
- Biomedical Technology (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Physiology (AREA)
- General Health & Medical Sciences (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Feedback Control In General (AREA)
Abstract
The invention relates to the technical field of ship lock dispatching, and discloses a multistage intermodal ship lock dispatching method and system, wherein the method comprises the following steps: acquiring ship passing influence index data, and determining a ship passing time function based on shipping visibility; acquiring ship lock report standby information, and constructing a multistage intermodal ship lock scheduling model and constraint conditions according to ship lock influence index data and a ship lock time function; and carrying out double-stage optimization solution on the constructed multi-stage intermodal ship lock scheduling model by utilizing a dynamic punishment strategy to obtain a real-time multi-stage intermodal ship lock scheduling scheme, and guiding the ship passing through the lock to a designated position in a lock chamber according to the ship scheduling strategy. According to the invention, the multi-stage intermodal ship lock scheduling model combined with hydrologic environment change is constructed and solved, so that the running speed control strategy of different ships with minimum running time and waiting time for opening the gate and the corresponding gate scheduling scheme are obtained, and the comprehensive lock passing rate is further improved.
Description
Technical Field
The invention relates to the technical field of ship lock dispatching, in particular to a multistage intermodal ship lock dispatching method and system.
Background
At present, ship lock passing dispatching is still completed through manual command of dispatching personnel, the dispatching personnel judge the running state of the ship lock and the ship lift, and the ship dispatching and navigation time is determined by estimating the ship navigation time according to working experience. The dispatching instruction is mainly based on artificial judgment, the execution means is backward, the situation that the estimation of the navigation time is inaccurate, the communication of the operation management information of a ship lock and a ship lift is not in place and the like occurs, the situation that the ship in a water area of a channel is jammed or the ship berthing is not in place and the like sometimes occurs, and the difference of the command conditions among different dispatching personnel is large. The current ship is high in waiting-brake quantity and is not occupied, and intelligent ship passing-brake scheduling has important significance. Aiming at the problem, the invention provides a multi-stage intermodal ship lock scheduling method and system, which realize automation of ship navigation command and can further realize coordination and unification of ship command, and are accurate and efficient.
Disclosure of Invention
In view of the above, the present invention provides a multi-stage intermodal ship lock scheduling method, which aims to 1) obtain current different ship running speed control strategies and corresponding gate scheduling schemes for realizing minimum ship running time and waiting time for opening the gate by solving the model, wherein the higher the shipping visibility is, the closer the running speed of the ship is to the normal running speed, otherwise, the lower the running speed is forced, a ship passing time function is provided based on the shipping visibility, the time, the passing time and the waiting time of different ships reach the gate are quantized, the multi-stage intership lock scheduling model is constructed according to ship passing effect index data and the ship passing time function, the current different ship running speed control strategies and corresponding gate scheduling schemes for realizing minimum ship running time and waiting time for opening the gate are obtained by solving the model, the gate opening time and the running speed of different ships are controlled based on the multi-stage intership lock scheduling schemes, and the space utilization rate of the ship reaching the designated position in the room of the pilot ship according to the ship passing gate scheduling strategies is improved; 2) The method comprises the steps of carrying out double-stage optimization solving on a constructed multi-stage intermodal ship lock scheduling model by utilizing a dynamic punishment strategy, adopting a genetic algorithm to solve the problem in the first-stage optimization solving process to obtain a gate scheduling scheme which is enabled to run according to the current running speed of a ship, wherein the running time and the waiting time are smaller, adopting the dynamic punishment strategy to introduce constraint conditions into an objective function in the second-stage solving process, carrying out dynamic iterative updating on the introduced items to quickly obtain a running speed control vector which accords with the limitation of a dynamic punishment function value, and simultaneously carrying out iteration based on the dynamic punishment function value to avoid larger difference between the running speed of the ship obtained by solving and the current running speed, thereby quickly obtaining the multi-stage intermodal ship lock scheduling scheme.
In order to achieve the above purpose, the invention provides a multi-stage intermodal ship lock scheduling method, which comprises the following steps:
s1: acquiring ship crossing gate influence index data, wherein the influence index comprises a gate external water flow speed, a gate internal water depth, shipping visibility and a gate internal water depth change rate;
s2: determining a ship passing time function based on the shipping visibility;
s3: acquiring ship lock report and backup information, constructing a multistage intermodal ship lock scheduling model and constraint conditions according to ship lock influence index data and a ship lock time function, wherein the constructed model takes maximized ship passing efficiency as an objective function and takes ship running speed and gate opening time as control variables;
s4: carrying out double-stage optimization solution on the constructed multi-stage intermodal ship lock scheduling model by utilizing a dynamic punishment strategy to obtain a real-time multi-stage intermodal ship lock scheduling scheme;
s5: and controlling the gate opening time and the running speeds of different ships based on a multi-stage intermodal ship lock scheduling scheme, and guiding the ship passing through the lock to reach a designated position in a lock chamber according to a ship scheduling strategy.
As a further improvement of the present invention:
optionally, the step S1 of collecting ship brake effect index data includes:
The method comprises the steps of collecting ship passing gate influence index data in real time, wherein the ship passing gate influence index data comprises a gate external water flow speed, a gate internal water depth, shipping visibility and a gate internal water depth growth rate, and the ship passing gate influence index data collecting flow is as follows:
s11: monitoring the flow rate of water outside the gate at the current timeWater flow velocity in the sum gatevWherein the water flow velocity comprises a water flow direction and a water flow velocity value;
s12: monitoring the water depth L in the gate at the current moment and the change rate of the water depth in the gatev L :
Wherein:
s represents the area of the bottom inside the gate,v s indicating the rate of water addition or water discharge in the lock,v s in cubic meters per second;v L the change rate of the water depth in the gate is expressed in meters per second;
s13: measuring the diameters of the atmospheric particulates and the densities of the atmospheric particulates in different shipping areas, wherein the densities of the atmospheric particulates are the number of the atmospheric particulates in each cubic meter area, and calculating to obtain the visibility of the different shipping areas at the current moment:
Wherein:
d represents the diameter of the atmospheric particulate matter,indicating the atmospheric particulate density,/->In meters.
Optionally, determining the ship passing time function in the step S2 includes:
determining a ship passing time function based on the shipping visibility:
Wherein:
Time(V(q) A ship lock time function representing the ship q,D(q) Indicating the distance of the ship q from the gate,V(q) The travel speed of the ship q is indicated,indicates the real-time gate external water flow speed, +.>The included angle between the ship q running direction and the water flow direction outside the brake is shown;
indicating that ship q is traveling to +.>When in shipping area, the>The current shipping visibility of the shipping area is at,num q representing the total number of navigation areas, +.>Representing a preset minimum normal driving visibility;
visibility indicating the position of the gate, +.>The speed of the passing gate is indicated by the specification,Len q representing the hull length of the vessel q;
L q indicating the required water depth of the ship q passing through the gate, when the water depth in the gate is higher than the required water depth, the water is discharged, and when the water depth in the gate is lower than the required water depth, the water is added.
Optionally, the step S3 of obtaining ship passing warning information includes:
when the ship drives to a gate from a port, the ship needs to report and prepare to acquire a time range [ t ] 0 ,t L ]The ship passing gate report information in the system takes the ship corresponding to the ship passing gate report information as the ship to be currently scheduled, wherein t L Indicating the current time, t 0 When the emergency ship or dangerous goods ship needs to pass the gate, an emergency channel is cleaned out at the gate, and the emergency ship or dangerous goods ship can pass the gate along the emergency channel.
Optionally, the step S3 of constructing an objective function of the multi-stage intermodal ship lock scheduling model includes:
according to ship lock influence index data and a ship lock time function, constructing an objective function of a multistage intermodal ship lock scheduling model, wherein the constructed objective function F for controlling and scheduling ship running speed and gate opening time is as follows:
wherein:
q represents the total number of the current ships to be scheduled, wherein the ships to be scheduled are the ship for which the passing gate is reported;
P q the gate report time of any ship q is shown,the moment when the ship q arrives at the gate is indicated;
e represents a gate opening time sequence, E comprises N moments,R(E) Indicating any time in the gate opening time sequence E,the waiting time for the ship q to wait for the gate to open is indicated.
Optionally, constructing constraint conditions of objective functions in the multi-stage intermodal ship lock scheduling model in the step S3 includes:
Constructing constraint conditions of an objective function in a multistage intermodal ship lock scheduling model, wherein the constraint conditions of the objective function F are as follows:
wherein:
C 1 the waiting time of any ship q waiting for the opening of the gate is more than or equal to 0;
representing a time sequence of opening the gateE for a number of time periods during which the shutter is continuously opened, < >>Representation->The shortest time length of continuous opening of the middle gate, +.>Representing a preset gate minimum opening time length threshold.
Optionally, in the step S4, a dynamic penalty strategy is used to perform a two-stage optimization solution on the constructed multi-stage intermodal ship lock scheduling model, including:
carrying out double-stage optimization solving on the constructed multi-stage intermodal ship lock scheduling model by utilizing a dynamic punishment strategy to obtain a multi-stage intermodal ship lock scheduling scheme, wherein the multi-stage intermodal ship lock scheduling scheme comprises the driving speed control of the ship after the lock is reported and the gate opening time;
the optimal solving flow of the multistage intermodal ship lock scheduling model based on the dynamic punishment strategy is as follows:
s41: generating M groups of chromosomes, wherein each group of chromosomes comprises N genes, and N times of N gate opening time sequences E to be optimally solved are corresponding;
s42: the method comprises the steps of carrying out initial coding representation on N genes in each group of chromosomes, wherein the coding type of each gene is {0,1},1 represents that a gate is in an open state at the moment corresponding to the gene, 0 represents that the gate is in a closed state at the moment corresponding to the gene, and the coding representation of each group of chromosomes meets the constraint condition I.e.the shortest gene length of consecutive 1 in the chromosome +.>The initial coding of the m-th group of chromosomes indicates thatx m (0),/>;
S43: taking the running speed reported by the current ship to be scheduled as a fixed value, taking the coding representation result of each group of chromosomes as an input value, and converting the objective function F into an adaptive function F (X) of each group of chromosomes, wherein X represents the coding representation result of the chromosomes of the input adaptive function;
s44: setting the iteration number of the current chromosome as k, the initial value of k as 0, and the maximum value as Max, wherein the k iteration result of the m-th group of chromosomes isX m (k) The corresponding adaptive function results in F(X m (k));
S45: randomly selecting a plurality of groups of chromosomes for iteration, wherein the iteration mode comprises cross variation, and the probability that the m group of chromosomes is selected in the k+1st iteration processP k+1 (m) is:
the crossing operation is to mutually exchange the selected chromosome gene segments with the gene segments of other chromosomes at the same position, and ensure that the exchanged chromosomes meet constraint conditions;
the mutation operation is to mutate a certain gene in the selected chromosome and ensure that the mutated chromosomes meet constraint conditions, and in the embodiment of the invention, the mutation operation comprises Or->;
S46: let k=k+1, repeat step S45 until k+1=max, select the coding representation result of the chromosome with the smallest adaptive function result at this time as the gate scheduling scheme; in the embodiment of the invention, the gate scheduling scheme is gate opening and closing time;
and combining a gate scheduling scheme, converting the objective function F into a dynamic ship speed scheduling function:
wherein:
representing the dynamic penalty factor obtained in the ith iteration, < ->Representing a preset initial dynamic penalty factor, +.>Representing a dynamic penalty function value obtained by the ith iteration;
v represents the running speed control vector of Q vessels to be scheduled to be solved optimally, v=,Representing the running speed control result of the ship q obtained by solving;
s47: calculating the dynamic punishment function value of the current nth iterationIf->If the dynamic punishment coefficient is smaller than the preset punishment threshold value, ending iteration, outputting a current running speed control vector, and otherwise, respectively iterating the dynamic punishment coefficient and the ship running speed control result:
wherein:
rand(-1, 1) represents a random number between-1 and 1,V th representing a preset speed update constant;
s48: let u=u+1, return to step S47;
S49: and taking the gate scheduling scheme and the current running speed control vector as a real-time multi-stage intermodal ship lock scheduling scheme.
Optionally, in the step S5, the ship running speed and the gate opening time are controlled based on a multi-stage intermodal ship lock scheduling scheme, and the ship passing through the lock is guided to reach the designated position in the lock chamber according to the ship scheduling strategy, including:
the method comprises the steps of controlling gate opening time and running speed of a ship to be scheduled based on a multi-stage intermodal ship lock scheduling scheme, and guiding the ship passing through the lock to a designated position in a lock chamber according to a ship scheduling strategy, wherein the ship scheduling strategy comprises the following steps:
s51: acquiring the size of the passing ship, and traversing the effective area of the sluice chamber, wherein the effective area of the sluice chamber represents the vacant space area in the sluice chamber;
s52: if the left lower corner position in the effective area of the lock chamber can store the lock ship, placing the lock ship at the left lower corner position of the effective area of the lock chamber, and updating the effective area of the lock chamber; otherwise, the passing ship is placed at the highest position of the upper right corner of the effective area of the lock chamber, and is enabled to move vertically downwards and then leftwards as much as possible under the condition of meeting space constraint until reaching an immovable position, and the effective area of the lock chamber is updated.
In order to solve the above problems, the present invention provides a multi-stage intermodal lock dispatch system, the system comprising:
the data acquisition device is used for acquiring ship crossing influence index data;
the scheduling model construction module is used for determining a ship lock time function based on shipping visibility, acquiring ship lock report information and constructing a multi-stage intermodal ship lock scheduling model according to ship lock influence index data and the ship lock time function;
the ship lock scheduling module is used for carrying out double-stage optimization solving on the constructed multi-stage intermodal ship lock scheduling model by utilizing a dynamic punishment strategy to obtain a real-time multi-stage intermodal ship lock scheduling scheme, controlling the gate opening time and the running speeds of different ships based on the multi-stage intermodal ship lock scheduling scheme, and guiding the ship passing through the lock to reach a designated position in a lock chamber according to the ship scheduling strategy.
In order to solve the above-mentioned problems, the present invention also provides an electronic apparatus including:
a memory storing at least one instruction;
the communication interface is used for realizing the communication of the electronic equipment; and
And the processor executes the instructions stored in the memory to realize the multi-stage intermodal ship lock scheduling method.
In order to solve the above-mentioned problems, the present invention also provides a computer-readable storage medium having stored therein at least one instruction that is executed by a processor in an electronic device to implement the multi-stage intermodal lock scheduling method described above.
Compared with the prior art, the invention provides a multi-stage intermodal ship lock scheduling method, which has the following advantages:
firstly, the scheme provides a multi-stage intermodal ship lock scheduling model, which constructs an objective function of the multi-stage intermodal ship lock scheduling model according to ship lock influence index data and a ship lock time function, wherein the constructed objective function F for controlling and scheduling ship running speed and gate opening time is as follows:
wherein: q represents the total number of the current ships to be scheduled, wherein the ships to be scheduled are the ship for which the passing gate is reported;P q the gate report time of any ship q is shown,the moment when the ship q arrives at the gate is indicated; e represents a gate opening time sequence, E comprises N moments,R(E) Indicates any time in the gate opening time sequence E, +.>The waiting time for the ship q to wait for the gate to open is indicated. Constructing constraint conditions of an objective function in a multistage intermodal ship lock scheduling model, wherein the constraint conditions of the objective function F are as follows:
Wherein:C 1 the waiting time of any ship q waiting for the opening of the gate is more than or equal to 0;representing the number of time periods of successive opening of the shutter in the shutter opening time sequence E, +.>Representation->The shortest time length of continuous opening of the middle gate, +.>Representing a preset gate minimum opening time length threshold. The method comprises the steps of providing a ship lock time function based on the shipping visibility, quantifying time, lock time and waiting time of different ships to reach a lock chamber, constructing a multi-stage intermodal lock scheduling model according to ship lock influence index data and the ship lock time function, solving the model to obtain current different ship running speed control strategies and corresponding lock scheduling schemes with minimum waiting time for realizing ship running time and waiting lock opening, taking the running speed control strategies and the lock scheduling schemes of different ships as multi-stage intermodal lock scheduling schemes, controlling the lock opening time and the running speeds of different ships based on the multi-stage intermodal lock scheduling schemes, and guiding the ships passing the lock to the appointed position in the lock chamber according to the ship scheduling strategies, thereby improving the space utilization rate of the lock chamber.
Meanwhile, the scheme provides a double-stage solving method of the multi-stage intermodal ship lock scheduling model, and the constructed multi-stage intermodal ship lock scheduling model is subjected to double-stage optimization solving by utilizing a dynamic punishment strategy to obtain a multi-stage intermodal ship lock scheduling scheme, wherein the multi-stage intermodal ship lock scheduling scheme comprises the running speed control of a ship after passing the lock report and the gate opening time; the optimal solving flow of the multistage intermodal ship lock scheduling model based on the dynamic punishment strategy is as follows: generating M groups of chromosomes, wherein each group of chromosomes comprises N genes, and N times of N gate opening time sequences E to be optimally solved are corresponding; the N genes in each group of chromosomes are initially coded, wherein the coding type of each gene is {0,1}, and 1 represents the time corresponding to the gateIn an open state, 0 means that the gate is in a closed state at the time corresponding to the gene, and the codes of each group of chromosomes indicate that the constraint condition is metI.e.the shortest gene length of consecutive 1 in the chromosome +.>The initial coding of the m-th group of chromosomes indicates thatx m (0),/>The method comprises the steps of carrying out a first treatment on the surface of the Taking the running speed reported by the current ship to be scheduled as a fixed value, taking the coding representation result of each group of chromosomes as an input value, and converting the objective function F into an adaptive function F (X) of each group of chromosomes, wherein X represents the coding representation result of the chromosomes of the input adaptive function; setting the iteration number of the current chromosome as k, the initial value of k as 0, and the maximum value as Max, wherein the k iteration result of the m-th group of chromosomes is X m (k) The corresponding adaptive function results in F(X m (k) A) is provided; randomly selecting a plurality of groups of chromosomes for iteration, wherein the iteration mode comprises cross variation, and the probability that the m group of chromosomes is selected in the k+1st iteration processP k+1 (m) is:
the crossing operation is to mutually exchange the selected chromosome gene segments with the gene segments of other chromosomes at the same position, and ensure that the exchanged chromosomes meet constraint conditions; the mutation operation is to perform mutation treatment on one gene in the selected chromosome, and ensure that the mutated chromosomes meet constraint conditions; repeating iteration until k=k+1=max, and selecting a coding representation result of a chromosome with the smallest adaptive function result at the moment as a gate scheduling scheme; and combining a gate scheduling scheme, converting the objective function F into a dynamic ship speed scheduling function:
wherein:
representing the dynamic penalty factor obtained in the ith iteration, < ->Representing a preset initial dynamic penalty factor, +.>Representing a dynamic penalty function value obtained by the ith iteration; />Representing a gate scheduling scheme; v represents the running speed control vector of Q vessels to be scheduled to be solved optimally, v= = ∈>,Representing the running speed control result of the ship q obtained by solving; calculating the dynamic punishment function value of the current nth iteration If->If the dynamic punishment coefficient is smaller than the preset punishment threshold value, ending iteration, outputting a current running speed control vector, and otherwise, respectively iterating the dynamic punishment coefficient and the ship running speed control result:
wherein:representing dynamic iteration coefficients, ++>;rand(-1, 1) represents a random number between-1 and 1,V th representing a preset speed update constant; let u=u+1 iterate; and taking the gate scheduling scheme and the current running speed control vector as a real-time multi-stage intermodal ship lock scheduling scheme. According to the method, a constructed multi-stage intermodal ship lock scheduling model is subjected to double-stage optimization solving by means of a dynamic punishment strategy, in the first-stage optimization solving process, a gate scheduling scheme which enables the ship to run at the current running speed and is low in running time and waiting time is obtained by adopting a genetic algorithm solving, in the second-stage solving process, constraint conditions are introduced into an objective function by adopting a dynamic punishment strategy, dynamic iterative updating is carried out on the introduced items, and a running speed control vector meeting the limit of a dynamic punishment function value is obtained rapidly.
Drawings
FIG. 1 is a flow chart of a method for dispatching a multi-stage intermodal ship lock according to an embodiment of the present invention;
FIG. 2 is a functional block diagram of a multi-stage intermodal lock dispatch system according to one embodiment of the present invention;
fig. 3 is a schematic structural diagram of an electronic device for implementing a multi-stage intermodal ship lock dispatching method according to an embodiment of the present invention.
The achievement of the objects, functional features and advantages of the present invention will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
The embodiment of the application provides a multi-stage intermodal ship lock scheduling method. The execution subject of the multi-stage intermodal ship lock scheduling method includes, but is not limited to, at least one of a server, a terminal, etc. capable of being configured to execute the method provided by the embodiments of the present application. In other words, the multi-stage intermodal ship lock scheduling method may be performed by software or hardware installed at a terminal device or a server device, and the software may be a blockchain platform. The service end includes but is not limited to: a single server, a server cluster, a cloud server or a cloud server cluster, and the like.
Example 1:
s1: and acquiring ship passing gate influence index data, wherein the influence indexes comprise the gate external water flow speed, the gate internal water depth, the shipping visibility and the gate internal water depth change rate.
And S1, acquiring ship brake influence index data, wherein the method comprises the following steps of:
the method comprises the steps of collecting ship passing gate influence index data in real time, wherein the ship passing gate influence index data comprises a gate external water flow speed, a gate internal water depth, shipping visibility and a gate internal water depth growth rate, and the ship passing gate influence index data collecting flow is as follows:
s11: monitoring the flow rate of water outside the gate at the current timeWater flow velocity in the sum gatevWherein the water flow velocity comprises a water flow direction and a water flow velocity value;
s12: monitoring the water depth L in the gate at the current moment and the change rate of the water depth in the gatev L :
Wherein:
s represents the area of the bottom inside the gate,v s indicating the rate of water addition or water discharge in the lock,v s in cubic meters per second;v L the change rate of the water depth in the gate is expressed in meters per second;
s13: measuring the diameters of the atmospheric particulates and the densities of the atmospheric particulates in different shipping areas, wherein the densities of the atmospheric particulates are the number of the atmospheric particulates in each cubic meter area, and calculating to obtain the visibility of the different shipping areas at the current moment :
Wherein:
d represents the diameter of the atmospheric particulate matter,indicating the atmospheric particulate density,/->In meters.
S2: a ship lock-out time function is determined based on the shipping visibility.
And in the step S2, determining a ship passing time function, which comprises the following steps:
determining a ship passing time function based on the shipping visibility:
wherein:
Time(V(q) A ship lock time function representing the ship q,D(q) Indicating the distance of the ship q from the gate,V(q) The travel speed of the ship q is indicated,indicates the real-time gate external water flow speed, +.>The included angle between the ship q running direction and the water flow direction outside the brake is shown;
indicating that ship q is traveling to +.>When in shipping area, the>The current shipping visibility of the shipping area is at,num q representing the total number of navigation areas, +.>Representing a preset minimum normal driving visibility;
visibility indicating the position of the gate, +.>The speed of the passing gate is indicated by the specification,Len q representing the hull length of the vessel q;
L q indicating the required water depth of the ship q passing through the gate, when the water depth in the gate is higher than the required water depth, the water is discharged, and when the water depth in the gate is lower than the required water depth, the water is added.
S3: and acquiring ship lock report and backup information, constructing a multistage intermodal ship lock scheduling model and constraint conditions according to ship lock influence index data and a ship lock time function, wherein the constructed model takes maximized ship passing efficiency as an objective function and takes ship running speed and gate opening time as control variables.
And step S3, acquiring ship passing gate report information, which comprises the following steps: when the ship drives to a gate from a port, the ship needs to report and prepare to acquire a time range [ t ] 0 ,t L ]The ship passing gate report information in the system takes the ship corresponding to the ship passing gate report information as the ship to be currently scheduled, wherein t L Indicating the current time, t 0 When the emergency ship or dangerous goods ship needs to pass the gate, an emergency channel is cleaned out at the gate, and the emergency ship or dangerous goods ship can pass the gate along the emergency channel.
And in the step S3, constructing an objective function of a multi-stage intermodal ship lock scheduling model, wherein the objective function comprises the following steps:
according to ship lock influence index data and a ship lock time function, constructing an objective function of a multistage intermodal ship lock scheduling model, wherein the constructed objective function F for controlling and scheduling ship running speed and gate opening time is as follows:
wherein:
q represents the total number of the current ships to be scheduled, wherein the ships to be scheduled are the ship for which the passing gate is reported;
P q the gate report time of any ship q is shown, The moment when the ship q arrives at the gate is indicated;
e represents a gate opening time sequence, E comprises N moments,R(E) Indicating any time in the gate opening time sequence E,the waiting time for the ship q to wait for the gate to open is indicated.
And step S3, constructing constraint conditions of an objective function in a multi-stage intermodal ship lock scheduling model, wherein the constraint conditions comprise:
constructing constraint conditions of an objective function in a multistage intermodal ship lock scheduling model, wherein the constraint conditions of the objective function F are as follows:
wherein:
C 1 the waiting time of any ship q waiting for the opening of the gate is more than or equal to 0;representing the number of time periods of successive opening of the shutter in the shutter opening time sequence E, +.>Representation->The shortest time length of continuous opening of the middle gate, +.>Representing a preset gate minimum opening time length threshold.
S4: and carrying out double-stage optimization solution on the constructed multi-stage intermodal ship lock scheduling model by utilizing a dynamic punishment strategy to obtain a real-time multi-stage intermodal ship lock scheduling scheme.
In the step S4, a dynamic punishment strategy is utilized to carry out double-stage optimization solution on the constructed multi-stage intermodal ship lock scheduling model, and the method comprises the following steps:
carrying out double-stage optimization solving on the constructed multi-stage intermodal ship lock scheduling model by utilizing a dynamic punishment strategy to obtain a multi-stage intermodal ship lock scheduling scheme, wherein the multi-stage intermodal ship lock scheduling scheme comprises the driving speed control of the ship after the lock is reported and the gate opening time;
The optimal solving flow of the multistage intermodal ship lock scheduling model based on the dynamic punishment strategy is as follows:
s41: generating M groups of chromosomes, wherein each group of chromosomes comprises N genes, and N times of N gate opening time sequences E to be optimally solved are corresponding;
s42: the method comprises the steps of carrying out initial coding representation on N genes in each group of chromosomes, wherein the coding type of each gene is {0,1},1 represents that a gate is in an open state at the moment corresponding to the gene, 0 represents that the gate is in a closed state at the moment corresponding to the gene, and the coding representation of each group of chromosomes meets the constraint conditionI.e.the shortest gene length of consecutive 1 in the chromosome +.>The initial coding of the m-th group of chromosomes indicates thatx m (0),/>;
S43: taking the running speed reported by the current ship to be scheduled as a fixed value, taking the coding representation result of each group of chromosomes as an input value, and converting the objective function F into an adaptive function F (X) of each group of chromosomes, wherein X represents the coding representation result of the chromosomes of the input adaptive function;
s44: setting the iteration number of the current chromosome as k, the initial value of k as 0, and the maximum value as Max, wherein the k iteration result of the m-th group of chromosomes isX m (k) The corresponding adaptive function results in F (X m (k));
S45: randomly selecting a plurality of groups of chromosomes for iteration, wherein the iteration mode comprises cross variation, and the probability that the m group of chromosomes is selected in the k+1st iteration processP k+1 (m) is:
the crossing operation is to mutually exchange the selected chromosome gene segments with the gene segments of other chromosomes at the same position, and ensure that the exchanged chromosomes meet constraint conditions;
the mutation operation is to mutate a certain gene in the selected chromosome and ensure that the mutated chromosomes meet constraint conditions, and in the embodiment of the invention, the mutation operation comprisesOr->;
S46: let k=k+1, repeat step S45 until k+1=max, select the coding representation result of the chromosome with the smallest adaptive function result at this time as the gate scheduling scheme;
and combining a gate scheduling scheme, converting the objective function F into a dynamic ship speed scheduling function:
wherein:
representing the dynamic penalty factor obtained in the ith iteration, < ->Representation ofPreset initial dynamic penalty coefficient, +.>Representing a dynamic penalty function value obtained by the ith iteration;
v represents the running speed control vector of Q vessels to be scheduled to be solved optimally, v= ,Representing the running speed control result of the ship q obtained by solving;
s47: calculating the dynamic punishment function value of the current nth iterationIf->If the dynamic punishment coefficient is smaller than the preset punishment threshold value, ending iteration, outputting a current running speed control vector, and otherwise, respectively iterating the dynamic punishment coefficient and the ship running speed control result:
wherein:
rand(-1, 1) represents between-1 and 1A random number is used to determine the random number,V th representing a preset speed update constant;
s48: let u=u+1, return to step S47;
s49: and taking the gate scheduling scheme and the current running speed control vector as a real-time multi-stage intermodal ship lock scheduling scheme.
S5: and controlling the gate opening time and the running speeds of different ships based on a multi-stage intermodal ship lock scheduling scheme, and guiding the ship passing through the lock to reach a designated position in a lock chamber according to a ship scheduling strategy.
And S5, controlling the ship running speed and the gate opening time based on a multi-stage intermodal ship gate scheduling scheme, guiding the ship passing through the gate to reach a designated position in a gate chamber according to a ship scheduling strategy, and comprising the following steps:
the method comprises the steps of controlling gate opening time and running speed of a ship to be scheduled based on a multi-stage intermodal ship lock scheduling scheme, and guiding the ship passing through the lock to a designated position in a lock chamber according to a ship scheduling strategy, wherein the ship scheduling strategy comprises the following steps:
S51: acquiring the size of the passing ship, and traversing the effective area of the sluice chamber, wherein the effective area of the sluice chamber represents the vacant space area in the sluice chamber;
s52: if the left lower corner position in the effective area of the lock chamber can store the lock ship, placing the lock ship at the left lower corner position of the effective area of the lock chamber, and updating the effective area of the lock chamber; otherwise, the passing ship is placed at the highest position of the upper right corner of the effective area of the lock chamber, and is enabled to move vertically downwards and then leftwards as much as possible under the condition of meeting space constraint until reaching an immovable position, and the effective area of the lock chamber is updated.
Example 2:
fig. 2 is a functional block diagram of a multi-stage intermodal lock dispatching system according to an embodiment of the present invention, which can implement the multi-stage intermodal lock dispatching method in embodiment 1.
The multi-stage intermodal lock dispatch system 100 of the present invention may be installed in an electronic device. Depending on the functions implemented, the multi-stage intermodal lock dispatch system may include a data acquisition device 101, a dispatch model building module 102, and a lock dispatch module 103. The module of the invention, which may also be referred to as a unit, refers to a series of computer program segments, which are stored in the memory of the electronic device, capable of being executed by the processor of the electronic device and of performing a fixed function.
The data acquisition device 101 is used for acquiring ship crossing influence index data;
the scheduling model construction module 102 is used for determining a ship lock time function based on shipping visibility, acquiring ship lock report information, and constructing a multi-stage intermodal ship lock scheduling model according to ship lock influence index data and the ship lock time function;
and the ship lock scheduling module 103 is used for carrying out double-stage optimization solution on the constructed multi-stage intermodal ship lock scheduling model by utilizing a dynamic punishment strategy to obtain a real-time multi-stage intermodal ship lock scheduling scheme, controlling the gate opening time and the running speeds of different ships based on the multi-stage intermodal ship lock scheduling scheme, and guiding the ship passing through the lock to reach a designated position in a lock chamber according to the ship scheduling strategy.
In detail, the modules in the multi-stage intermodal ship lock scheduling system 100 in the embodiment of the present invention use the same technical means as the multi-stage intermodal ship lock scheduling method described in fig. 1, and can produce the same technical effects, which are not described herein.
Example 3:
fig. 3 is a schematic structural diagram of an electronic device for implementing a multi-stage intermodal ship lock dispatching method according to an embodiment of the present invention.
The electronic device 1 may comprise a processor 10, a memory 11, a communication interface 13 and a bus, and may further comprise a computer program, such as program 12, stored in the memory 11 and executable on the processor 10.
The memory 11 includes at least one type of readable storage medium, including flash memory, a mobile hard disk, a multimedia card, a card memory (e.g., SD or DX memory, etc.), a magnetic memory, a magnetic disk, an optical disk, etc. The memory 11 may in some embodiments be an internal storage unit of the electronic device 1, such as a removable hard disk of the electronic device 1. The memory 11 may in other embodiments also be an external storage device of the electronic device 1, such as a plug-in mobile hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card) or the like, which are provided on the electronic device 1. Further, the memory 11 may also include both an internal storage unit and an external storage device of the electronic device 1. The memory 11 may be used not only for storing application software installed in the electronic device 1 and various types of data, such as codes of the program 12, but also for temporarily storing data that has been output or is to be output.
The processor 10 may be comprised of integrated circuits in some embodiments, for example, a single packaged integrated circuit, or may be comprised of multiple integrated circuits packaged with the same or different functions, including one or more central processing units (Central Processing unit, CPU), microprocessors, digital processing chips, graphics processors, combinations of various control chips, and the like. The processor 10 is a Control Unit (Control Unit) of the electronic device, connects the respective components of the entire electronic device using various interfaces and lines, executes or executes programs or modules (programs 12 for multi-stage intermodal lock scheduling, etc.) stored in the memory 11, and invokes data stored in the memory 11 to perform various functions of the electronic device 1 and process data.
The communication interface 13 may comprise a wired interface and/or a wireless interface (e.g. WI-FI interface, bluetooth interface, etc.), typically used to establish a communication connection between the electronic device 1 and other electronic devices and to enable connection communication between internal components of the electronic device.
The bus may be a peripheral component interconnect standard (peripheral component interconnect, PCI) bus or an extended industry standard architecture (extended industry standard architecture, EISA) bus, among others. The bus may be classified as an address bus, a data bus, a control bus, etc. The bus is arranged to enable a connection communication between the memory 11 and at least one processor 10 etc.
Fig. 3 shows only an electronic device with components, it being understood by a person skilled in the art that the structure shown in fig. 3 does not constitute a limitation of the electronic device 1, and may comprise fewer or more components than shown, or may combine certain components, or may be arranged in different components.
For example, although not shown, the electronic device 1 may further include a power source (such as a battery) for supplying power to each component, and preferably, the power source may be logically connected to the at least one processor 10 through a power management device, so that functions of charge management, discharge management, power consumption management, and the like are implemented through the power management device. The power supply may also include one or more of any of a direct current or alternating current power supply, recharging device, power failure detection circuit, power converter or inverter, power status indicator, etc. The electronic device 1 may further include various sensors, bluetooth modules, wi-Fi modules, etc., which will not be described herein.
The electronic device 1 may optionally further comprise a user interface, which may be a Display, an input unit, such as a Keyboard (Keyboard), or a standard wired interface, a wireless interface. Alternatively, in some embodiments, the display may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode) touch, or the like. The display may also be referred to as a display screen or display unit, as appropriate, for displaying information processed in the electronic device 1 and for displaying a visual user interface.
It should be understood that the embodiments described are for illustrative purposes only and are not limited to this configuration in the scope of the patent application.
It should be noted that, the foregoing reference numerals of the embodiments of the present invention are merely for describing the embodiments, and do not represent the advantages and disadvantages of the embodiments. And the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, apparatus, article, or method that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, apparatus, article, or method. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, apparatus, article or method that comprises the element.
From the above description of the embodiments, it will be clear to those skilled in the art that the above-described embodiment method may be implemented by means of software plus a necessary general hardware platform, but of course may also be implemented by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art in the form of a software product stored in a storage medium (e.g. ROM/RAM, magnetic disk, optical disk) as described above, comprising instructions for causing a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) to perform the method according to the embodiments of the present invention.
The foregoing description is only of the preferred embodiments of the present invention, and is not intended to limit the scope of the invention, but rather is intended to cover any equivalents of the structures or equivalent processes disclosed herein or in the alternative, which may be employed directly or indirectly in other related arts.
Claims (9)
1. A method of scheduling a multi-stage intermodal ship lock, the method comprising:
s1: acquiring ship crossing gate influence index data, wherein the influence index comprises a gate external water flow speed, a gate internal water depth, shipping visibility and a gate internal water depth change rate;
s2: determining a ship passing time function based on the shipping visibility;
s3: acquiring ship lock report and backup information, constructing a multistage intermodal ship lock scheduling model and constraint conditions according to ship lock influence index data and a ship lock time function, wherein the constructed model takes maximized ship passing efficiency as an objective function and takes ship running speed and gate opening time as control variables;
s4: carrying out double-stage optimization solution on the constructed multi-stage intermodal ship lock scheduling model by utilizing a dynamic punishment strategy to obtain a real-time multi-stage intermodal ship lock scheduling scheme;
S5: and controlling the gate opening time and the running speeds of different ships based on a multi-stage intermodal ship lock scheduling scheme, and guiding the ship passing through the lock to reach a designated position in a lock chamber according to a ship scheduling strategy.
2. The multi-stage intermodal ship lock scheduling method as claimed in claim 1, wherein the step S1 of collecting ship lock influence index data includes:
the method comprises the steps of collecting ship passing gate influence index data in real time, wherein the ship passing gate influence index data comprises a gate external water flow speed, a gate internal water depth, shipping visibility and a gate internal water depth growth rate, and the ship passing gate influence index data collecting flow is as follows:
s11: monitoring the flow rate of water outside the gate at the current timeWater flow velocity in the sum gatevWherein the water flow velocity comprises a water flow direction and a water flow velocity value;
s12: monitoring the water depth L in the gate at the current moment and the change rate of the water depth in the gatev L :
Wherein:
s represents the area of the bottom inside the gate,v s indicating the rate of water addition or water discharge in the lock,v s in cubic meters per second;v L the change rate of the water depth in the gate is expressed in meters per second;
s13: measuring the atmospheric particulate diameters and the atmospheric particulate densities of different shipping areas, wherein the densities of the atmospheric particulates Calculating to obtain the visibility of different shipping areas at the current moment for the number of the atmospheric particulates in each cubic meter area:
Wherein:
3. The multi-stage intermodal ship lock scheduling method as claimed in claim 2, wherein the determining of the ship lock time function in step S2 includes:
determining a ship passing time function based on the shipping visibility:
wherein:
Time(V(q) A ship lock time function representing the ship q,D(q) Indicating the distance of the ship q from the gate,V(q) The travel speed of the ship q is indicated,representing real timeWater flow speed outside gate->The included angle between the ship q running direction and the water flow direction outside the brake is shown;
indicating that ship q is traveling to +.>When in shipping area, the>The current shipping visibility of the shipping area is at,num q representing the total number of navigation areas, +.>Representing a preset minimum normal driving visibility;
visibility indicating the position of the gate, +.>The speed of the passing gate is indicated by the specification,Len q representing the hull length of the vessel q;
L q indicating the required water depth of the ship q passing through the gate, when the water depth in the gate is higher than the required water depth, the water is discharged, and when the water depth in the gate is lower than the required water depth, the water is added.
4. The multi-stage intermodal ship lock scheduling method as claimed in claim 1, wherein the step S3 of obtaining ship lock report information includes:
when the ship is driven from the port to the one-way gateThe report and the backup are needed to be carried out, and the time range [ t ] is acquired 0 ,t L ]The ship passing gate report information in the system takes the ship corresponding to the ship passing gate report information as the ship to be currently scheduled, wherein t L Indicating the current time, t 0 When the emergency ship or dangerous goods ship needs to pass the gate, an emergency channel is cleaned out at the gate, and the emergency ship or dangerous goods ship can pass the gate along the emergency channel.
5. The multi-stage intermodal lock dispatch method of claim 4, wherein constructing the objective function of the multi-stage intermodal lock dispatch model in step S3 includes:
according to ship lock influence index data and a ship lock time function, constructing an objective function of a multistage intermodal ship lock scheduling model, wherein the constructed objective function F for controlling and scheduling ship running speed and gate opening time is as follows:
Wherein:
q represents the total number of the current ships to be scheduled, wherein the ships to be scheduled are the ship for which the passing gate is reported;
P q the gate report time of any ship q is shown,the moment when the ship q arrives at the gate is indicated;
6. The multi-stage intermodal lock scheduling method as claimed in claim 5, wherein the constructing constraint conditions of the objective function in the multi-stage intermodal lock scheduling model in step S3 includes:
constructing constraint conditions of an objective function in a multistage intermodal ship lock scheduling model, wherein the constraint conditions of the objective function F are as follows:
wherein:
C 1 the waiting time of any ship q waiting for the opening of the gate is more than or equal to 0;
7. The multi-stage intermodal lock scheduling method of claim 6, wherein the step S4 of performing a two-stage optimization solution to the constructed multi-stage intermodal lock scheduling model using a dynamic penalty strategy includes:
Carrying out double-stage optimization solving on the constructed multi-stage intermodal ship lock scheduling model by utilizing a dynamic punishment strategy to obtain a multi-stage intermodal ship lock scheduling scheme, wherein the multi-stage intermodal ship lock scheduling scheme comprises the driving speed control of the ship after the lock is reported and the gate opening time;
the optimal solving flow of the multistage intermodal ship lock scheduling model based on the dynamic punishment strategy is as follows:
s41: generating M groups of chromosomes, wherein each group of chromosomes comprises N genes, and N times of N gate opening time sequences E to be optimally solved are corresponding;
s42: the method comprises the steps of carrying out initial coding representation on N genes in each group of chromosomes, wherein the coding type of each gene is {0,1},1 represents that a gate is in an open state at the moment corresponding to the gene, 0 represents that the gate is in a closed state at the moment corresponding to the gene, and the coding representation of each group of chromosomes meets the constraint conditionI.e.the shortest gene length of consecutive 1 in the chromosome +.>The initial coding of the m-th group of chromosomes indicates thatx m (0),/>;
S43: taking the running speed reported by the current ship to be scheduled as a fixed value, taking the coding representation result of each group of chromosomes as an input value, and converting the objective function F into an adaptive function F (X) of each group of chromosomes, wherein X represents the coding representation result of the chromosomes of the input adaptive function;
S44: setting the iteration number of the current chromosome as k, the initial value of k as 0, and the maximum value as Max, wherein the k iteration result of the m-th group of chromosomes isX m (k) The corresponding adaptive function results in F(X m (k));
S45: randomly selecting a plurality of groups of chromosomes for iteration, wherein the iteration mode comprises cross variation, and the probability that the m group of chromosomes is selected in the k+1st iteration processP k+1 (m) is:
the crossing operation is to mutually exchange the selected chromosome gene segments with the gene segments of other chromosomes at the same position, and ensure that the exchanged chromosomes meet constraint conditions;
the mutation operation is to perform mutation treatment on one gene in the selected chromosome, and ensure that the mutated chromosomes meet constraint conditions;
s46: let k=k+1, repeat step S45 until k+1=max, select the coding representation result of the chromosome with the smallest adaptive function result at this time as the gate scheduling scheme;
and combining a gate scheduling scheme, converting the objective function F into a dynamic ship speed scheduling function:
wherein:
representing the dynamic penalty factor obtained in the ith iteration, < ->Representing a pre-set initial dynamic penalty coefficient,representing a dynamic penalty function value obtained by the ith iteration;
v represents the running speed control vector of Q vessels to be scheduled to be solved optimally, v=,Representing the running speed control result of the ship q obtained by solving;
s47: calculating the dynamic punishment function value of the current nth iterationIf->If the dynamic punishment coefficient is smaller than the preset punishment threshold value, ending iteration, outputting a current running speed control vector, and otherwise, respectively iterating the dynamic punishment coefficient and the ship running speed control result:
wherein:
rand(-1, 1) represents a random number between-1 and 1,V th representing a preset speed update constant;
s48: let u=u+1, return to step S47;
s49: and taking the gate scheduling scheme and the current running speed control vector as a real-time multi-stage intermodal ship lock scheduling scheme.
8. The multi-stage intermodal lock scheduling method as set forth in claim 7, wherein the step S5 of controlling the ship traveling speed and the gate opening time based on the multi-stage intermodal lock scheduling scheme, guiding the ship passing through the lock to a designated location in the lock room according to the ship scheduling policy includes:
the method comprises the steps of controlling gate opening time and running speed of a ship to be scheduled based on a multi-stage intermodal ship lock scheduling scheme, and guiding the ship passing through the lock to a designated position in a lock chamber according to a ship scheduling strategy, wherein the ship scheduling strategy comprises the following steps:
S51: acquiring the size of the passing ship, and traversing the effective area of the sluice chamber, wherein the effective area of the sluice chamber represents the vacant space area in the sluice chamber;
s52: if the left lower corner position in the effective area of the lock chamber can store the lock ship, placing the lock ship at the left lower corner position of the effective area of the lock chamber, and updating the effective area of the lock chamber; otherwise, the passing ship is placed at the highest position of the upper right corner of the effective area of the lock chamber, and is enabled to move vertically downwards and then leftwards as much as possible under the condition of meeting space constraint until reaching an immovable position, and the effective area of the lock chamber is updated.
9. A multi-stage intermodal lock dispatch system, the system comprising:
the data acquisition device is used for acquiring ship crossing influence index data;
the scheduling model construction module is used for determining a ship lock time function based on shipping visibility, acquiring ship lock report information and constructing a multi-stage intermodal ship lock scheduling model according to ship lock influence index data and the ship lock time function;
the ship lock scheduling module is used for carrying out double-stage optimization solving on the constructed multi-stage intermodal ship lock scheduling model by utilizing a dynamic punishment strategy to obtain a real-time multi-stage intermodal ship lock scheduling scheme, controlling the gate opening time and the running speeds of different ships based on the multi-stage intermodal ship lock scheduling scheme, and guiding the ships passing through the lock to a designated position in a lock chamber according to the ship scheduling strategy so as to realize the multi-stage intermodal ship lock scheduling method according to any one of claims 1-8.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202310331350.5A CN116050810B (en) | 2023-03-31 | 2023-03-31 | Multistage intermodal ship lock scheduling method and system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202310331350.5A CN116050810B (en) | 2023-03-31 | 2023-03-31 | Multistage intermodal ship lock scheduling method and system |
Publications (2)
Publication Number | Publication Date |
---|---|
CN116050810A true CN116050810A (en) | 2023-05-02 |
CN116050810B CN116050810B (en) | 2023-06-20 |
Family
ID=86127605
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202310331350.5A Active CN116050810B (en) | 2023-03-31 | 2023-03-31 | Multistage intermodal ship lock scheduling method and system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN116050810B (en) |
Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105117793A (en) * | 2015-08-10 | 2015-12-02 | 大连海事大学 | Two-way navigable port ship scheduling optimization method |
US20190080271A1 (en) * | 2017-09-11 | 2019-03-14 | Hefei University Of Technology | Coordinated Production and Transportation Scheduling Method and System Based on Improved Tabu Search Algorithm |
CN110110403A (en) * | 2019-04-19 | 2019-08-09 | 长江三峡通航管理局 | A kind of scheduling gear method being applicable in unidirectional continuous lockage ship |
CN111062568A (en) * | 2019-11-12 | 2020-04-24 | 武汉理工大学 | Ship lockage scheduling method, system and storage medium |
CN111652502A (en) * | 2020-06-01 | 2020-09-11 | 中南大学 | Multi-step multi-line ship lock combined scheduling method based on flexible job shop scheduling |
WO2022016149A1 (en) * | 2020-07-17 | 2022-01-20 | Custody Chain LLC | Unitos-universal transportation operating system |
KR20220159593A (en) * | 2021-05-26 | 2022-12-05 | 주식회사 이에스피 | Process schedule optimization system according to the environment change of the quay line |
CN115689235A (en) * | 2022-11-11 | 2023-02-03 | 长江三峡通航管理局 | Navigation scheduling method for reducing influence of multi-line single-stage ship lock water discharge wave |
-
2023
- 2023-03-31 CN CN202310331350.5A patent/CN116050810B/en active Active
Patent Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105117793A (en) * | 2015-08-10 | 2015-12-02 | 大连海事大学 | Two-way navigable port ship scheduling optimization method |
US20190080271A1 (en) * | 2017-09-11 | 2019-03-14 | Hefei University Of Technology | Coordinated Production and Transportation Scheduling Method and System Based on Improved Tabu Search Algorithm |
CN110110403A (en) * | 2019-04-19 | 2019-08-09 | 长江三峡通航管理局 | A kind of scheduling gear method being applicable in unidirectional continuous lockage ship |
CN111062568A (en) * | 2019-11-12 | 2020-04-24 | 武汉理工大学 | Ship lockage scheduling method, system and storage medium |
CN111652502A (en) * | 2020-06-01 | 2020-09-11 | 中南大学 | Multi-step multi-line ship lock combined scheduling method based on flexible job shop scheduling |
WO2022016149A1 (en) * | 2020-07-17 | 2022-01-20 | Custody Chain LLC | Unitos-universal transportation operating system |
KR20220159593A (en) * | 2021-05-26 | 2022-12-05 | 주식회사 이에스피 | Process schedule optimization system according to the environment change of the quay line |
CN115689235A (en) * | 2022-11-11 | 2023-02-03 | 长江三峡通航管理局 | Navigation scheduling method for reducing influence of multi-line single-stage ship lock water discharge wave |
Non-Patent Citations (2)
Title |
---|
毛星;徐希涛;: "多目标遗传算法在船闸调度中的应用", 计算机与现代化, no. 06 * |
邓伟;邝祝芳;余绍军;曾非凡;: "基于遗传算法的三峡-葛洲坝船闸闸室编排算法", 人民长江, no. 24 * |
Also Published As
Publication number | Publication date |
---|---|
CN116050810B (en) | 2023-06-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Zeng et al. | Integrating simulation and optimization to schedule loading operations in container terminals | |
He et al. | Modeling berth allocation and quay crane assignment considering QC driver cost and operating efficiency | |
Subtil et al. | A practical approach to truck dispatch for open pit mines | |
CN111861205B (en) | Automatic container wharf outlet box space distribution method | |
Yin et al. | A distributed agent system for port planning and scheduling | |
CN108280575A (en) | A kind of multiple batches of scheduling decision method of emergency evacuation vehicle | |
CN106651280B (en) | Logistics transportation scheduling method and system for container ship | |
KR102687483B1 (en) | A method for scheduling works of yardcranes in container terminal using a simulation-based algorithm | |
CN101986313A (en) | Knowledge-based container quay berth and shore bridge dispatching method | |
CN108764579A (en) | A kind of storage multi-robotic task dispatching method based on congestion control | |
Dahal et al. | A port system simulation facility with an optimization capability | |
CN115330227A (en) | Container position allocation method, device, equipment and medium for container yard | |
CN116050810B (en) | Multistage intermodal ship lock scheduling method and system | |
CN117557199B (en) | Intelligent warehousing method, system and storage medium based on mathematical model | |
Wang et al. | Real-time truck dispatching in open-pit mines | |
CN117634792A (en) | Port congestion scheduling method, device, equipment and medium | |
CN117745045A (en) | Production order and production path scheduling method based on genetic algorithm | |
CN116629571A (en) | Multi-equipment integrated robust scheduling method and device for wharf | |
Varghese et al. | Dynamic spatial block arrangement scheduling in shipbuilding industry using genetic algorithm | |
Dahal et al. | Modelling, simulation and optimisation of port system management | |
CN115630901A (en) | Stereo warehouse carrying and scheduling method and device | |
Zhao et al. | Container ship stowage based on Monte Carlo tree search | |
Han et al. | Integrated Scheduling of Automated Rail-Mounted Gantries and External Trucks in U-Shaped Container Terminals | |
Song et al. | Novel AGV resilient scheduling for automated container terminals considering charging strategy | |
CN114580728A (en) | Elevator dispatching method and device, storage medium and electronic equipment |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |