Multi-step multi-line ship-gate cooperative scheduling method and system, terminal and medium

Abstract

The invention discloses a multi-step multi-line ship-gate cooperative scheduling method and system, a terminal and a medium, and the method comprises the steps: dividing a multi-step multi-line ship-gate cooperative scheduling problem into several standard sub problems through employing an MOEA / D decomposition technology; in each sub-problem, an interactive solving process comprising three modules is designed, namely ship-gate number distribution, gate chamber gear arrangement and gate number scheduling, and a large neighborhood search algorithm, a multiple optimal ship arrangement algorithm and a critical path method are adopted for solving; during the iteration process, the current Pareto front will be maintained by an external non-dominated solution set EP. And finally, outputting the solutions in the non-dominated solution set EP and the corresponding solutions, and carrying out ship-gate cooperative scheduling. According to the method, the multi-step multi-line ship-lock cooperative scheduling problem of a more general ship lock structure can be solved, the lock chamber gear and ship navigational speed optimization are considered at the same time, and a feasible strategy is provided for relieving the passing pressure of an inland waterway.

Description

Technical Field

[0001] The present invention relates to the technical field of ship and ship lock dispatching, and in particular to a multi-step multi-line ship-lock coordinated dispatching method, system, terminal and medium. Background Art

[0002] At present, there are few research methods for the multi-stage multi-line ship-lock coordinated scheduling problem with general characteristics. Most of the existing methods are based on special structure cascade lock structures, such as single-stage lock scheduling, multi-stage lock scheduling after simplifying two-dimensional ship packing constraints, etc.; or special lock scheduling modes, such as discretized lock opening time, etc. For the more general multi-stage multi-line ship-lock coordinated scheduling problem, there is still no effective solution.

[0003] The existing scheduling schemes, including: single-line ship coordinated scheduling (A), single-line ship-lock coordinated scheduling (B), multi-level ship-lock coordinated scheduling considering special lock structures (C), and multi-level multi-line ship-lock coordinated scheduling (D), are not applicable to the more general multi-level ship-lock coordinated scheduling problem. The specific analysis is as follows:

[0004] Technology A takes the process of ships passing through a single lock as the object, and studies the impact of the speed optimization of a single ship on other ships from the perspective of game theory. However, this method is only applicable to a single lock with a single lock chamber, and only one ship can pass through a lock. The lock scheduling is not considered. This method cannot be applied to the optimization of multi-level and multi-line ship-lock coordinated scheduling schemes.

[0005] The B technique established a mixed integer linear programming model based on lock order and time index to solve the ship-lock coordinated scheduling problem where each lock has only one lock chamber and all lock chambers have the same properties (size, operation time), and the efficiency of the model was tested and confirmed on 10 small-scale instances. However, except for simple lock configurations, this method does not take into account the placement of two-dimensional ships, and the method cannot be applied to the situation where each lock may contain multiple parallel lock chambers, that is, it cannot be applied to the optimization of multi-level and multi-line ship-lock coordinated scheduling solutions.

[0006] C technology established a mixed integer nonlinear programming model for the optimization of multi-stage ship lock scheduling schemes, and proposed a heuristic method to solve the problem. However, the model assumes that the ship locks operate continuously and the locks have fixed start times, and does not consider the two-dimensional placement of lock scheduling and ships, which does not conform to the actual scheduling scenario. The modeling process and solution method design process of this scheme both utilize this particularity, so this scheme cannot be applied to the optimization problem of ship-lock collaborative scheduling schemes where locks can be opened freely.

[0007] D technology regards the joint scheduling problem of multi-level and multi-line ship locks as a variant of the flexible job shop scheduling problem based on batch processing, and regards the lock chamber gearing as a two-dimensional packing problem with additional constraints. A mixed integer linear programming model for the optimization of the joint scheduling scheme of multi-level and single-line ship locks is established, and the model is solved using a commercial solver. However, this method cannot solve large-scale problems within a reasonable computing time, and its performance cannot meet the requirements of actual scheduling. Summary of the invention

[0008] The present invention provides a multi-level multi-line ship-lock coordinated scheduling method, system, terminal and medium based on a multi-objective decomposition framework and a large neighborhood search algorithm, so as to overcome the defects of the effective solution to the multi-level multi-line ship-lock coordinated scheduling problem in the background technology and solve the coordinated scheduling problem of ships and locks.

[0009] In a first aspect, a multi-level multi-line ship-lock coordinated scheduling method is provided, comprising the following steps:

[0010] S1: Obtain ship information and lock attribute information;

[0011] S2: Construct an objective function that minimizes the ship's waiting time and total fuel consumption;

[0012] S3: Generate a population of weight vectors {λ 1 ,λ 2 ,…,λ N}, each weight vector λ i Corresponding to a sub-problem; generating an initial solution for each sub-problem, and obtaining an initial solution population X = {X 1 ,X 2 ,…,X N}, each solution in the solution population describes the allocation information of ships and locks; and initializes a reference point and an external non-dominated solution set EP that records the Pareto optimal solutions in the current population;

