JP6947517B2 - Inventory allocation device and inventory allocation method - Google Patents

Description

The present invention relates to a case where there is a certain degree of freedom in the types of inventory lots that can be allocated in the business of allocating a plurality of types of inventory lots to a plurality of order orders for manufacturing a product in a manufacturing factory. The present invention relates to an inventory allocation device and an inventory allocation method that can determine the optimum combination of inventory allocation numbers in consideration of priorities such as inventory versatility (width of order orders that can be allocated) and productivity.

In the manufacture of design products, when inventories are assigned to order orders that produce products with different specifications, the operator makes trial and error in combining inventory lots for the order, and assigns each inventories to each order. The type and the number of allocations are determined. In general, there are inventory lots that can be allocated and inventory lots that cannot be allocated for each order, so under those conditions, the inventory lot that is as versatile as possible is on hand as inventory. Set the allocation number of each inventory item so as to satisfy the order order with the near delivery date.

Regarding such inventory processing, when the number of types of products to be produced is small, the operator can determine the optimum combination of the number of inventory items to be allocated from among a plurality of inventory items. As the number of sales orders increases, the amount of calculation for setting the allocation number of each inventory for each sales order increases exponentially so as to satisfy all of them. For this reason, when there are many options for both order orders and inventories, it becomes difficult for the operator to set a combination of the number of inventories allocated suitable for manufacturing each product.

Therefore, as a method of specifying the optimum combination of the allocation number of inventories from the above options, for example, the linear programming method disclosed in Non-Patent Document 1 below or the integer programming method for limiting the solution space to an integer can be considered. .. In the method disclosed in Non-Patent Document 1, an evaluation function is set in consideration of various constraints for the number of stock items allocated for manufacturing each product, and each evaluation function is maximized. This is done by setting the number of reserves for each inventory to make the product to the optimum value.

Introduction to Mathematical Planning Law Morikita Publishing November 2014 (ISBN-13: 978-46279281818)

When the above linear programming method and integer programming method are used, it is difficult to find the optimum solution within a practical time because the search space for the combination of the ordered order and the inventory lot is enormous.

As an algorithm for calculating the optimum solution other than the above linear programming method and integer programming method, there is also a method called a local search method. In the local search method, first, a locally different solution (neighborhood solution) is set for the provisional solution (initial solution) that is the starting point, and the evaluation value of the initial solution and the evaluation value of the neighborhood solution are evaluated based on the evaluation function. Calculate and compare each. Next, for example, the arithmetic processing unit of a computer sets the neighborhood solution as a new provisional solution when the evaluation value is large, and does not change the provisional solution when the initial solution has a large evaluation value. repeat. The more the rewriting of this provisional solution is repeated, the closer the provisional solution approaches the optimum solution. By applying the above local search method to inventory allocation processing, an allocation combination solution with a higher evaluation value is set.

However, the solution space of the evaluation values in the allocation combination solution often has a multimodal evaluation value distribution, and if the initial solution is of a certain high quality, a part of the initial solution is allocated. Although the quality of the solution can be improved by the local search method that fine-tunes the number, if the initial solution itself is not perfect, it may fall into a local solution far from the optimum solution in the entire solution space. be. In addition, it is difficult to say that a search method that randomly sets the number of allocations can find a solution efficiently when the solution space is huge.

The present invention has been made in view of such circumstances, and an object of the present invention is to efficiently combine appropriate combinations of each allocation number of a plurality of types of stock lots to be allocated to a plurality of types of order orders. It is to provide an inventory allocation method and an inventory allocation device that can be set.

As a result of various studies, the present inventor has found that the above object can be achieved by the following invention. That is, in the inventory allocation method according to one aspect of the present invention, the order quantity of one or a plurality of types of inventory lots required for each product in order to produce two or more types of the same or different products is determined. This is an inventory allocation method that determines the number of allocations for each inventory lot for a sales order, and each of the sales orders has two or more preset order priorities for which each inventory lot should be allocated. Each of the inventory lots has two or more preset priority inventory parameters for determining the priority of the inventory lot to be assigned to each order, and the priority order parameter is provided. A first allocation that sets the allocation number of each inventory lot to be allocated to each sales order based on any one priority order parameter of the parameters and any one priority inventory parameter of the priority inventory parameters. Based on the first step of creating a combined solution and the priority order parameter and the priority inventory parameter in which at least one of the priority order parameter or the priority inventory parameter used in the first step is changed. The second step of creating a second allocation combination solution that sets the number of allocations for each inventory lot to be assigned to each order is compared with the first allocation combination solution and the second allocation combination solution based on the evaluation function. , A third step of setting a solution showing a better evaluation value as an allocation combination solution.

Since the first allocation combination solution and the second allocation combination solution are created based on the combination of the priority order parameter and the priority inventory parameter as described above, compared with the case where the allocation number is set at random. Both the first allocation combination solution and the second allocation combination solution are likely to satisfy the allocation constraint. Moreover, since the superior solution is set as the allocation combination solution after comparing the first allocation combination solution and the second allocation combination solution, it is possible to easily obtain the allocation combination solution in which the number of allocations closer to the optimum solution is set. Can be done.

In the above configuration, each is based on the priority order parameter and the priority inventory parameter in which at least one of the priority order parameter or the priority inventory parameter used in the first step or the second step is changed. The fourth step of creating a provisional allocation combination solution in which the number of allocations for each inventory lot to be assigned to the sales order is set, and the provisional allocation combination solution and the provisional allocation combination solution are compared based on the evaluation function, and the provisional allocation combination is compared. If the evaluation value of the solution is less than the evaluation value of the allocation combination solution, the allocation combination solution is not changed, and if the evaluation value of the provisional allocation combination solution is equal to or more than the evaluation value of the provision combination solution, the provisional allocation combination solution is used. May include a fifth step of rewriting a new allocation combination solution. The fourth step and the fifth step may be performed one or more times each.

According to the above configuration, the provisional allocation combination solution can be created with a combination different from the combination of the priority order parameter and the priority inventory parameter when the first allocation combination solution and the second allocation combination solution are created. By comparing the evaluation value of the provisional allocation combination solution created in this way with the evaluation value of the allocation combination solution and rewriting the provisional allocation combination solution to the allocation combination solution when the provisional allocation combination solution becomes larger, the allocation combination The number of allocations for each in-stock lot of the solution can be brought closer to the optimal solution. Moreover, as the number of times of executing the fourth step and the fifth step is increased, the provisional allocation combination solution having a better evaluation value can be used as the allocation combination solution, and the allocation combination solution can be brought closer to the optimum solution. can.

In the above configuration, the sixth step of creating a locally modified allocation combination solution in which the allocation number of any one type of inventory lot is changed for any one order in the allocation combination solution, and evaluation of the allocation combination solution. The value and the evaluation value of the local change allocation combination solution are calculated using the evaluation function, and when the evaluation value of the local change allocation combination solution is less than the evaluation value of the allocation combination solution, the allocation combination solution is not changed. , The seventh step of rewriting the local change allocation combination solution to a new allocation combination solution when the evaluation value of the local change allocation combination solution is equal to or higher than the evaluation value of the allocation combination solution may be included. The sixth step and the seventh step may be performed once or more.

As described above, the number of allocations of any one type of inventory lot for any one order in the allocation combination solution is locally changed, and the evaluation values of the allocation combination solutions before and after the change are compared to make a further evaluation. By rewriting the allocation combination solution so that the value becomes preferable, the allocation number of each inventory lot for each sales order of the allocation combination solution can be approached to the optimum solution. Moreover, as the number of times the sixth step and the seventh step are executed while changing the combination of the order order and the inventory lot, which locally change the allocation number, the allocation number of the inventory lot for each order is increased. You can get closer to the optimal solution.

In the above configuration, each is based on the priority order parameter and the priority inventory parameter in which at least one of the priority order parameter or the priority inventory parameter used in the first step or the second step is changed. The fourth step of creating a provisional allocation combination solution that sets the allocation number of each inventory lot to be assigned to the sales order, and
The allocation combination solution and the provisional allocation combination solution are compared based on the evaluation function, and when the evaluation value of the provisional allocation combination solution is less than the evaluation value of the provision combination solution, the allocation combination solution is not changed. The fifth step of rewriting the provisional allocation combination solution to a new allocation combination solution when the evaluation value of the provisional allocation combination solution is equal to or higher than the evaluation value of the provision combination solution.
A sixth step of creating a locally modified allocation combination solution in which the number of allocations of any one type of inventory lot is changed for any one order in the allocation combination solution.
The evaluation value of the allocation combination solution and the evaluation value of the local change allocation combination solution are calculated by using the evaluation function, and when the evaluation value of the local change allocation combination solution is less than the evaluation value of the allocation combination solution, the allocation Including the seventh step of rewriting the locally changed allocation combination solution to a new allocation combination solution when the evaluation value of the locally changing allocation combination solution is equal to or greater than the evaluation value of the allocation combination solution without changing the combination solution. good.

The process of executing the first step, the second step, and the third step, and then executing the fourth step and the fifth step the first loop number of times may be defined as a total search process. The process of executing the sixth step and the seventh step a second loop number of times may be defined as a local search process. The solution search process for executing the local search process after executing the whole search process may be performed once or more.

The inventory allocation method further includes a first output step of outputting the allocation combination solution obtained by the solution search process when the solution search process is performed once, and the solution search process is performed twice. When the above is performed, the evaluation values of the allocation combination solutions obtained by the solution search process two or more times are calculated using the evaluation function, and the calculated evaluation values are compared with each other. A second output step may be included to output the allocation combination solution having the highest evaluation value.

In the above configuration, the sixth step and the sixth step are executed after the whole search process of executing the first step, the second step, and the third step, and then executing the fourth step and the fifth step for the first loop number of times is executed. The solution search process in which the local search process in which the 7 steps are executed the second loop number of times is executed is performed once or more. When the solution search process is performed once, the allocation combination solution obtained in the solution search process is output. When the solution search process is performed twice or more, the evaluation values of the allocation combination solutions obtained by the solution search process two or more times are calculated using the evaluation function, and the calculated evaluation values are compared with each other. And the allocation combination solution with the highest evaluation value is output. Therefore, according to the above configuration, the number of stock lots allocated for each order can be brought close to the optimum solution.

In the above configuration, the overall search process may include a setting step of setting the number of times of the first loop in the first solution search process according to the number of orders ordered.

In the above configuration, in the setting process included in the overall search process, the number of first loops in the first solution search process is set according to the number of ordered orders. Therefore, according to the above configuration, the number of first loops can be set to an appropriate value according to the number of ordered orders.

In the above configuration, in the setting step, when the number of ordered orders is equal to or greater than a predetermined threshold value, the number of first loops in the first solution search process is set to the first number value, and the number of ordered orders is the threshold value. If it is less than, the number of times of the first loop in the first solution search process may be set to a second number value less than the first number value.

In the above configuration, when the number of ordered orders is equal to or greater than a predetermined threshold value in the setting step, the number of first loops in the first solution search process is set to the first number value. When the number of ordered orders is less than the threshold value, the number of first loops in the first solution search process is set to the second number value less than the first number value. Therefore, according to the above configuration, the number of first loops can be set to an appropriate value according to the number of ordered orders.

