Planning device, planning method, and program

Abstract

To provide a mechanism for dividing multiple orders into multiple groups with the optimal solution at a high speed and formulating a plan for determining the order to process the orders in the groups while maintaining accuracy enough for practical use.SOLUTION: A planning apparatus includes: an evaluation item information setting unit 120 which divides multiple orders into multiple groups, and sets evaluation item information for use in determining the order to process the orders in the groups; an optimal solution calculation unit 130 which calculates an evaluation value based on the evaluation item information by arranging the orders and cutting points serving as indices for partitioning a group in a line, and calculates one line with the optimal solution in which the orders and the cutting points are arranged, using the evaluation value; and a group setting unit 140 which sets, as one group, one or more orders partitioned by the cutting points in the one line with the optimal solution calculated by the optimal solution calculation unit 130.SELECTED DRAWING: Figure 1

Description

[Technical Field]

[0001] The present invention relates to a planning device and a planning method for creating a plan to divide multiple orders into multiple groups and to determine the processing order of the orders within those groups, as well as a program for causing a computer to function as each part of the planning device. [Background technology]

[0002] Conventionally, for example, it has been practiced to create plans to divide order information for multiple products, which are considered as multiple orders, into multiple lots, which are considered as multiple groups. For example, Patent Document 1 describes a technique for creating a plan to process multiple products in batches, which is defined as a set partitioning problem, and which is solved using a column generation method to create the plan. [Prior art documents] [Patent Documents]

[0003] [Patent Document 1] Japanese Patent Publication No. 2020-107277 [Overview of the project] [Problems that the invention aims to solve]

[0004] However, the technology described in Patent Document 1 creates a plan by solving the set partitioning problem using a column generation method, which makes it possible to obtain a highly accurate solution, but it has the problem that it is difficult to obtain a solution quickly because it takes a lot of time to compute.

[0005] This invention has been made in view of the above problems, and aims to provide a mechanism that can quickly and efficiently divide multiple orders into multiple groups and create a plan to determine the processing order of orders within those groups, while maintaining practical accuracy. [Means for solving the problem]

[0006] The planning device of the present invention is a planning device that divides a plurality of orders into a plurality of groups and creates a plan for determining the processing order of the orders within the groups, comprising: an order acquisition unit that acquires the plurality of orders; an evaluation item information setting unit that sets evaluation item information used when dividing the plurality of orders into a plurality of groups and determining the processing order of the orders within the groups; a best solution calculation unit that arranges the plurality of orders and cutting points which serve as indicators for dividing the groups into a line, calculates an evaluation value based on the evaluation item information, and uses the evaluation value to calculate the best solution line in which the plurality of orders and the cutting points are arranged; and a group setting unit that sets one or more of the orders separated by the cutting points in the best solution line calculated by the best solution calculation unit as a single group. Furthermore, the present invention includes a plan creation method using the plan creation device described above, and a program for causing a computer to function as each part of the plan creation device described above. [Effects of the Invention]

[0007] According to the present invention, when creating a plan to divide multiple orders into multiple groups and determine the processing order of the orders within those groups, it is possible to perform the best possible grouping at high speed while maintaining practical accuracy. [Brief explanation of the drawing]

[0008] [Figure 1] This figure shows an example of a schematic configuration of a planning system including a planning device according to the first embodiment of the present invention. [Figure 2] This flowchart shows an example of the processing procedure for a plan creation method using a plan creation device according to the first embodiment of the present invention. [Figure 3]This is a diagram showing a first embodiment of the present invention and an example of order list information described in the storage unit shown in FIG. 1. [Figure 4] This is a diagram showing a first embodiment of the present invention and an example of evaluation item information described in the storage unit shown in FIG. 1. [Figure 5] This is a diagram showing a first embodiment of the present invention and an example of an order - between - different - steel - type connection penalty shown in FIG. 4. [Figure 6] This is a diagram showing a first embodiment of the present invention and an example of one line of the initial solution generated in step S103 of FIG. 2. [Figure 7] This is a flowchart showing a first embodiment of the present invention and an example of the detailed processing procedure of generating one line of a neighboring solution in step S104 of FIG. 2. <统一格式,保留原始标签 [Figure 8] This is a diagram for explaining the insertion process in step S204 of FIG. 7, showing a first embodiment of the present invention. [Figure 9] This is a diagram for explaining the exchange process in step S205 of FIG. 7, showing a first embodiment of the present invention. [Figure 10] This is a diagram showing an example of formula (1), which is an example of a formula used in the calculation process of the evaluation value in step S105 of FIG. 2, showing a first embodiment of the present invention. [Figure 11] This is a diagram showing an example of calculating the evaluation value of one lot in formula (1) shown in FIG. 10, showing a first embodiment of the present invention. [Figure 12] This is a diagram showing an example of formula (2), which is an example of a formula used in the update process of temperature T in step S106 of FIG. 2, showing a first embodiment of the present invention. [Figure 13] This is a flowchart showing a first embodiment of the present invention and an example of the detailed processing procedure of updating the solution according to temperature T in step S107 of FIG. 2. [Figure 14] This is a diagram showing an example of one line of the best solution generated in step S109 of FIG. 2, showing a first embodiment of the present invention. [Figure 15]This figure shows a second embodiment of the present invention, illustrating an example of multiple orders obtained in step S101 of Figure 2. [Figure 16] This figure shows a second embodiment of the present invention, including an example of one line of the initial solution generated in step S103 of Figure 2, and an example of one line of the best solution generated in step S109 of Figure 2. [Modes for carrying out the invention]

[0009] The embodiments for carrying out the present invention will be described below with reference to the drawings.

[0010] (First Embodiment) First, a first embodiment of the present invention will be described.

