CN112249583B - Intelligent selection method and system for bulk cargo wharf stock yard stacking position - Google Patents

Abstract

The invention discloses an intelligent selection method and system for bulk cargo wharf stock yard stacking positions, wherein the method comprises the following steps: acquiring stack selection data and preprocessing the stack selection data; constructing a stack position selection evaluation function according to the preprocessed stack selection data, and solving to obtain a stack selection result; constructing a stack order evaluation function according to the stack selection result, and solving to obtain a stack order; and selecting the stacking positions according to the stacking sequence. The system comprises: a user module; a calculation module; a stack position selection module; and a data statistics module. The method has the advantages that the stacking position selection and stacking sequence are automatically calculated, the calculation result is accumulated according to manual experience and data deposition, and planning personnel in charge of selecting the stacking position do not need years of work experience and professional ability, so that the enterprise cost is effectively reduced.

Description

A method and system for intelligent selection of stacking position in bulk cargo terminal

technical field

The invention relates to the field of port stacking position selection, in particular to an intelligent selection method and system for stacking positions of bulk cargo terminals.

Background technique

As we all know, choosing different yards for different cargoes on the yard of the terminal has different benefits for the enterprise. For the container terminal, due to the regularity of the containers, many excellent algorithms have been formed to select the stacking position. For the bulk cargo terminal, due to the irregularity of the bulk cargo and the irregular size of the bulk cargo, the algorithm in the container cannot be well optimized in the bulk cargo terminal. In the process of stacking position selection in port terminals, the current stage is mainly based on manual judgment and selection, and the optimal result cannot be selected.

For the selection of stacking positions in bulk cargo terminals, the current main method is to select the stacking positions manually based on manual experience. This method of stacking selection is related to the difference of human experience, and it cannot guarantee that a better selection will be made every time. the stacking position. There is also no specific evaluation criteria for stacking results.

Therefore, it is necessary to propose an intelligent selection algorithm and corresponding evaluation system for the stacking position of the bulk cargo terminal. Based on this evaluation system, we can optimize the manual selection of stacking position, thereby reducing the cost of the enterprise and increasing the profit of the enterprise.

SUMMARY OF THE INVENTION

In view of the above-mentioned deficiencies at present, the present invention provides a method and system for intelligent selection of stacking positions of bulk cargo terminals, which can automatically calculate a scientific and reasonable plan, improve the business level of the port dispatching department, and make the port in the direction of intelligence develop.

To achieve the above object, the embodiments of the present invention adopt the following technical solutions:

A method for intelligently selecting stacking positions in bulk cargo terminals, comprising the following steps:

Obtain pallet selection data and preprocess;

According to the preprocessed stacking selection data, construct stacking position selection evaluation function to solve and obtain stacking selection results;

According to the stacking selection results, the stacking sequence evaluation function is constructed to solve and obtain the stacking sequence;

The stacking position is selected according to the stacking sequence.

According to one aspect of the present invention, the pallet selection data includes vessel information, vessel cargo information, dock information and weather information.

According to an aspect of the present invention, the preprocessing of the stack selection data is specifically as follows: defining parameter values according to the stack selection data; Evaluate the matching score between the goods and the stacking position.

According to one aspect of the present invention, the wharf includes a BDQ, and the BDQ refers to a conveyor belt from the berth where the ship is docked to the warehouse yard, and each BDQ can only be used by one ship at the same time.

According to one aspect of the present invention, the stack selection evaluation function is:

The parameters include: whether the i-th ship selects the j-th stack position a _ij ∈ {0, 1}, the value is 1 when it is selected, and the value is 0 when it is not selected;

The cargo volume z _kl ≥ 0 allocated by the kth ship on the 1st lane;

The amount of goods that can be used in the s-th stacking position yard _s ;

the number of ships n;

The matching score Score _ij of the i-th ship at the j-th stacking position;

SizeNeed _i of the cargo required by the i-th vessel;

The number of stacking positions m;

The number r of BDQ;

At the same time, the stacking conditions that need to be met are:

The meaning is: the number of stacks is q, condition 1 is that each stack is allocated to only one ship; condition 2 is that the number of stacks that can be allocated to each ship cannot exceed w; condition 3 is that each ship is allocated The amount of cargo contained in the stack should be greater than or equal to the required amount of cargo; Condition 4 is the allocation of the first BDQ of the i-th ship, and penalty points will be imposed if it exceeds the given recommended cargo amount; Condition 5 is the i-th ship. The use time of the sth BDQ of the ship should be less than or equal to the available time.

According to one aspect of the present invention, the method of combining the branch definition method and the cutting plane method is used to solve the stacking position selection evaluation function, and all the values of a _ij that make the stacking position selection evaluation function the highest score and satisfy the stacking position condition are solved, that is, Specific vessel selection results.

According to one aspect of the present invention, the stacking sequence evaluation function is:

y _ij ≥M*y _i1 j=13,...,18

The parameters include: the recommended cargo volume BDQccupy _ij given by the jth BDQ of the i-th ship under the condition of the average residual mass;

The available time BDQtime _ij of the jth BDQ of the i-th ship;

The arrival time T _istart of the i-th ship;

departure time T _istart of the i-th ship;

The cargo quantity m _i of the i-th ship;

Stacking sequence notation:

The 0-1 parameter y _ij ∈ {0, 1} of the i-th ship, 1≤j≤12;

The continuous variable y _ij of the i-th ship, 13≤j≤18;

The initial variable y _ij of the i-th ship, 19≤j≤24, means that the i-th ship assumes that there are 3 BDQs available and cannot be used at the same time. The working time of BDQ1 is [y _i19 , y _i20 ] , the working time of BDQ2 is [y _i21 , y _i22 ], and the working time of BDQ3 is [y _i23 , y _i24 ].

According to one aspect of the present invention, after the stacking selection result is obtained, the position of the corresponding stacking position of each ship is obtained, and the stacking sequence evaluation function is solved by traversing all stacking operation sequences to obtain the optimal stacking sequence.

According to one aspect of the present invention, the method further includes the following steps: saving the stacking sequence result in a database, and forming a data statistics module through a statistic.

An intelligent selection system for stacking positions in bulk cargo terminals, the intelligent selection method system for stacking positions in the storage yard includes:

User module, including data input device and parameter modifier, the data input device is used to input pallet selection data, and the parameter modifier is used to adjust data parameters;

The calculation module includes a stacking position selector and a stacking sequencer. The stacking position selector builds a stacking position selection evaluation function to obtain the stacking results, and the stacking sequencer builds a stacking sequence evaluation function to obtain the stacking sequence;

The stacking position selection module is used to select the stacking position according to the stacking sequence.

Advantages of the implementation of the present invention: a method and system for intelligently selecting stack positions in a bulk cargo terminal yard according to the present invention, the method includes: acquiring stack selection data and preprocessing; constructing stacks according to the preprocessed stack selection data The position selection evaluation function is solved to obtain the stacking results; the stacking sequence evaluation function is constructed according to the stacking results to solve the stacking sequence; the stacking position is selected according to the stacking sequence. The system includes: a user module; a calculation module; a stack position selection module; a data statistics module. The stacking position selection and stacking sequence are automatically calculated. The calculation results are based on manual experience accumulation and data precipitation. The planners responsible for selecting stacking positions do not need many years of work experience and professional ability, which effectively reduces the cost of the enterprise. This method will automatically Calculate a scientific and reasonable plan, improve the business level of the port dispatching department, and make the port develop in the direction of intelligence.

Description of drawings

In order to illustrate the technical solutions in the embodiments of the present invention more clearly, the following briefly introduces the drawings required in the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can also be obtained from these drawings without any creative effort.

FIG. 1 is a schematic diagram of a method for intelligently selecting stack positions in a bulk cargo terminal yard according to Embodiment 1 of the present invention;

FIG. 2 is a schematic diagram of an intelligent selection method for stacking positions in a bulk cargo terminal yard according to Embodiment 2 of the present invention;

FIG. 3 is a schematic diagram of an intelligent selection system for stacking positions of a bulk cargo terminal according to the present invention.