In the above configuration, the setting step may set the number of times of the first loop in the second and subsequent solution search processes to a constant value less than the number of times of the first loop in the first solution search process.

It was found that even if the number of first loops in the second and subsequent solution search processes is set to a value equal to or greater than the number of first loops in the first solution search process, the allocation combination solution cannot often approach the optimum solution. bottom. Therefore, in the above configuration, in the setting step, the number of first loops in the second and subsequent solution search processes is set to a constant value less than the number of first loops in the first solution search process. Therefore, according to the above configuration, it is possible to prevent the time required for the entire search process from becoming unnecessarily long.

In the above configuration, it is determined whether or not the elapsed time exceeds a predetermined time when the solution search process is completed and the count start step of starting the counting of the elapsed time when the solution search process is started. It may include a time determination step. In the time determination step, if it is determined that the elapsed time does not exceed the predetermined time, the solution search process may be newly started, and it is determined that the elapsed time exceeds the predetermined time. And the solution search process does not have to be newly started.

In the above configuration, counting of the elapsed time is started when the solution search process is started, and when the solution search process is completed, it is determined whether or not the elapsed time exceeds a predetermined time. Then, when it is determined that the elapsed time does not exceed the predetermined time, the solution search process is newly started. On the other hand, if it is determined that the elapsed time exceeds the predetermined time, the solution search process is not newly started. Therefore, according to the above configuration, it is possible to control the time of the solution search process.

In the above configuration, the evaluation function satisfies the priority of assigning each inventory lot to each order and the order quantity of the order for all the order in the allocation combination solution. The ratio of the allocation completion order for which the allocation number of the above is set and the inventory amount of the inventory item lot may be included in the variable factor. The evaluation function may be an evaluation function F represented by the following formula (I).

In the formula (I), x _i is a priority to be assigned to the order order i among the order orders of N (N is an integer of 2 or more) types, and y _j is an inventory product of M (M is a natural number) type. Of the lots, the inventory lot j is the priority to be assigned, _{ai and j} are the allocation numbers of the inventory lot j to be allocated to the order i, and α is set according to each order. The correction coefficient, β is the correction coefficient set according to each inventory lot, X is the ratio (%) of the allocation completion order to all the order orders in the allocation combination solution, and Y is the inventory lot. It is the total amount of inventories of the inventories after allocating.

By using the evaluation function having the above variable factors, the evaluation values of the first allocation combination solution, the second allocation combination solution, the provisional allocation combination solution, and the allocation combination solution can be quantified, respectively, and therefore the evaluation of each combination solution is evaluated. The superiority or inferiority of the value can be easily determined.

The inventory allocation device of the present invention is used for each order for which the order quantity of one or more kinds of inventory lots required for each product in order to produce two or more kinds of the same or different products is defined. Each of the above-mentioned order orders has a priority order parameter for determining the priority of the order to be assigned to each inventory lot, which is set in advance of 2 or more. Each of the inventory lots has two or more preset priority inventory parameters for determining the priority of the inventory lots to be assigned to each order, and any one of the priority order parameters. First allocation to create a first allocation combination solution that sets the allocation number of each inventory lot to be assigned to each sales order based on the priority order parameter and any one of the priority inventory parameters. For each order, based on the combination solution creation unit and the priority order parameter and the priority inventory parameter in which at least one of the priority order parameter or the priority inventory parameter used in the first step is changed. The second allocation combination solution creation unit that creates the second allocation combination solution that sets the number of allocations for each inventory lot to be allocated is compared with the first allocation combination solution and the second allocation combination solution based on the evaluation function. The allocation combination solution setting that sets the solution showing the better evaluation value among the evaluation value comparison unit and the first allocation combination solution and the second allocation combination solution compared by the evaluation value comparison unit as the allocation combination solution. Including part.

Since the first allocation combination solution and the second allocation combination solution are created based on the combination of the priority order parameter and the priority inventory parameter as described above, compared with the case where the allocation number is set at random. Both the first allocation combination solution and the second allocation combination solution are likely to satisfy the allocation constraint. Moreover, by comparing the first allocation combination solution and the second allocation combination solution and setting the superior solution as the allocation combination solution, the allocation combination solution can be more easily approached to the optimum solution.

According to the present invention, it is possible to provide an inventory allocation method and an inventory allocation device that can efficiently set an appropriate combination of each allocation number of a plurality of types of inventory lots to be allocated to a plurality of types of order orders.

It is a figure which shows the structure of the inventory allocation system which executes the inventory allocation method in 1st Embodiment. It is a flowchart which shows the procedure of the whole search among the inventory allocation method in 1st Embodiment. It is a flowchart which shows the procedure of the local search among the inventory allocation method in 1st Embodiment. It is a figure which shows the structure of the inventory allocation system which executes the inventory allocation method in 2nd Embodiment. It is a figure which shows typically an example of the loop number information in 2nd Embodiment. It is a flowchart which shows the procedure of the inventory allocation method in 2nd Embodiment. It is a flowchart which shows the procedure of the whole search among the inventory allocation methods in 2nd Embodiment.

Hereinafter, embodiments according to the present invention will be described with reference to the drawings. It should be noted that the configurations with the same reference numerals in each figure indicate that they are the same configurations, and the description thereof will be omitted as appropriate.

<Inventory allocation system of the first embodiment>
FIG. 1 is a diagram showing a configuration of an inventory allocation system that executes the inventory allocation method of the first embodiment. As shown in FIG. 1, the inventory allocation system 1 of the first embodiment includes an input unit 11, an output unit 12, a storage unit 13, and a control processing unit 14.

The input unit 11 is a device connected to the control processing unit 14 and inputs various data necessary for allocating inventory to the inventory allocation system 1, for example, a plurality of input switches and keyboards to which predetermined functions are assigned. , Mouse, etc.

The output unit 12 is a device connected to the control processing unit 14 and outputs commands and data input from the input unit 11 under the control of the control processing unit 14, for example, a CRT (Cathode Ray Tube) or an LCD (Liquid Crystal). A display device such as a display) and an organic EL display, or a printing device such as a printer.

The storage unit 13 is a circuit that is connected to the control processing unit 14 and stores various predetermined programs and various predetermined data under the control of the control processing unit 14. These various predetermined programs are, for example, a control program that controls each part of the inventory allocation system according to the function of each part, and a combination (allocation) of the optimum number of allocations of a plurality of types of inventory items for a plurality of order orders. A control processing program such as an inventory allocation program that determines a combination solution) is included. The various predetermined data include a product information database 31 that stores information about products (for example, price, use, function, storage period, size, etc.), information about in-stock items (for example, number of stocks, expiration date, size, etc.). Inventories information database 32 that stores materials, functions, uses, etc.), information necessary to determine the number of inventories allocated for each order (for example, priority for assigning specific inventories to each order) , Allocation availability information, loop number setting values K, L, etc.) are stored in the solution search condition database 33 and the like.

Such a storage unit 13 includes, for example, a ROM (Read Only Memory) which is a non-volatile storage element, an EEPROM (Electrically Erasable Programmable Read Only Memory) which is a rewritable non-volatile storage element, and the like. The storage unit 13 includes a RAM (Random Access Memory) or the like that serves as a working memory of the so-called control processing unit 14 that stores data or the like generated during the execution of the predetermined program. Further, the storage unit 13 may be provided with a storage device having a relatively large capacity such as a hard disk.

The control processing unit 14 is a circuit for controlling each unit of the inventory allocation system 1 according to the function of each unit and determining the number of each allocation of a plurality of types of inventories for producing a plurality of types of products. .. The control processing unit 14 includes, for example, a CPU (Central Processing Unit) and peripheral circuits thereof. When the control processing program stored in the storage unit 13 is executed in the control processing unit 14, the control unit 41, the first allocation combination solution creation unit 42, and the second allocation combination solution 42 are executed, as shown in FIG. The creation unit 43, the evaluation value comparison unit 44, the allocation combination solution setting unit 45, the counter unit 46, the counter success / failure judgment unit 47, the provisional allocation combination solution creation unit 48, the allocation combination solution update unit 49, and the local change solution creation unit 50. Functionally configured.

The control unit 41 controls each unit of the inventory allocation system 1 according to the function of each unit.

The first allocation combination solution creation unit 42 stores the priority order parameter of any one of the priority order parameters stored in the product information database 31 of the storage unit 13 and the inventory product information database 32 of the storage unit 13. A first allocation combination solution is created in which the allocation number of each inventory lot to be allocated to each sales order is set based on any one of the priority inventory parameters given. Here, the first allocation combination solution creation unit 42 sets the allocation number of the stock item lots having the highest priority in the priority inventory parameter in order from the order having the highest priority in the priority order parameter. To create the above first allocation combination solution. The details of the procedure for setting each allocation number will be described later.

The second allocation combination solution creation unit 43 receives each order based on the priority order parameter and the priority inventory parameter in which at least one of the priority order parameter or the priority inventory parameter used by the first allocation combination solution creation unit 42 is changed. It creates a second allocation combination solution that sets the allocation number of each inventory lot to be assigned to the order. By creating the second allocation combination solution by changing at least one of the priority order parameter or the priority inventory parameter in this way, the second allocation combination solution is a combination of the number of allocations set in the first allocation combination solution. It is a combination of different allocation numbers.

The evaluation value comparison unit 44 calculates the evaluation value of the first allocation combination solution and the second allocation combination solution based on the evaluation function, and compares the evaluation values. From the evaluation value calculated here, it is possible to specify which of the first allocation combination solution and the second allocation combination solution is the better solution. Further, the evaluation value comparison unit 44 calculates the evaluation value of the provisional allocation combination solution created by the provisional allocation combination solution creation unit 48, which will be described later, and the evaluation value of the local change allocation combination solution created by the local change allocation solution creation unit 50. Is calculated. By comparing the evaluation value of the provisional allocation combination solution and the evaluation value of the locally changed allocation combination solution with the evaluation value of the allocation combination solution, it is possible to identify which is the better solution.

The allocation combination solution setting unit 45 compares the evaluation value of the first allocation combination solution calculated by the evaluation value comparison unit 44 with the evaluation value of the second allocation combination solution, and allocates a solution showing a better evaluation value. Set to a combination solution. As a result, at least one of the priority order parameter and the priority inventory parameter is changed to create two types of allocation combination solutions, and the one with the better evaluation value can be set as the allocation combination solution.

The counter unit 46 counts the number of times that the provisional allocation combination solution creation unit 48, which will be described later, creates the provisional allocation combination solution. For example, when the allocation combination solution is the one in which the better of the first allocation combination solution and the second allocation combination solution is set, the provisional allocation combination solution has never been created, so that the counter unit 46 counters. Set the value of n to 0. After that, the counter unit 46 increments the value of the counter n by 1 according to the number of times the provisional allocation combination solution creation unit 48 has created the provisional allocation combination solution.

The counter success / failure determination unit 47 determines whether or not the value of the counter n satisfies the loop number setting value K set in advance by the user. Specifically, the value of the counter n is the loop number setting value K. If the values are the same, it is determined that it is not necessary to create a further provisional allocation combination solution, and if the value of the counter n has not reached the loop number setting value K, it is determined that a further provisional allocation combination solution should be created. do. The loop number setting value K is arbitrarily set by the user, for example, 100 or 1000, and is stored in the solution search condition database 33. In the present embodiment, the loop number setting value K corresponds to an example of the number of first loops.