[0011] Figure 1 shows an example of a schematic configuration of a planning system 10 including a planning device 100 according to a first embodiment of the present invention. As shown in Figure 1, the planning system 10 comprises a planning device 100, an input device 210, and a display device 220.

[0012] The planning device 100 is a device that divides multiple orders into multiple groups and creates a plan for determining the processing order of orders within each group. As shown in Figure 1, the planning device 100 includes an order acquisition unit 110, an evaluation item information setting unit 120, a best solution calculation unit 130, a group setting unit 140, and a storage unit 150.

[0013] The order acquisition unit 110 acquires multiple orders, for example, from the input device 210. The order acquisition unit 110 then stores order list information related to the acquired multiple orders in the storage unit 150.

[0014] The evaluation item information setting unit 120 sets evaluation item information to be used when dividing multiple orders into multiple groups and determining the processing order of orders within each group, based on information input from, for example, the input device 210. The evaluation item information setting unit 120 then stores the set evaluation item information in the storage unit 150.

[0015] First, the best solution calculation unit 130 arranges the multiple orders obtained by the order acquisition unit 110 and the cutting points that serve as indicators for dividing the groups into a single line, and calculates an evaluation value based on the evaluation item information set by the evaluation item information setting unit 120. Specifically, in this embodiment, the best solution calculation unit 130 extracts a first component and a second component from the multiple components consisting of multiple orders and cutting points that constitute a single line, and calculates a line of nearby solutions by inserting the first component next to the second component or exchanging the first component and the second component in that line, and calculates an evaluation value for that line of nearby solutions. Next, the best solution calculation unit 130 calculates a line of the best solution in which multiple orders and cutting points are arranged using the calculated evaluation value. Specifically, in this embodiment, the best solution calculation unit 130 calculates a line of the best solution by simulated annealing using the evaluation value for a line of nearby solutions. The best solution calculation unit 130 then stores information for one line of the calculated best solution in the storage unit 150 as needed. As shown in Figure 1, the best solution calculation unit 130 includes an initial solution generation unit 131, a neighboring solution generation unit 132, an evaluation value calculation unit 133, and a best solution generation processing unit 134. A detailed explanation of the internal components 131 to 134 of the best solution calculation unit 130 will be described later in the flowchart shown in Figure 2.

[0016] The group setting unit 140 sets one or more orders separated by cutting points in one line of the best solution calculated by the best solution calculation unit 130 as a group. Then, if necessary, the group setting unit 140 stores the information of the set group in the storage unit 150.

[0017] The memory unit 150 stores various information (including data and images) necessary for processing by the internal components 110 to 140 of the planning device 100, as well as programs for the computer to function as the internal components 110 to 140 of the planning device 100. The memory unit 150 also stores various information (including data and images) obtained as a result of processing by the internal components 110 to 140 of the planning device 100.

[0018] The input device 210 inputs various types of information (including data and images) to the planning device 100, for example, in response to user input.

[0019] The display device 220 displays various information (including data and images) based on the control of the planning device 100. For example, the display device 220 displays information for one line of the best solution calculated by the best solution calculation unit 130, and information for groups set by the group setting unit 140.

[0020] Figure 2 is a flowchart illustrating an example of the processing procedure for a planning method using a planning device 100 according to the first embodiment of the present invention. In the first embodiment, an example is described assuming that an order is order information for the production processing of steel products, a group is a lot (production lot) of steel products, and the planning device 100 is a production planning device that creates a production plan for steel products. Here, in the first embodiment, a lot (production lot) of steel products applied as a group is a collection of orders, and is a unit for continuously processing the collected orders.

[0021] First, in step S101, the order acquisition unit 110 acquires multiple orders, for example, from the input device 210. Then, as described above, the order acquisition unit 110 stores order list information relating to the acquired multiple orders in the storage unit 150.

[0022] Figure 3 shows a first embodiment of the present invention and is a diagram showing an example of order list information 300 recorded in the storage unit 150 shown in Figure 1. In this embodiment, one order 301 to which order information for the production processing of steel products is applied is defined as order No. information 310, steel type information 320, width max information 330, width min information 340, desired delivery date information 350, and manufacturing grade information 360. Here, in this embodiment, the steel type information 320 is information on steel types classified by the iron composition of the ordered steel product, and there are 26 types from A to Z. The width max information 330 indicates the maximum width of the ordered steel product, and the width min information 340 indicates the minimum width of the ordered steel product. The manufacturing grade information 360 is information indicating the precision when processing the ordered steel product. In this embodiment, the manufacturing grade information 360 has nine grades from G1 to G9, and the higher the number, the higher the processing precision.

[0023] Now, let's return to the explanation of Figure 2. Once the processing in step S101 is complete, the process proceeds to step S102. When the process proceeds to step S102, the evaluation item information setting unit 120 sets evaluation item information to be used when dividing multiple orders into multiple groups and determining the processing order of orders within each group, based on information input from, for example, the input device 210. Then, as described above, the evaluation item information setting unit 120 stores the set evaluation item information in the storage unit 150.

[0024] Figure 4 shows a first embodiment of the present invention and is a diagram showing an example of evaluation item information 400 described in the storage unit 150 shown in Figure 1. In the first embodiment, as shown in Figure 4, the evaluation item information 400 defines six evaluation items: a penalty for connecting different steel grades between orders 410, a penalty for excess material between orders 420, a penalty for excess grade within a lot 430, a penalty for delivery time difference within a lot 440, a penalty for violating the order number constraint within a lot 450, and a lot number penalty 460.