Detailed ways

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, but not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

Embodiment 1 of an intelligent selection method for stacking positions in a bulk cargo terminal

As shown in Figure 1, an intelligent selection method for stacking positions in a yard includes the following steps:

S1: Obtain the stacking data and preprocess it;

In practical applications, the stack selection data includes ship information, ship cargo information, terminal information and weather information.

In practical applications, ship information, including the time of the ship's arrival at anchor, the name of the ship's cargo to be loaded and unloaded, the ship's expected arrival time at the berth, the ship's expected start time, the expected completion time, and the ship's draft, etc.;

Ship cargo information, including cargo volume information, cargo category information, cargo moisture information, cargo taste information, density information, and estimated delivery time of the cargo;

Terminal information, including the depth of the berth, the length of the yard from the berth, the storage cost of the yard, the information on whether the stacks in the yard are occupied, the current and future operation information of the yard, and the information of each stack in the yard. cargo category information, etc.;

Weather information, including whether it is raining, whether it is foggy, whether it is windy, etc.

In practical applications, the wharf includes a BDQ, and the BDQ refers to a conveyor belt from the berth where the ship is docked to the warehouse stack, and each BDQ can only be used by one ship at the same time.

In practical applications, once the BDQ is used by a ship, the corresponding area on the conveyor belt cannot be used by other ships until all the goods of the ship are delivered. Therefore, it is necessary to evaluate whether a BDQ should be allocated to the ship before use. This is the stacking sequence. A good stacking sequence can avoid the conflict time of the conveyor belt and make better use of the stacking position of the site.

In practical applications, the preprocessing of the stack selection data is as follows: defining parameter values according to the stack selection data; The matching score of the goods and the stacking position.

In practical applications, the defined parameter values include ship cargo volume, ship quantity, stack cargo volume, stack cargo volume, and the like.

In practical applications, the defined parameter values and the calculated matching scores are used in the stack selection evaluation function.

S2: Build a stacking position selection evaluation function based on the preprocessed stacking selection data to solve and obtain the stacking selection result;

In practical application, the evaluation function of stacking position selection is:

The parameters include: whether the i-th ship selects the j-th stack position a _ij ∈ {0, 1}, the value is 1 when it is selected, and the value is 0 when it is not selected;

The cargo volume z _kl ≥ 0 allocated by the kth ship on the 1st lane;

The amount of goods that can be used in the s-th stacking position yard _s ;

the number of ships n;

The matching score Score _ij of the i-th ship at the j-th stacking position;

SizeNeed _i of the cargo required by the i-th vessel;

The number of stacking positions m;

The number r of BDQ;

In practical applications, the above parameters are all defined in the parameter evaluation of the stacking data in step S1.

At the same time, the stacking conditions that need to be met are:

The meaning is: the number of stacks is q, condition 1 is that each stack is allocated to only one ship; condition 2 is that the number of stacks that can be allocated to each ship cannot exceed w; condition 3 is that each ship is allocated The amount of cargo contained in the stack should be greater than or equal to the required amount of cargo; Condition 4 is the allocation of the first BDQ of the i-th ship, and penalty points will be imposed if it exceeds the given recommended cargo amount; Condition 5 is the i-th ship. The use time of the sth BDQ of the ship should be less than or equal to the available time.

In practical applications, the meaning of the above function is that in the case that each BDQ is allocated its own ideal quality, and the quality to be allocated cannot be too far away from the required quality, the score is the highest.

In practical applications, the method of combining the branch definition method and the cutting plane method is used to solve the evaluation function of the selection of the stacking position, and the value of a _ij that makes the evaluation function of the stacking position selection with the highest score and meets the conditions of the stacking position is solved, that is, the specific ship Stacking position selection result

In practical applications, the method of combining the branch definition method and the cutting plane method is as follows:

Option 1 (using the branch-and-bound method) includes the following steps:

S(a)1. Rewrite the original problem into a standard form of a (mixed integer) linear programming problem. The optimal solution is initialized, and the corresponding linear programming solution is solved without considering the integer limit first, and the upper and lower bounds of the branch-and-bound method are obtained.

