A ship steel plate yard warehousing operation planning method for multi-batch steel plates

Abstract

The application provides a ship steel plate yard storage operation planning method for multiple batches of steel plates, which comprises the following steps: collecting storage batch information and the position of the storage steel plate in the batch, and grouping according to the manufacturing date of the section where the steel plate is located; establishing an initial storage sequence of the steel plate, and updating the storage sequence of the steel plate according to the selected removal and insertion operators; determining the storage location of each steel plate through heuristic rules based on the given storage sequence of the storage steel plate; determining the expected number of times of plate turning of the storage scheme obtained by each heuristic rule, and taking the storage scheme corresponding to the minimum number of times of plate turning as the updated storage sequence of the steel plate; and judging whether the stopping condition of the method is reached. The method can accurately plan the storage location of each steel plate in consideration of the subsequent yard delivery operation, and fully meets the allocation requirements of the storage sequence and the storage location under the condition that multiple batches and different project steel plates are simultaneously stored.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of steel plate warehousing, in particular to a ship steel plate yard warehousing operation planning method for multiple batches of steel plates. BACKGROUND

[0002] For the shipbuilding industry, steel plates are the most important raw materials for shipbuilding. There are a large number of steel plates in the shipyard, and the extraction and transportation of steel plates have become a major constraint on the shipbuilding capacity of the shipyard. Steel plates need to be pretreated and cut before they can be processed into sections and then into ship sections. Therefore, steel plate logistics is the first and most important link in ship logistics. Steel plates come from multiple external suppliers of the shipyard, and multiple batches of steel plates need to be warehoused at the same time when warehoused. The warehousing operation process directly determines the position of the steel plates in the yard. The position of the steel plates in the yard determines the number of plate flips when the steel plates are delivered, which affects the supply of steel plates and thus the subsequent production of ships. Therefore, the study of the warehousing sequence and storage scheme of steel plates has an important influence on shipbuilding.

[0003] In the prior art, the warehousing, sorting, flipping and extraction processes of steel plates in the shipyard are mostly completed by manual experience due to the lack of information and intelligent means. However, in the face of such a large amount of work and information, the historical experience of workers cannot obtain the most reasonable operation scheme, and the influence of the warehousing sequence and storage position of steel plates on subsequent delivery operations cannot be considered, resulting in an increase in the number of plate flips when delivering, low delivery efficiency and other problems. Therefore, the time waste of the steel plate yard and other problems have become an important reason for the improvement of the production capacity of the shipyard. SUMMARY

[0004] In view of the defects in the prior art, the purpose of the present application is to provide a ship steel plate yard warehousing operation planning method for multiple batches of steel plates. The method can accurately plan the warehousing and storage position of each steel plate while considering the subsequent delivery operation of the yard, and fully meet the allocation requirements of the warehousing sequence and storage position under the condition of simultaneous warehousing of multiple batches and different project steel plates.

[0005] To solve the above problems, the technical scheme of the present application is as follows:

[0006] A ship steel plate yard warehousing operation planning method for multiple batches of steel plates, comprising the following steps:

[0007] Collecting warehousing batch information and the position of the warehoused steel plate in the batch, and grouping according to the manufacturing date of the section where the steel plate is located;

[0008] Establishing an initial warehousing sequence of the steel plates, and updating the warehousing sequence of the steel plates according to the selected removal and insertion operators;

[0009] determining a storage location for each steel plate based on the given storage sequence of the incoming steel plates;

[0010] determining the expected number of times of flipping for each storage scheme obtained by each heuristic rule, and taking the storage scheme corresponding to the least number of times of flipping as the updated storage sequence of the incoming steel plates;

[0011] judging whether a stop condition of the method is reached.

[0012] Preferably, the step of collecting the batch information of the incoming steel plates and the position of each steel plate in the batch, and grouping the steel plates according to the manufacturing date of the section where the steel plate is located, specifically comprises: first obtaining the serial number of each incoming steel plate and the section information corresponding to each steel plate from the arrival list; finding the manufacturing date of the section where the steel plate is located from the schedule, so as to determine the approximate delivery time of each incoming steel plate; grouping the steel plates delivered on the same day in the same group according to the approximate delivery time of the steel plates, and sorting the groups according to the delivery time; defining the group with the earliest delivery time as the first group, the group with the second earliest delivery time as the second group, and so on.