[0025] The inter-order dissimilar steel type connection penalty 410 is an evaluation item that imposes a penalty depending on whether the connection between each order within a single lot is a dissimilar steel type connection. This inter-order dissimilar steel type connection penalty 410 is imposed with the aim of minimizing the unusable portion when the connection between orders is a dissimilar steel type connection, because iron with different compositions mixes at the connection point. Figure 5 shows a first embodiment of the present invention and is a diagram showing an example of the inter-order dissimilar steel type connection penalty 410 shown in Figure 4. In the inter-order dissimilar steel type connection penalty 410 shown in Figure 5, for example, if the steel type information 320 is an order of B and an order of B, the penalty value is 10, and if the steel type information 320 is an order of B and an order of C, the penalty value is 1500.

[0026] Now, let's return to the explanation of Figure 4. The inter-order excess material penalty 420 is an evaluation item that imposes a penalty for each piece of excess material inserted when the width difference between each order within a single lot exceeds a predetermined width difference (100 mm or more in this embodiment), making continuous production difficult without inserting excess material. Specifically, in the example shown in Figure 4, the inter-order excess material penalty 420 indicates that a penalty value of 100 is given for each piece of excess material inserted.

[0027] The lot-to-lot excess grade penalty 430 is an evaluation item that imposes a penalty based on the grade difference between the highest grade order and the lowest grade order within a single lot. This lot-to-lot excess grade penalty 430 is imposed with the aim of minimizing unnecessary increases in processing accuracy, as it is not possible to abruptly change the processing accuracy during the continuous production process of steel products, and the production process of the lot must be adjusted to the highest grade order. Specifically, in the example shown in Figure 4, the lot-to-lot excess grade penalty 430 is shown to be applied as follows: for example, if the grade difference between the highest grade order and the lowest grade order within a lot is 3, the penalty value is 9, which is obtained by multiplying by the coefficient 3.

[0028] The lot-to-lot delivery time difference penalty of 440 is an evaluation item that imposes a penalty based on the delivery time difference between the earliest and latest delivery orders within a single lot. This lot-to-lot delivery time difference penalty of 440 is imposed with the aim of reducing unnecessary inventory, as producing steel products with far apart delivery times together in a single lot results in the later-delivered steel products being stored as inventory. Specifically, in the example shown in Figure 4, the lot-to-lot delivery time difference penalty of 440 is shown to apply as follows: for example, if the delivery time difference between the earliest and latest delivery orders within a single lot is 7 days, a coefficient of 5 is applied, resulting in a penalty value of 35.

[0029] A penalty of 450 for violating the order count constraint within a lot indicates that the number of orders within a lot is the minimum order count within a lot (OD), which is the order count constraint. min The above and the maximum order quantity (OD) within a lot. maxThe following are evaluation items that will result in penalties depending on whether or not they are violated. The lot order quantity constraint violation penalty of 450 is imposed when there are upper and lower limits on the number of orders when producing steel products in a single lot, with the aim of strictly adhering to the set upper and lower limits on the number of orders. Specifically, in the example shown in Figure 4, the lot order quantity constraint violation penalty of 450 is, for example, the minimum order quantity within the lot OD. min The maximum order quantity (OD) within a lot is 4. max This indicates that if the value is 7, and the number of orders in the lot in question is 3, then a penalty value of 10000 should be applied.

[0030] The lot size penalty of 460 is an evaluation item that imposes a penalty for each increase in the number of lots. This lot size penalty of 460 is imposed with the aim of reducing the number of lots as much as possible.

[0031] Now, let's return to the explanation of Figure 2. Once the processing in step S102 is complete, the process proceeds to step S103. When the process proceeds to step S103, the initial solution generation unit 131 of the best solution calculation unit 130 arranges the multiple orders obtained in step S101 and the cutting points that serve as indicators for dividing the groups into a single line to generate one line of the initial solution.

[0032] Figure 6 shows a first embodiment of the present invention and is a diagram showing an example of one line 600 of the initial solution generated in step S103 of Figure 2. Specifically, one line 600 of the initial solution shown in Figure 6 consists of multiple components 601 to 613 of multiple orders 1 to 10 and multiple cutting points CP1 to CP3. In this one line 600 of the initial solution shown in Figure 6, the processing order is earlier towards the left and later towards the right.

[0033] Now, let's return to the explanation of Figure 2. Once the process in step S103 is completed, the process proceeds to step S104. In step S104, the nearest neighbor solution generation unit 132 of the best solution calculation unit 130 generates a line of nearest neighbor solutions by arranging the multiple orders obtained in step S101 and the cutting points that serve as indicators for dividing the groups into a single line. The detailed processing procedure of this step S104 will be explained with reference to Figure 7.

[0034] Figure 7 shows a first embodiment of the present invention and is a flowchart illustrating an example of a detailed processing procedure for generating one line of the nearest solution in step S104 of Figure 2.

[0035] When the process in step S104 in Figure 2 begins, first, in step S201 in Figure 7, the nearest neighbor solution generation unit 132 obtains two non-overlapping components from among multiple components formed by arranging multiple orders and (multiple) cutting points in a single line. Here, the two non-overlapping components obtained are the first component x1 and the second component x2.

[0036] Next, in step S202, the neighbor solution generation unit 132 generates a random number R1 between 0 and 1.

[0037] Next, in step S203, the nearest neighbor solution generation unit 132 determines whether the random number R1 generated in step S202 is less than 0.5.

[0038] If, as a result of the decision in step S203, the random number R1 generated in step S202 is less than 0.5 (S203 / YES), proceed to step S204. When the process proceeds to step S204, the nearest neighbor solution generation unit 132 inserts the first component x1 obtained in step S201 in front of the second component x2, from among the multiple components which are composed of multiple orders and (multiple) cutting points arranged in a line.