S(a)2. If the above result obtains an integer solution, the discussion ends, and the integer solution is the optimal solution we want. If it is a non-integer solution, branch processing is performed on the original problem, and the upper and lower bounds of the corresponding branch are obtained by linear relaxation.

S(a) 3. Determine whether the new branch satisfies the conditions, and if not, prune the branch. If the upper and lower bounds obtained by the branch are not higher than the upper and lower bounds of the previous step, the branch will be pruned. Otherwise do not prune.

S(a)4. Traverse S(a)3 for all variables until all branches and leaves are cut.

Scheme 2 (cutting plane method) includes the following steps:

S(b)1. Rewrite the original problem into a standard form of (mixed integer) linear programming problem. Increase the slack variable and get the initial simplex table and the optimal simplex table of (LP). Initialize the optimal solution and first solve the corresponding linear programming solution regardless of integer constraints.

S(b)2. If the above result obtains an integer solution, the discussion ends, and the integer solution is the optimal solution we want. If it is a non-integer solution, we introduce a cutting plane, choose a non-integer component, decompose the coefficient integer and decimal of the row in the optimal simplex table, and use this row as the source row to make the cutting plane equation.

S(b) 3. Put the obtained cutting plane equation as a new constraint in the optimal simplex table (add a unit column vector at the same time), and use the dual simplex method to find the new optimal solution, the solution method Like S(b)1.

In practical applications, the two solutions S(a) and S(b) can be calculated in parallel without interfering with each other, which greatly improves the calculation rate.

In practical applications, the evaluation function for the selection of stacking position is solved as the value of a _ij . If the value of a _ij is 1, it means that the i-th ship selects the j-th stack position, and if the value of a _ij is 0, it means that the i-th ship is selected. The ship does not select the j-th stacking position, so the specific stacking position selection scheme of the ship is solved, and a feasible solution is initially given, which greatly reduces the possibility of types of stacking sequences.

In practical applications, the solved a _ij feasible solutions are feasible stacking options for ships, and in the next step, these feasible stacking options are traversed to obtain the specific stacking sequence.

S3: According to the stacking result, construct the stacking sequence evaluation function to solve and obtain the stacking sequence;

In practical applications, the stacking sequence is specific to which stacking position when the ship arrives at what time.

In practical applications, the stacking sequence evaluation function is:

y _ij ≥M*y _i1 j=13,...,18

The parameters include: the recommended cargo volume BDQccupy _ij given by the jth BDQ of the i-th ship under the condition of the average residual mass;

The available time BDQtime _ij of the jth BDQ of the i-th ship;

The arrival time T _istart of the i-th ship;

departure time T _istart of the i-th ship;

The cargo quantity m _i of the i-th ship;

Stacking sequence notation:

The 0-1 parameter y _ij ∈ {0, 1} of the i-th ship, 1≤j≤12;

The continuous variable y _ij of the i-th ship, 13≤j≤18;

The initial variable y _ij of the i-th ship, 19≤j≤24, means that the i-th ship assumes that there are 3 BDQs available and cannot be used at the same time. The working time of BDQ1 is [y _i19 , y _i20 ] , the working time of BDQ2 is [y _i21 , y _i22 ], and the working time of BDQ3 is [y _i23 , y _i24 ].

In practical applications, after the stacking position selection result is obtained, the position of each ship corresponding to the stacking position is obtained, and the stacking sequence evaluation function is solved by traversing all stacking operation sequences to obtain the best stacking sequence result.

In practical applications, the evaluation function of stacking sequence is a linear programming problem, and the solution of the function is to solve the linear programming problem.

In practical applications, a feasible stacking position selection result is obtained according to step S2, and it is verified whether the conditions of these linear programming problems are satisfied in this step. For example, S2 obtains 50 possible solutions (in descending order of optimality), then in this step, for each solution, the stacking sequence is arranged.