The provisional allocation combination solution creation unit 48 is a priority order in which at least one of the priority order parameter or the priority inventory parameter used by the first allocation combination solution creation unit 42 and the second allocation combination solution creation unit 43 is changed. Create a provisional allocation combination solution that sets the allocation number for each inventory lot to be assigned to each sales order based on the parameters and priority inventory parameters. The provisional allocation combination solution created here is a candidate for updating the above provision combination solution, and if the evaluation value of the provisional allocation combination solution is equal to or higher than the evaluation value of the provision combination solution, the provisional allocation combination solution is used. Is a new allocation combination solution.

The provisional combination solution update unit 49 was created by the provisional allocation combination solution creation unit 48 when the evaluation value of the provisional combination solution is equal to or greater than the evaluation value of the provisional combination solution as a result of comparison by the evaluation value comparison unit 44. It rewrites the provisional allocation combination solution to a new allocation combination solution.

The local change allocation solution creation unit 50 creates a local change allocation combination solution in which the allocation number of any one type of inventory lot is changed for any one order in the allocation combination solution. The local change allocation combination solution created here is a candidate for updating the above allocation combination solution, and if the evaluation value of the local change allocation combination solution is equal to or higher than the evaluation value of the allocation combination solution, the local change is made. The allocation combination solution becomes a new allocation combination solution.

Such an inventory allocation system 1 may be configured by a computer such as a personal computer, or may be configured by, for example, a system in which a processing server device, a data server device, and an input / output terminal device can communicate with each other. good.

In the following, each step constituting the inventory allocation method of the first embodiment will be described. FIG. 2 is a flowchart showing the procedure of the overall search of the inventory allocation method in the first embodiment, and FIG. 3 is a flowchart showing the procedure of the local search of the inventory allocation method in the first embodiment. In the inventory allocation method using the inventory allocation system 1, one or a plurality of types of inventory lots are allocated to produce the same or different types of products by combining the global search and the local search in the solution space. The allocation combination solution in which the combination of the number of allocations is set is determined, and the control processing unit 14 starts at the timing when the operator instructs the inventory allocation system 1 to execute the inventory allocation process, and the control processing unit 14 determines step S1 in FIG. Proceed to the process of.

At the same time as this start, the control processing unit 14 executes the initialization of each necessary unit, and by executing the control processing program, the control processing unit 14 receives the control unit 41, the first allocation combination solution creation unit 42, and the second. Allocation combination solution creation unit 43, evaluation value comparison unit 44, allocation combination solution setting unit 45, counter unit 46, counter success / failure judgment unit 47, provisional allocation combination solution creation unit 48, allocation combination solution update unit 49, and local change solution creation. The unit 50 and the like are functionally configured. The above-mentioned inventory allocation system generally operates as follows with respect to determining the allocation number of each inventory item for each product.

First, the control processing unit 14 is stored by the control unit 41 in the order order data stored in the product information database 31, the inventory data stored in the inventory information database 32, and the solution search condition database 33. Read the data about the constraints on the allocations that have been made.

As shown in FIG. 2, the control processing unit 14 allocates to each order by the first allocation number combination solution creation unit 42 based on an arbitrary 1 priority order parameter and an arbitrary 1 priority inventory parameter. Create a first allocation combination solution in which the allocation number of stock lots is set (S1).

Next, the control processing unit 14 changes at least one of the priority order parameter and the priority inventory parameter used by the first allocation number combination solution creation unit 42 by the second allocation number combination solution creation unit 43. Create a second allocation combination solution that sets the allocation number of each inventory lot to be assigned to each order based on the degree order parameter or priority inventory parameter (S2).

Next, the control processing unit 14 calculates the evaluation value EV1 of the first allocation combination solution and the evaluation value EV2 of the second allocation combination solution by the evaluation value comparison unit 44, and sets the evaluation value EV1 and the evaluation value EV2. Compare (S3). Then, the control processing unit 14 is the solution of the one showing the better evaluation value of the evaluation value EV1 of the first allocation combination solution and the evaluation value EV2 of the second allocation combination solution by the allocation combination solution setting unit 45. Is set in the allocation combination solution (S4).

Next, the control processing unit 14 sets the value of the counter n, which indicates the number of times the provisional allocation combination solution is created, to 0 by the counter unit 46 (S5). Here, since the provisional allocation combination solution has never been created, the value of the counter n is set to 0.

Next, the control processing unit 14 determines whether or not the value of the counter n satisfies the loop number setting value K by the counter success / failure determination unit 47 (S6). Then, when the value of the counter n is the same as the loop number setting value K (S6: Yes), the control processing unit 14 stores the allocation combination solution stored in the storage unit 13 as the optimum solution in the storage unit 13. End the whole search process (end). For example, when the loop number setting value K is set to 0, the control processing unit 14 stores the allocation combination solution determined in step S4 in the storage unit 13 without proceeding to step S7, and ends the processing ( End). The allocation combination solution stored in the storage unit 13 may be output to an external device by the control unit 41, if necessary. On the other hand, when the value of the counter n is less than the loop number setting value K (S6: No), the value of the counter n is incremented by 1 by the counter unit 46 (S7), and the process proceeds to step S8.

Next, the control processing unit 14 is at least one of the priority order parameter or the priority inventory parameter used by the first combination solution creation unit 42 or the second combination solution creation unit 43 by the provisional allocation combination solution creation unit 48. Create a provisional allocation combination solution that sets the allocation number of each inventory lot to be assigned to each order based on the changed priority order parameter and priority inventory parameter (S8).

Then, the control processing unit 14 calculates the evaluation value EV3 of the allocation combination solution set by the allocation combination solution setting unit 45 and the evaluation value EV4 of the provisional allocation combination solution by the evaluation value comparison unit 44, and sets the evaluation value EV3. Compare with the evaluation value EV4 (S9). Then, when the evaluation value EV4 of the provisional allocation combination solution is less than the evaluation value EV3 of the allocation combination solution (S9: No), the control processing unit 14 returns to the process of step S6. On the other hand, when the evaluation value EV4 of the provisional allocation combination solution is equal to or higher than the evaluation value EV3 of the provision combination solution (S9: Yes), the allocation combination solution update unit 49 rewrites the provisional allocation combination solution to a new allocation combination solution. On top of that (S10). The control processing unit 14 returns to the processing of step S6.

By repeating each step of steps S5 to S10 as described above, the counter unit 46 increments the value of the counter n by 1, and steps S5 to step S5 until the value of the counter n becomes the loop number setting value K. Each step of S10 is repeated. In this way, in step S8, a provisional allocation combination solution created by changing at least one of the priority inventory parameter and the priority inventory parameter is created, and in step S9, the evaluation value of the provisional allocation combination solution is the original. By setting the provisional allocation combination solution to the new allocation combination solution only when it is equal to or more than the evaluation value of the allocation combination solution, the allocation number of each stock lot for each order can be set to a more suitable value. Then, the more the number of executions of step S8 for setting the provisional allocation combination solution by changing the combination of the priority order parameter for determining the priority of the order and the priority inventory parameter for determining the priority of the inventory lot, the more the allocation combination Since the number of times the solution is rewritten is increased, the allocation combination solution can be brought closer to the optimum solution.

Each of the above steps sets an allocation combination solution by a global search (S11). By performing a local search by each of the following steps on this allocation combination solution, it is possible to modify it to an allocation combination solution in which a more suitable number of allocations is set.

The control processing unit 14 sets the value of the counter n indicating the number of times the locally changed solution is created to 0 by the counter unit 46 (S12). Here, since the locally changed solution has never been created, the value of the counter n is set to 0.

Next, the control processing unit 14 determines whether or not the value of the counter n satisfies the loop number setting value L by the counter success / failure determination unit 47. The loop number setting value L may be the same value as or different from the loop number setting value K. Then, when the value of the counter n is the same as the loop number setting value L (S13: Yes), the control processing unit 14 stores the allocation combination solution stored in the storage unit 13 as the optimum solution in the storage unit 13. End the whole search process (end). That is, when the loop number setting value L is set to 0, the control processing unit 14 stores the allocation combination solution determined in step S11 in the storage unit 13 without proceeding to step S14, and ends the processing. (End). On the other hand, when the value of the counter n is less than the loop number setting value L (S13: No), the value of the counter n is incremented by 1 by the counter unit 46 (S14), and the process proceeds to step S15.

Next, the control processing unit 14 creates a local change allocation combination solution in which the allocation number of any one type of inventory lot is changed for any one order in the allocation combination solution by the local change allocation solution creation unit 50. (S15). The number of allocations here is an integer of 0 or more, and is randomly set from among integers up to the smaller of the order quantity of the order and the inventory quantity of the inventories. In addition, when various constraints are no longer satisfied due to the change in the number of allocations in this way, a step of appropriately adjusting the number of allocations for each inventory lot so as to satisfy the various constraints is included. ..

Next, the control processing unit 14 calculates the evaluation value EV5 of the allocation combination solution and the evaluation value EV6 of the locally changed allocation combination solution by the evaluation value comparison unit 44, and compares the evaluation value EV5 with the evaluation value EV6 (S16). ). Then, when the evaluation value EV6 of the locally changed allocation combination solution is less than the evaluation value EV5 of the allocation combination solution (S16: No), the control processing unit 14 returns to the process of step S13 without changing the allocation combination solution. On the other hand, when the evaluation value EV6 of the local change allocation combination solution is equal to or higher than the evaluation value EV5 of the allocation combination solution (S16: Yes), the allocation combination solution update unit 49 rewrites the local change allocation combination solution to a new allocation combination solution. Above (S17). The control processing unit 14 returns to the processing of step S13. By modifying a part of the allocation combination solution in this way, the evaluation value of the allocation combination solution can be further increased. In the present embodiment, the loop number setting value L corresponds to an example of the second loop number.

<Specific example of allocation problem>
Next, a procedure for setting the allocation number of M types of inventory lots for N types of order orders will be described by the inventory allocation method of the first embodiment. The allocation combination solution is represented by the N × M matrix in Table 1 below, and there are a total of N types of order orders J1, J2, J3, ..., JN, and the inventory lot is an inventory item. There are a total of M types of lots L1, L2, L3, ..., LM.

The “inventory group” in Table 1 is a group of inventories manufactured at the same place of manufacture and on the date of manufacture. Even if the inventories belong to the same inventories group, different inventories lots are set for the inventories showing different properties in the quality inspection after manufacturing. For example, a plurality of inventories lots L1 and L2 belonging to the same inventories group G1 are inventories included in the inventories manufactured in the same manufacturing place on the same manufacturing date, but in the subsequent quality inspection. There are two types of inventories that have been shown to exhibit different properties.

“Inventory lots” in Table 1 are inventories that are grouped by assigning individual lot numbers to inventories according to attributes such as the same manufacturing date, manufacturing location, width, length, weight, and various performances. In the number sequence next to Table 1, the number of allocations for each inventory lot is set individually. An inventory amount is set individually for each inventory lot, and the inventory amount is the number of inventories of the inventory lot. For example, the inventory of the inventory lot L1 has 10 inventories, and a total of up to 10 inventories can be allocated to all the ordered orders.