[0039] Figure 8 shows a first embodiment of the present invention and is a diagram for explaining the insertion process in step S204 of Figure 7. In the example shown in Figure 8, Figure 8(a) illustrates one line 600 of the initial solution shown in Figure 6 as an example of one line to be subjected to the insertion process in step S204 of Figure 7. In the line 600 of the initial solution shown in Figure 8(a), lot 1, which is group 1, is composed of multiple order 1 to 10 components 601 to 610, separated by the component 611 of cutting point CP1. In addition, in the line 600 of the initial solution shown in Figure 8(a), no group is set for the portion where multiple cutting points CP1 to CP3, consisting of components 611 to 613, are arranged in a continuous line. Then, for the initial solution line 600 shown in Figure 8(a), if the first component x1 obtained in step S201 is component 608 (order 8) and the second component x2 is component 612 (cutting point CP2), then the neighboring solution line 710 shown in Figure 8(b) is generated. Specifically, the neighboring solution line 710 shown in Figure 8(b) illustrates the case of an insertion neighborhood where, relative to the line 600 shown in Figure 8(a), component 608 (order 8), which is the first component x1, is inserted before component 612 (cutting point CP2), which is the second component x2. In line 710 of the nearby solution shown in Figure 8(b), lot 1, which is group 1, is composed of multiple order 1-7, 9, and 10 components 601-607, 608, and 609 separated by component 611 of cutting point CP1. Lot 2, which is group 2, is composed of order 8 component 608 separated by components 611 and 612 of cutting points CP1 and CP2. In line 710 of the nearby solution shown in Figure 8(b), no group is set for the portion where multiple cutting points CP2-CP3, consisting of components 612-613, are arranged consecutively.

[0040] In step S204 of Figure 7, the insertion process is described in which the first component x1 is inserted before the second component x2. However, the present invention is not limited to this configuration. For example, the present invention can also include a configuration in which the first component x1 is inserted after the second component x2. That is, in the present invention, the insertion process in step S204 of Figure 7 may be in which the first component x1 is inserted next to the second component x2.

[0041] Now, let's return to the explanation of Figure 7. If, as a result of the judgment in step S203, the random number R1 generated in step S202 is not less than 0.5 (i.e., it is 0.5 or greater), then proceed to step S205 (S203 / NO). When the process proceeds to step S205, the nearest neighbor solution generation unit 132 exchanges the first component x1 and the second component x2 obtained in step S201, from among the multiple components formed by arranging multiple orders and (multiple) cutting points in a single line.

[0042] Figure 9 shows a first embodiment of the present invention and is a diagram for explaining the exchange process in step S205 of Figure 7. In the example shown in Figure 9, Figure 9(a) illustrates one line 600 of the initial solution shown in Figure 6, as an example of one line to be subjected to the exchange process in step S205 of Figure 7, similar to Figure 8(a). Then, for the line 600 of the initial solution shown in Figure 9(a), if the first component x1 obtained in step S201 is component 611 (cutting point CP1) and the second component x2 is component 605 (order 5), then the line 720 of the neighboring solution shown in Figure 9(b) is generated. Specifically, the line 720 of the neighboring solution shown in Figure 9(b) illustrates the case of an exchange neighborhood in which the first component x1, component 611 (cutting point CP1), and the second component x2, component 605 (order 5), are exchanged with respect to the line 600 shown in Figure 9(a). In line 720 of the nearby solution shown in Figure 9(b), lot 1, which is group 1, is composed of multiple order 1-4 components 601-604 separated by component 611 of cutting point CP1. Lot 2, which is group 2, is composed of multiple order 6-10,5 components 606-610,605 separated by components 611 and 612 of cutting points CP1 and CP2. In line 720 of the nearby solution shown in Figure 9(b), no group is set for the portion where multiple cutting points CP2-CP3, consisting of component 612-613, are arranged consecutively.

[0043] Now, let's return to the explanation of Figure 7. When the process in step S204 in Figure 7 is completed, or when the process in step S205 in Figure 7 is completed, the flowchart shown in Figure 7 is completed, and as a result, the process in step S104 in Figure 2 is completed.

[0044] Now, let's return to the explanation of Figure 2. Once the process in step S104 in Figure 2 is completed, the process proceeds to step S105. When the process proceeds to step S105, the evaluation value calculation unit 133 of the best solution calculation unit 130 calculates an evaluation value for one line of the neighboring solutions generated in step S104.

[0045] Figure 10 shows a first embodiment of the present invention and is a diagram of equation (1), which is an example of a mathematical formula used in the calculation process of the evaluation value in step S105 of Figure 2. In this embodiment, the evaluation value eval in step S105 of Figure 2 is calculated using equation (1) in Figure 10. The definitions of each symbol in equation (1) shown in Figure 10 are described in the dotted line box below equation (1). In equation (1) shown in Figure 10, the inter-order dissimilar steel type connection penalty value 1011 is the sum of the values ​​of the inter-order dissimilar steel type connection penalty 410 shown in Figure 5, depending on whether the connection between each order is a dissimilar steel type connection for a given lot l. Also, in equation (1) shown in Figure 10, the inter-order excess material penalty value 1012 is the sum of the values ​​of the inter-order excess material penalty 420 shown in Figure 4, depending on the number of excess materials inserted when the width difference between the rear width of the nth order and the front width of the (n+1)th order is 100 mm or more for a given lot l. In equation (1) shown in Figure 10, the summation value 1010 is the sum of the inter-order dissimilar steel grade connection penalty value 1011 and the inter-order surplus material penalty value 1012 for a given lot l. In equation (1) shown in Figure 10, the lot excess grade penalty value 1020 is the value based on the lot excess grade penalty 430 shown in Figure 4, corresponding to the grade difference between the highest grade order and the lowest grade order for a given lot l. In equation (1) shown in Figure 10, the lot delivery time difference penalty value 1030 is the value based on the lot delivery time difference penalty 440 shown in Figure 4, corresponding to the delivery time difference between the earliest delivery order and the latest delivery order for a given lot l. In equation (1) shown in Figure 10, the lot order number constraint violation penalty value 1040 is the value based on the lot order number constraint violation penalty 450 shown in Figure 4 for a given lot l. In equation (1) shown in Figure 10, the lot size penalty value of 1050 is the value for a given lot l based on the lot size penalty of 460 shown in Figure 4.In equation (1) shown in Figure 10, the evaluation value of a certain lot l, 1000, is the sum of the total value of that lot l, the lot-specific over-grade penalty value, the lot-specific delivery time difference penalty value, the lot-specific order quantity constraint violation penalty value, the lot-specific order quantity penalty value, and the lot size penalty value, 1050. Then, in equation (1) shown in Figure 10, the evaluation value 1000 of all lots related to lot size L is added together to calculate the evaluation value eval in step S105 of Figure 2. Note that since the evaluation value eval is the sum of each penalty value, a smaller value is better than a larger value.