For example, the first solution is that the cargo of two ships has selected 3 stacks, the first ship has 1 stack (a), the second ship has 2 stacks (b1, b2), and verify (a, b1, b2) Order, whether it is feasible to bring it into the linear programming condition, feasible, then end. If not, we verify whether the (a, b2, b1) sequence is feasible, the feasible end, the infeasible continue to verify; traverse all the possible sequences, if not, then find the second item of the 50 solutions, and continue to verify until a feasible solution is found. .

S4: Select the stacking position according to the stacking sequence.

In practical applications, after finding the optimal stacking sequence, the ships can perform stacking operations according to this sequence, which can achieve the best stacking effect.

Embodiment 2 of an intelligent selection method for stacking positions in a bulk cargo terminal

As shown in Figure 2, an intelligent selection method for stacking positions in a yard includes the following steps:

S1: Obtain the stacking data and preprocess it;

In practical applications, the stack selection data includes ship information, ship cargo information, terminal information and weather information.

In practical applications, ship information, including the time of the ship's arrival at anchor, the name of the ship's cargo to be loaded and unloaded, the ship's expected arrival time at the berth, the ship's expected start time, the expected completion time, and the ship's draft, etc.;

Ship cargo information, including cargo volume information, cargo category information, cargo moisture information, cargo taste information, density information, and estimated delivery time of the cargo;

Terminal information, including the depth of the berth, the length of the yard from the berth, the storage cost of the yard, the information on whether the stacks in the yard are occupied, the current and future operation information of the yard, and the information of each stack in the yard. cargo category information, etc.;

Weather information, including whether it is raining, whether it is foggy, whether it is windy, etc.

In practical applications, the wharf includes a BDQ, and the BDQ refers to a conveyor belt from the berth where the ship is docked to the warehouse stack, and each BDQ can only be used by one ship at the same time.

In practical applications, if a BDQ is used by one ship, the corresponding area on the conveyor belt cannot be used by other ships until all the goods of the ship are delivered. Therefore, it is necessary to evaluate whether a BDQ should be allocated to the ship before use. This is the stacking sequence. A good stacking sequence can avoid the conflict time of the conveyor belt and make better use of the stacking position of the site.

In practical applications, the preprocessing of the stack selection data is as follows: defining parameter values according to the stack selection data; The matching score of the goods and the stacking position.

In practical applications, the defined parameter values include ship cargo volume, ship quantity, stack cargo volume, stack cargo volume, and the like.

In practical applications, the defined parameter values and the calculated matching scores are used in the stack selection evaluation function.

S2: Build a stacking position selection evaluation function based on the preprocessed stacking selection data to solve and obtain the stacking selection result;

In practical application, the evaluation function of stacking position selection is:

The parameters include: whether the i-th ship selects the j-th stack position a _ij ∈ {0, 1}, the value is 1 when it is selected, and the value is 0 when it is not selected;

The cargo volume z _kl ≥ 0 allocated by the kth ship on the 1st lane;

The amount of goods that can be used in the s-th stacking position yard _s ;

the number of ships n;

The matching score Score _ij of the i-th ship at the j-th stacking position;

SizeNeed _i of the cargo required by the i-th vessel;

The number of stacking positions m;

The number r of BDQ;

In practical applications, the above parameters are all defined or calculated in the parameter evaluation of the stacking selection data in step S1.

At the same time, the stacking conditions that need to be met are:

The meaning is: the number of stacks is q, condition 1 is that each stack is allocated to only one ship; condition 2 is that the number of stacks that can be allocated to each ship cannot exceed w; condition 3 is that each ship is allocated The amount of cargo contained in the stack should be greater than or equal to the required amount of cargo; Condition 4 is the allocation of the first BDQ of the i-th ship, and penalty points will be imposed if it exceeds the given recommended cargo amount; Condition 5 is the i-th ship. The use time of the sth BDQ of the ship should be less than or equal to the available time.

In practical applications, the meaning of the above function is that in the case that each BDQ is allocated its own ideal quality, and the quality to be allocated cannot be too far away from the required quality, the score is the highest.

In practical applications, the method of combining the branch definition method and the cutting plane method is used to solve the evaluation function of the selection of the stacking position, and the value of a _ij that makes the evaluation function of the stacking position selection with the highest score and meets the conditions of the stacking position is solved, that is, the specific ship Stacking position selection result

