阅读说明：本技术 一种被阻挡分段的预测方法 (Prediction method of blocked segments ) 是由 田凌 陈俊宇 刘思超 于 2021-07-23 设计创作，主要内容包括：本发明提供了一种被阻挡分段的预测方法,包括步骤：仿真模拟所有分段参照其预计出场日期在分段堆场内,逐个沿无阻挡分段的出场路径模拟出场；记录每一分段出场的途径堆位信息；拟定新入场分段的出场日期和放置在分段堆场内的堆位,进行新入场分段对分段堆场内其他分段的出场障碍预测。本发明可以在将一个新入场分段分配到分段堆场内某一个空堆位时,预测在未来的分段周转过程中,堆场中的分段可能在到期出场时会被新入场分段阻挡,从而判断这次分配的优劣程度,进而可以选择所有的空堆位分配方案中,选择有最少分段出场时被阻挡的方案。(The invention provides a prediction method of blocked segments, which comprises the following steps: simulating all the segments in the segment storage yard according to the predicted departure date of all the segments, and simulating departure one by one along the departure path of the unblocked segments; recording path pile bit information of each segment outgoing; and drawing the departure date of the new entry segment and the positions of the segments in the segment yard, and predicting the departure obstacles of other segments in the segment yard by the new entry segment. The invention can predict that the segment in the storage yard can be blocked by the new entry segment when the segment arrives at the storage yard in the future segment turnover process when a new entry segment is allocated to a certain empty storage yard in the segment storage yard, thereby judging the degree of superiority and inferiority of the allocation, and further selecting the scheme blocked when the least segment leaves from all the empty storage yard allocation schemes.)

1. A method for predicting blocked segments, comprising the steps of:

(1) simulating all the segments in the segment storage yard according to the predicted departure date of all the segments, and simulating departure one by one along a departure path without segment blocking;

(2) recording route pile bit information of each segment outgoing;

(3) drawing the departure date of a new entering segment and the positions of the segments in the segment yard, and predicting the departure obstacles of the new entering segment to other segments in the segment yard.

2. The prediction method according to claim 1, wherein the step (1) comprises the steps of:

(1.1) initializing any date earlier than the departure date of all of said segments in said segment yard;

(1.2) checking whether the segments with the date of departure as the current date can be departed, if so, all the segments are transported out one by one; if not, the field date of the segment is delayed by one day;

(1.3) after the segment simulation of the current date is completed, increasing the current date value by one day;

(1.4) repeating steps (1.1) - (1.3) until all of said segments in said segment yard are completed.

3. The prediction method according to claim 2, characterized in that in step (1.2) all the segments are transported out of the field one by one according to an out-of-field path; wherein the departure path includes the stack position of the conveyor path carrying the segment and an attitude characteristic as it passes the stack position.

4. The prediction method according to claim 3, wherein the exit path of the segment comprises at least one exit path free of exit obstacles.

5. The prediction method of claim 1, wherein the heap location information in step (2) includes a form one or a form two; said form one and said form two are interconverted;

the first form is as follows: each pile position corresponds to one record, and the load information of all the segments of the route pile position is recorded;

the second form: and each segment corresponds to one record, and the load information of the segment is recorded.

6. The prediction method of claim 5, wherein the load information for the segment includes at least a unique identification of the segment, an expected date of departure, attitude characteristics of the segment vehicle as it moves the segment through the stack location, and vehicle status thereof.

7. The prediction method according to claim 6, wherein the step (3) comprises the steps of:

(3.1) acquiring load information of all the segments of the heap which approach the new entry segment;

(3.2) predicting whether an exit barrier exists for the segment within the segment yard; the method comprises the steps that a, a flag variable is initialized, and the value of the flag variable is False;

b, judging whether the departure date of the new entry segment is earlier than that of the new entry segment in the segment departure way

b 1: the transport vehicle is unloaded when passing through the stacking position of the new entry section;