[0013] Preferably, the step of establishing an initial storage sequence of the steel plates and updating the storage sequence of the steel plates according to the selected removal and insertion operators, specifically comprises: first establishing an initial storage sequence of the steel plates by using a rule-based heuristic algorithm; then selecting removal and insertion operators based on the weights of the operators; finally updating the storage sequence of the steel plates according to the selected removal and insertion operators.

[0014] Preferably, in the step of determining a storage location for each steel plate based on the given storage sequence of the incoming steel plates, the heuristic rules include:

[0015] a minimum blocking rule: storing the steel plate on a stack with the least number of blocking steel plates below;

[0016] a grouping approximation rule: storing the steel plate on a stack that is most similar to the group of the stack;

[0017] an optimal storage rule: storing the steel plate on a stack so that the subsequent steel plates can be stored on the most suitable stacks;

[0018] a minimum storage loss rule: storing the steel plate on a stack so that the number of steel plates that can be stored on the stack is lost the least.

[0019] Preferably, in the step of determining the expected number of times of turning over of each storage scheme obtained by each heuristic rule and taking the storage scheme corresponding to the least number of times of turning over as the updated storage sequence of the steel plates, the expected number of times of turning over of each storage scheme is calculated as follows: first, determine the steel plate with the smallest group number, located at the top of the stack, and with the smallest stack number, and move the steel plates above it to the nearest stack, and record the number of times of turning over this time, and if all the steel plates are out of the warehouse, exit; and the final number of times of turning over is the expected number of times of turning over of the corresponding storage scheme.

[0020] Preferably, in the step of determining the expected number of times of turning over of each storage scheme obtained by each heuristic rule and taking the storage scheme corresponding to the least number of times of turning over as the updated storage sequence of the steel plates, it is assumed that the expected number of times of turning over of the original storage sequence is f, and the expected number of times of turning over of the new sequence is f', if f > f' or the formula: is established, then the new sequence replaces the original sequence, wherein rand is a random number between 0 and 1.

[0021] Preferably, in the step of judging whether the stopping condition of the method is reached, the maximum running time or the maximum number of iterations is taken as the stopping condition of the method.

[0022] Preferably, in the step of judging whether the stopping condition of the method is reached, if the stopping condition of the method is reached, the determined storage sequence of the steel plates and the storage scheme expressed in a standard semantic model are taken as the system output.

[0023] Preferably, in the step of judging whether the stopping condition of the method is reached, if the stopping condition of the method is not reached, the weights of the removal and insertion operators are updated, and the storage sequence of the steel plates is updated.

[0024] Compared with the prior art, the method of the present application can plan the storage sequence of all the steel plates and the storage stack of the steel plates according to different batches of incoming steel plates, the sequence of the steel plates in the batch, and the number and capacity of the stacks, accurately plan the storage position of each steel plate in consideration of the subsequent out-of-warehouse operation of the yard, and thus fully meet the allocation requirements of the storage sequence and the storage stack under the condition that multiple batches and different project steel plates are simultaneously stored in the warehouse. At the same time, the method of the present application fully considers the out-of-warehouse time of the steel plates, and reduces the number of times of turning over during the out-of-warehouse operation by reasonably planning the storage sequence of different batches of steel plates and the storage position of the steel plates. BRIEF DESCRIPTION OF DRAWINGS

[0025] Other features, objects and advantages of the present application will become more apparent from the following detailed description of non-limiting embodiments, made with reference to the accompanying drawings:

[0026] Figure 1A flow chart of a ship steel plate yard storage planning method for multiple batches of steel plates is shown in the figure;

[0027] Figure 2 A flow chart of a rule-based heuristic algorithm steel plate initial storage sequence generation method is shown in the figure;