In practical applications, the method of combining the branch definition method and the cutting plane method is as follows:

Option 1 (using the branch-and-bound method) includes the following steps:

S(a)1. Rewrite the original problem into a standard form of a (mixed integer) linear programming problem. The optimal solution is initialized, and the corresponding linear programming solution is solved without considering the integer limit first, and the upper and lower bounds of the branch-and-bound method are obtained.

S(a)2. If the above result obtains an integer solution, the discussion ends, and the integer solution is the optimal solution we want. If it is a non-integer solution, branch processing is performed on the original problem, and the upper and lower bounds of the corresponding branch are obtained by linear relaxation.

S(a) 3. Determine whether the new branch satisfies the conditions, and if not, prune the branch. If the upper and lower bounds obtained by the branch are not higher than the upper and lower bounds of the previous step, the branch will be pruned. Otherwise do not prune.

S(a)4, traverse S(a)3 for all variables until all branches and leaves are pruned.

Scheme 2 (cutting plane method) includes the following steps:

S(b)1. Rewrite the original problem into a standard form of (mixed integer) linear programming problem. Increase the slack variable and get the initial simplex table and the optimal simplex table of (LP). Initialize the optimal solution and first solve the corresponding linear programming solution regardless of integer constraints.

S(b)2. If the above result obtains an integer solution, the discussion ends, and the integer solution is the optimal solution we want. If it is a non-integer solution, we introduce a cutting plane, choose a non-integer component, decompose the coefficient integer and decimal of the row in the optimal simplex table, and use this row as the source row to make the cutting plane equation.

S(b) 3. Put the obtained cutting plane equation as a new constraint in the optimal simplex table (add a unit column vector at the same time), and use the dual simplex method to find the new optimal solution, the solution method Like S(b)1.

In practical applications, the two solutions S(a) and S(b) can be calculated in parallel without interfering with each other, which greatly improves the calculation rate.

In practical applications, the evaluation function for the selection of stacking position is solved as the value of a _ij . If the value of a _ij is 1, it means that the i-th ship selects the j-th stack position, and if the value of a _ij is 0, it means that the i-th ship is selected. The ship does not select the j-th stacking position, so the specific stacking position selection scheme of the ship is solved, and a feasible solution is initially given, which greatly reduces the possibility of types of stacking sequences.

In practical applications, the solved a _ij feasible solutions are feasible stacking options for ships, and in the next step, these feasible stacking options are traversed to obtain the specific stacking sequence.

S3: According to the stacking result, construct the stacking sequence evaluation function to solve and obtain the stacking sequence;

In practical applications, the stacking sequence is specific to which stacking position the ship goes to at what time.

In practical applications, the stacking sequence evaluation function is:

y _ij ≥M*y _i1 j=13,...,18

The parameters include: the recommended cargo volume BDQccupy _ij given by the jth BDQ of the i-th ship under the condition of the average residual mass;

The available time BDQtime _ij of the jth BDQ of the i-th ship;

The arrival time T _istart of the i-th ship;

departure time T _istart of the i-th ship;

The cargo quantity m _i of the i-th ship;

Stacking sequence notation:

The 0-1 parameter y _ij ∈ {0, 1} of the i-th ship, 1≤j≤12;

The continuous variable y _ij of the i-th ship, 13≤j≤18;

The initial variable y _ij of the i-th ship, 19≤j≤24, means that the i-th ship assumes that there are 3 BDQs available and cannot be used at the same time. The working time of BDQ1 is [y _i19 , y _i20 ] , the working time of BDQ2 is [y _i21 , y _i22 ], and the working time of BDQ3 is [y _i23 , y _i24 ].

In practical applications, after the stacking position selection result is obtained, the position of each ship corresponding to the stacking position is obtained, and the stacking sequence evaluation function is solved by traversing all stacking operation sequences to obtain the best stacking sequence result.

In practical applications, the stacking sequence evaluation function is a linear programming problem, and the solution of the function is to solve the linear programming problem.