the transport vehicle passes through the new entry segment stack along the length or width direction of the stack, the segment not being considered to be blocked by the new entry segment; the transport vehicle is in a turning posture at the position of the pile, the segment is considered to be blocked by the new entry segment, and the flag variable in the step a is set to True; finishing the judgment;

b 2: c, when the transport vehicle passes through the stack position of the new entry segment, the transport vehicle is loaded, the segment is considered to be blocked by the new entry segment, and the flag variable in the step a is set to True; finishing the judgment;

c flag variable True, predicting that the segment is blocked by the new entry segment.

Technical Field

The invention relates to the technical field of ship construction subsection turnover, in particular to a prediction method of a blocked subsection.

Background

The subsections are intermediate products in the ship building process, the subsections need to go through the processes of pre-outfitting, sand washing and polishing, paint spraying, pre-assembling and the like, and then enter a dock to be carried, and the subsections are often required to be placed in subsection storage yards for buffering among all the processes, and the subsections are transferred among different sites through flat plate transport vehicles. The segmented yard is generally a rectangular yard and is divided into a plurality of rows and columns of square lattices, each lattice is a pile position, each pile position can store one segment, and the segments are placed on support columns or door type support frames of the pile positions.

The flat-bed transport vehicle can slowly and carefully pass under the segments in the segment yard when empty, either along the length or width of the yard, but is interfered by the support columns of the segments and cannot turn when under the segments. The flat-bed transport vehicles cannot pass over any of the staging positions when loaded.

In order to evaluate the degree of superiority and inferiority of the allocation, it is necessary to know which segments may be blocked when a new segment enters a certain empty heap, and then a scheme of the least blocked segments may be selected from all the empty heap allocation schemes.

Disclosure of Invention

The invention aims to solve one of the technical problems in the related technology at least to a certain extent, and provides a prediction method of blocked segments, which can predict that segments in a storage yard are possibly blocked by new entering segments when the segments are out of the storage yard in the future segment turnover process when a new entering segment is allocated to a certain empty storage yard in a segment storage yard, so as to judge the degree of superiority and inferiority of the allocation, and further select a scheme with the least blocked segments when the segments are out of the distribution scheme of all empty storage yards.

In view of the above, the present invention provides a method for predicting blocked segments, comprising the following steps:

(1) simulating all the segments in the segment storage yard according to the predicted departure date of all the segments, and simulating departure one by one along a departure path without segment blocking;

(2) recording path pile bit information of each segment outgoing;

(3) and drawing the departure date of the new entry segment and the positions of the segments in the segment yard, and predicting the departure obstacles of other segments in the segment yard by the new entry segment.

In the invention, under the conditions of length, width, open edge, position of all segments in the segmented yard and predicted departure date, the 'full-segment simulated departure process' is simulated, and all segments are simulated one by one along the departure path of the unblocked segments according to the predicted departure date. Wherein information of all the heap locations in the heap of the segment to which each segment is routed during the simulated outbound transit is recorded.

The method for predicting the blocked segment comprises the following steps in step (1):

(1.1) initializing the date of the current day as any date which is earlier than the date of the outgoing of all the segments in the segment yard;

(1.2) checking whether the segments with the date of the current day can be taken out, if so, all the segments are conveyed out one by one; if not, the segmented departure date is delayed by one day;

(1.3) after the segmented simulation of the current date is completed, increasing the value of the current date by one day;

(1.4) repeating the steps (1.1) - (1.3) until all the segments in the segment yard come out.

In the step (1.2), the predicted departure dates of the segments are checked one by one, wherein the departure date is equal to whether the segment on the current date can be taken out, namely whether the segment on the current date on the departure date has a departure path without blocking, and the flat-bed transport vehicle for transporting the segments to come out can carry the segments to come out along the best departure path.

The prediction method of the blocked subsections comprises the steps that (1.2) all subsections are conveyed out one by one according to an outgoing path; wherein the departure path includes a stack position of the conveyor path carrying the segments and an attitude characteristic as it passes the stack position.