[0046] Figure 11 shows a first embodiment of the present invention and is a diagram illustrating an example of calculating an evaluation value of 1000 for a certain lot l in equation (1) shown in Figure 10. Figure 11(a) shows an example in which a certain lot l is composed of three orders: Order 1 (component 601) corresponding to Order No. information 310 "1" shown in Figure 3, Order 2 (component 602) corresponding to Order No. information 310 "2" shown in Figure 3, and Order 3 (component 603) corresponding to Order No. information 310 "3" shown in Figure 3. Here, in the example shown in Figure 11(a), Order 1 (component 601) has a front width of width min and a rear width of width max, but in this embodiment, it is also possible to arrange them with the front and back reversed. Similarly, Order 2 (component 602) and Order 3 (component 603) can also be arranged with the front and back reversed. Figure 11(b) shows an example of calculating an evaluation value of 1000 for a certain lot l shown in Figure 11(a). The penalty value 1011 for connecting dissimilar steel grades between orders, as shown in Figure 11(b), is 10 between order 1 (component 601) and order 2 (component 602), and 1500 between order 2 (component 602) and order 3 (component 603), as shown in Figure 5, resulting in 1510. The penalty value 1012 for excess material between orders, as shown in Figure 11(b), is 0 because the width difference between the rear end of order 1 (component 601) and the front end of order 2 (component 602) is 49 mm, which is less than 100 mm, and 100 because the width difference between the rear end of order 2 (component 602) and the front end of order 3 (component 603) is 108 mm, which is 100 mm or more, resulting in 100. In the example shown in Figure 11(a), the width difference between the rear end of order 2 (component 602) and the front end of order 3 (component 603) is 108 mm, which is more than 100 mm. Therefore, as shown in Figure 11(c), a configuration is adopted that assumes production will be carried out by inserting one piece of surplus material 1101 between order 2 (component 602) and order 3 (component 603) to reduce the width difference. Note that if the width difference between orders is 200 mm or more, it will be necessary to insert two pieces of surplus material 1101, in which case the surplus material penalty value 1012 between orders will be 200.The lot-to-lot over-grade penalty value 1020 shown in Figure 11(b) is 9 because, for a certain lot l shown in Figure 11(a), the grade difference between the highest grade order 2 (component 602) and the lowest grade order 1 (component 601) is 3, and the lot-to-lot over-grade penalty 430 shown in Figure 4 is 3 per over-grade. The lot-to-lot delivery time difference penalty value 1030 shown in Figure 11(b) is 35 because, for a certain lot l shown in Figure 11(a), the delivery time difference between the earliest delivery order 2 (component 602) and the latest delivery order 3 (component 603) is 7 days, and the lot-to-lot delivery time difference penalty 440 shown in Figure 4 is 5 per day of delivery time difference. The lot-to-lot order number constraint violation penalty value 1040 shown in Figure 11(b) is, for example, the minimum order number OD in a lot because the number of orders in a certain lot l shown in Figure 11(a) is 3. min is 4 (and the maximum order quantity within a lot is OD) max If the condition is 7), the lot order number constraint violation penalty of 450 shown in Figure 4 becomes 10000. The lot number penalty value of 1050 shown in Figure 11(b) becomes 4000 for a certain lot l shown in Figure 11(a), based on the lot number penalty of 460 shown in Figure 4. Therefore, the evaluation value of a certain lot l shown in Figure 11(a) is 1000, which is 1510 + 100 + 9 + 35 + 10000 + 4000 = 15654.

[0047] Now, let's return to the explanation of Figure 2. Once the process in step S105 in Figure 2 is completed, the process proceeds to step S106. When the process proceeds to step S106, the best solution generation processing unit 134 of the best solution calculation unit 130 updates the temperature T in the annealing method used when calculating one line of the best solution.

[0048] FIG. 12 shows the first embodiment of the present invention and is a diagram showing an example of the formula (2) used in the temperature T update process in step S106 of FIG. 2. The definitions of each symbol in the formula (2) shown in FIG. 12 are described within the dotted frame below the formula (2). As described within the dotted frame of FIG. 12, the temperature T in the annealing method used when calculating one line of the optimal solution is updated so that the value gradually decreases.

[0049] Here, return to the description of FIG. 2. When the process of step S106 in FIG. 2 ends, the process proceeds to step S107. When the process proceeds to step S107, the optimal solution generation unit 134 of the optimal solution calculation unit 130 updates the solution according to the temperature T updated in step S107. The detailed processing procedure of this step S107 will be described using FIG. 13.