As an example of the relationship between the inventory group and the inventory lot, for example, inventory products manufactured at the same manufacturing site on the same manufacturing date should be managed with the same inventory product lot. However, when the storage location of the inventory is different (for example, warehouse WH1 and warehouse WH2), or when it is found in the quality inspection that the inventory lot shows different properties depending on each location. Is an inventory item that should be allocated as a separate inventory item lot according to the storage location or quality in the allocation to the order.

For each inventory lot, two or more priority inventory parameters that determine the priority of the inventory lot to be assigned to each order are set in advance. The higher the priority inventory parameter, the higher the priority of the inventory lot to be assigned to the order. In other words, an inventory lot with a high priority is an inventory lot that you want to preferentially allocate and digest. For example, an inventory lot that you want to use up quickly, an inventory lot that is low in versatility and difficult to allocate, etc. Is a high-priority inventory lot. Such priority inventory parameters include, for example, a basic priority value set individually for each inventory lot, the number of types of sales orders that can be allocated for each inventory lot, and the inventory quantity of each inventory lot. The inventory retention period of each inventory lot, the number of times each inventory lot was not assigned to the order, the date of manufacture of each inventory lot, the priority of each inventory lot set at random, and the like can be mentioned.

For each of the above priority inventory parameters, for example, the smaller the number of types of order orders that can be allocated, the higher the priority that should be assigned to the order, and the larger the inventory amount of the inventory lot, the higher the priority. There are multiple priority criteria, such as the longer the number, the higher the priority, the smaller the number of ordered orders assigned, the higher the priority, and the older the date of manufacture, the higher the priority. It is also possible to randomly determine the priority. After ranking the inventory lots based on the priority inventory parameter of any of these, the allocation number is set in order from the inventory lot with the highest priority.

The "orders ordered" in Table 1 set the number of allocations for each inventory lot to be allocated to manufacture the product, and the order quantity is set individually for each order, and if necessary. Therefore, constraints such as the upper limit of the number of inventories and the lower limit of the number of allocations are set. The vertical sequence in Table 1 corresponds to one order, for example, the order J1 has 0 inventory lots L1, 2 inventory lots L2, ..., 5 inventory lots LM. It is set to allocate each. The unit of the number of allocations here is not limited to "pieces". For example, depending on the stock items to be handled, the number of sheets (sheets), the number (pieces), the weight (g, kg, ton), and the volume (cm ³ , m). It may be represented by ^{3) or the like.}

The order quantity of the order is the total number of inventories to be allocated to manufacture the product, and a numerical range is set for the total according to the circumstances of the individual order as shown in Table 1. Sometimes. The allocation number of each inventory lot is set so that the total number of allocations of each inventory lot assigned to each sales order does not exceed the upper limit of the order quantity of each order. Taking the order order J1 in Table 1 as an example, since the order quantity of the order order J1 is set to 4 or more and 7 or less, the total number of stock lots allocated to the order order J1 may be 8 or more. The number of allocations for each inventory lot is set so that there is no such thing.

When the total number of allocations of each inventory lot allocated to the order is within the range of the order quantity of the order, the order is called "allocation completed order", and the lower limit of the range of the order quantity is described. Orders that are less than the value are called "unallocated orders". For example, in the case of order order J1, order order J1 when the total number of reserves for each inventory lot is 4 or more and 7 or less is called an allocation completion order, and when the total number of reserves for each inventory lot is 3 or less. Order order J1 is called an unallocated order. In addition, the ratio (%) of allocation completion orders to all order orders in the allocation combination solution may be referred to as the allocation completion rate.

The upper limit of the number of inventories of each order has been stipulated that it is necessary to allocate the inventories lot from the inventories lots included in the inventories of the number of types set by the upper limit of the types of inventories. For example, when an inventory item is assigned to the order order J1 in Table 1, it is necessary to allocate an inventory item lot from the inventory item lots included in the inventory item group of 3 or less types, and 4 or more types of inventory items must be allocated. This is a constraint condition that stipulates that an inventory lot cannot be assigned from the inventory lots included in the inventory group. For example, when the upper limit of the number of inventories is set to 1, it is necessary to set the allocation number from the inventories lots included in a single inventory group to satisfy the order quantity of the order. When the upper limit of the number of in-stock items is set to 2, the order is received by setting the allocation number from the inventories lots included in at most two types (preferably one type) of inventories. Need to meet the quantity. For example, since the inventory item lot L1 and the inventory item lot L2 belong to the same inventory item group G1, even if both the inventory item lot L1 and the inventory item lot L2 are assigned, the number of inventory items is counted as one type. Will be done.

The lower limit of the number of allocations for each order is set to the minimum number of the total number of allocations of inventory lots included in one inventory group for the order, and each inventory to be allocated to each order. This is a constraint condition for reducing the number of types of inventory items including lots. For example, if the lower limit of the number of reserves for a certain order is set to 3, the total number of reserves for all inventory lots included in one inventory group for that order may be 1 or 2. It is not allowed and the total must be set to 3 or more, and if the allocation number of 3 or more cannot be set, the allocation number of all inventory lots included in the inventory group is set to 0. ..

For example, when inventories are assigned to the order J1 in Table 1, the total number of all inventories lots belonging to at least one inventories group must be 3 or more. The lower limit of the number of reserves is also counted in units of the inventory group as in the case of the upper limit of the number of inventory items. Therefore, for example, when allocating an inventory item to order J1, even if the allocation number of the inventory item lot L1 is 1 and the allocation number of the inventory item lot L2 is 2, the allocation number of the inventory item lot belonging to the inventory item group G1 Since the sum of 3 is 3, the lower limit of the number of allocations of the order J1 is satisfied.

As described above, by imposing constraints such as the upper limit of the number of stock items and the lower limit of the number of reserves for the order, it is possible to allocate one by one from the inventory lots included in different inventory groups. Can be prevented.

Similar to each inventory lot, each order has a priority order parameter that determines the priority of the order to which the inventory lot should be assigned. The priority order parameters include, for example, the basic priority value set individually for each order, the period until the delivery date of the product produced by the order, and the number of unallocated orders in the past allocation process. , Randomly set priority, etc. Orders are ranked based on any of these priority order parameters, and the number of allocations for each inventory lot is set for the order in descending order of priority.

There may be a constraint that each sales order cannot be assigned a particular inventory lot individually. Such allocation availability information is stored in the solution search condition database 33, and is represented by, for example, an N × M matrix as shown in Table 2 below. In Table 2, “1” is indicated for the inventory lot that can be allocated for each order, and “0” is indicated for the inventory lot that cannot be allocated. In other words, it is possible to set an arbitrary number of allocations for the combination of stock lots for the order of "1" in the information on availability of allocation in Table 2, but the inventory for the order of "0" in the information on availability of allocation. A non-zero allocation number cannot be set for a combination of product lots.

As shown in Table 2 above, even if the inventory lots L1 and L2 are included in the same inventory group as in the inventory group G1, the inventory items can be allocated to a specific order (for example, order order J2). It is possible that there are lots and unallocated inventory lots. Hereinafter, each step (S1 to S10) of the overall search and each step (S11 to S17) of the local search constituting the inventory allocation method of the first embodiment will be described. Although it is a conceptual explanation, the global search optimizes the allocation combination solution by changing the row unit of the stock lot and the column unit of the sales order in the allocation combination solution, whereas the local search is the allocation combination. The number of allocations for a specific inventory lot for a specific sales order in the solution is partially changed to optimize the allocation combination solution. FIG. 2 is a flowchart of the whole search in the first embodiment, and FIG. 3 is a flowchart of the local search in the first embodiment.

(Step S1: Creation of first allocation combination solution (first step))
In step S1, each of the first allocation combination solution creation unit 42 is based on an arbitrary 1 priority order parameter among the priority order parameters and any 1 priority inventory parameter among the priority inventory parameters. Create a first allocation combination solution that sets the allocation number of each inventory lot to be assigned to the sales order.

Here, the procedure for setting the allocation number of each inventory lot is when the constraint condition of the lower limit of the allocation number and the constraint condition of the upper limit of the number of stock items are set for the order, and these constraint conditions are set. It is different from the case where it is not done. The procedure for setting the number of allocations in each case will be described below.

(When the lower limit of the number of reserves and the upper limit of the number of inventories are not set in the order)
If the sales order does not have the constraints of the lower limit of the number of allocations and the upper limit of the number of stock items, the sales order is arranged in descending order of priority of the priority order parameter, and the inventory lot is arranged in descending order of priority inventory parameter. .. For example, when the delivery date of an order is used as the priority order parameter and the inventory quantity of inventories is used as the priority order parameter, the order orders are arranged in the order of the delivery date of the order order and the inventory quantity of the inventory lot is increased. Arrange inventory lots in descending order.

After arranging the order and inventory lots in this way, for the order with the highest priority order parameter, the number of allocations is set in descending order of priority from the inventory lot with the highest priority inventory parameter. .. Specifically, first, the order quantity of the order is compared with the inventory quantity of the inventory lot with the highest priority among the inventory lots that can be allocated to the order, and the smaller value is used. Set as the number of stock lots to be allocated to the sales order. When the number of allocations set here satisfies the order quantity of the order, the allocation process for the order is terminated, and the allocation process for the order with the next highest priority is executed.

On the other hand, if the number of allocations set above is less than the order quantity of the order, the inventory to be allocated to the order is obtained by subtracting the allocation number for which the inventory lot has already been allocated from the order quantity of the order. Calculate the number of remaining reserves for the product lot. Then, the number of remaining reserves is compared with the inventory quantity of the inventory lot with the second highest priority among the inventory lots that can be allocated to the order, and the smaller value is assigned to the order. Set as the number of stock lots to be allocated. Then, when the sum of the allocation numbers of all the inventory lots allocated to the order is satisfied with the order quantity of the order, the allocation process for the order is completed and the next highest priority order is allocated. Proceed to processing.

On the other hand, if the total number of all inventories allocated to the above-mentioned order is less than the order quantity of the order, the total number of inventories already allocated from the order quantity of the order is added. By subtracting, the number of remaining stock lots to be allocated to the order is calculated. Then, the number of remaining reserves is compared with the inventory amount of the inventory lot with the third highest priority among the inventory lots that can be allocated to the order, and the smaller value is assigned to the order. Set as the number of stock lots to be allocated. By repeating such an operation, the number of allocations is set in the order of priority of the inventory lots that can be allocated until the order quantity of the order is satisfied. As a result, it is possible to preferentially allocate high-priority inventory lots to high-priority order orders.

However, even if the allocation number of all inventory lots that can be allocated for the order is set, the total allocation number of all inventory lots may still be less than the order quantity of the order. In this case, the order is regarded as an unallocated order and the allocation process is completed, and then the process proceeds to the allocation process of the order with the highest priority. Even if such an unallocated order occurs, it shall be treated as a valid allocation combination solution. This is because, as a matter of fact, even if the stock quantity of the stock product lot is insufficient to satisfy the order quantity of the order, the specific stock product lot will be delivered by the next allocation process, and the stock product will be delivered. This is because the shortfall can be allocated to the unallocated order, which makes it possible to make the allocated completed order.