Preferably, the attitude characteristic is the attitude characteristic of each stack the flat-bed transport vehicle is routed through and of itself as it passes over the stack, i.e. indicating whether the flat-bed transport vehicle is traversing the stack lengthwise of the stack, traversing the stack widthwise of the stack or making a turn at the stack.

In the prediction method of the blocked segment, the segment departure path at least comprises a departure path without departure obstacles.

In the prediction method of the blocked segment, the heap bit information in the step (2) includes a first form or a second form; interconversion of form one and form two;

the first form: each pile position corresponds to one record, and the load information of all sections of the route pile position is recorded;

the second form: each segment corresponds to a record, and the load information of the segment is recorded.

Preferably, the form one: taking the heap position as a clue, namely each heap position corresponds to one record, and recording the information of all segments passing through the heap position; the second form: the load information of the segment is recorded by using the segment as a clue, namely, each segment corresponds to one record.

According to the prediction method of the blocked segment, the load information of the segment at least comprises the unique identification mark of the segment, the predicted departure date, the attitude characteristic of the segment transport vehicle when the segment transport vehicle carries the segment to pass through the stacking position and the transport vehicle state of the segment transport vehicle.

The load information describes the unique identification of the segment, the expected date of departure, and each stack that is passed by the flat-bed transporter during the departure from the yard, the attitude of the flat-bed transporter as it passes by the stack (i.e., whether the flat-bed transporter is traversing the stack lengthwise of the yard, traversing the stack widthwise of the yard, or making a turn at the stack), and the corresponding flat-bed transporter status and whether the flat-bed transporter is loaded.

In the foregoing method for predicting blocked segments, step (3) includes the following steps:

(3.1) acquiring load information of all segments of the new entry segment stack position;

(3.2) predicting whether the segment in the segment yard has a departure obstacle; comprises the steps of

a, initializing a flag variable, wherein the value of the flag variable is False;

b, judging whether the present time is earlier than the new entering segment

b 1: the transport vehicle is unloaded when passing through a new entrance subsection pile position;

the transport vehicle passes through the new entry section stack along the length or width direction of the stack, and the section is not considered to be blocked by the new entry section; the transport vehicle is in a turning posture at the position of the pile, the section is considered to be blocked by a new entrance section, and the mark variable in the step a is set to True; c, finishing judgment and performing step c;

b 2: loading when the transport vehicle passes through a new entry subsection pile position, considering that the subsection is blocked by the new entry subsection, and setting the flag variable in the step a to True; c, finishing judgment and performing step c;

c flag variable is True and the predicted segment is blocked by the new entry segment.

Through the technical scheme, the prediction method of the blocked segment provided by the invention has the following outstanding effects:

1. the invention assumes that no new entering segment exists in the future through a simplified scene, and leaves all segments, thereby giving the positions of the stacks which may need to be accessed and the postures and states of the flat-bed transport vehicles when each stack is accessed when all segments in the field are left, and further combining the information of the expected leaving date and the like of the new entering segment on the basis of the positions to judge which segments are possibly blocked by the new entering segment.

2. The prediction of the blocked segments can effectively evaluate the advantages and disadvantages of the scheme of allocating the empty positions to the segments to be entered when entering, so as to reduce the total number of the blocked segments as much as possible.

3. The dispatching experiment of the segment yard shows that the number of times of occurrence of the situation that the departure path of the due segment needs to be vacated by extra segment carrying when the segment arrives at the departure can be effectively reduced by applying the method for guiding the allocation of the empty heap position of the departure segment of the segment yard compared with randomly allocating the empty heap position to the departure segment.

Drawings

The foregoing and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:

FIG. 1 is a flow chart of the steps of a prediction method for blocked segments provided by the present invention.

Fig. 2 is a schematic diagram of a variation of the segment exit in the segment stack field provided by the present invention.

Fig. 3 is a prediction result of the new entry segment blocking segment exit provided by the present invention.