In practical applications, a feasible stacking position selection result is obtained according to step S2, and it is verified whether the conditions of these linear programming problems are satisfied in this step. For example, S2 obtains 50 possible solutions (in descending order of optimality), then in this step, for each solution, the stacking sequence is arranged.

For example, the first solution is that the cargo of two ships has selected 3 stacks, the first ship has 1 stack (a), the second ship has 2 stacks (b1, b2), and verify (a, b1, b2) Order, whether it is feasible to bring it into the linear programming condition, feasible, then end. If it doesn't work, we verify whether the (a, b2, b1) sequence is feasible, it is feasible to end, and it is not feasible to continue the verification; traverse all the possible sequences, if not, then find the second item of the 50 solutions, and continue to verify until a feasible solution is found. .

S4: Select the stacking position according to the stacking sequence;

In practical applications, after finding the optimal stacking sequence, the ships can perform stacking operations according to this sequence, which can achieve the best stacking effect.

S5: Save the stacking sequence results in the database, and form a data statistics module through the statistic.

In practical applications, the formation of a data statistics module is conducive to the subsequent analysis of the effect of stacking sequence.

An embodiment of an intelligent selection system for stacking positions in bulk cargo terminals

As shown in Figure 3, an intelligent selection system for stacking positions of a bulk cargo terminal, the intelligent selection method system for stacking positions of a bulk cargo terminal includes:

User module, including data input device and parameter modifier, the data input device is used to input pallet selection data, and the parameter modifier is used to adjust data parameters;

The calculation module includes a stacking position selector and a stacking sequencer. The stacking position selector builds a stacking position selection evaluation function to obtain the stacking results, and the stacking sequencer builds a stacking sequence evaluation function to obtain the stacking sequence;

The stacking position selection module is used to select the stacking position according to the stacking sequence.

In practical applications, it also includes a data statistics module, including a database and a statistician, the database receives data from the computing module, and the statistician performs statistical analysis on the data.

In practical applications, the user module, the calculation module and the data statistics module are interconnected, and data can be transferred to each other.

Advantages of the implementation of the present invention: a method and system for intelligently selecting stack positions in a bulk cargo terminal yard according to the present invention, the method includes: acquiring stack selection data and preprocessing; constructing stacks according to the preprocessed stack selection data The position selection evaluation function is solved to obtain the stacking results; the stacking sequence evaluation function is constructed according to the stacking results to solve the stacking sequence; the stacking position is selected according to the stacking sequence. The system includes: a user module; a calculation module; a stack position selection module; a data statistics module. The stacking position selection and stacking sequence are automatically calculated. The calculation results are based on manual experience accumulation and data precipitation. The planners responsible for selecting stacking positions do not need many years of work experience and professional ability, which effectively reduces the cost of the enterprise. This method will automatically Calculate a scientific and reasonable plan, improve the business level of the port dispatching department, and make the port develop in the direction of intelligence.

The above are only specific embodiments of the present invention, but the protection scope of the present invention is not limited to this. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed by the present invention, All should be included within the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.

Claims (9)

1. an intelligent selection method of stacking position of bulk cargo terminal, is characterized in that, the intelligent selection method of described stacking yard stacking comprises the following steps: Obtain pallet selection data and preprocess; According to the preprocessed stacking selection data, a stacking position selection evaluation function is constructed to solve and obtain the stacking selection result; the stacking position selection evaluation function is:

The parameters include: whether the i-th ship selects the j-th stack position a _ij ∈{0,1}, the value is 1 when it is selected, and the value is 0 when it is not selected; The cargo volume z _kl ≥ 0 allocated by the kth ship on the 1st lane; The amount of goods that can be used in the s-th stacking position yard _s ; the number of ships n; The matching score Score _ij of the i-th ship at the j-th stacking position; SizeNeed _i of the cargo required by the i-th vessel; The number of stacking positions m; The number r of BDQ, the BDQ is the conveyor belt from the berth where the ship is docked to the stacking position in the warehouse; According to the stacking selection results, the stacking sequence evaluation function is constructed to solve and obtain the stacking sequence;