(When the order has the lower limit of the number of reserves and the upper limit of the number of inventories set)
If the sales order has the lower limit of the number of allocations and the upper limit of the number of stock items, the number of allocations of the inventory lots is set for each inventory group instead of determining the number of allocations for each inventory lot. To go. Therefore, first, the value with the highest priority inventory parameter among the inventory lots included in the inventory group is set as the priority of the inventory group, and each inventory group is arranged in descending order of priority, and then each is arranged. In the inventory group, each inventory lot is arranged in descending order of priority inventory parameter. On the other hand, order orders are arranged in descending order of priority order parameter.

Next, first, the order quantity of the order and the highest priority among the inventory lots included in the inventory group including the inventory lot with the highest priority among the inventory lots that can be allocated to the order. Compare with the inventory quantity of the high inventory lot, and set the smaller value as the allocation number of the inventory lot to be assigned to the order. When the number of allocations set here satisfies the order quantity of the order, the allocation process for the order is terminated, and the process proceeds to the allocation process for the order with the next highest priority.

On the other hand, if the number of inventories allocated to the order is less than the order quantity of the order, the number of inventories already allocated to the order is subtracted from the order quantity of the order. Calculate the number of remaining inventory lots to be allocated to the sales order. Then, the remaining allocation quantity and the inventory amount of the inventory item lot having the second highest priority in the inventory item group including the inventory item lot having the highest priority among the inventory item lots that can be allocated to the order. Is compared with, and the smaller value is set as the number of stock lots to be allocated to the order. By repeating such an operation, the number of allocations is set in the order of priority of the inventory lots that can be allocated until the order quantity of the order is satisfied by the inventory lots included in a single inventory group.

When the allocation number of all available inventory lots included in a single inventory group has been set for the above order, the total number of allocations of all inventory lots included in the inventory group. Compare the value with the lower limit of the number of reserves, and if the total value of the number of reserves of all the stock lots included in the stock group is less than the lower limit of the number of reserves, for all the stock lots included in the stock group. After setting the allocation number to 0, the allocation number of the inventory item lot having the highest priority among the inventory item lots included in the inventory item group including the inventory item lot having the second highest priority is set.

On the other hand, if the total number of allocations for all inventory lots included in the inventory group is equal to or greater than the lower limit of the allocation number, the allocation numbers for all inventory lots included in the inventory group are as set above. To set the allocation number of the inventory lot with the highest priority among the inventory lots included in the inventory group including the inventory lot with the second highest priority for the order. By repeating such an operation, the allocation number of all the inventory lots included in the inventory group including the inventory lot having the second highest priority is set. When the total inventory amount of the inventory lots that can be allocated to the above order among the inventory lots included in the inventory group including the inventory lot having the second highest priority is less than the above lower limit of the allocation number. , The inventory group including the next (third) high priority inventory lot without setting the allocation number of the inventory lot included in the inventory group including the second highest priority inventory lot. Proceed to the process of allocating the inventory lot included in.

When the allocation number of all available inventory lots included in the inventory group including the inventory lot having the second highest priority for the above order is set, all included in the inventory group. Compare the total number of reserves for stock lots with the lower limit of the number of reserves, and if the total number of reserves for all stock lots included in the inventory group does not meet the lower limit of the number of reserves, the stock group After setting the allocation number of all inventory lots included in to 0, the inventory lot with the highest priority among the inventory lots included in the inventory group including the inventory lot with the third highest priority. Set the number of lots to be allocated. In this way, by allocating an inventory lot for each inventory group including a high-priority inventory lot for an order, the inventory included in the high-priority inventory group for a high-priority order. The number of stocked product lots to be allocated can be set in order from the product lot.

By repeating such operations, the number of stock lots allocated in order of priority of the inventory group including the inventory lots that can be allocated until the order quantity of the order is satisfied or the number of inventory items in the order order exceeds the upper limit. Will be set. As a result, it is possible to preferentially set the allocation number of inventory lots included in the inventory group including the inventory lots with high priority for the order with high priority. In this way, by determining the number of stock lots to be allocated for the order in order from the order with the highest priority, the number of inventory lots to be allocated is set for all the orders. By creating the first allocation combination solution in this way, step S1 is completed, and the control processing unit 14 proceeds to the process of step S2.

On the other hand, if the total number of all stock lots allocated is still less than the order quantity of the order, even if the inventory lots included in the same number of inventory groups as the upper limit of the number of types of inventory items in the order order are assigned. The number of all inventory lots included in the lowest priority inventory group among the inventory lots allocated to is set to 0, and the most of the inventory items that have not been allocated. Set the allocation number of inventory lots in descending order of priority from the inventory lots with the highest priority among the inventory lots included in the inventory group including the inventory lots with high priority. In this way, the number of inventories lots to be allocated is determined while satisfying the constraint condition of the upper limit of the number of inventories.

For the above unallocated orders, even if the allocation process is performed again after the next delivery of the inventories, the allocation is made so as to satisfy the constraint condition of the number of stock items in each order and the constraint condition of the lower limit of the allocation number. The number needs to be corrected. The order of the correction steps based on the upper limit of the number of types of inventories and the correction steps based on the lower limit of the number of allocations described below is only an example, and each correction step may be exchanged and executed.

(Correction process for unallocated orders to satisfy the constraint condition of the upper limit of the number of types in stock)
When the upper limit of the number of types of inventory items is set for the above unallocated order, the inventory lots included in the same number of inventory items as the upper limit of the number of types of inventory items are assigned to the unallocated order. In that case, the inventory lot included in the new inventory group cannot be allocated at the next allocation process. In order to avoid such a situation, by setting the allocation number of all inventory lots included in any one or more inventory groups of the inventory lots already allocated to the unallocated order to 0. , Correct the allocation quantity of the inventory lot so that the constraint condition of the upper limit of the number of inventory types can be satisfied at the next allocation processing.

Specifically, the upper limit of the number of types of inventory items that can be allocated to unallocated orders is A, the lower limit of the order quantity of unallocated orders is B, and the allocation of each inventory lot allocated to the unallocated orders. Assuming that the total number is C and the total number of all inventory lots included in one type of inventory group to be replenished by the time the allocation process is executed is D, the above unallocated order Of the inventory items allocated to the unallocated order so that the number of types of inventory items allocated to is less than or equal to the integer value obtained by rounding down the decimal point of the value calculated by A- (BC) ÷ D. Set the allocation number of all inventory lots included in any one or more of the inventory groups to 0. By adjusting the number of allocations in this way, it is possible to allow a margin in the number of types of inventory items that can be allocated to unallocated orders, and it is possible to allocate inventory lots to be delivered by the next allocation processing. be able to.

(Correction process for unallocated orders to meet the constraint condition of the lower limit of the number of allocations)
When the lower limit of the number of allocations is set for the unallocated order, the difference between the upper limit of the order quantity of the unallocated order and the total number of allocations of the inventory lots allocated for the unallocated order is the unallocated order. If it is less than the lower limit of the number of allocations, it will not be possible to set the number of allocations for inventory lots to more than the lower limit of the number of allocations for unallocated orders at the next allocation processing. In order to avoid such a situation, the following modification step is performed so that the inventory lot can be allocated to the unallocated order at the next allocation process.

That is, any of the reserved orders so that the value obtained by subtracting the total number of stock lots allocated to the ordered order from the upper limit of the ordered quantity of the ordered order is equal to or greater than the lower limit of the allocated number of unallocated orders. Or subtract the number of reserves for one or more inventory lots. By subtracting the number of reserved inventory lots from the unallocated order in this way, there is room for the number of allocations so that the inventory lot can be allocated to the unallocated order at the next allocation process. Can be done. If, as a result of subtracting the number of allocations for inventory lots, the total number of allocations for all inventory lots included in the inventory group including the subtracted inventory lots is less than the lower limit for the number of allocations for unallocated orders. Set the allocation number of all inventory lots included in the inventory group to 0.

As for the subtraction of the allocation number here, it is preferable to perform the allocation number of any one inventories allocated to the unallocated order one by one. By gradually reducing the number of allocations for inventory lots in this way, the number of allocations after subtraction is the lower limit of the total number of allocations for all inventory lots included in the inventory group allowed for order orders. Since it is less likely to be less than the value, it is possible to prevent the number of allocations from being excessively subtracted. The first allocation combination solution can be created by modifying the allocation number as described above.

(Step S2: Creation of second allocation combination solution (second step))
In step S2, the second allocation combination solution creation unit 43 changes each order order based on the priority order parameter and the priority inventory parameter in which at least one of the priority order parameter and the priority inventory parameter used in the first step is changed. Create a second allocation combination solution that sets the allocation number of each inventory lot to be allocated to. For example, when the delivery date of an order is used as the priority order parameter in the first process, the order quantity of the order is used as the priority order parameter in the second process, or the inventory item is used as the priority inventory parameter in the first process. When the number of lots in stock is used, the manufacturing date of the stock lot is used as the priority stock parameter in the second step.

The second allocation combination solution creation unit 43 is the same as the first allocation combination solution except that at least one of the priority order parameter and the priority inventory parameter is changed as described above. To create. In this way, by creating the second allocation combination solution with a combination different from the case where the first allocation combination solution is created for at least one of the priority order parameter and the priority inventory parameter, a matrix different from the first allocation combination solution is created. A second allocation combination solution can be obtained.

(Step S3: Comparison of evaluation values)
In step S3, the evaluation value comparison unit 44 calculates the evaluation value EV1 of the first allocation combination solution and the evaluation value EV2 of the second allocation combination solution based on the predetermined evaluation function. Both the evaluation value EV1 and the evaluation value EV2 calculated here are specified by specific numerical values, and the higher the numerical value, the closer to the optimum solution. The evaluation function here is preferably set based on the priority of the sales order, the priority of the inventory lot, the ratio of the allocation completed orders, and the number of inventories of the inventories after the allocation process, and more preferably the following. The evaluation function F represented by the formula (I) is used.

Here, in the above formula (I), x _i is a priority to be assigned to the order order i among the order orders of N (N is an integer of 2 or more) types, and y _j is the M (M is a natural number) type. Of the inventory lots of the above, the inventory lot j is the priority to be assigned, _{ai and j} are the allocation number of the inventory lot j to be allocated to the order i, and α is according to each order. The correction coefficient is set, β is the correction coefficient set according to each inventory lot, X is the ratio (%) of the allocation completion order to all the order orders in the allocation combination solution, and Y is. This is the total amount of inventories in stock after the lot of inventories has been allocated.

In order to increase the evaluation value of the allocation combination solution, as shown in the above formula (I), the larger the number of inventory lots allocated to the high-priority order order, the higher the priority inventory. It is preferable that the number of lots allocated increases, the ratio of allocation completion orders increases, and the total number of inventories of inventories lots after the allocation ends is small, and it is important to balance the above conditions. Therefore, for example, even if a high-priority inventory lot can be assigned to a high-priority order, the evaluation value may not be high if the ratio of the allocation completion order is low, and the allocation completion order may not be high. Even if the ratio is slightly inferior, the valuation value may be high if the number of inventories in the inventory lot after the allocation process is significantly reduced.