Detailed Description

In order that the above objects, features and advantages of the present invention can be more clearly understood, a more particular description of the invention will be rendered by reference to the appended drawings. It should be noted that the embodiments of the present invention and features of the embodiments may be combined with each other without conflict.

In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention, however, the present invention may be practiced in other ways than those specifically described herein, and therefore the scope of the present invention is not limited by the specific embodiments disclosed below.

Examples

As shown in fig. 1, this embodiment proposes a prediction method for blocked segments, which includes the following steps:

(1) simulating all the segments in the segment storage yard according to the predicted departure date of all the segments, and simulating departure one by one along a departure path without segment blocking;

(2) recording path pile bit information of each segment outgoing;

(3) and drawing the departure date of the new entry segment and the positions of the segments in the segment yard, and predicting the departure obstacles of other segments in the segment yard by the new entry segment.

In the embodiment, under the conditions of the length, the width and the open edge of the segmented yard, the positions and the expected departure dates of all the segments in the segmented yard, a full-segment simulated departure process is simulated, and all the segments are simulated to depart one by one along the departure path of the unblocked segment according to the expected departure dates of the segments. Wherein information of all the heap locations in the heap of the segment to which each segment is routed during the simulated outbound transit is recorded.

In order to optimize the embodiment, the step (1) comprises the following steps:

(1.1) initializing the date of the current day as any date which is earlier than the date of the outgoing of all the segments in the segment yard;

(1.2) checking whether the segments with the date of the current day can be taken out, if so, all the segments are conveyed out one by one; if not, the segmented departure date is delayed by one day;

(1.3) after the segmented simulation of the current date is completed, increasing the value of the current date by one day;

(1.4) repeating the steps (1.1) - (1.3) until all the segments in the segment yard come out.

In step (1.2) of this embodiment, the expected departure dates of the segments are checked one by one, where the departure date is equal to whether the segment on the current date can be taken, that is, whether the segment on the current date on the departure date has a departure path without blocking the segment is checked, so that the transportation vehicle transporting the segment to come out can transport the segment to come out along the best departure path. The departure path is understood to mean the transport of the transport vehicle from outside the segment yard to below the segments in the segment yard to the departure of the loaded segments. Wherein the transport vehicle is a flat-bed transport vehicle. Checking whether the segments with the date of the current day can be taken out one by one, if so, all the segments are carried out one by one; and if not, delaying the departure date of the departure date segment as the current date by one day until no segment with the departure date being the current date and capable of being freely presented exists in the segment yard so as to exhaust all the expiration segments which can be presented on the current date and avoid neglecting the expiration segments which can not be presented at the beginning and become the expiration segments capable of being presented after the departure of some expiration segments.

The best departure path can be understood as one of only one departure path without sectional blocking or when a plurality of departure paths without sectional blocking exist in the gear, the selection standard of the best departure path is determined by a user and can be the shortest path length or the minimum index such as oil consumption.

In order to optimize the embodiment, all the segments are conveyed out one by one according to the outgoing path in the step (1.2); wherein the departure path includes a stack position for carrying the way of the segmented transporter and attitude characteristics as the segmented transporter passes the stack position.

Preferably, the attitude characteristic is the attitude characteristic of each stack the flat-bed transport vehicle is routed through and of itself as it passes over the stack, i.e. indicating whether the flat-bed transport vehicle is traversing the stack lengthwise of the stack, traversing the stack widthwise of the stack or making a turn at the stack.

In order to optimize this embodiment, it is proposed that the segmented departure path at least comprise a departure path free of departure obstacles.

In order to optimize the embodiment, the heap bit information in the step (2) comprises a first form or a second form; interconversion of form one and form two;

the first form: each pile position corresponds to one record, and the load information of all sections of the route pile position is recorded;

the second form: each segment corresponds to a record, and the load information of the segment is recorded.

Preferably, the form one: taking the heap position as a clue, namely each heap position corresponds to one record, and recording the information of all segments passing through the heap position; the second form: the load information of the segment is recorded by using the segment as a clue, namely, each segment corresponds to one record.

