Joint dispatching method, system, storage medium and computer for multi-step ship locks

Abstract

The present invention provides a joint scheduling method, system, storage medium and computer for a multi-step ship lock, the method comprising: if each ship arrives at the first lock area of ​​the multi-step ship lock, then each ship is marked to enter the waiting lock state, and the release volume of all the locks in the multi-step ship lock is obtained, and whether the multi-step ship lock needs to be jointly scheduled is determined according to the release volume; if the multi-step ship lock needs to be jointly scheduled, the joint scheduling time difference of the first lock in the multi-step ship lock is calculated according to the number of locks in the multi-step ship lock; the release scheduling volume of the first lock is calculated according to the joint scheduling time difference of the first lock, and all the locks in the multi-step ship lock are virtually shifted according to the release scheduling volume of the first lock, so as to realize the joint scheduling of the multi-step ship lock. The present invention changes the registration scheduling of a single step into a unified registration scheduling of multiple steps, ensures the smooth navigation of ships and reduces waiting time, and at the same time ensures the smooth flow of waterways within the steps.

Description

Technical Field

[0001] The present invention relates to the technical field of data processing, and in particular to a joint dispatching method, system, storage medium and computer for multi-step ship locks. Background Art

[0002] At present, each lock operates independently and the navigation capacity of the locks varies. In the absence of a unified scheduling and management mechanism, there is a backlog of ships in some locks in the waterway, long waiting times, and even congestion in the waterway, increasing safety risks.

[0003] There is no limit on the number of ships registered at each lock. Generally, the number of ships registered is the same as the number of ships dispatched. If there is no time to dispatch ships, they will be docked in the waiting area (anchorage) to wait for the lock. If the dispatch efficiency is lower than the ship registration efficiency, it is easy to cause the number of ships waiting for the lock to continue to increase, eventually leading to navigation congestion or safety risks, while affecting environmental sanitation and increasing the difficulty of lock management.

[0004] As a key node on inland waterways, the operation efficiency and dispatching management level of ship locks directly affect the navigation capacity of the entire waterway and the transportation efficiency of ships. The traditional multi-stage ship lock dispatching method often has the following problems:

[0005] Business independence: Although data is shared among the locks at all levels, such as waiting data query, registration data query, passing data query, etc., there is no business relationship. When dispatching, the staff will not consider the actual situation of the upstream and downstream locks, even if the upstream and downstream locks are congested.

[0006] Low efficiency: From a local perspective, the dispatching efficiency of single-step locks is very high, but from an overall perspective, due to the congestion of upstream or downstream locks (or even multiple locks), the navigation time of ships in the entire waterway is greatly increased, and the safety hazard coefficient is very high, which is not conducive to the development of water transportation in the waterway.

[0007] Environmental management is difficult: As ships wait in various cascade locks, each cascade lock will require manpower, material resources and time to solve environmental problems, making it impossible to achieve centralized processing and unified management. Summary of the invention

[0008] Based on this, the purpose of the present invention is to provide a joint scheduling method, system, storage medium and computer for multi-step ship locks, so as to at least solve the deficiencies in the above-mentioned technology.

[0009] The present invention provides a joint dispatching method for a multi-step ship lock, comprising:

[0010] Obtaining declaration information of a number of ships, and performing real-time analysis on the corresponding ships according to the declaration information to determine whether the ships have arrived at the first lock area of ​​the multi-step ship lock;

[0011] If each of the ships arrives at the first lock area of ​​the multi-step lock, each of the ships is marked as entering a lock waiting state, and the release volume of all the locks in the multi-step lock is obtained, and it is determined whether the multi-step locks need to be jointly dispatched according to the release volume;

[0012] If the multi-step ship lock needs to be jointly dispatched, the joint dispatching time difference of the first lock in the multi-step ship lock is calculated according to the number of locks in the multi-step ship lock;

[0013] The release scheduling amount of the first lock is calculated according to the joint scheduling time difference of the first lock, and all the locks in the multi-step lock are virtually shifted according to the release scheduling amount of the first lock to achieve the joint scheduling of the multi-step lock.