The priority of the above-mentioned order is set based on the conditions (for example, required performance, specifications, application, size, etc.) related to the product manufactured by each order, and the priority of the inventory lot is each. It is set based on the conditions related to the inventory lot (quality, raw materials, expiration date, use, shape, etc.). The ratio (%) of the allocation completed orders in the above formula (I) is a percentage of the number of allocation completed orders to all the ordered orders included in the allocation combination solution.

If the difference between the ratio of the allocation completion order of the allocation combination solution S1 and the ratio of the allocation completion order of the allocation combination solution S2 is larger than the predetermined value α in the two types of allocation combination solutions S1 and S2 to be compared, Regardless of the value of the evaluation function, the solution having the higher ratio of the allocation completion orders can be adopted as the allocation combination solution. Then, for the allocation combination solution in which the allocation completion order can be significantly improved, the local search in steps S15 and S16 described later is executed to create an allocation combination solution in which the number of allocations is locally changed, and then this local allocation solution is created. The evaluation value of the allocation combination solution changed to is calculated by the above evaluation function, and if the evaluation value exceeds the evaluation value of the best solution of the allocation combination solution calculated so far, the solution is allocated combination. It can be set as a solution.

As a variable factor other than the evaluation function represented by the above formula (I), for example, the number of inventories of the inventory lot after the allocation process may be added. For example, if the number of inventories of the inventory lot after the allocation process is too small, it is difficult to allocate only the small amount of the inventory lot at the next allocation process, which is not preferable.

(Step S4: Allocation combination solution setting (third step))
The evaluation value comparison unit 44 compares the evaluation value EV1 of the first allocation combination solution with the evaluation value EV2 of the second allocation combination solution, and the allocation combination solution setting unit 45 allocates a solution showing a better evaluation value. Set to a combinatorial solution. By setting the allocation combination solution in this way, the first allocation combination solution and the second allocation combination solution can be compared, and the superior solution can be set as the allocation combination solution. The evaluation value can be increased. As a result, step S4 is completed, and the process proceeds to step S5.

(Step S5: Setting the number of loops)
In step S5, the counter unit 46 sets the value of the counter n indicating the number of times (the number of loops) for which the provisional allocation combination solution is set to 0. The value of the counter n means the number of times that the provisional allocation combination solution is set. However, in the stage of step S5 after step S4, the allocation number has never been rewritten for the allocation combination solution, so that the counter unit 46 sets the value of the counter n to 0. By setting the counter n, step S5 is completed, and the control processing unit 14 proceeds to the process of step S6.

(Step S6: Loop determination)
In step S6, the counter success / failure determination unit 47 compares the value of the counter n with the loop number setting value K, and determines whether or not the value of the counter n is the loop number setting value K. When the value of the counter n is the loop number setting value K (S6: Yes), the counter success / failure determination unit 47 determines that the currently set allocation combination solution is the optimum solution, and the control processing unit 14 determines the allocation combination solution. End rewriting (end). On the other hand, when the value of the counter n has not reached the loop number setting value K (S6: No), the counter unit 46 performs step S7 in which the value of the counter n is incremented by one. As a result, step S7 is completed, and the control processing unit 14 proceeds to the process of step S8.

(Step S8: Creation of provisional allocation combination solution (4th step))
In step S8, the provisional allocation combination solution creation unit 48 changes at least one of the priority order parameter and the priority inventory parameter used in the first step and the second step to the priority order parameter and the priority inventory parameter. Based on this, create a provisional allocation combination solution that sets the allocation number of each inventory lot to be allocated to each order. In this way, each in-stock item lot assigned to each order using the combination of the priority order parameter and the priority inventory parameter, which is different from the combination of the priority order parameter and the priority inventory parameter used in the first step or the second step. By setting the number of allocations in, the provisional allocation combination solution creation unit 48 can create a provisional allocation combination solution in which a combination of the number of allocations other than the first allocation combination solution and the second allocation combination solution is set.

(Step S9: Comparison of evaluation values)
In step S9, the evaluation value comparison unit 44 calculates the evaluation value of the provisional allocation combination solution prepared above by using the evaluation function represented by the above equation (I), and provisionally sets the evaluation value EV3 of the provisional allocation combination solution. The evaluation value EV4 of the allocation combination solution is compared, and when the evaluation value EV4 is less than the evaluation value EV3 (S9: No), it is determined to return to the process of step S5 without changing the allocation combination solution. On the other hand, when the evaluation value EV4 is the evaluation value EV3 or more (S9: Yes), the evaluation value comparison unit 44 determines to proceed to the process of step S10, and the allocation combination solution update unit 49 determines the provisional allocation combination solution in step S10. Rewrite with a new allocation combination solution. By rewriting the allocation combination solution in this way, the allocation number of each inventory lot for each order of the allocation combination solution can be brought closer to the optimum solution. As a result, step S10 is completed, and the process returns to step S5. As described above, each step of steps S5 to S10 is repeated, and after the value of the counter n reaches the loop number setting value K, in step S6, the counter success / failure determination unit 47 determines that the control processing unit 14 finishes the process. (End).

When step S8 is executed a plurality of times while repeating the loop of steps S5 to S10, it is preferable that at least one of the priority order parameter and the priority inventory parameter is different for each step S8, for example, the priority order is received. Create a provisional allocation combination solution by changing only the priority stock parameters without changing the parameters, and after changing all the priority stock parameters, change the priority order parameters and similarly the priority stock parameters. It is preferable to change the combination of each priority order parameter and priority inventory parameter, such as changing in order. Of course, the combination of the priority order parameter and the priority inventory parameter may be randomly changed for each step S8 while repeating the loop of steps S5 to S10.

In step S8 (fourth step), it is preferable to set a provisional allocation combination solution for all combinations of the priority order parameter and the priority inventory parameter. For example, if 5 types of priority order parameters and 5 types of priority inventory parameters are preset, it is based on 25 5 × 5 priority order parameters and priority inventory parameters, which are all combinations thereof. It is preferable to set 25 types of provisional allocation combination solutions, and set the solution having the maximum evaluation value among them as the allocation combination solution. By setting the provisional allocation combination solution for all combinations in this way, it is possible to obtain an allocation combination solution in which a more suitable number of allocations is set.

By executing the following local search for the allocation combination solution created by each of the above steps, the allocation combination solution is made a better evaluation value. FIG. 3 is a flowchart showing a procedure for local search in the inventory allocation method according to the first embodiment.

(Step S11: Setting of allocation combination solution)
In step S11, the allocation combination solution obtained by the overall search (S1 to S10) is set as the initial solution of the local search. By setting the initial solution in this way, step S11 is completed, and the control processing unit 14 proceeds to the process of step S12.

(Step S12: Setting the number of loops)
In step S12, the counter unit 46 sets the value of the counter n, which indicates the number of times the local change allocation combination solution is created, to 0. The value of the counter n means the number of times that the provisional allocation combination solution is set, but since the allocation number has never been rewritten at the stage of step S12, the counter unit 46 sets the value of the counter n to 0. .. By setting the counter n, step S12 is completed, and the control processing unit 14 proceeds to the process of step S13.

(Step S13: Loop determination)
In step S13, the counter success / failure determination unit 47 compares the value of the counter n with the loop number setting value L, and determines whether or not the value of the counter n is the loop number setting value L. When the value of the counter n is the loop number setting value L (S13: Yes), the counter success / failure determination unit 47 determines that the currently set allocation combination solution is the optimum solution, and the control processing unit 14 determines the allocation combination solution. End rewriting (end). On the other hand, when the value of the counter n has not reached the loop number setting value L (S13: No), the counter unit 46 performs step S14 for incrementing the value of the counter n by one. As a result, step S14 is completed, and the control processing unit 14 proceeds to the process of step S15.

(Step S15: Change of specific allocation number: 6th step)
In step S15, the local change allocation solution creation unit 50 creates a local change allocation combination solution in which the allocation number of any one kind of inventory lot for any one kind of order in the allocation combination solution is changed. Here, the method of selecting an inventory lot for changing the specific number of reserves of 1 is not particularly limited, and any 1 order is randomly selected from all the order orders, and the selected order order is selected. Any one inventory lot may be randomly selected from all the inventory lots that can be allocated. The changed number of allocations here has been changed to meet various constraint conditions, and if it becomes necessary to change the number of allocations for another inventory lot in response to this change, the number of allocations will be newly added. change. Step S15 is completed by changing the number of allocations, and the control processing unit 14 proceeds to the process of step S16.

When step S15 is executed a plurality of times while repeating the loop of steps S13 to S16, it is preferable that at least one of the ordered order or the inventory lot of the reserved number to be changed is different for each step S15. For each step S15, the combination of the order to be changed and the inventory lot may be randomly set.

(Step S16: Comparison of evaluation values)
In step S16, the evaluation value comparison unit 44 sets the evaluation value EV5 of the allocation combination solution set by the global search and the evaluation value EV6 of the local change allocation combination solution set in step S15 based on the predetermined evaluation function. calculate. As the evaluation function for calculating the evaluation value here, the same evaluation function F used in steps S3 and S9 can be used.

The evaluation value comparison unit 44 compares the evaluation value EV5 of the allocation combination solution with the evaluation value EV6 of the locally changed allocation combination solution, and when the evaluation value EV6 is less than the evaluation value EV5 (S16: No), the allocation combination solution is selected. The process returns to step S13 without any change. On the other hand, when the evaluation value EV6 is the evaluation value EV5 or more (S16: Yes), the evaluation value comparison unit 44 determines to proceed to the process of step S17, and the allocation combination solution update unit 49 determines that the local change allocation combination solution is performed in step S17. Is rewritten as a new allocation combination solution. By rewriting the allocation combination solution in this way, the allocation number of each inventory item for each product of the allocation combination solution can be brought close to the optimum solution. As a result, step S17 is completed, and the process returns to step S13. As described above, each step of step S13 to step S17 is repeated, and after the value of the counter n reaches the loop number setting value K, in step S13, the control processing unit 14 determines that the processing is completed by the counter success / failure determination unit 47. (End).

<Inventory allocation system of the second embodiment>
FIG. 4 is a diagram showing a configuration of an inventory allocation system that executes the inventory allocation method of the second embodiment. As shown in FIG. 4, the inventory allocation system 1 of the second embodiment includes an input unit 11, an output unit 12, a storage unit 13, and a control processing unit 14. The storage unit 13 stores the control processing program of the second embodiment such as the inventory allocation program of the second embodiment.

When the control processing program of the second embodiment stored in the storage unit 13 is executed in the control processing unit 14, the control unit 41 and the first allocation combination solution creation unit 42 are as shown in FIG. , Second allocation combination solution creation unit 43, evaluation value comparison unit 44, allocation combination solution setting unit 45, counter unit 46, counter success / failure judgment unit 47, provisional allocation combination solution creation unit 48, allocation combination solution update unit 49, local change The solution creation unit 50, the time determination unit 51, and the loop number setting unit 52 are functionally configured.