[0013] S4: Traverse each subproblem in the solution population X, and find the solution X contained in each subproblem p The destruction operator based on the taboo table and the Chebyshev penalty insertion operator are used to search and reconstruct the allocation relationship between ships and locks. A new solution is obtained through destruction and repair operations. Then, the ship-lock allocation scheme in the new solution is tested to see if it meets the lock chamber scheduling constraints. If it meets the constraints, the berthing positions of each ship in each lock chamber in the new solution are recorded. For the feasible new solution X' p , the critical path method based on triangular distribution is used to make decisions on the ship's speed at each stage and the opening time of the lock; the time when the ship leaves the lock system and the speed of the ship at each stage in the lock system are obtained, and then the total stay time of the ship and the total fuel consumption of the ship are calculated;

[0014] S5: Determine the new solution X' obtained for each sub-problem p Whether it is accepted, the accepted new solution will be called the latest solution of the subproblem The latest solution for each subproblem All of them are compared with their neighbor solutions, and the neighbor solutions are updated to obtain a new solution population, and the non-dominated solution set EP and reference point are updated;

[0015] S6: Execute steps S4 to S5 in a loop until the iteration termination condition is met, output the solutions in the non-dominated solution set EP and their corresponding solutions, and use them to perform ship-lock coordinated scheduling.

[0016] Furthermore, in step S2, the ship waiting time objective function f 1 It is expressed as follows:

[0017]

[0018] In the formula, π i represents the weight of ship i, represents the last lock that ship i needs to pass through, represents the time when ship i leaves the lock system; r i represents the time when ship i arrives at the lock system; Represents a collection of ships;

[0019] Ship total fuel consumption objective function f 2 It is expressed as follows:

[0020]

[0021] In the formula, Ω i is the stage set of ship i, 0-1 variable τ ikv Indicates whether ship i is sailing at speed V in the kth stage, α i Indicates the ship fuel consumption coefficient, D ik represents the sailing distance of ship i in the kth stage, V i represents the speed set of ship i.

[0022] Furthermore, in step S3, the solution uses the following structure to describe the ship and lock allocation information:

[0023]

[0024] In the formula, Indicates the number of locks assigned to lock chamber m Ship stage collection.

[0025] Furthermore, in step S4, a multiple sorting optimal ship-dispatch algorithm is used to detect whether the ship-lock order allocation scheme in the obtained new solution satisfies the lock chamber scheduling constraint, specifically including:

[0026] In the process of inserting the removed ship phase using the Chebyshev penalty insertion operator, the solution obtained after inserting the removed ship phase into phase k is checked using the multi-(length, width, area) sorting optimal ship row algorithm Whether the lock chamber gear constraint is met, if so, record The berthing position of each ship in each lock chamber; otherwise The objective function value of will be set to infinity;

[0027] Record the best insertion position and the corresponding Chebyshev penalty for each removed ship phase;

[0028] Sort the Chebyshev penalties of the best insertion positions of all removed ship stages, and then insert the removed ship stages into their best positions one by one according to the deep greedy strategy to obtain a new solution X' i .

[0029] Furthermore, in step S4, a critical path method based on triangular distribution is used to make decisions on the speed of the ship at each stage and the opening time of the lock, specifically including:

[0030] The decision interval of ship speed is processed by triangular distribution, including: dividing the ship speed into several intervals from the lowest speed to the highest speed, assuming that the upper limit of an interval is b and the lower limit is a; according to the weight vector of the current sub-problem p Generate the most likely value This gives the expected speed in this interval for the current subproblem. x is the integration variable, where

[0031] The critical path method is used to determine the ship speed and the lock opening time, including:

[0032] Determine the key locks and key ships, and construct a directed acyclic graph G = (A, V) to represent the current solution X' p , V represents the node represented by the lock, A represents the time sequence relationship between the locks; calculate the earliest start time and the latest end time of each node, among which the node with the difference of the sum of the earliest start time and the lock operation time and the latest end time being 0 is the key lock, and the latest arriving ship in the key lock is the key ship;

[0033] Adjust the speed and calculate the contribution of each key ship to the objective function Among them, f 1 is the ship waiting time objective function, f 2 is the total fuel consumption objective function of the ship, v i represents the current speed of ship i, It indicates the speed of ship i increasing by one gear, and increases the speed range of ships with large contribution values ​​to small ones until the critical route is about to change;

[0034] Perform time relaxation and decelerate non-critical ships whose waiting time is not 0, that is, reduce the speed range until all non-critical ships in the current lock reach the minimum speed or will affect the lock opening time;

[0035] The start time of each lock is calculated according to the final speed, and then the objective function value is calculated.

[0036] Further, in step S5, the new solution X' obtained by each sub-problem is determined. p Whether it is accepted, including:

[0037] Prioritize the solution of the current sub-problem that corresponds to the goal with a larger weight If f m (X' p ) <f m (X p ), the new solution will be accepted, f 1 and f 2 They represent the objective function of ship waiting time and the objective function of ship total fuel consumption respectively;

[0038] If f m (X' p )>f m (X p ), X' p Will be The probability of being accepted is is a predefined coefficient that controls the probability of accepting a new solution that is worse than the current solution. The accepted new solution will be called the current state-of-the-art solution to the subproblem.

[0039] Further, in step S5, the latest solution of each sub-problem Each solution is compared with its neighbor solutions and updated, including:

[0040] The latest solution to each sub-problem Solve X with its neighbors j ,j∈T, and calculate the neighbor solution and Chebyshev value of and if but Where T is the neighbor solution set of the current subproblem solution, and it is determined by calculating the Euclidean distance between the weight vectors of each subproblem.

[0041] In the second aspect, a multi-level multi-line ship-lock coordinated dispatching system is provided, comprising:

[0042] A data acquisition module is used to obtain ship information and lock attribute information;

[0043] An objective function building module, used to build an objective function that minimizes the ship's waiting time and the ship's total fuel consumption;

[0044] Initialization module, used to generate the weight vector population {λ 1 ,λ 2 ,…,λ N}, each weight vector λ i Corresponding to a sub-problem; generating an initial solution for each sub-problem, and obtaining an initial solution population X = {X 1 ,X 2 ,…,X N}, each solution in the solution population describes the allocation information of ships and locks; and initializes a reference point and an external non-dominated solution set EP that records the Pareto optimal solutions in the current population;

[0045] The loop iteration module is used to traverse each sub-problem in the solution population X, and for each sub-problem contained in the solution X p The destruction operator based on the taboo table and the Chebyshev penalty insertion operator are used to search and reconstruct the allocation relationship between ships and locks. A new solution is obtained through destruction and repair operations. Then, the ship-lock allocation scheme in the new solution is tested to see if it meets the lock chamber scheduling constraints. If it meets the constraints, the berthing positions of each ship in each lock chamber in the new solution are recorded. For the feasible new solution X' p , the critical path method based on triangular distribution is used to make decisions on the ship's speed at each stage and the opening time of the lock; the time when the ship leaves the lock system and the speed of the ship at each stage in the lock system are obtained, and then the total stay time and total fuel consumption of the ship are calculated; the new solution X' obtained by judging each sub-problem p Whether it is accepted, the accepted new solution will be called the latest solution of the subproblem The latest solution to each subproblem All of them are compared with their neighbor solutions, and the neighbor solutions are updated to obtain a new solution population, and the non-dominated solution set EP and the reference point are updated; the aforementioned iterative process is executed repeatedly until the iteration termination condition is met, and the solutions in the non-dominated solution set EP and their corresponding solutions are output;

[0046] The scheduling module is used to perform ship-lock coordinated scheduling according to the solutions in the non-dominated solution set EP and their corresponding solutions.

[0047] In a third aspect, an electronic terminal is provided, comprising:

[0048] one or more memories having computer programs or instructions stored thereon;

[0049] One or more processors are used to load and execute the computer program or instructions to implement the multi-level multi-line ship-lock coordinated scheduling method as described above.

[0050] In a fourth aspect, a computer-readable storage medium is provided, on which a computer program or instruction is stored, and when the computer program or instruction is called by a computer, the multi-level multi-line ship-lock coordinated scheduling method as described above is implemented.

[0051] The present invention proposes a multi-level multi-line ship-lock coordinated dispatching method, system, terminal and medium, which has the following beneficial effects:

[0052] In the multi-stage multi-line ship-lock coordinated scheduling (SLCP) problem, due to the interdependence between ship navigation and locks, optimizing them as an integrated system can maximize the overall operational efficiency and economic benefits of water transportation under the growing demand. The present invention designs a multi-objective heuristic algorithm, which can effectively solve large-scale SLCP instances and output a set of multi-objective Pareto front solutions within a reasonable time, thereby improving the diversity of solutions. Compared with the prior art, the present invention can solve the multi-stage multi-line ship-lock coordinated scheduling problem of a more general lock structure, while considering the optimization of lock chamber gears and ship speeds, providing a feasible strategy for alleviating the traffic pressure of inland waterways, serving the sustainable development of inland shipping, and providing theoretical and methodological support for the decision-making of lock operation scheduling. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0054] Figure 1 is a schematic diagram of coordinated scheduling of cascade ship-locks containing n ship locks provided by an embodiment of the present invention;

[0055] Figure 2 is a schematic diagram of lock chamber gear shifting constraint provided by an embodiment of the present invention;

[0056] Figure 3 Schematic diagram of a multi-objective large neighborhood search algorithm (MOLNS) provided in an embodiment of the present invention;

[0057] Figure 4 It is a schematic diagram of the processing sequence relationship between different gates provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0058] To make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be described in detail below. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other implementation methods obtained by ordinary technicians in this field without creative work belong to the scope of protection of the present invention.

[0059] like Figure 1 As shown, the multi-step multi-line ship-lock structure provided in the implementation of the present invention includes multiple ship locks and a river channel, multiple ship locks are arranged on the river channel, and are arranged in sequence in the upstream and downstream directions of the river channel, and the ship locks include multiple lock chambers, multiple lock chambers are arranged in parallel in the river channel, and multiple lock chambers are independent structures. Wherein, the river channel includes tributaries, and the tributaries are arranged between adjacent ship locks and connected to the river channel. Wherein, multiple lock chambers are lock chambers of different types. There are two-way navigation ship flows with different temporal and spatial distributions on the waterway, and the ships have different routes, that is, they can enter or leave the cascade ship lock system through the main stream or tributaries. The declared information of the ship includes length, width, draft depth, tonnage, speed range, distance from the first ship lock it needs to pass through, etc. The lock operator formulates a ship-lock coordinated scheduling plan based on the lock attribute parameters and ship declaration information. It needs to decide the lock information (which ships to serve), lock chamber gear (the two-dimensional spatial layout of the ship in the lock chamber), lock start time and recommended speed for each section of the ship for each lock, and feed back the recommended speed to the ship.