[0014] Furthermore, the method further comprises:

[0015] If the multi-stage ship locks do not require joint scheduling, the basic information of the first lock is obtained, and the scheduling time of each ship in the waiting state is calculated based on the basic information;

[0016] A scheduling gear shift instruction for each ship in the waiting state is generated according to the scheduling time, so that each ship in the waiting state performs scheduling gear shifting according to the scheduling gear shift instruction.

[0017] Furthermore, the step of obtaining the release volume of all the locks in the multi-step locks and judging whether the multi-step locks need to be jointly dispatched according to the release volume includes:

[0018] Obtaining the number of ships per lock, the number of locks released, and the number of locks in a single direction in a first lock of the multi-step ship lock within a time period and the scheduling time difference of the first lock of the multi-step ship lock, and calculating the release volume of the first lock of the multi-step ship lock according to the scheduling time difference of the first lock of the multi-step ship lock, the number of ships per lock, the number of locks released, and the number of locks in a single direction;

[0019] The release volumes of the remaining locks in the multi-step ship locks are calculated respectively, and if the release volume of the first lock in the multi-step ship locks and the release volume of the remaining locks in the multi-step ship locks increase successively, it is determined that the multi-step ship locks do not need to be jointly dispatched;

[0020] If the release volume of the first lock in the multi-step ship lock is greater than the minimum value of the release volume of the remaining locks in the multi-step ship lock, it is determined that the multi-step ship lock needs to be jointly dispatched.

[0021] Furthermore, the calculation formula for the release volume of the first lock in the multi-step ship lock is:

[0022] ;

[0023] In the formula, It indicates the number of ships passing through a single lock in the first lock of a multi-stage lock; Indicates a time period The number of gates released within ; The value range of is 0-24; Represents a time period The number of gates in a single direction; It indicates the scheduling time difference of the first lock in a multi-step ship lock.

[0024] Furthermore, the step of calculating the joint scheduling time difference of the first lock in the multi-step ship lock according to the number of locks in the multi-step ship lock comprises:

[0025] Calculating the release volume of all the locks in the multi-step locks respectively, and calculating the scheduling time interval of the lock with the smallest release volume in the multi-step locks and the corresponding number of released locks;

[0026] The joint scheduling time difference of the first lock in the multi-step ship lock is calculated according to the scheduling time interval of the lock with the smallest release volume in the multi-step ship lock and the corresponding number of released locks.

[0027] Furthermore, the calculation formula for the joint scheduling time difference of the first lock in the multi-step ship lock is:

[0028] ;

[0029] In the formula, Indicates the scheduling time interval of the lock with the smallest release volume among the multi-stage locks, Indicates the number of locks released by the lock with the smallest release volume among multiple-step locks.

[0030] The present invention also proposes a joint dispatching system for multi-step ship locks, comprising:

[0031] A real-time analysis module is used to obtain the declared information of several ships, and to perform real-time analysis on the corresponding ships according to the declared information, so as to determine whether each of the ships has arrived at the first lock area of ​​the multi-step ship lock;

[0032] A state judgment module is used for marking each of the ships as entering a waiting state if the ships arrive at the first lock area of ​​the multi-step lock, and obtaining the release volume of all the locks in the multi-step lock, and judging whether the multi-step locks need to be jointly dispatched according to the release volume;

[0033] A data calculation module, for calculating the time difference of the joint dispatch of the first lock in the multi-step ship lock according to the number of locks in the multi-step ship lock if the multi-step ship lock needs to be jointly dispatched;

[0034] The joint scheduling module is used to calculate the release scheduling amount of the first lock according to the joint scheduling time difference of the first lock, and to virtually shift gears for all the locks in the multi-step locks according to the release scheduling amount of the first lock to achieve the joint scheduling of the multi-step locks.

[0035] Furthermore, the system also includes:

[0036] A scheduling time calculation module, for obtaining basic information of the first lock if the multi-step ship lock does not require joint scheduling, and calculating the scheduling time of each ship in the waiting state based on the basic information;