The control unit 41 controls each unit 42 to 50, executes a total search, and then performs a solution search process for executing a local search. The time determination unit 51 counts the execution time of the solution search process. The time determination unit 51 determines whether or not the execution time of the solution search process exceeds a predetermined time when one solution search process is completed.

When the time determination unit 51 determines that the execution time of the solution search process does not exceed the predetermined time, the control unit 41 performs the solution search process again. When the time determination unit 51 determines that the execution time of the solution search process exceeds the predetermined time, the control unit 41 ends without performing the solution search process.

The loop number setting unit 52 sets the number of loops in the overall search of the second embodiment based on the loop number information 500 (FIG. 5) stored in the solution search condition database 33. The number of loops is the number of times the loops of steps S71, S7, S8, S9, and S10 of FIG. 7, which will be described later, are executed.

FIG. 5 is a diagram schematically showing an example of loop count information 500 stored in the solution search condition database 33 of the second embodiment. As shown in FIG. 5, in the loop count information 500, the loop count K (Ns) is determined according to the search count Ns. The number of searches Ns represents the number of times the solution search process is performed.

Further, in the loop number information 500, when the number of searches is the first time (that is, Ns = 1), the number of loops K (Ns) is determined according to the number of ordered orders N. That is, when the number of ordered orders N is 500 or more, the number of loops K (1) is set to 50, and when the number of ordered orders N is less than 500 and 300 or more, the number of loops K (1) is set to 30. When the number of ordered orders N is less than 300, the number of loops K (1) is set to 10.

When the number of searches is the second or later, the number of loops K (Ns) is defined regardless of the number of ordered orders N. That is, in the second embodiment, when the number of searches is the second time (that is, Ns = 2), the number of loops K (2) is set to 5, for example, regardless of the number of ordered orders N, and the number of searches is the third and subsequent times. When (that is, Ns ≧ 3), the number of loops K (Ns) is set to 1, for example, regardless of the number of ordered orders N.

In the present embodiment, the number of loops K (Ns) corresponds to an example of the number of first loops. The order number N = 500 corresponds to an example of the threshold value, the loop number K (1) = 50 corresponds to an example of the first number value, and the loop number K (1) = 30 corresponds to the second number value. Corresponds to one example. The order number N = 300 corresponds to an example of the threshold value, the loop number K (1) = 30 corresponds to an example of the first number value, and the loop number K (1) = 10 corresponds to the second number value. Corresponds to one example.

FIG. 6 is a flowchart showing the procedure of the inventory allocation method in the second embodiment. In step S60, the control unit 41 sets the number of searches Ns to 1. In step S61 (counting start step), the time determination unit 51 starts counting the elapsed time. In step S62, the control unit 41 controls each unit 42 to 50 to execute the overall search process (FIG. 7 described later).

In step S63, the control unit 41 controls each unit 42 to 50 to execute the local search process. The local search process of the second embodiment is the same as that of the first embodiment shown in FIG. In the local search process of the second embodiment, the loop number setting value L is set to a constant value (for example, 3 in this embodiment). In this second embodiment, steps S62 (total search process) to S63 (local search process) correspond to an example of the solution search process.

In step S64, the control unit 41 stores the allocation combination solution obtained in step S63 in the storage unit 13. In step S65 (time determination step), the time determination unit 51 determines whether or not the elapsed time exceeds the predetermined time. The predetermined time is stored in, for example, the solution search condition database 33. If the time determination unit 51 determines that the elapsed time does not exceed the predetermined time (No in step S65), the process proceeds to step S66. On the other hand, if the time determination unit 51 determines that the elapsed time exceeds the predetermined time (Yes in step S65), the process proceeds to step S67.

In step S66, the control unit 41 increments the number of searches Ns by 1, the process returns to step S62, and the solution search process including the total search process (step S62) and the local search process (step S63) is executed again. .. That is, at the end of the solution search process, if a predetermined time has not elapsed from the start of the solution search process, the solution search process is newly started. On the other hand, at the end of the solution search process, if a predetermined time has elapsed from the start of the solution search process, the solution search process is not newly started.

In step S67, the control unit 41 determines whether or not two or more allocation combination solutions are stored in the storage unit 13, that is, whether or not the solution search process is performed twice or more. If only one allocation combination solution is stored in the storage unit 13 (No in step S67), the process proceeds to step S68. On the other hand, if two or more allocation combination solutions are stored in the storage unit 13 (Yes in step S67), the process proceeds to step S69.

In step S68 (first output step), the control unit 41 outputs the allocation combination solution stored in the storage unit 13 to the output unit 12, and the process of FIG. 6 ends. In step S69 (second output step), the evaluation value comparison unit 44 uses the evaluation function F to calculate and calculate the evaluation values of two or more allocation combination solutions stored in the storage unit 13, respectively. The evaluation values are compared, the allocation combination solution having the highest evaluation value is output to the output unit 12, and the process of FIG. 6 ends. When the output unit 12 is a display device, the control unit 41 may display the allocation combination solution on the output unit 12. When the output unit 12 is a printing device, the control unit 41 may print the allocation combination solution by the output unit 12.

FIG. 7 is a flowchart showing a procedure for a general search among the inventory allocation methods in the second embodiment. Steps S1 to S4 are the same as steps S1 to S4 in FIG. In step S70 (setting step) following step S4, the loop number setting unit 52 sets the loop number K (Ns). The number of searches Ns is set in step S60 or step S65 of FIG.

In the first solution search process, Ns is set to 1 in step S60 of FIG. If Ns is 1, the loop number setting unit 52 reads the order number N from the information stored in the product information database 31. The loop number setting unit 52 sets the loop number K (Ns) from the read order number N and the loop number information 500 stored in the solution search condition database 33. For example, if the number of ordered orders N is 450, the number of loops K (Ns) is set to 30.

From the second time onward of the solution search process, Ns is set in step S65 of FIG. If Ns is 2, the loop count setting unit 52 sets the loop count K (Ns) to 5 from the loop count information 500 stored in the solution search condition database 33. If Ns is 3 or more, the loop count setting unit 52 sets the loop count K (Ns) to 1 from the loop count information 500 stored in the solution search condition database 33. Step S5 following step S70 is the same as step S5 in FIG.

In step S71 following step S5, the counter success / failure determination unit 47 compares the value of the counter n with the number of loops K (Ns), and determines whether or not the value of the counter n is equal to the number of loops K (Ns). .. If the value of the counter n is equal to the number of loops K (Ns) (Yes in step S6), the counter success / failure determination unit 47 determines that the currently set allocation combination solution is the optimum solution, and the process of FIG. 7 ends. do. On the other hand, if the value of the counter n is not equal to the number of loops K (Ns) (No in step S6), the process proceeds to step S7. Steps S7 to S10 are the same as steps S7 to S10 in FIG. When step S10 is completed, the process returns to step S71.

As described above, in the second embodiment, when the number of searches Ns is the first time, the number of loops K (Ns) of the total search process is determined according to the number of orders N. Thereby, the loop number K (Ns) of the total search process can be set to an appropriate value according to the order number N.

It has been empirically found that when the number of searches Ns is the second or later, the frequency of updating the allocation combination solution is low even if the number of loops of the total search process is increased. Therefore, in the second embodiment, when the number of searches Ns is the second time, the number of loops K (Ns) of the total search process is set to 5 regardless of the number of orders N, and when the number of searches Ns is the third or later. Sets the number of loops K (Ns) of the total search process to 1 regardless of the number of ordered orders N. As a result, according to the second embodiment, it is possible to prevent the total search processing time from becoming unnecessarily long without lowering the calculation accuracy of the allocation combination solution.

Further, in the second embodiment, in step S65 (FIG. 6), it is determined whether or not the elapsed time from the start of the solution search process exceeds the predetermined time, and if the predetermined time has elapsed, the solution search is performed. Do not start a new process. As a result, it is possible to prevent the execution time of the solution search process from becoming excessively long.

<Modified example of the embodiment>
In the first embodiment, the allocation combination solution is searched for until the value of the counter n becomes the loop number setting value K in the whole search process and until the value of the counter n becomes the loop number setting value L in the local search process. However, the case is not limited to this. In the whole search process and the local search process, the allocation combination solution may be searched until the evaluation value becomes a predetermined value or more, or the loop may be repeated until the predetermined time is reached.

In the first and second embodiments, the order of setting the allocation number in the first allocation combination solution and the second allocation combination solution is to set the allocation number of the inventory lot in order from the order with the highest priority. However, the number of allocations to be allocated to the order may be set in order from the stock lot with the highest priority.

The loop number K (Ns) in the loop number information 500 (FIG. 5) of the second embodiment is an example, and is not limited to this. For example, the number of loops K (Ns) when the number of searches Ns is 1 may be set to 10% of the number of ordered orders N. In this case, the numbers after the decimal point may be rounded off.

In the second embodiment, the predetermined time used for the determination in step S64 (FIG. 6) is stored in the solution search condition database 33, but is not limited to this. For example, the input unit 11 may be used to allow the user to set a predetermined time to a desired time.

<Others>
In order to express the present invention, the present invention has been appropriately and sufficiently described through the embodiments with reference to the drawings described above, but those skilled in the art can easily change and / or improve the above-described embodiments. It should be recognized that it can be done. Therefore, unless the modified or improved form implemented by a person skilled in the art is at a level that deviates from the scope of rights of the claims stated in the claims, the modified form or the improved form is the scope of rights of the claims. It is interpreted as being comprehensively included in.

11 Input unit 12 Output unit 13 Storage unit 14 Control processing unit 31 Product information database 32 Stock item information database 33 Solution search condition database 41 Control unit 42 1st allocation combination solution creation unit 43 2nd allocation combination solution creation unit 44 Evaluation value comparison Part 45 Allocation combination solution setting part 46 Counter part 47 Counter success / failure judgment part 48 Temporary allocation combination solution creation part 49 Allocation combination solution update part 50 Local change solution creation part 51 Time judgment part 52 Loop count setting part

Claims (11)