[0050] FIG. 13 shows the first embodiment of the present invention and is a flowchart showing an example of the detailed processing procedure of the solution update process according to the temperature T in step S107 of FIG. 2. The definitions of the symbols appearing in each process of the flowchart shown in FIG. 13 are described within the dotted frame below the flowchart.

[0051] When the process of step S107 in FIG. 2 starts, first, in step S301 of FIG. 13, the optimal solution generation unit 134 determines whether the evaluation value E i for one line of the neighboring solution S i ' of the solution S i [[ID=--]] ' is less than the evaluation value E i for one line of the solution S i . Here, the evaluation values E i ' and E i are based on the evaluation value eval calculated by the evaluation value calculation unit 133.

[0052] As a result of the determination in step S301, if the evaluation value E [[ID=--]] i ' is not less than the evaluation value E i (the evaluation value Ei If the above is true (S301 / NO), proceed to step S302. When the process proceeds to step S302, the best solution generation processing unit 134 generates a random number R2 between 0 and 1.

[0053] Next, in step S303, the best solution generation processing unit 134 determines whether the update probability of the solution, which is shown within the dotted line frame in Figure 13, is greater than or equal to the random number R2.

[0054] If the result of the judgment in step S303 is that the probability of updating the solution is greater than or equal to the random number R2 (S303 / YES), proceed to step S304. Also, if the result of the judgment in step S301 is that the evaluation value E i ' is an evaluation value E i If the value is less than (S301 / YES), proceed to step S304. When the process proceeds to step S304, the best solution generation processing unit 134 generates the solution S in the (i+1)th loop from step S104 to step S108. i+1 As such, solution S i The neighboring solution S i ' Set it.

[0055] On the other hand, if the result of the judgment in step S303 indicates that the probability of updating the solution is not greater than or equal to the random number R2 (i.e., it is less than the random number R2) (S303 / NO), then proceed to step S305. When the process proceeds to step S305, the best solution generation unit 134 generates the solution S in the (i+1)th loop from step S104 to step S108. i+1 As such, solution S i Set it.

[0056] When the process in step S304 is completed, or when the process in step S305 is completed, the process in the flowchart shown in Figure 13 is completed, and as a result, the process in step S107 in Figure 2 is completed.

[0057] Now, let's return to the explanation of Figure 2. Once the process in step S107 in Figure 2 is completed, the process proceeds to step S108. When the process proceeds to step S108, the best solution generation processing unit 134 of the best solution calculation unit 130 determines that the temperature T updated in step S106 is the predetermined end temperature T end Determine whether it is higher or lower.

[0058] As a result of the determination in step S108, the temperature T updated in step S106 is the final temperature T. end If the value is higher than (S108 / YES), return to step S104 and repeat the processing from step S104 onwards.

[0059] On the other hand, as a result of the decision in step S108, the temperature T updated in step S106 is the final temperature T end If it is not higher than (S108 / NO), proceed to step S109. When the process proceeds to step S109, the best solution generation processing unit 134 of the best solution calculation unit 130 calculates and generates one line of the best solution, in which multiple orders and cutting points are arranged, based on the solution currently set in step S107.

[0060] Figure 14 shows a first embodiment of the present invention and is a diagram showing an example of the best solution line 1400 generated in step S109 of Figure 2. In the example shown in Figure 14, the number of orders is 100, with orders 1 to 100 as multiple orders. Furthermore, the best solution line 1400 shown in Figure 14 has a minimum order number within a lot (OD) in the lot order number constraint violation penalty 450. min Set to 4 and the maximum order quantity (OD) within the lot. max This shows an example where the value is set to 7.

[0061] Now, let's return to the explanation of Figure 2. Once the process in step S109 in Figure 2 is completed, the process proceeds to step S110. In step S110, the group setting unit 140 sets one or more orders separated by cutting points in the best solution line generated in step S109 as a group. Here, an example of the group setting process by the group setting unit 140 will be explained using Figure 14. For the best solution line 1400 shown in Figure 14, the group setting unit 140 first sets multiple orders 31 to 50 separated by cutting point CP1 as Lot 1, which is Group 1. The group setting unit 140 also sets multiple orders 15 to 88 separated by cutting points CP1 and CP2 as Lot 2, which is Group 2, for the best solution line 1400 shown in Figure 14. Furthermore, the group setting unit 140 also sets multiple orders 10 to 40 separated by cutting points CP2 and CP3 as Lot 3, which is Group 3, for the best solution line 1400 shown in Figure 14. From this point onward, the group setting unit 140 sets the orders separated at each cutting point as a single lot, which is a single group.

[0062] Now, let's return to the explanation of Figure 2. Once the process in step S110 in Figure 2 is completed, the process proceeds to step S111. When the process proceeds to step S111, the planning device 100 displays, for example, the information of the best solution line generated in step S109 and the group information set in step S110 on the display device 220. This allows the user to visually confirm the lot, which is the group of optimal orders, and to understand the optimal order processing sequence for each lot by viewing the information displayed on the display device 220.

[0063] Once the process in step S111 is completed, the process shown in the flowchart in Figure 2 is finished.

[0064] <Evaluation Results> The inventors evaluated the cases of order number 30 and order number 100 using three solution methods of the present invention: [1] the conventional enumeration method, [2] the conventional column generation method described in Patent Document 1, and [3] the method of the present invention which uses cutting points for grouping.