[0060] For the convenience of subsequent description, the symbols used below are explained as follows:

[0061] Lock collection;

[0062] Ship assembly;

[0063] the collection of locks that the ship needs to pass through;

[0064] Ω: the stage set of all ships;

[0065] Ω(q): a subset of Ω, representing the set of ship stages assigned to lock q;

[0066] Ω m (q): a subset of Ω, representing the set of ship stages that are scheduled to lock chamber m at lock time q;

[0067] π i : The weight of ship i;

[0068] r i : The time when ship i arrives at the lock system;

[0069] D ik : The sailing distance of ship i in the kth stage;

[0070] α i : Fuel consumption coefficient of ship i.

[0071] The present invention designs a multi-objective large neighborhood search algorithm (MOLNS) for the multi-level multi-line ship-lock collaborative scheduling problem (SLCP). The algorithm applies the MOEA / D decomposition technology to divide the SLCP into several scalar subproblems. The subproblems are related to each other through the Euclidean distance of the weight vector. The nearest subproblems of each subproblem are called its neighbors. In each subproblem, the present invention designs an interactive solution process including three modules: ship-lock allocation, lock chamber scheduling and lock scheduling, which are solved by large neighborhood search (LNS), multiple optimal ship scheduling (MOBF) and critical path method (CPM) respectively. In the iterative process, the current Pareto front will be maintained by an external group (called external Pareto front (EP)).

[0072] (1) Ship-lock allocation: The ship allocation problem is the main problem of SLCP, which determines which lock a ship passes through during its voyage. In the present invention, SLCP is regarded as a variant of the batch-based flexible workshop scheduling problem, that is, the ship that needs to pass through a series of locks is mapped to the situation where a series of operations need to be processed for the job. The ship is considered as a "job", the lock corresponds to the "batch" in the flexible job workshop scheduling, and each "machine" (lock chamber) may have different structures and sizes. In order to realize this idea, the present invention adopts the following solution structure to describe the allocation information of ships and locks:

[0073]

[0074] In the formula, each Contains the ship stage that needs to be served by a lock, m represents the lock chamber, Represents the number of locks assigned to the lock chamber. The present invention uses a large-scale neighborhood search operator to implement this process to quickly search for a better solution.

[0075] (2) Lock chamber arrangement: Different from the traditional two-dimensional packing problem, the placement of ships in the lock chamber needs to consider not only the width of the ship, but also the length and area of ​​the ship and whether the mooring constraints between ships are met. The new solution obtained by MOLNS after removing and inserting the solution structure may violate the placement constraints of the ship. Therefore, the present invention uses the multiple sorting best ship arrangement algorithm (MOBF) to perform constraint detection on the new solution, and the solution that does not meet the constraint will not be accepted.

[0076] (3) Lock scheduling: The present invention introduces the concept of engineering project management and regards the fuel of the ship as a resource required for workpiece processing. The lock scheduling sub-problem is regarded as a resource scheduling problem whose goal is to use as few resources as possible to achieve the shortest possible construction period. The critical path method (CPM) is introduced to determine the key stage, and the triangular distribution is introduced to adjust the speed.

[0077] The following is a detailed description of a multi-level multi-line ship-lock coordinated dispatching method provided by an embodiment of the present invention. Figure 3 As shown, the following steps are included:

[0078] S1: Obtaining ship information and lock attribute information. The ship information includes ship size, ship lock route, ship arrival time at the cascade lock system, speed range, etc. The lock attribute information includes lock size, one-time service operation time, reversal time, etc.

[0079] S2: Construct the objective function that minimizes the ship waiting time and the total fuel consumption of the ship.

[0080] S21: Minimize ship waiting time. Minimizing ship waiting time is usually the most important goal for navigation dispatch departments and ship owners, especially when the lock capacity is limited. This goal can be described by the retention time of the ship in the entire cascade lock system, that is, the time difference between the ship arriving at the starting lock and leaving the destination lock. The ship waiting time objective function f 1 It is expressed as follows:

[0081]

[0082] In the formula, π i represents the weight of ship i, which represents the importance of ship i; represents the last lock that ship i needs to pass through, represents the time when ship i leaves the lock system; r i represents the time when ship i arrives at the lock system; Represents a collection of ships.

[0083] S22: Minimize the total fuel consumption in the lock. This is a goal that takes into account the green economy. The carbon emissions of a ship's navigation are directly proportional to the fuel consumption of the ship during navigation. Reducing carbon emissions actually requires reducing the fuel consumption of the ship. The fuel consumption of a ship is affected by multiple external factors, among which the ship's speed and load are important factors, and it has highly nonlinear characteristics. The fuel consumption of a ship per unit time is proportional to the cube of the ship's speed. Assume that the time required for a ship to travel a distance D at a constant speed v is D / v. Therefore, for a ship i with a travel distance D and a speed v, its total fuel consumption can be expressed as α i Dv 2 , where αi is the ship fuel consumption coefficient. Therefore, the ship's total fuel consumption objective function f 2 It is expressed as follows:

[0084]

[0085] In the formula, Ω i is the stage set of ship i. The introduction of speed will produce nonlinear constraints. Therefore, a 0-1 variable τ is introduced. ikv To discretize and linearize the objective function, τ ikv Indicates whether ship i is sailing at speed v in the kth stage, D ik represents the sailing distance of ship i in the kth stage, V i represents the speed set of ship i,

[0086] S3: The Chebyshev decomposition strategy is used to divide the multi-objective optimization problem into several vector sub-problems, generating a series of uniformly distributed weight vectors to form a weight vector population {λ 1 ,λ 2 ,…,λ N}, each weight vector Corresponding to a subproblem. For each weight vector, the Euclidean distance between weight vectors is calculated, and the solution represented by the nearest weight vector is regarded as the neighbor solution (T).

[0087] Generate an initial solution for each subproblem and obtain the initial solution population X = {X 1 ,X 2 ,…,X N}. Specifically, for each initialization solution (individual), it is obtained by the following method: divide the ship into several ship stages according to the ship passage route obtained in S1, and assign a separate lock number to each ship stage; assign each lock number to a feasible lock chamber, calculate and balance the number of lock times assigned to each lock chamber during the allocation process, and use the capacity ratio allocation method to allocate the lock times of each lock to each lock chamber, and then obtain the initialization solution. Among them, using the capacity ratio allocation method to allocate the lock times of each lock to each lock chamber specifically includes: for n lock chambers in a certain lock, calculate the capacity (or area) Sn of each lock chamber and the capacity ratio Sn / sum(Sn) of each lock chamber; when allocating lock times, use a roulette wheel method to allocate with the capacity ratio as the probability.

[0088] At initialization, let the optimal solution of each subproblem be And calculate the corresponding objective function Initialization reference point In addition, an external non-dominated solution set EP is initialized to record the Pareto optimal solutions in the current population.

[0089] S4: Traverse each subproblem in the solution population X, and find the solution X contained in each subproblem p The destruction operator based on the taboo table and the Chebyshev penalty insertion operator are used to search and reconstruct the allocation relationship between ships and locks. A new solution is obtained through destruction and repair operations. Then, the multiple sorting best ship arrangement algorithm (MOBF) is used to detect whether the ship-lock allocation scheme in the new solution satisfies the lock chamber scheduling constraints. If the constraints are satisfied, the berthing positions of each ship in each lock chamber in the new solution are recorded. The objective function value of the solution that violates the constraints will be set to infinity. For the feasible new solution X' p The critical path method (CPM) based on triangular distribution is used to make decisions on the ship's speed at each stage and the opening time of the locks; the time when the ship leaves the lock system and the speed of the ship at each stage in the lock system are obtained, and then the total stay time of the ship and the total fuel consumption of the ship are calculated.

[0090] More specifically, step S4 includes the following steps:

[0091] S41, traverse the solution population X, start the inner iteration. The solution X of the current sub-problem i , generate a random number ρ as the number of ship stages that need to be removed.

[0092] S42, using the random destruction operator based on the taboo table to remove ρ X p The ship phase that does not exist in the taboo table is temporarily solved. When a ship phase is removed, it is recorded in the taboo table and will not be removed in the next phase during the artificially set taboo period.

[0093] S43, insert the removed ship stage using the Chebyshev penalty insertion operator. Insert the removed ship stage into the best possible position. The possible position can be an existing lock in the same direction as the inserted ship stage, or a newly generated lock. Use the multiple sorting best ship placement algorithm (MOBF) to check the solution obtained after the removed ship stage is inserted into stage k. Whether the lock chamber gear constraint is met, the lock chamber gear constraint diagram is as follows Figure 2 As shown, if the constraints are met, record The berthing position of each ship in each lock chamber is obtained, and a new solution is obtained. p ;otherwise The objective function value of will be set to infinity; if If there are ships that cannot fit into the lock chamber, The lock chamber gear constraint is not met; the best insertion position and Chebyshev penalty are recorded for each removal stage represents the set of stages to be removed, χ m Represents the minimum value of the current mth target. ; Sort the Chebyshev penalty of the best insertion position of all stages and then insert the removal stage into its best position in turn according to the deep greedy strategy to obtain the new solution X' p .

[0094] S44, using triangular distribution to process the decision interval of ship speed. Specifically, the ship speed is divided into several intervals from the lowest speed to the highest speed, assuming that the upper limit of an interval is b and the lower limit is a; according to the weight vector of the current sub-problem p Generate the most likely value This can give the expected speed in this interval for the current subproblem. x is the integration variable, where