[0037] The scheduling and shifting module is used to generate a scheduling and shifting instruction for each ship in the waiting state according to the scheduling time, so that each ship in the waiting state performs scheduling and shifting according to the scheduling and shifting instruction.

[0038] Furthermore, the state determination module includes:

[0039] a release volume calculation unit, used for obtaining the number of ships in a single lock, the number of locks released, the number of locks in a single direction, and the scheduling time difference of the first lock in the multi-step ship locks within a time period, and calculating the release volume of the first lock in the multi-step ship locks according to the scheduling time difference of the first lock in the multi-step ship locks, the number of ships in a single lock, the number of locks released, and the number of locks in a single direction;

[0040] The first state judgment unit is used to respectively calculate the release volume of the remaining locks in the multi-step ship locks, and if the release volume of the first lock in the multi-step ship locks and the release volume of the remaining locks in the multi-step ship locks increase successively, it is judged that the multi-step ship locks do not need to be jointly dispatched;

[0041] The second state judgment unit is used to judge that the multi-step ship locks need to be jointly dispatched if the release volume of the first lock in the multi-step ship lock is greater than the minimum value of the release volume of the remaining locks in the multi-step ship locks.

[0042] Furthermore, the data calculation module includes:

[0043] A data calculation unit, used to calculate the release volume of all the locks in the multi-step locks, and calculate the scheduling time interval of the lock with the smallest release volume in the multi-step locks and the corresponding number of released locks;

[0044] The time difference calculation unit is used to calculate the joint scheduling time difference of the first lock in the multi-step ship locks according to the scheduling time interval of the lock with the smallest release volume in the multi-step ship locks and its corresponding number of released locks.

[0045] The present invention also provides a storage medium on which a computer program is stored, and when the program is executed by a processor, the above-mentioned joint scheduling method of multi-step ship locks is implemented.

[0046] The present invention also proposes a computer, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned joint scheduling method for multi-step ship locks when executing the computer program.

[0047] The joint scheduling method, system, storage medium and computer of the multi-step locks in the present invention determine whether joint scheduling is needed by the arrival time of the ship at the first lock of the multi-step locks and the release volume of all the locks in the multi-step locks, so as to further ensure the passage of the locks, dynamically calculate the number of ships released by the first lock and the scheduling plan by calculating the joint scheduling time difference of the first lock, and predict the timetable of the ship arriving at each step lock, and transform the registration scheduling of a single step into a unified registration scheduling of multiple steps, so as to ensure the smooth navigation of the ship and reduce the waiting time, and at the same time ensure the smooth passage of the waterway within the step; ensure the green passage of the waterway, and the backlog of ships at the first and last locks of the step locks. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] Figure 1 It is a flow chart of the joint dispatching method of multi-step ship locks in the first embodiment of the present invention;

[0049] Figure 2 for Figure 1 Detailed flow chart of step S102;

[0050] Figure 3 for Figure 1 Detailed flow chart of step S103;

[0051] Figure 4 It is a structural block diagram of a joint dispatching system for multi-step ship locks in a second embodiment of the present invention;

[0052] Figure 5 FIG. 4 is a structural block diagram of a computer in a third embodiment of the present invention.

[0053] The following specific implementation manner will further illustrate the present invention in conjunction with the above-mentioned drawings. DETAILED DESCRIPTION

[0054] In order to facilitate the understanding of the present invention, the present invention will be described more fully below with reference to the relevant drawings. Several embodiments of the present invention are given in the drawings. However, the present invention can be implemented in many different forms and is not limited to the embodiments described herein. On the contrary, the purpose of providing these embodiments is to make the disclosure of the present invention more thorough and comprehensive.

[0055] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art to which the present invention belongs. The terms used herein in the specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention. The term "and / or" used herein includes any and all combinations of one or more of the related listed items.

[0056] Embodiment 1

[0057] See also Figure 1 , which shows a joint dispatching method for a multi-step ship lock in a first embodiment of the present invention, and the method specifically comprises steps S101 to S104:

[0058] S101, obtaining declaration information of a number of ships, and performing real-time analysis on the corresponding ships according to the declaration information to determine whether the ships have arrived at the first lock area of ​​the multi-step ship lock;

[0059] In specific implementation, when a ship makes an electronic declaration through a mobile terminal APP, the declaration information includes the locks that need to be passed (in this embodiment, the multi-step locks include four locks: lock A, lock B, lock C, and lock D);

[0060] Specifically, the AIS dynamic analysis system of the multi-step lock conducts real-time analysis of the ship's position to determine whether the ship has arrived at the electronic fence (reporting area) of lock A. There are many ways to report, including building an AIS base station yourself, using the mobile phone's own GPS positioning, or using a third-party system such as Ship Information Network to purchase services. These can all be used to determine the ship's position.

[0061] S102, if each of the ships arrives at the first lock area of ​​the multi-step lock, each of the ships is marked as entering a lock waiting state, and the release volume of all the locks in the multi-step lock is obtained, and it is determined whether the multi-step locks need to be jointly dispatched according to the release volume;

[0062] For further information, see Figure 2 , the step S102 specifically includes steps S1021 to S1023:

[0063] S1021, obtaining the number of ships per lock, the number of released locks, and the number of locks in a single direction in a first lock of the multi-step ship locks within a time period, and the scheduling time difference of the first lock of the multi-step ship locks, and calculating the release volume of the first lock of the multi-step ship locks according to the scheduling time difference of the first lock of the multi-step ship locks, the number of ships per lock, the number of released locks, and the number of locks in a single direction;

[0064] S1022, respectively calculating the release volume of the remaining locks in the multi-step ship lock, and if the release volume of the first lock in the multi-step ship lock and the release volume of the remaining locks in the multi-step ship lock increase successively, it is determined that the multi-step ship lock does not need to be jointly dispatched;

[0065] S1023: If the release volume of the first lock in the multi-step ship lock is greater than the minimum value of the release volume of the remaining locks in the multi-step ship lock, it is determined that the multi-step ship lock needs to be jointly dispatched.

[0066] In specific implementation, when a ship arrives at the first lock area of ​​a multi-step ship lock, the ship is marked as entering a waiting state, and a joint control method is implemented, which can be configured by staff or calculated and predicted by algorithms;

[0067] Specifically, is the number of ships released, For time, is the release volume of lock A, The value range is from 0 o'clock to 24 o'clock. Assume that the scheduling time difference of lock A is (The difference between the last dispatch time and the current dispatch time is the average value of the system statistics under full load, calculated using a mathematical model and a regression algorithm). The number of gates released within the time The number of ships released is equal to the sum of the number of ships in all locks, and the number of ships in a single lock is equal to the sum of the number of ships in all locks. , It represents the number of locks in a single direction in a day, so the release volume formula is:

[0068] ;

[0069] The above formula is used to calculate the release volume of locks B, C and D in the multi-step lock. , , ,like If the above is true, then there is no need for joint regulation of lock A; if If established, , which can avoid the backlog of ships in locks B, C and D.

[0070] S103, if the multi-step ship lock needs to be jointly dispatched, calculating the joint dispatching time difference of the first lock in the multi-step ship lock according to the number of locks in the multi-step ship lock;

[0071] For further information, see Figure 3 , the step S103 specifically includes steps S1031~S1032:

[0072] S1031, respectively calculating the release volume of all the locks in the multi-step locks, and calculating the scheduling time interval of the lock with the smallest release volume in the multi-step locks and the corresponding number of released locks;

[0073] S1032: Calculate the joint scheduling time difference of the first lock in the multi-step ship locks according to the scheduling time interval of the lock with the smallest release volume in the multi-step ship locks and its corresponding number of released locks.

[0074] In order to avoid wasting resources during the specific implementation, the number of ships in a single lock remains unchanged. Unchanged, want To become smaller, you must Get smaller, through Formula, finalized It becomes larger and the scheduling time needs to be extended.