[0065] ≪If the order quantity is 30≫ The evaluation results for a number of orders of 30 are shown below. [1] Enumeration method (traditional method) Calculation time: 17300.00 seconds [2] Column generation method (conventional method) [1] Difference from enumeration method: 0.000%, calculation time: 274.67 seconds [3] Methods based on the present [1] Difference from enumeration method: 0.065%, calculation time: 0.67 seconds While the enumeration method (conventional method) has been proven to yield exact solutions, the differences between this method and the enumeration method show that the method of the present invention can also maintain a level of accuracy suitable for practical use. Furthermore, regarding computation time, it was found that the method of the present invention can group the best solution faster than the enumeration method (conventional method) and the column generation method (conventional method).

[0066] ≪If the number of orders is 100≫ The evaluation results for a number of orders of 100 are shown below. [1] Enumeration method (traditional method) The memory capacity (32.0GB) is exceeded, making it impossible to solve. [2] Column generation method (conventional method) Calculation time: 617515.53 seconds (approximately 18 hours) [3] Methods based on the present [2] Difference from column generation method: 0.333%, calculation time: 2.00 seconds The difference from the column generation method shows that the method of the present invention can maintain accuracy sufficient for practical use. Furthermore, regarding computation time, the column generation method (conventional method) takes approximately 18 hours, making it impractical, whereas the method of the present invention takes only 2.00 seconds, making it suitable for practical use.

[0067] As described above, in the plan creation device 100 according to the first embodiment, the order acquisition unit 110 acquires multiple orders, and the evaluation item information setting unit 120 divides the multiple orders into multiple groups and sets evaluation item information used to determine the processing order of the orders within each group. The best solution calculation unit 130 arranges the multiple orders and cutting points that serve as indicators for dividing the groups on one line, calculates an evaluation value based on the evaluation item information set by the evaluation item information setting unit 120, and uses this evaluation value to calculate a best solution line in which the multiple orders and cutting points are arranged. The group setting unit 140 then sets one or more orders separated by the cutting points on the best solution line calculated by the best solution calculation unit 130 as a single group. With this configuration, when dividing multiple orders into multiple groups and creating a plan to determine the processing order of orders within those groups, it is possible to quickly perform the best possible grouping while maintaining practical accuracy. Furthermore, the group setting unit 140 can divide multiple orders into any number of groups based on cutting points.

[0068] (Second embodiment) Next, a second embodiment of the present invention will be described. In the description of the second embodiment below, matters common to the first embodiment described above will be omitted, and matters that differ from the first embodiment described above will be described.

[0069] The schematic configuration of the planning system including the planning device according to the second embodiment is the same as the schematic configuration of the planning system 10 including the planning device 100 according to the first embodiment shown in Figure 1.

[0070] In the first embodiment described above, the order is assumed to be order information for the production processing of steel products, the group is assumed to be a lot (production lot) of steel products, and the planning device 100 is assumed to be a production planning device that creates a production plan for steel products. In contrast, in the second embodiment, the order is assumed to be information about the location where goods are processed for delivery, the group is assumed to be a single vehicle that processes the goods for delivery, and the planning device 100 is assumed to be a logistics planning device that creates a logistics plan for the distribution of goods.

[0071] Furthermore, the processing procedure for the plan creation method by the plan creation device 100 according to the second embodiment is the same as the flowchart showing an example of the processing procedure for the plan creation method by the plan creation device 100 according to the first embodiment, as shown in Figure 2.

[0072] In the second embodiment, in step S101 of Figure 2, the order acquisition unit 110 acquires a plurality of orders input from, for example, the input device 210.

[0073] Figure 15 shows a second embodiment of the present invention, and is a diagram showing an example of multiple orders obtained in step S101 of Figure 2. In the second embodiment, as shown in Figure 15, in step S101 of Figure 2, multiple orders 1 to 13 (components 1501 to 1513), which are information about the points where items located at the base 1500 are to be processed for delivery, are obtained.

[0074] Now, let's return to the explanation of Figure 2. Once the process in step S101 in Figure 2 is completed, the process proceeds to step S102. In the second embodiment, when the process proceeds to step S102, the evaluation item information setting unit 120 sets evaluation item information used to divide multiple orders into multiple groups and determine the processing order of the orders within each group, based on information input from, for example, the input device 210. Specifically, in the second embodiment, information on the distance penalty between orders, which is information on the points where goods are processed for delivery, is set as evaluation item information. In this case, the greater the distance between orders, the greater the value of the distance penalty between orders, which is an evaluation item. In the second embodiment, an example of setting the distance penalty between orders as an evaluation item has been described, but it is also possible to add and set other evaluation items.

[0075] In the second embodiment, in step S103 of Figure 2, the initial solution generation unit 131 of the best solution calculation unit 130 arranges the multiple orders obtained in step S101 and the cutting points that serve as indicators for dividing the groups into a single line to generate a line of initial solutions.

[0076] Figure 16 shows a second embodiment of the present invention, illustrating an example of one line 1600 of the initial solution generated in step S103 of Figure 2, and an example of one line 1610 of the best solution generated in step S109 of Figure 2. In Figure 16, components similar to those shown in Figure 15 are denoted by the same reference numerals.

[0077] In the second embodiment, in step S103 of Figure 2, for example, one line 1600 of the initial solution shown in Figure 16(a) is generated. Specifically, one line 1600 of the initial solution shown in Figure 16(a) consists of multiple components 1501 to 1516 of multiple orders 1 to 13 and multiple cutting points CP1 to CP3. In this one line 1600 of the initial solution shown in Figure 16(a), the processing order is earlier as you move to the left and later as you move to the right.

[0078] Now, let's return to the explanation of Figure 2. In the second embodiment, after the processing in step S103 in Figure 2 is completed, in steps S104 to S109, the best solution calculation unit 130 calculates and generates a line of the best solution in which multiple orders and cutting points are arranged. In the second embodiment, in step S109 in Figure 2, for example, the line of the best solution 1610 shown in Figure 16(b) is generated.