[0095] S45. Use the critical path method to determine the ship speed and lock opening time. First, determine the key locks and key ships, such as Figure 4 As shown, construct a directed acyclic graph G = (A, V) to represent the current solution X' p , V represents the node represented by the gate, A represents the time sequence relationship between the gates; secondly, calculate the earliest start and latest end time of each node, among which the node with the difference of the sum of the earliest start time and the gate operation time and the latest end time is 0 is the key gate, and the latest arriving ship in the key gate is the key ship. Make speed adjustment and calculate the contribution value of each key ship to the objective function where v i represents the current speed of ship i, Indicates the speed of ship i increasing by one gear, and increases the speed range for ships with contribution values ​​from large to small. It stops when all ships with positive contribution values ​​reach the maximum speed, or when the critical route changes due to the speed increase. Perform time relaxation and decelerate non-critical ships with waiting time not 0, that is, reduce the speed range until all non-critical ships in the current lock reach the minimum speed or will affect the lock opening time. The start time of each lock is calculated according to the final speed, and then the objective function value f(X' p ).

[0096] S5: Determine the new solution X' obtained for each sub-problem p Whether it is accepted, the accepted new solution will be called the latest solution of the subproblem The latest solution to each subproblem They are all compared with their neighbor solutions, the neighbor solutions are updated, a new solution population is obtained, and the non-dominated solution set EP and the reference point χ are updated.

[0097] More specifically, step S5 includes the following steps:

[0098] S51: Use simulated annealing to consider whether the sub-problem accepts the new solution X' p Prioritize the solution of the current sub-problem that corresponds to the goal with a larger weight. If f m (X' p ) <f m (X p ), the new solution will be accepted; if f m (X' p )>f m (X p ), X' p Will be The probability of being accepted is is a predefined coefficient that controls the probability of accepting a new solution that is worse than the current solution. The accepted new solution will be called the current state-of-the-art solution to the subproblem.

[0099] S52: After completing the inner iteration, the latest solution of each sub-problem All are solved with their neighbors j ,j∈T to compare and calculate the neighbor solution X j and The Chebyshev value g te (X j )and if but Where T is the neighbor solution set of the current subproblem solution, and is determined by calculating the Euclidean distance between the weight vectors of each subproblem. The Chebyshev value is calculated by the following formula: χ m Indicates the minimum value of the current m-th target.

[0100] S53: Update the non-dominated solution set EP and the reference point χ.

[0101] S6: Execute steps S4 to S5 in a loop until the iteration termination condition is met, output the solutions in the non-dominated solution set EP and their corresponding solutions, and use them to perform ship-lock coordinated scheduling.

[0102] It should be noted that a set of multi-objective Pareto frontiers are finally output, and the optimal solution and optimal scheduling scheme with corresponding weights are selected according to the decision maker's current preference (preference for minimizing ship waiting time and minimizing total ship fuel consumption) to carry out ship-lock coordinated scheduling.

[0103] The multi-step multi-line ship-lock coordinated scheduling method provided in the above embodiment has the following beneficial effects: in the multi-step multi-line ship-lock coordinated scheduling (SLCP) problem, due to the interdependence between ship navigation and locks, optimizing them as an integrated system can maximize the overall operational efficiency and economic benefits of water transportation under the growing demand. The present invention designs a multi-objective heuristic algorithm, which can effectively solve large-scale SLCP instances and output a set of multi-objective Pareto front solutions within a reasonable time, thereby improving the diversity of solutions. Compared with the prior art, the present invention can solve the multi-step multi-line ship-lock coordinated scheduling problem of a more general lock structure, while considering the optimization of lock chamber gears and ship speed, providing a feasible strategy for alleviating the traffic pressure of inland waterways, serving the sustainable development of inland shipping, and providing theoretical and methodological support for the decision-making of lock operation scheduling.

[0104] The embodiment of the present invention further provides a multi-level multi-line ship-lock coordinated dispatching system, comprising:

[0105] A data acquisition module is used to obtain ship information and lock attribute information;

[0106] An objective function building module, used to build an objective function that minimizes the ship's waiting time and the ship's total fuel consumption;

[0107] Initialization module, used to generate the weight vector population {λ 1 ,λ 2 ,…,λ N}, each weight vector λ i Corresponding to a sub-problem; generating an initial solution for each sub-problem, and obtaining an initial solution population X = {X 1 ,X 2 ,…,X N}, each solution in the solution population describes the allocation information of ships and locks; and initializes a reference point and an external non-dominated solution set EP that records the Pareto optimal solutions in the current population;

[0108] The loop iteration module is used to traverse each sub-problem in the solution population X, and for each sub-problem contained in the solution X p The destruction operator based on the taboo table and the Chebyshev penalty insertion operator are used to search and reconstruct the allocation relationship between ships and locks. A new solution is obtained through destruction and repair operations. Then, the ship-lock allocation scheme in the new solution is tested to see if it meets the lock chamber scheduling constraints. If it meets the constraints, the berthing positions of each ship in each lock chamber in the new solution are recorded. For the feasible new solution X' p, the critical path method based on triangular distribution is used to make decisions on the ship's speed at each stage and the opening time of the lock; the time when the ship leaves the lock system and the speed of the ship at each stage in the lock system are obtained, and then the total stay time and total fuel consumption of the ship are calculated; the new solution X' obtained by judging each sub-problem p Whether it is accepted, the accepted new solution will be called the latest solution of the subproblem The latest solution to each subproblem All of them are compared with their neighbor solutions, and the neighbor solutions are updated to obtain a new solution population, and the non-dominated solution set EP and the reference point are updated; the aforementioned iterative process is executed repeatedly until the iteration termination condition is met, and the solutions in the non-dominated solution set EP and their corresponding solutions are output;

[0109] The scheduling module is used to perform ship-lock coordinated scheduling according to the solutions in the non-dominated solution set EP and their corresponding solutions.

[0110] It should be understood that the functional unit modules in various embodiments of the present invention may be concentrated in one processing unit, or each unit module may exist physically separately, or two or more unit modules may be integrated in one unit module, and may be implemented in the form of hardware or software.

[0111] An embodiment of the present invention further provides an electronic terminal, including:

[0112] one or more memories having computer programs or instructions stored thereon;

[0113] One or more processors are used to load and execute the computer program or instructions to implement the multi-level multi-line ship-lock coordinated scheduling method as described above.

[0114] An embodiment of the present invention further provides a computer-readable storage medium having a computer program or instruction stored thereon, which, when called by a computer, implements the multi-level multi-line ship-lock coordinated scheduling method as described above.

[0115] It can be understood that the same or similar parts of the above embodiments can be referenced to each other, and the contents not described in detail in some embodiments can refer to the same or similar contents in other embodiments.

[0116] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0117] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0118] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0119] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0120] Although the embodiments of the present invention have been shown and described above, it is to be understood that the above embodiments are exemplary and are not to be construed as limitations of the present invention. A person skilled in the art may change, modify, replace and vary the above embodiments within the scope of the present invention.