[0028] Figure 3 A schematic diagram of a removal operator is shown in the figure;

[0029] Figure 4 A schematic diagram of an insertion operator is shown in the figure;

[0030] Figure 5 A schematic diagram of a plurality of heuristic rules for determining a storage scheme of a steel plate is shown in the figure. DETAILED DESCRIPTION

[0031] The present application will be described in detail below with specific embodiments. The following examples will help those skilled in the art to further understand the present application, but do not limit the present application in any form. It should be noted that for those skilled in the art, without departing from the concept of the present application, a number of changes and improvements can be made. These are within the scope of the present application.

[0032] Specifically, the present application provides a ship steel plate yard storage planning method for multiple batches of steel plates, as shown in the figure Figure 1 The method comprises the following steps:

[0033] S1: Collect the storage batch information, the position of the storage steel plate in the batch, and group according to the manufacturing date of the section where the steel plate is located;

[0034] Specifically, first, get the number of each storage steel plate from the arrival list, and the corresponding section information of each steel plate. From the schedule, find the manufacturing date of the section where the steel plate is located, so as to determine the approximate delivery time of each storage steel plate. According to the approximate delivery time of the steel plate, the steel plates delivered on the same day are grouped in the same group, and the groups are sorted according to the delivery time. The earliest delivery group is defined as the first group, the second earliest delivery group is defined as the second group, and so on.

[0035] S2: Establish an initial storage sequence of the steel plate, and update the storage sequence of the steel plate according to the selected removal and insertion operators;

[0036] Specifically, this step is divided into three stages: first, an initial steel plate storage sequence is established by using a rule-based heuristic algorithm; then, based on the weight of the operator, the removal and insertion operators are selected; finally, the storage sequence of the steel plate is updated according to the selected removal and insertion operators.

[0037] First, the heuristic algorithm initial storage sequence establishment process is as shown in the figure Figure 2The establishment process of the initial storage sequence is divided into multiple stages. For each stage, starting from the first batch, it is determined whether there is a steel plate that has not been stored in the warehouse. If there is, it is determined whether the stage has determined a storage steel plate. If not, it is taken as the storage steel plate of the stage; if so, it is determined whether the grouping of the current stage is larger. If the grouping of the current stage is larger, the uppermost steel plate of the batch is taken as the storage steel plate of the current stage. According to the above process, the determination of the storage steel plate of each stage is completed. When all the steel plates are added to the storage sequence, the construction of the initial storage sequence of the steel plates is completed.

[0038] Further, the algorithm selects specific removal and insertion operators from the operators shown in Table 1 according to the operator weights.

[0039]

[0040]

[0041] Table 1

[0042] The selection of the operator is determined by the operator weight. and respectively represent the weight of the i-th removal and the i-th insertion operator. At the initial moment, the weight of each operator is set to the same value. When the operator weight needs to be selected, first, the selection probability of the i-th removal and the i-th insertion operator and

[0043]

[0044] Then, according to the selection probability of each operator, the removal and insertion operators are determined in the manner of roulette.

[0045] The removal operator is shown in Figure 3 The operator removes part of the steel plates from the sequence according to the rules set by itself. These steel plates will be sorted from large to small according to their grouping. Then, according to the sorting rule, based on the selected insertion operator, the steel plates are inserted into the storage sequence in order. The process of the insertion operator is shown in Figure 4 .

[0046] S3: Based on the given storage sequence of the steel plates, determine the storage position of each steel plate through heuristic rules;

[0047] The heuristic rules include the following four:

[0048] (1) Least blocking rule (FB): store the steel plate to the position with the least blocking of the lower steel plates.

[0049] (2) Grouping approximation rule (MS): The steel plates are stored in the rule that is most similar to the stacking grouping.

[0050] (3) Optimal storage rule (BF): The steel plates are stored in one stack so that the subsequent steel plates can be stored in the most suitable stack.

[0051] (4) Minimum storage loss (LSC): The steel plates are stored in a pile so that the loss of the number of steel plates that can be stored in the pile is minimized.