[0075] Furthermore, in order to increase the efficiency of ship passing through the lock, the general ship lock is to dispatch one lock and shift one lock. Within the time, the number of ships in the waiting area must meet the number of ships for two locks (M). In order to ensure the accuracy of the number, Lock B begins to virtually schedule ships while the ships are sailing, and finally prioritizes them on a first-come, first-served basis. Virtual scheduling is mainly based on the estimated time of arrival of the ship at Lock B ( The predicted time for the ship is sorted and the gears are arranged in sequence. The predicted time is arranged in the following ways:

[0076] 1) Calculate arrival time based on AIS, , s is the distance between lock A and lock B, v is the ship speed, which comes from the ais dynamic message and is continuously calculated during the voyage ;

[0077] 2) Based on the regression algorithm, a ship time database is established, and the time model of the ship in this section is constructed according to the empty and loaded ships. value.

[0078] 3) Configuration value.

[0079] According to the maximum release volume of lock B, the corresponding value:

[0080] Assume that the initial value of the scheduling time interval of lock A is , and has been released Total gate times ships, the scheduling time interval of lock B is , the number of gates is Existing formula:

[0081]

[0082]

[0083] Assumptions , We can get:

[0084]

[0085]

[0086] In actual operation, when Lock A dispatches the first lock, no calculation is required. The second gate is dispatched after the time, and the next dispatch time starts to be calculated at this time For example: Lock A released 20 ships twice in 60 minutes. According to the gear calculation, Lock B needs 90 minutes to release 3 ships. According to the data in the example, : , then Lock A will schedule the third lock after 68 minutes.

[0087] Assuming that among locks B, C, and D, lock C has the lowest release volume per unit time, then the calculation formula for the joint scheduling time difference of the first lock among the multi-step locks is:

[0088]

[0089] Therefore, the final formula is: , Represents the lock with the least amount of ships released.

[0090] S104, calculating the release scheduling amount of the first lock according to the joint scheduling time difference of the first lock, and performing virtual gear shifting on all the locks in the multi-step lock according to the release scheduling amount of the first lock to achieve the joint scheduling of the multi-step lock.

[0091] In the specific implementation, the basic information of the lock is recorded, including the length and width of the lock, water depth, warning line, platform line and other basic data; the pilot bridge or navigation wall is notified to enter the lock according to the joint dispatch time difference of the first lock obtained above; after entering the lock, the dispatch notification of the next lock is initiated; the virtual gears are shifted in sequence to obtain the gear list of the four locks; and the four locks are jointly dispatched according to the gear list.

[0092] In some optional embodiments, the method further comprises:

[0093] If the multi-stage ship locks do not require joint scheduling, the basic information of the first lock is obtained, and the scheduling time of each ship in the waiting state is calculated based on the basic information;

[0094] A scheduling gear shift instruction for each ship in the waiting state is generated according to the scheduling time, so that each ship in the waiting state performs scheduling gear shifting according to the scheduling gear shift instruction.

[0095] In summary, the joint scheduling method for multiple-step locks in the above-mentioned embodiment of the present invention determines whether joint scheduling is needed by the arrival time of the ship at the first lock of the multiple-step locks and the release volume of all the locks in the multiple-step locks, so as to further ensure the passage of the locks, and dynamically calculates the number of ships released by the first lock and the scheduling plan by calculating the joint scheduling time difference of the first lock, and at the same time, it can predict the timetable for the ship to arrive at each step lock, and transform the registration scheduling of a single step into a unified registration scheduling of multiple steps, so as to ensure the smooth navigation of the ship and reduce the waiting time, and at the same time ensure the smooth passage of the waterway within the step; ensure the green passage of the waterway, and the backlog of ships at the head and tail locks of the step locks.

[0096] Embodiment 2

[0097] Another aspect of the present invention is to provide a combined dispatching system for multi-stage ship locks. Figure 4 , shown is a joint dispatching system of a multi-step ship lock in a second embodiment of the present invention, the system comprising:

[0098] The real-time analysis module 11 is used to obtain the declaration information of several ships, and perform real-time analysis on the corresponding ships according to the declaration information to determine whether each of the ships has arrived at the first lock area of ​​the multi-step ship lock;

[0099] The state judgment module 12 is used for marking each of the ships as entering a waiting state if the ships arrive at the first lock area of ​​the multi-step lock, and obtaining the release volume of all the locks in the multi-step lock, and judging whether the multi-step locks need to be jointly dispatched according to the release volume;

[0100] Furthermore, the state determination module 12 includes:

[0101] a release volume calculation unit, used for obtaining the number of ships in a single lock, the number of locks released, the number of locks in a single direction, and the scheduling time difference of the first lock in the multi-step ship locks within a time period, and calculating the release volume of the first lock in the multi-step ship locks according to the scheduling time difference of the first lock in the multi-step ship locks, the number of ships in a single lock, the number of locks released, and the number of locks in a single direction;

[0102] The first state judgment unit is used to respectively calculate the release volume of the remaining locks in the multi-step ship locks, and if the release volume of the first lock in the multi-step ship locks and the release volume of the remaining locks in the multi-step ship locks increase successively, it is judged that the multi-step ship locks do not need to be jointly dispatched;

[0103] The second state judgment unit is used to judge that the multi-step ship locks need to be jointly dispatched if the release volume of the first lock in the multi-step ship lock is greater than the minimum value of the release volume of the remaining locks in the multi-step ship locks.

[0104] A data calculation module 13 is used to calculate the joint scheduling time difference of the first lock in the multi-step ship lock according to the number of locks in the multi-step ship lock if the multi-step ship lock needs to be jointly scheduled;

[0105] Furthermore, the data calculation module 13 includes:

[0106] A data calculation unit, used to calculate the release volume of all the locks in the multi-step locks, and calculate the scheduling time interval of the lock with the smallest release volume in the multi-step locks and the corresponding number of released locks;

[0107] The time difference calculation unit is used to calculate the joint scheduling time difference of the first lock in the multi-step ship locks according to the scheduling time interval of the lock with the smallest release volume in the multi-step ship locks and its corresponding number of released locks.

[0108] The joint scheduling module 14 is used to calculate the release scheduling amount of the first lock according to the joint scheduling time difference of the first lock, and to virtually shift gears for all the locks in the multi-step locks according to the release scheduling amount of the first lock to achieve the joint scheduling of the multi-step locks.

[0109] In some optional embodiments, the system further comprises:

[0110] A scheduling time calculation module, for obtaining basic information of the first lock if the multi-step ship lock does not require joint scheduling, and calculating the scheduling time of each ship in the waiting state based on the basic information;

[0111] The scheduling and shifting module is used to generate a scheduling and shifting instruction for each ship in the waiting state according to the scheduling time, so that each ship in the waiting state performs scheduling and shifting according to the scheduling and shifting instruction.

[0112] The functions or operation steps implemented when the above modules and units are executed are generally the same as those in the above method embodiments, and will not be repeated here.

[0113] The joint dispatching system of multi-step ship locks provided in the embodiment of the present invention has the same implementation principle and technical effects as those of the aforementioned method embodiment. For the sake of brief description, for matters not mentioned in the system embodiment, reference may be made to the corresponding contents in the aforementioned method embodiment.

[0114] Embodiment 3

[0115] The present invention also provides a computer, see Figure 5 , shown is a computer in the third embodiment of the present invention, including a memory 10, a processor 20, and a computer program 30 stored in the memory 10 and executable on the processor 20. When the processor 20 executes the computer program 30, the above-mentioned joint scheduling method of multi-step ship locks is implemented.

[0116] The memory 10 includes at least one type of storage medium, including flash memory, hard disk, multimedia card, card-type memory (e.g., SD or DX memory, etc.), magnetic memory, magnetic disk, optical disk, etc. In some embodiments, the memory 10 may be an internal storage unit of a computer, such as a hard disk of the computer. In other embodiments, the memory 10 may also be an external storage device, such as a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card, etc. Further, the memory 10 may also include both an internal storage unit of the computer and an external storage device. The memory 10 may be used not only to store application software and various types of data installed in the computer, but also to temporarily store data that has been output or is to be output.