Claims

1. A multi-level multi-line ship-lock coordinated dispatching method, characterized in that: The steps include: S1: Obtain ship information and lock attribute information; S2: Construct an objective function that minimizes the ship's waiting time and total fuel consumption; S3: Generate a population of weight vectors {λ 1 ,λ 2 , ..., λ N }, each weight vector λ i Corresponding to a sub-problem; generating an initial solution for each sub-problem, and obtaining an initial solution population X = {X1, X2, ..., X N }, each solution in the solution population describes the allocation information of ships and locks; and initializes a reference point and an external non-dominated solution set EP that records the Pareto optimal solutions in the current population; S4: Traverse each subproblem in the solution population X, and find the solution X contained in each subproblem p The destruction operator based on the taboo table and the Chebyshev penalty insertion operator are used to search and reconstruct the allocation relationship between ships and locks. A new solution is obtained through destruction and repair operations. Then, the ship-lock allocation scheme in the new solution is tested to see if it meets the lock chamber scheduling constraints. If it meets the constraints, the berthing positions of each ship in each lock chamber in the new solution are recorded. For the feasible new solution X′ p , the critical path method based on triangular distribution is used to make decisions on the ship's speed at each stage and the opening time of the lock; the time when the ship leaves the lock system and the speed of the ship at each stage in the lock system are obtained, and then the total stay time of the ship and the total fuel consumption of the ship are calculated; S5: Determine the new solution X′ obtained for each sub-problem p Whether it is accepted, the accepted new solution will be called the latest solution of the subproblem The latest solution for each subproblem All of them are compared with their neighbor solutions, and the neighbor solutions are updated to obtain a new solution population, and the non-dominated solution set EP and reference point are updated; S6: Execute steps S4 to S5 in a loop until the iteration termination condition is met, output the solutions in the non-dominated solution set EP and their corresponding solutions, and use them to perform ship-lock coordinated scheduling.

2. The multi-level multi-line ship-lock coordinated dispatching method according to claim 1 is characterized in that: In step S2, the ship waiting time objective function f1 is expressed as follows: In the formula, π i represents the weight of ship i, represents the last lock that ship i needs to pass through, represents the time when ship i leaves the lock system; r i represents the time when ship i arrives at the lock system; Represents a collection of ships; The ship's total fuel consumption objective function f2 is expressed as follows: In the formula, Ω i is the stage set of ship i, 0-1 variable τ ikv Indicates whether ship i is sailing at speed v in the kth stage, α i Indicates the ship fuel consumption coefficient, D ik represents the sailing distance of ship i in the kth stage, V i represents the speed set of ship i.

3. The multi-level multi-line ship-lock coordinated dispatching method according to claim 1 is characterized in that: In step S3, the solution uses the following structure to describe the ship and lock allocation information: In the formula, Indicates the number of locks assigned to lock chamber m Ship stage collection.

4. The multi-level multi-line ship-lock coordinated dispatching method according to claim 1 is characterized in that: In step S4, a multiple sorting optimal ship-dispatch algorithm is used to detect whether the ship-lock order allocation scheme in the new solution satisfies the lock chamber scheduling constraints, which specifically includes: In the process of inserting the removed ship phases using the Chebyshev penalty insertion operator, each time a ship phase is inserted, the multi-sort optimal ship row algorithm is used to check the solution obtained after the removed ship phase is inserted into phase k. Whether the lock chamber gear constraint is met, if so, record The berthing position of each ship in each lock chamber; otherwise The objective function value of will be set to infinity; Record the best insertion position and the corresponding Chebyshev penalty for each removed ship phase; Sort the Chebyshev penalties of the best insertion positions of all removed ship phases, and then insert the removed ship phases into their best positions one by one according to the deep greedy strategy to obtain a new solution X′ i .