[0052] Specifically, for each incoming steel plate, the stack grouping is first determined. The stack grouping is defined as the minimum value of the grouping of steel plates stored in the stack. The grouping of the sth stack is represented by sp s If there is no steel plate in the pile, sp s =P, which is the maximum value of the group. Determine the group p of the incoming steel plates i , stacking position to store steel plate quantity A s . Construct a stacking set W that can prevent incoming steel plates from becoming blocking plates p :

[0053] W p ={s|sp s ≥p i}

[0054] Determine that the group of steel plates entering the warehouse later is less than the stacking position s, and is less than or equal to the number of stacking positions ugl s and ugm s

[0055] For the least blocking rule (FB), first determine the set W p Is there a stack in the , if yes, select W p Medium sp s The smallest stack is used as the storage stack for the steel plate. If there is none, p Select sp from the stack outside s The smallest stack is used as the storage stack for steel plates.

[0056] For group approximation rule (MS), select |sp s -p i |The smallest stack is used as the storage location for steel plates.

[0057] For the optimal storage rule (BF), first determine the set W p Is there a stack in the , if yes, select W p UGL s The smallest stack is used as the storage stack for the steel plate; if there is none, the stack is from W p Select ugl from the stack outside s The smallest stack is used as the storage stack for steel plates.

[0058] For the least storage loss (LSC), first calculate the storage loss sc of each stack position s :

[0059]

[0060] If there is a stack position in the set W p , select the stack position with the smallest sc p in W s as the storage stack position of the steel plate; if not, select the stack position with the smallest sc p from the stack positions outside W s as the storage stack position of the steel plate. Figure 5 For the same case, the storage scheme obtained by different rules is shown in the schematic diagram.

[0061] S4: Determine the expected number of times of plate turning for the storage scheme obtained by each heuristic rule, and take the storage scheme corresponding to the least number of times of plate turning as the updated steel plate storage sequence;

[0062] Specifically, the expected number of times of plate turning for the storage scheme obtained by each rule is calculated as follows: first, determine the steel plate with the smallest group, located at the top of the stack position, and with the smallest stack position number. Move the steel plate above it to the nearest stack position, and record the number of times of plate turning this time. If all the steel plates are out of the warehouse, exit; otherwise, repeat the above process. The final number of times of plate turning is the expected number of times of plate turning for the corresponding storage scheme.

[0063] Suppose the expected number of times of plate turning for the original storage sequence is f, and the expected number of times of plate turning for the new sequence is f'. If f > f' or the following formula is satisfied, the new sequence replaces the original sequence:

[0064]

[0065] where rand is a random number between 0 and 1.

[0066] S5: Determine whether the stopping condition of the method is reached.

[0067] Specifically, determine whether the stopping condition of the method is reached. The stopping condition can be a fixed running time or a number of iterations. In this embodiment, the maximum running time or the maximum number of iterations is used as the stopping condition of the method.

[0068] If the stopping condition of the method is reached, the determined yard storage job scheme of the method is output according to specific rules, that is, the determined steel plate storage sequence and storage scheme are expressed as a system output in a standard semantic model, for example, a steel plate storage plan semantic model is established by taking a steel plate number and a stacking position number as basic semantic units. A steel plate storage statement = <storage sequence number, steel plate number, storage stacking position number>, thereby forming a steel plate storage job plan containing steel plate extraction and plate turning operations.

[0069] If the stopping condition of the method is not reached, the weights of the removal and insertion operators are updated, and the step S2 is returned to update the steel plate storage sequence.

[0070] Specifically, for the operators that are not selected, the weights remain unchanged. For the selected operators, the weights are updated according to the following formula:

[0071] p = p + r

[0072] wherein r is a reward, and the value of r changes according to the result of sequence updating. Specifically, if the new sequence result is better than the original sequence, the reward value is set to r1. If the new sequence result is not as good as the original sequence, but the sequence is still updated, the reward value is set to r2. If the sequence is not updated, the reward value is set to r3. Meanwhile, the values of the three rewards need to satisfy the following conditions:

[0073] r1 > r2 > r3