The number of allocations for each inventory lot is assigned to each order for which the order quantity of one or more inventory lots required for each product to produce two or more products of the same or different types is defined. It is the inventory allocation method to decide
Each of the ordered orders has two or more preset priority order parameters that determine the priority of the ordered orders to which each inventory lot should be assigned.
Each of the inventory lots has two or more preset priority inventory parameters that determine the priority of the inventory lots to be assigned to each sales order.
Set the allocation number of each inventory lot to be assigned to each sales order based on any 1 priority order parameter of the priority order parameter and any 1 priority inventory parameter of the priority inventory parameter. The first step of creating the first allocation combination solution
Of each inventory lot assigned to each order based on the priority order parameter and the priority inventory parameter in which at least one of the priority order parameter or the priority inventory parameter used in the first step is changed. The second step of creating a second allocation combination solution with the number of allocations set, and
The third step of comparing the first allocation combination solution and the second allocation combination solution based on the evaluation function and setting a solution showing a better evaluation value as the allocation combination solution.
A sixth step of creating a locally modified allocation combination solution in which the number of allocations of any one type of inventory lot is changed for any one order in the allocation combination solution.
The evaluation value of the allocation combination solution and the evaluation value of the local change allocation combination solution are calculated by using the evaluation function, and when the evaluation value of the local change allocation combination solution is less than the evaluation value of the allocation combination solution, the allocation Including the seventh step of rewriting the local change allocation combination solution to a new allocation combination solution when the evaluation value of the local change allocation combination solution is equal to or higher than the evaluation value of the allocation combination solution without changing the combination solution.
An inventory allocation method in which the sixth step and the seventh step are performed one or more times. Allocate to each order based on the priority order parameter and the priority inventory parameter in which at least one of the priority order parameter or the priority inventory parameter used in the first step or the second step is changed. The fourth step of creating a provisional allocation combination solution that sets the allocation number of each inventory lot, and
The allocation combination solution and the provisional allocation combination solution are compared based on the evaluation function, and when the evaluation value of the provisional allocation combination solution is less than the evaluation value of the provision combination solution, the allocation combination solution is not changed. Including the fifth step of rewriting the provisional allocation combination solution to a new allocation combination solution when the evaluation value of the provisional allocation combination solution is equal to or higher than the evaluation value of the provision combination solution.
The inventory allocation method according to claim 1, wherein the fourth step and the fifth step are performed one or more times each. The number of allocations for each inventory lot is assigned to each order for which the order quantity of one or more inventory lots required for each product to produce two or more products of the same or different types is defined. It is the inventory allocation method to decide
Each of the ordered orders has two or more preset priority order parameters that determine the priority of the ordered orders to which each inventory lot should be assigned.
Each of the inventory lots has two or more preset priority inventory parameters that determine the priority of the inventory lots to be assigned to each sales order.
Set the allocation number of each inventory lot to be assigned to each sales order based on any 1 priority order parameter of the priority order parameter and any 1 priority inventory parameter of the priority inventory parameter. The first step of creating the first allocation combination solution
Of each inventory lot assigned to each order based on the priority order parameter and the priority inventory parameter in which at least one of the priority order parameter or the priority inventory parameter used in the first step is changed. The second step of creating a second allocation combination solution with the number of allocations set, and
The third step of comparing the first allocation combination solution and the second allocation combination solution based on the evaluation function and setting a solution showing a better evaluation value as the allocation combination solution.
Allocate to each order based on the priority order parameter and the priority inventory parameter in which at least one of the priority order parameter or the priority inventory parameter used in the first step or the second step is changed. The fourth step of creating a provisional allocation combination solution that sets the allocation number of each inventory lot, and
The allocation combination solution and the provisional allocation combination solution are compared based on the evaluation function, and when the evaluation value of the provisional allocation combination solution is less than the evaluation value of the provision combination solution, the allocation combination solution is not changed. The fifth step of rewriting the provisional allocation combination solution to a new allocation combination solution when the evaluation value of the provisional allocation combination solution is equal to or higher than the evaluation value of the provision combination solution.
A sixth step of creating a locally modified allocation combination solution in which the number of allocations of any one type of inventory lot is changed for any one order in the allocation combination solution.
The evaluation value of the allocation combination solution and the evaluation value of the local change allocation combination solution are calculated by using the evaluation function, and when the evaluation value of the local change allocation combination solution is less than the evaluation value of the allocation combination solution, the allocation Including the seventh step of rewriting the locally changed allocation combination solution to a new allocation combination solution when the evaluation value of the locally changing allocation combination solution is equal to or greater than the evaluation value of the allocation combination solution without changing the combination solution.
The process of executing the first step, the second step, and the third step, and then executing the fourth step and the fifth step the first loop number of times is defined as a total search process.
The process of executing the sixth step and the seventh step the second loop number of times is defined as a local search process.
After executing the whole search process, the solution search process for executing the local search process is performed one or more times.
The inventory allocation method further
When the solution search process is performed once, it includes a first output step of outputting the allocation combination solution obtained in the solution search process.
When the solution search process is performed two or more times, the evaluation values of the allocation combination solutions obtained by the solution search process two or more times are calculated by using the evaluation function, and each of the calculated values is calculated. A second output step of comparing the evaluation values with each other and outputting the allocation combination solution having the highest evaluation value is included.
Inventory reserve method. The overall search process includes a setting step of setting the number of times of the first loop in the first solution search process according to the number of ordered orders.
The inventory allocation method according to claim 3. In the setting step, when the number of ordered orders is equal to or greater than a predetermined threshold value, the number of first loops in the first solution search process is set to the first number value, and when the number of ordered orders is less than the threshold value. The number of times of the first loop in the first solution search process is set to a second number value less than the first number value.
The inventory allocation method according to claim 4. In the setting step, the number of times of the first loop in the second and subsequent solution search processes is set to a constant value less than the number of times of the first loop in the first solution search process.
The inventory allocation method according to claim 4 or 5. A counting start step of starting counting of elapsed time when starting the solution search process, and
Includes a time determination step of determining whether or not the elapsed time exceeds a predetermined time when the solution search process is completed.
In the time determination step, if it is determined that the elapsed time does not exceed the predetermined time, the solution search process is newly started, and if it is determined that the elapsed time exceeds the predetermined time, the solution is determined. The search process is not started anew,
The inventory allocation method according to any one of claims 3 to 6. The evaluation function determines the priority for which each inventory lot should be assigned to each order, and the number of inventory lots allocated that satisfy the order quantity of the order for all orders in the allocation combination solution. The inventory allocation method according to any one of claims 1 to 7, wherein the ratio of the set allocation completion order and the inventory amount of the inventory item lot are used as variable factors. The inventory allocation method according to claim 8, wherein the evaluation function is an evaluation function F represented by the following formula (I).

In the formula (I), x _i is a priority to be assigned to the order order i among the order orders of N (N is an integer of 2 or more) types, and y _j is an inventory product of M (M is a natural number) type. Of the lots, the inventory lot j is the priority to be assigned, _{ai and j} are the allocation numbers of the inventory lot j to be allocated to the order i, and α is set according to each order. The correction coefficient, β is the correction coefficient set according to each inventory lot, X is the ratio (%) of the allocation completion order to all the order orders in the allocation combination solution, and Y is the inventory lot. It is the total amount of inventories of the inventories after allocating. The number of allocations for each inventory lot is assigned to each order for which the order quantity of one or more inventory lots required for each product to produce two or more products of the same or different types is defined. It is an inventory allocation device to decide
Each of the ordered orders has two or more preset priority order parameters that determine the priority of the ordered orders to which each inventory lot should be assigned.
Each of the inventory lots has two or more preset priority inventory parameters that determine the priority of the inventory lots to be assigned to each sales order.
Set the allocation number of each in-stock item lot to be assigned to each order based on the priority order parameter of any one of the priority order parameters and the priority inventory parameter of any one of the priority inventory parameters. The first allocation combination solution creation unit that creates the first allocation combination solution
Each assigned to each order based on the priority order parameter and the priority inventory parameter in which at least one of the priority order parameter or the priority inventory parameter used in the first allocation combination solution creation unit is changed. A second allocation combination solution creation unit that creates a second allocation combination solution that sets the number of allocations for stock lots, and a second allocation combination solution creation unit.
An evaluation value comparison unit that compares the first allocation combination solution and the second allocation combination solution based on the evaluation function.
The allocation combination solution setting unit that sets the solution showing the better evaluation value of the first allocation combination solution and the second allocation combination solution compared by the evaluation value comparison unit as the allocation combination solution, and the allocation combination solution setting unit.
A local change allocation combination solution creation unit that performs the sixth step of creating a local change allocation combination solution in which the number of allocations of any one type of inventory lot is changed for any one order in the allocation combination solution.
The evaluation value of the allocation combination solution and the evaluation value of the local change allocation combination solution are calculated by using the evaluation function, and when the evaluation value of the local change allocation combination solution is less than the evaluation value of the allocation combination solution, the allocation With the rewriting unit that performs the seventh step of rewriting the locally changed allocation combination solution to a new allocation combination solution when the evaluation value of the locally changing allocation combination solution is equal to or greater than the evaluation value of the allocation combination solution without changing the combination solution. , Including
An inventory allocation device that performs the sixth step and the seventh step one or more times. The number of allocations for each inventory lot is assigned to each order for which the order quantity of one or more inventory lots required for each product to produce two or more products of the same or different types is defined. It is an inventory allocation device to decide
Each of the ordered orders has two or more preset priority order parameters that determine the priority of the ordered orders to which each inventory lot should be assigned.
Each of the inventory lots has two or more preset priority inventory parameters that determine the priority of the inventory lots to be assigned to each sales order.
Set the allocation number of each inventory lot to be assigned to each sales order based on any 1 priority order parameter of the priority order parameter and any 1 priority inventory parameter of the priority inventory parameter. The first allocation combination solution creation unit that performs the first step to create the first allocation combination solution
Each assigned to each order based on the priority order parameter and the priority inventory parameter in which at least one of the priority order parameter or the priority inventory parameter used in the first allocation combination solution creation unit is changed. The second allocation combination solution creation unit that performs the second step of creating the second allocation combination solution that sets the allocation number of stock lots, and
An evaluation value comparison unit that performs the third A step of comparing the first allocation combination solution and the second allocation combination solution based on the evaluation function.
Provision combined solution set intends row better the 3B step of the solution indicating the evaluation value is set to reserve the combination solution of the compared first reserve combined solution and the second reserve combined solution by the evaluation value comparison unit Department and
Allocate to each order based on the priority order parameter and the priority inventory parameter in which at least one of the priority order parameter or the priority inventory parameter used in the first step or the second step is changed. A provisional allocation combination solution creation unit that performs the fourth step of creating a provisional allocation combination solution that sets the number of allocations for each inventory lot,
The allocation combination solution and the provisional allocation combination solution are compared based on the evaluation function, and when the evaluation value of the provisional allocation combination solution is less than the evaluation value of the provision combination solution, the allocation combination solution is not changed. The first rewriting unit that performs the fifth step of rewriting the provisional allocation combination solution to a new allocation combination solution when the evaluation value of the provisional allocation combination solution is equal to or higher than the evaluation value of the provision combination solution.
A local change allocation combination solution creation unit that performs the sixth step of creating a local change allocation combination solution in which the number of allocations of any one type of inventory lot is changed for any one order in the allocation combination solution.
The evaluation value of the allocation combination solution and the evaluation value of the local change allocation combination solution are calculated by using the evaluation function, and when the evaluation value of the local change allocation combination solution is less than the evaluation value of the allocation combination solution, the allocation The second rewriting that performs the seventh step of rewriting the locally changed allocation combination solution to a new allocation combination solution when the evaluation value of the local change allocation combination solution is equal to or greater than the evaluation value of the allocation combination solution without changing the combination solution. Including the part
The first step, the second step, before Symbol a 3 A step, and executing the first 3B step, followed by the fourth step and the fifth step process to be executed first loop count, overall search process Defined as
The process of executing the sixth step and the seventh step the second loop number of times is defined as a local search process.
After executing the whole search process, the solution search process for executing the local search process is performed one or more times.
Further, when the solution search process is performed once, the allocation combination solution obtained by the solution search process is output, and when the solution search process is performed twice or more, the two or more times are output. The evaluation values of the allocation combination solutions obtained in the solution search process are calculated by using the evaluation function, the calculated evaluation values are compared with each other, and the allocation combination solution having the highest evaluation value is output. An inventory allocation device that includes an output unit.

Images