[0079] In the second embodiment, in step S110 of Figure 2, the group setting unit 140 sets one or more orders separated by cutting points in the best solution line generated in step S109 as a group. Here, an example of the group setting process by the group setting unit 140 will be explained using Figure 16(b). For the best solution line 1610 shown in Figure 16(b), the group setting unit 140 first sets the multiple orders 3 to 4 (components 1503 to 1504) separated by cutting point CP1 (component 1514) as group 1, which is vehicle 1. Also, for the best solution line 1610 shown in Figure 16(b), the group setting unit 140 sets the multiple orders 1 to 7 (components 1501 to 1507) separated by cutting points CP1 (component 1514) and CP2 (component 1515) as group 2, which is vehicle 2. Furthermore, the group setting unit 140 sets multiple orders 5 to 9 (components 1505 to 1509), separated by cutting points CP2 (component 1515) and CP3 (component 1516), as group 3, which is vehicle 3, for the best solution line 1610 shown in Figure 16(b). Figure 15 illustrates group 1 (vehicle 1), group 2 (vehicle 2), and group 3 (vehicle 3), which are grouped for the best solution line 1610 shown in Figure 16(b).

[0080] Now, let's return to the explanation of Figure 2. In the second embodiment, after the processing of step S110 in Figure 2 is completed, the planning device 100 then displays, for example, the information of the best solution line generated in step S109 and the group information set in step S110 on the display device 220. As a result, the user can visually confirm the group of vehicles that constitute the optimal order, and can also understand the optimal order processing sequence for each vehicle.

[0081] In the second embodiment, once the process in step S111 in Figure 2 is completed, the process in the flowchart shown in Figure 2 is completed.

[0082] According to the second embodiment, similar to the first embodiment described above, when creating a plan to divide multiple orders into multiple groups and determine the processing order of orders within those groups, it is possible to perform the best possible grouping at high speed while maintaining practical accuracy. Furthermore, the group setting unit 140 can divide multiple orders into any number of groups based on cutting points.

[0083] (Other embodiments) The present invention can also be realized by supplying a program that implements one or more of the functions of the above-described embodiments to a system or device via a network or storage medium, and by having one or more processors in the computer of that system or device read and execute the program. It can also be realized by a circuit (e.g., an ASIC) that implements one or more functions. This program and a computer-readable storage medium storing said program are included in the present invention.

[0084] The embodiments of the present invention described above are merely examples of how the invention can be implemented, and the technical scope of the invention should not be interpreted as being limited by them. In other words, the present invention can be implemented in various forms without departing from its technical concept or its main features. [Explanation of symbols]

[0085] 10: Planning system, 100: Planning device, 110: Order acquisition unit, 120: Evaluation item information setting unit, 130: Best solution calculation unit, 131: Initial solution generation unit, 132: Nearest solution generation unit, 133: Evaluation value calculation unit, 134: Best solution generation processing unit, 140: Group setting unit, 150: Storage unit, 210: Input device, 220: Display device

Claims

1. A planning device that divides multiple orders into multiple groups and creates a plan for determining the processing order of the orders within each group, An order acquisition unit that acquires the aforementioned multiple orders, An evaluation item information setting unit sets evaluation item information used when dividing the aforementioned multiple orders into the aforementioned multiple groups and determining the processing order of the orders within those groups, A best solution calculation unit that arranges the plurality of orders and cutting points that serve as indicators for dividing the groups on a single line, calculates an evaluation value based on the evaluation item information, and uses the evaluation value to calculate the best solution single line in which the plurality of orders and the cutting points are arranged, A group setting unit sets one or more of the orders separated by the cutting point in one line of the best solution calculated by the best solution calculation unit as one group, A planning device characterized by having the following features.

2. The planning apparatus according to claim 1, characterized in that a plurality of cutting points are arranged in the line.

3. The planning device according to claim 2, characterized in that the group setting unit does not set the portion in which the plurality of cutting points are arranged in a continuous line as a group.

4. The planning device according to claim 1, characterized in that the group setting unit can divide the plurality of orders into any number of groups based on the cutting point.

5. The planning device according to claim 1, wherein the best solution calculation unit extracts a first component and a second component from a plurality of components consisting of a plurality of orders and a cutting point that constitute the line, inserts the first component next to the second component in the line or swaps the first component with the second component to calculate the line of the nearest solution, calculates the evaluation value for the line of the nearest solution, and calculates the line of the best solution.

6. The planning device according to claim 5, characterized in that the best solution calculation unit calculates the line of the best solution by an simulated annealing method using the evaluation value for one line of the neighboring solutions.

7. The aforementioned order is order information for the production process of the product. The group is the lot of the product. The planning device according to feature 1.

8. The aforementioned order is information about the location where the goods are processed for delivery. The group is a single vehicle that handles the delivery of the aforementioned goods. The planning device according to feature 1.

9. A planning method using a planning device that divides multiple orders into multiple groups and creates a plan for determining the processing order of the orders within each group, The planning device includes an acquisition step of acquiring the plurality of orders, The planning device includes a first setting step in which it sets evaluation item information to be used when dividing the plurality of orders into the plurality of groups and determining the processing order of the orders within the group, The planning device calculates an evaluation value based on the evaluation item information, and uses the evaluation value to calculate the best possible line in which the multiple orders and the cutting points are arranged. The planning device performs a second setting step in which, in the line of the best solution calculated in the calculation step, one or more of the orders separated by the cutting points are set as one group, A method for creating a plan, characterized by having the following features.

10. A program for causing a computer to function as a component of the planning device described in any one of claims 1 to 8.

Images