5. The multi-level multi-line ship-lock coordinated dispatching method according to claim 1 is characterized in that: In step S4, the critical path method based on triangular distribution is used to make decisions on the speed of the ship at each stage and the opening time of the lock, which specifically includes: The decision interval of ship speed is processed by triangular distribution, including: dividing the ship speed into several intervals from the lowest speed to the highest speed, assuming that the upper limit of an interval is b and the lower limit is a; according to the weight vector of the current sub-problem p Generate the most likely value Thus, the expected speed E(X) in this interval under the current sub-problem is obtained; The critical path method is used to determine the ship speed and the lock opening time, including: Determine the key locks and key ships, and construct a directed acyclic graph G = (A, V) to represent the current solution X' p , V represents the node represented by the lock, A represents the time sequence relationship between the locks; calculate the earliest start time and the latest end time of each node, among which the node with the difference of the sum of the earliest start time and the lock operation time and the latest end time being 0 is the key lock, and the latest arriving ship in the key lock is the key ship; Adjust the speed and calculate the contribution of each key ship to the objective function Among them, f1 is the ship waiting time objective function, f2 is the ship total fuel consumption objective function, v i represents the current speed of ship i, It indicates the speed of ship i increasing by one gear, and increases the speed range of ships with large contribution values ​​to small ones until the critical route is about to change; Perform time relaxation and decelerate non-critical ships whose waiting time is not 0, that is, reduce the speed range until all non-critical ships in the current lock reach the minimum speed or will affect the lock opening time; The start time of each lock is calculated according to the final speed, and then the objective function value is calculated.

6. The multi-level multi-line ship-lock coordinated dispatching method according to claim 1 is characterized in that: In step S5, determine the new solution X′ obtained for each sub-problem p Whether it is accepted, including: Prioritize the solution of the current sub-problem that corresponds to the goal with a larger weight If f m (X′ p ) <f m (X p ), the new solution will be accepted, f1 and f2 represent the objective function of ship waiting time and the objective function of ship total fuel consumption respectively; If f m (X′ p )>f m (X p ), X′ p Will be The probability of being accepted is is a predefined coefficient that controls the probability of accepting a new solution that is worse than the current solution. The accepted new solution will be called the current state-of-the-art solution to the subproblem.

7. The multi-level multi-line ship-lock coordinated dispatching method according to claim 1 is characterized in that: In step S5, the latest solution of each sub-problem Each solution is compared with its neighbor solutions and updated, including: The latest solution to each sub-problem Solve X with its neighbors j , j∈T, and calculate the neighbor solution and The Chebyshev value g te (X j )and if but Where T is the neighbor solution set of the current subproblem solution, and it is determined by calculating the Euclidean distance between the weight vectors of each subproblem.

8. A multi-level multi-line ship-lock coordinated dispatching system, characterized in that: include: A data acquisition module is used to obtain ship information and lock attribute information; An objective function building module, used to build an objective function that minimizes the ship's waiting time and the ship's total fuel consumption; Initialization module, used to generate the weight vector population {λ 1 ,λ 2 , ..., λ N }, each weight vector λ i Corresponding to a sub-problem; generating an initial solution for each sub-problem, and obtaining an initial solution population X = {X1, X2, ..., X N }, each solution in the solution population describes the allocation information of ships and locks; and initializes a reference point and an external non-dominated solution set EP that records the Pareto optimal solutions in the current population; The loop iteration module is used to traverse each sub-problem in the solution population X, and for each sub-problem contained in the solution X p The destruction operator based on the taboo table and the Chebyshev penalty insertion operator are used to search and reconstruct the allocation relationship between ships and locks. A new solution is obtained through destruction and repair operations. Then, the ship-lock allocation scheme in the new solution is tested to see if it meets the lock chamber scheduling constraints. If it meets the constraints, the berthing positions of each ship in each lock chamber in the new solution are recorded. For the feasible new solution X' p , the critical path method based on triangular distribution is used to make decisions on the ship's speed and the opening time of the locks at each stage; Get the time when the ship leaves the lock system and the speed of the ship at each stage in the lock system, and then calculate the total stay time and total fuel consumption of the ship; determine the new solution X' obtained for each sub-problem p Whether it is accepted, the accepted new solution will be called the latest solution of the subproblem The latest solution for each subproblem All of them are compared with their neighbor solutions, and the neighbor solutions are updated to obtain a new solution population, and the non-dominated solution set EP and the reference point are updated; the aforementioned iterative process is executed repeatedly until the iteration termination condition is met, and the solutions in the non-dominated solution set EP and their corresponding solutions are output; The scheduling module is used to perform ship-lock coordinated scheduling according to the solutions in the non-dominated solution set EP and their corresponding solutions.

9. An electronic terminal, characterized in that: include: one or more memories having computer programs or instructions stored thereon; One or more processors are used to load and execute the computer program or instructions to implement the multi-level multi-line ship-lock coordinated scheduling method as described in any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program or instruction stored thereon, characterized in that: When the computer program or instruction is called by a computer, the multi-level multi-line ship-lock coordinated scheduling method as described in any one of claims 1 to 7 is implemented.

Images