In order to optimize the embodiment, the load information of the segment at least comprises the unique identification mark of the segment, the expected departure date, the attitude characteristic of the segment transport vehicle when the segment transport vehicle carries the segment to pass through the stacking position and the transport vehicle state.

The load information can be understood as a unique identification which describes the section, the expected date of departure, and, during the transport of the flat-bed transport vehicles out of the yard, each passing yard, the attitude of the flat-bed transport vehicle when passing this yard (i.e. whether the flat-bed transport vehicle passes through the yard along its length, passes through the yard along its width, or makes a turn at the yard), and the corresponding flat-bed transport vehicle state and whether the flat-bed transport vehicle is loaded or not.

In order to optimize the present embodiment, step (3) includes the following steps:

(3.1) acquiring load information of all segments of the new entry segment stack position;

(3.2) predicting whether the segment in the segment yard has a departure obstacle; comprises the steps of

a, initializing a flag variable, wherein the value of the flag variable is False;

b, judging whether the departure date of the new entry segment is earlier than that of the new entry segment:

b 1: the transport vehicle is empty when passing through a new entering subsection stacking position (namely, the transport vehicle enters the lower part of the subsection from the outside of the subsection stacking position);

the transport vehicle passes through the new entry section stack along the length or width direction of the stack, and the section is not considered to be blocked by the new entry section; the transport vehicle is in a turning posture at the position of the pile, the section is considered to be blocked by a new entrance section, and the mark variable in the step a is set to True; finishing the judgment; c, performing the step c;

b 2: loading the transport vehicle when the transport vehicle passes through a new entry subsection pile position, considering that the subsection is blocked by the new entry subsection, and setting the flag variable in the step a to True; c, finishing judgment and performing step c;

c flag variable is True and the predicted segment is blocked by the new entry segment.

Wherein step (3) can be further understood as: and (3) acquiring load information of all the sections of the stack position of the route corresponding to the to-be-placed stack position of the new entry segment from the route stack position information of the exit of each segment recorded in the step (2) according to the to-be-placed stack position of the new entry segment, and judging whether all the sections of the to-be-placed stack position passing through the new entry segment are blocked by the new entry segment one by one when the new entry segment exits.

Referring to fig. 2, in an embodiment of the present invention, a 7-row 9-column yard is provided, wherein the west side and the north side are open sides, the east side and the south side are closed walls (indicated by dark blocks), and the segment is indicated by a dark square with a number indicating the remaining storage time of the segment in the yard, and if the number is 1, the segment will be present on the day. The application step 1: as shown in 201, day 1 initially there are 32 segments in the yard; day 1 has 3 expired segments to come on, and 1 expired segment is postponed. As shown at 202, there are 29 segments in the yard at the beginning of day 2; on day 2, 2 expired segments come and 1 expired segment is postponed. As shown at 203, there are 27 segments in the yard at the beginning of day 3; on day 3, 5 expired segments come and 1 expired segment is postponed. As shown at 204, there are 22 segments in the yard at the beginning of day 4; on day 4, 9 expired segments come and 1 expired segment is postponed. As shown at 205, there are 13 segments in the yard at the beginning of day 5; day 5 has 7 expired segments to come out. As shown at 206, there are 6 segments in the yard at the beginning of day 6; on day 6 there are 6 expired segments.

If a new entry segment is placed at line 1, column 3, as shown in fig. 3, it expects a date of departure of day 4. Then, through step 2 of the present invention, it is known that there is a segment with the date of departure predicted for day 3 at row 2 and column 3, and there is a possibility that a segment with the date of departure predicted for day 4 at row 3 and column 3 will be a pile position at row 1 and column 3 in the future route. Further according to step 3 of the present invention, it is predicted that the segment on row 2, column 3, which is expected to be on date 3 may be blocked by the new incoming segment at the time of the departure.

The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.