y _ij ≥M*y _i1 j=13,...,18

The parameters include: the recommended cargo volume BDQccupy _ij given by the jth BDQ of the i-th ship under the condition of the average residual mass; The available time BDQtime _ij of the jth BDQ of the i-th ship; The arrival time T _istart of the i-th ship; departure time T _istart of the i-th ship; The cargo quantity m _i of the i-th ship; Stacking sequence notation: The 0-1 parameter y _ij ∈ {0,1}, 1≤j≤12 of the i-th ship; The continuous variable y _ij of the i-th ship, 13≤j≤18; The initial variable y _ij of the i-th ship, 19≤j≤24, means that the i-th ship assumes that there are 3 BDQs available and cannot be used at the same time. The working time of BDQ1 is [y _i19 ,y _i20 ] , the working time of BDQ2 is [y _i21 , y _i22 ], and the working time of BDQ3 is [y _i23 , y _i24 ]; The stacking position is selected according to the stacking sequence. 2 . The method for intelligently selecting stacking positions of bulk cargo terminals according to claim 1 , wherein the stacking selection data includes ship information, ship cargo information, dock information and weather information. 3 . 3. The method for intelligently selecting stack positions in bulk cargo terminal yard according to claim 2, wherein the preprocessing of the stack selection data is specifically: defining parameter values according to the stack selection data; according to ship information, ship cargo Information, terminal information, weather information, and weights given manually or by the system are used to evaluate the matching score between the cargo and the stack. 4. The method for intelligently selecting the stacking position of a bulk cargo terminal according to claim 1, wherein the wharf includes a BDQ, and the BDQ refers to a conveyor belt from the berth where the ship is docked to the stacking position in the storage yard. A BDQ can only be used by one ship at the same time. 5. the intelligent selection method of the stack position of bulk cargo terminal yard according to claim 1, is characterized in that, the stack position condition that described stack position selection evaluation function needs to satisfy has:

The meaning is: the number of stacks is q, condition 1 is that each stack is allocated to only one ship; condition 2 is that the number of stacks that can be allocated to each ship cannot exceed w; condition 3 is that each ship is allocated The amount of cargo contained in the stack should be greater than or equal to the required amount of cargo; Condition 4 is the allocation of the first BDQ of the i-th ship, and penalty points will be imposed if it exceeds the given recommended cargo amount; Condition 5 is the i-th ship. The use time of the sth BDQ of the ship should be less than or equal to the available time. 6. The intelligent selection method of stacking position of bulk cargo terminal yard according to claim 5 is characterized in that, adopting the method of combining branch definition method and cutting plane method to solve the stacking position selection evaluation function, the solution makes the stacking position selection All the values of a _ij with the highest evaluation function score and meeting the stacking condition are the specific ship stacking results. 7. The intelligent selection method of stacking position of bulk cargo terminal yard according to claim 1, is characterized in that, after obtaining stacking selection result, the position of corresponding stacking position of each ship is obtained, by traversing all stacking operation sequence method to solve the evaluation function of stacking order to obtain the best stacking order. 8. The method for intelligently selecting stacking positions in a bulk cargo terminal yard according to any one of claims 1 to 7, further comprising the steps of: saving the stacking sequence results in a database, and forming a data statistics module through a statistic. 9 . An intelligent selection system for stacking positions of bulk cargo terminals, characterized in that the intelligent selection system for stacking positions in bulk cargo terminals is used to implement the intelligent selection method for stacking positions in bulk cargo terminals according to claim 1 . ,include: User module, including data input device and parameter modifier, the data input device is used to input pallet selection data, and the parameter modifier is used to adjust data parameters; The calculation module, including the stacking position selector and the stacking sequencer, the stacking position selector is constructed so that each BDQ can be assigned its own ideal mass, and the mass that needs to be assigned cannot be too far away from the required mass. The stacking position selection evaluation function with the highest score in the lower right corner is used to obtain the stacking results, and the stacking sequencer builds a stacking sequence evaluation function based on the linear programming problem to obtain the stacking sequence; The stacking position selection module is used to select the stacking position according to the stacking sequence.

Images