[0117] Among them, in some embodiments, the processor 20 can be an electronic control unit (Electronic Control Unit, abbreviated as ECU, also known as a vehicle computer), a central processing unit (Central Processing Unit, CPU), a controller, a microcontroller, a microprocessor or other data processing chip, used to run the program code stored in the memory 10 or process data, such as executing access restriction programs, etc.

[0118] It should be pointed out that Figure 5The structure shown does not constitute a limitation on the computer. In other embodiments, the computer may include fewer or more components than shown in the figure, or combine certain components, or arrange the components differently.

[0119] The embodiment of the present invention further provides a storage medium on which a computer program is stored. When the program is executed by a processor, the combined dispatching method of the multi-step ship lock as described above is implemented.

[0120] Those skilled in the art will appreciate that the logic and / or steps represented in the flowchart or otherwise described herein, for example, may be considered as an ordered list of executable instructions for implementing logical functions, and may be specifically implemented in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute instructions), or in conjunction with such instruction execution systems, devices or apparatuses. For purposes of this specification, "computer-readable medium" may be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution system, device or apparatus, or in conjunction with such instruction execution systems, devices or apparatuses.

[0121] More specific examples of computer-readable media (a non-exhaustive list) include the following: an electrical connection with one or more wires (electronic device), a portable computer disk case (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be a paper or other suitable medium on which the program is printed, since the program may be obtained electronically, for example, by optically scanning the paper or other medium, followed by editing, deciphering or, if necessary, processing in another suitable manner, and then stored in a computer memory.

[0122] It should be understood that the various parts of the present invention can be implemented by hardware, software, firmware or a combination thereof. In the above-mentioned embodiments, multiple steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented by hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or a combination thereof: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0123] The technical features of the above-described embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above-described embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0124] The above-mentioned embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the attached claims.

Claims

1. A joint dispatching method for multi-stage ship locks, characterized in that: include: Obtaining declaration information of a number of ships, and performing real-time analysis on the corresponding ships according to the declaration information to determine whether the ships have arrived at the first lock area of ​​the multi-step ship lock; If each of the ships arrives at the first lock area of ​​the multi-step lock, each of the ships is marked as entering a lock waiting state, and the release volume of all the locks in the multi-step lock is obtained, and it is determined whether the multi-step locks need to be jointly dispatched according to the release volume; If the multi-step ship lock needs to be jointly dispatched, the joint dispatching time difference of the first lock in the multi-step ship lock is calculated according to the number of locks in the multi-step ship lock, wherein the step of calculating the joint dispatching time difference of the first lock in the multi-step ship lock according to the number of locks in the multi-step ship lock comprises: Calculating the release volume of all the locks in the multi-step locks respectively, and calculating the scheduling time interval of the lock with the smallest release volume in the multi-step locks and the corresponding number of released locks; The joint scheduling time difference of the first lock in the multi-step ship lock is calculated according to the scheduling time interval of the lock with the smallest release volume in the multi-step ship lock and the corresponding number of released locks. The calculation formula of the joint scheduling time difference of the first lock in the multi-step ship lock is: ； In the formula, Indicates the scheduling time interval of the lock with the smallest release volume among the multi-stage locks, Indicates the number of locks released by the lock with the smallest release volume among the multi-step locks. Indicates the number of gates released by the first gate; The release scheduling amount of the first lock is calculated according to the joint scheduling time difference of the first lock, and all the locks in the multi-step lock are virtually shifted according to the release scheduling amount of the first lock to achieve the joint scheduling of the multi-step lock.

2. The combined dispatching method of multi-step ship locks according to claim 1, characterized in that: The method further comprises: If the multi-stage ship locks do not require joint scheduling, the basic information of the first lock is obtained, and the scheduling time of each ship in the waiting state is calculated based on the basic information; A scheduling gear shift instruction for each ship in the waiting state is generated according to the scheduling time, so that each ship in the waiting state performs scheduling gear shifting according to the scheduling gear shift instruction.