[0074] The specific embodiments of the present application are described above. It should be understood that the present application is not limited to the specific embodiments described above, and various changes or modifications can be made by those skilled in the art within the scope of the claims, which do not affect the essential content of the present application. In the case of no conflict, the embodiments of the present application and the features in the embodiments can be combined with each other arbitrarily.

Claims

1. A method for planning ship steel plate storage yard warehousing operations for multiple batches of steel plates, characterized in that: The method comprises the following steps: Collect incoming batch information and the position of incoming steel plates in the batch, and group them according to the manufacturing date of the segment in which the steel plates are located. Specifically, the following steps are performed: first, obtain the number of each incoming steel plate and the segment information corresponding to each steel plate from the arrival list; then find the manufacturing date of the segment in which the steel plate is located from the schedule, thereby determining the outbound time of each incoming steel plate. Based on the outbound time of the steel plates, steel plates that are outbound on the same day are grouped together, and the groups are sorted by outbound time; the group with the earliest outbound shipment is defined as the first group, the group with the second earliest outbound shipment is defined as the second group, and so on; Establish the initial storage order of steel plates and update the storage order of steel plates according to the selected removal and insertion operators; Based on the given storage order of incoming steel plates, the storage location of each steel plate is determined by heuristic rules. The heuristic rules include: Least obstruction rule: the steel plates are stored in the pile with the least obstruction below the steel plates; Approximate grouping rule: the steel plates are stored in the rule that is most similar to the stacking grouping; Optimal storage rule: steel plates are stored in one location so that subsequent steel plates can be stored in the most suitable location; Minimum storage loss: Steel plates are stored in a pile so that the loss of the number of steel plates that can be stored in the pile is minimized; Determine the expected number of plate flipping results for each storage solution obtained by each heuristic rule, and use the storage solution with the least number of plate flipping results as the updated steel plate storage order. The expected number of plate flipping results for each storage solution obtained by each rule is calculated as follows: First, determine the steel plate with the smallest group, located at the top of the stack, and with the smallest stack number, move the steel plate above it to the nearest stack, record the number of plate flipping results, and exit if all steel plates are out of the warehouse; the final number of plate flipping results is the expected number of plate flipping results for the corresponding storage solution; Determine whether the method's stopping condition has been reached.

2. The method for planning ship steel plate storage yard warehousing operations for multiple batches of steel plates according to claim 1, characterized in that: The steps of establishing the initial storage order of steel plates and updating the storage order of steel plates according to the selected removal and insertion operators specifically include: first, using a rule-based heuristic algorithm to establish the initial storage order of steel plates; then, selecting removal and insertion operators based on operator weights; finally, updating the storage order of steel plates according to the selected removal and insertion operators.

3. The method for planning ship steel plate storage yard warehousing operations for multiple batches of steel plates according to claim 1, characterized in that: In the step of determining the expected number of plate turnover results of the storage scheme obtained by each heuristic rule and taking the storage scheme corresponding to the minimum number of plate turnover results as the updated steel plate storage sequence, it is assumed that the expected number of plate turnover results of the original storage sequence is , the expected number of flips in the new sequence is ,if Or the formula: If the new sequence replaces the original sequence, A random number between 0 and 1.

4. The method for planning ship steel plate storage yard warehousing operations for multiple batches of steel plates according to claim 1, characterized in that: In the step of determining whether the stopping condition of the method is reached, the maximum running time or the maximum number of iterations is used as the stopping condition of the method.

5. The method for planning ship steel plate storage yard warehousing operations for multiple batches of steel plates according to claim 1, characterized in that: In the step of determining whether the stopping condition of the method is met, if the stopping condition of the method is met, the determined steel plate warehousing sequence and storage plan are expressed in a standardized semantic model as system output.

6. The method for planning ship steel plate storage yard warehousing operations for multiple batches of steel plates according to claim 1, characterized in that: In the step of determining whether the stopping condition of the method is met, if the stopping condition of the method is not met, the weights of the removal and insertion operators are updated, and the order of steel plate storage is updated.

Images