3. The combined dispatching method of multi-step ship locks according to claim 1, characterized in that: The steps of obtaining the release volume of all the locks in the multi-step locks and judging whether the multi-step locks need to be jointly dispatched according to the release volume include: The number of ships in a single lock, the number of locks released, and the number of locks in a single direction in the first lock of the multi-step ship lock within a time period and the scheduling time difference of the first lock in the multi-step ship lock are obtained, and the release volume of the first lock in the multi-step ship lock is calculated according to the scheduling time difference of the first lock in the multi-step ship lock, the number of ships in a single lock, the number of locks released, and the number of locks in a single direction, wherein the calculation formula of the release volume of the first lock in the multi-step ship lock is: ； In the formula, It indicates the number of ships passing through a single lock in the first lock of a multi-stage lock; Indicates a time period The number of gates released within ; The value range of is 0-24; Represents a time period The number of gates in a single direction; It indicates the scheduling time difference of the first lock in a multi-stage ship lock; The release volumes of the remaining locks in the multi-step ship locks are calculated respectively, and if the release volume of the first lock in the multi-step ship locks and the release volume of the remaining locks in the multi-step ship locks increase successively, it is determined that the multi-step ship locks do not need to be jointly dispatched; If the release volume of the first lock in the multi-step ship lock is greater than the minimum value of the release volume of the remaining locks in the multi-step ship lock, it is determined that the multi-step ship lock needs to be jointly dispatched.

4. A joint dispatching system for multi-step ship locks, characterized in that: include: A real-time analysis module is used to obtain the declared information of several ships, and to perform real-time analysis on the corresponding ships according to the declared information, so as to determine whether each of the ships has arrived at the first lock area of ​​the multi-step ship lock; A state judgment module is used for marking each of the ships as entering a waiting state if the ships arrive at the first lock area of ​​the multi-step lock, and obtaining the release volume of all the locks in the multi-step lock, and judging whether the multi-step locks need to be jointly dispatched according to the release volume; A data calculation module is used for calculating the joint scheduling time difference of the first lock in the multi-step ship lock according to the number of locks in the multi-step ship lock if the multi-step ship lock needs to be jointly scheduled, wherein the data calculation module includes: A data calculation unit, used to calculate the release volume of all the locks in the multi-step locks, and calculate the scheduling time interval of the lock with the smallest release volume in the multi-step locks and the corresponding number of released locks; The time difference calculation unit is used to calculate the joint scheduling time difference of the first lock in the multi-step ship lock according to the scheduling time interval of the lock with the smallest release volume in the multi-step ship lock and the corresponding number of released locks. The calculation formula of the joint scheduling time difference of the first lock in the multi-step ship lock is: ； In the formula, Indicates the scheduling time interval of the lock with the smallest release volume among the multi-stage locks, Indicates the number of locks released by the lock with the smallest release volume among the multi-step locks. Indicates the number of gates released by the first gate; The joint scheduling module is used to calculate the release scheduling amount of the first lock according to the joint scheduling time difference of the first lock, and to virtually shift gears for all the locks in the multi-step locks according to the release scheduling amount of the first lock to achieve the joint scheduling of the multi-step locks.

5. The combined dispatching system of multi-step ship locks according to claim 4 is characterized in that: The system further comprises: A scheduling time calculation module, for obtaining basic information of the first lock if the multi-step ship lock does not require joint scheduling, and calculating the scheduling time of each ship in the waiting state based on the basic information; The scheduling and shifting module is used to generate a scheduling and shifting instruction for each ship in the waiting state according to the scheduling time, so that each ship in the waiting state performs scheduling and shifting according to the scheduling and shifting instruction.

6. A storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, a joint dispatching method for a multi-step ship lock as described in any one of claims 1 to 3 is implemented.

7. A computer comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the joint scheduling method for the multi-step ship locks as described in any one of claims 1 to 3 is implemented.

Images