JP2008276486A - Item distribution system and method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To properly distribute various types of merchandise to a plurality of retail stores. <P>SOLUTION: This item distribution system is configured to distribute whole or a portion of p types of items to first or q-th reception means, and provided with a storage means for storing the total number of items and the number of items to be received by each reception means; an initial condition setting means for reading and setting initial conditions; a configuration ratio calculation means for calculating a horizontal configuration ratio and a vertical configuration ratio, and for calculating the configuration ratio of components a<SB>mn</SB>as the product of the calculated horizontal configuration ratio and the vertical configuration ratio; a proportional division means for proportionally dividing numerics into components a<SB>mn</SB>; and an adjusting means for adjusting the excess and deficiency of the numerics proportionally divided into the components a<SB>mn</SB>by the proportional division means. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention generally relates to a product distribution system and method, and more particularly, to a system and method for appropriately distributing various types of products to a plurality of retail stores. Furthermore, the present invention provides a system and method for distributing various types of articles to a specific warehouse or a specific storage location of one warehouse according to storage capacity, and various personnel according to their roles and suitability. It has the potential to be applied in many fields, such as systems and methods for allocating to departments.

  Let's consider an example where a company that handles many types of products has a large number of stores in the retail industry. At present, there are so many examples, and typical examples such as a supermarket, a convenience store, a 100-yen shop, a clothing store, a bookstore, a CD shop, a mobile phone store, and a drug store can be considered immediately. As is clear from these examples, the types of products to be allocated are enormous, and the number of products that can be allocated varies from product to product. In addition, the scale of the stores is also different. In such a case, it is a difficult problem to determine how many products should be distributed to which stores.

  An object of the present invention is to solve this item allocation problem that has been difficult to solve in the past. Note that the items to which the present invention is applied are not limited to items such as merchandise, as described above, and include a wide concept including the case where a person having a specific ability is determined to be in charge of a specific job. It is.

According to the present invention, m is a positive integer from 1 to p, n is a positive integer from 1 to q, and pq non-negative integer components a _mn of a matrix of p rows and q columns (a _mn ) by determining the, all or part of the p type of item from _one of the first item T to the item of T _p pieces of the p, first receives ₁ item V the sum of p type An item distribution system is provided that distributes from a single receiving means to a qth receiving means for receiving a total of V _q items of p types. The item distribution system includes storage means for storing the total number T ₁ to T _p of each item and the number of items V ₁ to V _q received by each receiving means, and the _first to _first items stored in the storage means. initial condition setting means for reading and setting initial conditions of T ₁ to T _p that are the total number of items of _p and V ₁ to V _q received by the _first to _qth receiving means, respectively, However, between the initial condition and the non-negative integer component of the matrix, T ₁ ≧ a ₁₁ + a ₁₂ +... + A _1q , T ₂ ≧ a ₂₁ + a ₂₂ +... + A _2q,. T _p ≧ _a p1 _{+ a} p2 is _{+ ··· + a pq, V 1} = a 11 + a 21 + ··· + a p1, V 2 = a 12 + a 22 + ··· + a p2, ···, V q = _{a 1q} + _{2q +} ··· ₊ a _pq) is satisfied, the initial condition setting means, using the set initial condition by the initial condition setting means relates component a _mn of the m-th row and n columns of said matrix, horizontal The composition ratio V _n / (T ₁ + T ₂ +... + T _p ) and the composition ratio T _m / (T ₁ + T ₂ +... + T _p ) in the vertical direction are calculated, and the calculated horizontal direction Of the component a _mn , which is the product of the component ratio and the component ratio in the vertical direction (V _n / (T ₁ + T ₂ +... + T _p )) × (T _m / (T ₁ + T ₂ +) + T _p )) for calculating the composition ratio, and for each component a _mn , the product of the horizontal composition ratio and the vertical composition ratio calculated by the composition ratio computation means and the total number of each item Product (V _n / (T ₁ + T ₂ +... + T _p )) × (T _m / (T ₁ + T ₂ +... + T _p )) · (T ₁ + T ₂ +... + T _p ) = V _n · T _m / (T ₁ + T ₂ +... + T _p ) processing the decimal numerical value obtained following the apportioning means for apportioning the components a _mn in terms of the integer, the excess produced as a result of processing the decimal in the numerical values are proportionally distributed to each component a _mn by said proportional division means Adjusting means for adjusting the minutes and the under minutes so as to satisfy the relationship between the initial condition set by the initial condition setting means and the non-negative integer component of the matrix.

Further, according to the present invention, m is a positive integer from 1 to p, n is a positive integer from 1 to q, and pq non-negative integer components a _mn of a matrix of (a _mn ) in p rows and q columns are by determining using a computer, all or part of the p type of item from the first item _one T of T to _p number of items of the p, ₁ item V the sum of p type An item distribution system is provided that distributes from a first receiving means for receiving to a qth receiving means for receiving a total of p types of V _q items. The item distribution system includes storage means for storing the total number T ₁ to T _p of each item and the number of items V ₁ to V _q received by each receiving means, and the _first to _first items stored in the storage means. initial condition setting means for reading and setting initial conditions of T ₁ to T _p that are the total number of items of _p and V ₁ to V _q received by the _first to _qth receiving means, respectively, However, between the initial condition and the non-negative integer component of the matrix, T ₁ ≧ a ₁₁ + a ₁₂ +... + A _1q , T ₂ ≧ a ₂₁ + a ₂₂ +... + A _2q,. T _p ≧ _a p1 _{+ a} p2 is _{+ ··· + a pq, V 1} = a 11 + a 21 + ··· + a p1, V 2 = a 12 + a 22 + ··· + a p2, ···, V q = _{a 1q} + _{2q +} ··· ₊ a _pq) is satisfied, the initial condition setting means, using the set initial condition by the initial condition setting means relates component a _mn of the m-th row and n columns of said matrix, horizontal The composition ratio V _n / (T ₁ + T ₂ +... + T _p ) and the composition ratio T _m / (T ₁ + T ₂ +... + T _p ) in the vertical direction are calculated, and the calculated horizontal direction Of the component a _mn , which is the product of the component ratio and the component ratio in the vertical direction (V _n / (T ₁ + T ₂ +... + T _p )) × (T _m / (T ₁ + T ₂ +) + T _p )) for calculating the composition ratio, and for each component a _mn , the product of the horizontal composition ratio and the vertical composition ratio calculated by the composition ratio computation means and the total number of each item Product (V _n / (T ₁ + T ₂ +... + T _p )) × (T _m / (T ₁ + T ₂ +... + T _p )) · (T ₁ + T ₂ +... + T _p ) = V _n · T _m / (T ₁ + T ₂ +... + T _p ) decimal numbers obtained following the round-up process, a proportional division means for proportionally to each component a _mn in terms of the integer, caused as a result of rounding up the decimal point in numeric values are proportionally distributed to each component a _mn by said proportional division means Adjusting means for adjusting the excess and the under, and satisfying the relationship between the initial condition set by the initial condition setting means and the non-negative integer component of the matrix.

Furthermore, in the item distribution system according to the present invention, the adjusting means includes a ranking processing means for presetting the adjustment order of the excess and undersize, and each row and each column of each component a _mn apportioned by the apportioning means. If the sum exceeds the initial condition preset by the initial condition setting means, it follows the order set by the ranking processing means and reaches the range of the initial condition preset by the initial condition setting means. Basic adjustment means for setting each component a _mn to 1 and 0 for components exceeding the sum, and p pieces included in a column in which the sum of the components in the vertical direction is less than V _n set by the initial condition setting means In accordance with the order set by the ranking processing means, each component V _n set by the initial condition setting means Addition processing means for adding 1 to each component a _mn until equal to, q q included in a row in which the sum of the horizontal components of the matrix exceeds T _m set by the initial condition setting means In the component, according to the order set by the ranking processing means, excess relaxation means for subtracting 1 from each component a _mn, and the sum of vertical components exceeds V _n set by the initial condition setting means Subtracting 1 from each component a _mn according to the order set by the ranking processing means until it becomes equal to V _n set by the initial condition setting means, Subtracting means for making the sum of vertical components equal to V _n set by the initial condition setting means, and the sum of horizontal components is the initial condition. Identifying a first line exceeds a set T _m by matter setting means, and a second row sum of the horizontal component is T less than _m, which is set by the initial condition setting means, the the process of adding 1 to the component of the second row by subtracting 1 from the components of the first row, until the sum of the horizontal component in all rows equal to or smaller than T _m which is set by the initial condition setting means Continued swap processing means.

  Although the present invention has been grasped as an item distribution system in the above, the present invention can be grasped as an item distribution method described in claims 4 to 6 of the claims. As described in Item 7 and Item 8, a computer program for causing a computer to execute each step included in the item distribution method described in any one of Items 4 to 6 is stored. It can also be understood as a computer-readable storage medium or such a computer program itself.

1. Explanation using a specific example :
Hereinafter, the present invention will be described using an example of a process of “allocating stocks of 12 types of products to 20 stores”. In order to show the processing in the personal computer or the like of the present invention, consider a matrix on the computer display with inventory on the vertical axis (Y axis) and stores on the horizontal axis (X axis). An example of such a matrix is shown in FIG. Here, the stock means the current number of products to be allocated. Since there are 12 types of products on the vertical axis and 20 stores on the horizontal axis, the number of cells constituting this matrix is 12 × 20 = 240. As shown in FIG. 1, the items (items) have a total of 400 items from Item — 01 to Item — 12. For these stocks, the total number of input instructions is set to 50 points, 45 points, 40 points,..., 5 points from the 1st store to the 20th store. Then, by the operation of the product distribution system according to the present invention, the quantity to be distributed to each store is automatically determined for each item.

  Although the details will be described later, in the present invention, the total of 400 stocks are first divided according to the vertical composition ratio and the horizontal composition ratio to determine the value of each cell. Next, determine each rank in the order of descending numerical value (inventory) and horizontal value (number of input instructions), adjust the value of each cell according to the rank, and perform the rounding process to match the vertical and horizontal scales. Do. The above is the case where the total number of stocks is equal to the total number of input instructions. However, the present invention applies only a part rather than all of the stock, that is, the case where the total number of stocks ≧ the total number of input instructions. Can also be used.

  In the processing in the case of Example 1 according to the present invention, firstly, there are two basic points: items with a large stock are allocated at each store, and secondly, as many items as possible are allocated at each store. A policy. In addition, (1) initial processing, (2) basic adjustment, (3) input instruction number adjustment (addition), (4) excess relaxation, (5) input instruction number adjustment (subtraction), (6) swap Six processes of processing (matching the number of inventory between items) are performed.

(1) Initial processing:
First, the initial process will be described. In the initial process, three processes are performed: input process, apportioning by composition ratio, and ranking process.

(1-1) Input processing:
In the input process, as shown in FIG. 1, numerical values that are the original data of the calculation are input as input data to the X axis and the Y axis. At that time, the number of input instructions is input for each store on the X axis, and the number of stocks for each item is input on the Y axis. In this example, 12 types of items are considered to be distributed to 20 stores, but the total of 12 types of items is assumed to be 400. From item 1 to item 12, the number of each item is as shown on the vertical axis in FIG. 1, and the total number of items allocated to each store is as shown on the horizontal axis in FIG. is there. In this example, since it is assumed that all items are distributed to any store, X-axis total = Y-axis total = 400.

(1-2) Apportionment by composition ratio:
First, the composition ratio with respect to the total sum of the numerical values in each cell is calculated, and the entire inventory is allocated to each cell using the ratio. In this example, the decimal part is rounded up to an integer.

  Actually, X-axis composition ratio = store input instruction number / total number of inventory and Y-axis composition ratio = inventory quantity / total number of inventory is calculated, and (X-axis composition ratio) × (Y-axis composition ratio) = cell composition ratio Calculate When calculation is performed using a specific example, the composition ratio of the cells at the intersection of the first store and item 1 (Item_01) is (store input instruction number ÷ total number of stocks) × (inventory number ÷ total number of stocks) = (50 ÷ 400) × (120 ÷ 400) = 0.125 × 0.3 = 3.75%. Since the value allocated to this cell is the total number of stocks × the composition ratio of the cells, 400 × 3.75% = 15. In the above calculation, the decimal part generated when calculating the cell value is rounded up. The reason for rounding up is to distribute as many items as possible at each store. FIG. 2 shows a state in which the above calculation is performed for all the cells and the obtained numerical values are distributed to all the cells. As shown in the lower right of FIG. 2, a cell having 10 or more allocated items, 4 to 9 allocated items, and 2 to 3 allocated items has three levels of density. A dot is attached. No dot is attached to a cell in which the allocated item is 1.

(1-3) Ranking process:
Next, ranking processing is performed for each of the X axis and the Y axis. The order obtained as a result of the ranking process is used as an order when adding or subtracting each cell in the process described later. In the X-axis ranking process, the rank is assigned in descending order of the number of input instructions. In the case of arrival at the same time, the one with the faster processing is the higher rank. In the ranking process on the Y-axis, the order is assigned in descending order of the number of stocks. FIG. 3 shows the ranking on the upper side of the X axis and the left side of the Y axis.

(2) Basic adjustment:
Next is the basic adjustment. As a result of the processing so far, the cell values are filled according to the composition ratio, but when the number of cells is larger than the input value on the X-axis and Y-axis, all cells are rounded up to one or more by rounding up the decimal point. Since the numerical values are allocated, the total exceeds the input value. For the column or row corresponding to this, the adjustment is performed such that 1 is allocated to the cells up to the input value rank in the ranking order and 0 is allocated to the others.

(2-1) When the number of input instructions <the number of items:
At the time of apportioning by the composition ratio, since the process of rounding up the decimal point is performed, as shown in FIGS. 2 and 3, at least 1 is allocated to all the cells at this time. Since the number of items is 12, the number of inputs allocated to each store is theoretically at least 12 (in practice, as shown in FIGS. 2 and 3, the 18th store to the 20th store). The minimum is 13 in the store). However, since the number of input instructions is excessively distributed to stores smaller than 12 such as 5 or 10, processing corresponding to the number of input instructions is required. In the case of this example, when the number of input instructions is less than 12, which is the number of items, 7 stores from the 10th store, the 11th store, the 13th store, and the 17th store to the 20th store are applicable. For these seven stores, 1 is allocated to the cells up to the number of input instructions in descending order of inventory rank, and 0 is allocated to the other cells. For example, in the case of the 20th store, 1 is allocated to items 1 to 5 and 0 is allocated to items 6 to 12. The result of the above adjustment is shown in FIG. In FIG. 4, a portion surrounded by a thick dotted line is a place where the above processing is performed.

(2-2) If the number of stocks <the number of stores:
In the processing shown in FIG. 4, the sum in the column direction, that is, the vertical direction is considered, but the same adjustment is performed for the stock in consideration of the sum in the row direction, that is, the horizontal direction. In FIG. 5, a portion to be processed this time is surrounded by a thick dotted line. When attention is paid to an item whose number that can be allocated is less than 20, which is the number of stores, in this example, items 6 to 12 are used. For these items, 1 is allocated to cells up to the number of stocks in descending order of input instruction rank, and 0 is allocated to other cells. However, it should be noted that “1” is not placed in a cell that is set to “0” when the number of stores input is adjusted in the process of FIG. Specifically, in the case of item 12, 1 is allocated to the 1st store, the 2nd store, the 3rd store, the 15th store, the 4th store from the one with the highest input instruction rank, and the other stores are allocated. Allocate 0.

(3) Matching the number of input instructions (addition):
Next, an addition process is performed for a store whose calculation result up to this stage is smaller than the number of input instructions assumed at the beginning. Specifically, 1 is added to a cell in the order of items in stock until the number of stores input = the number of input instructions. Specifically, as will be described in detail below, the number of stores input <the number of input instructions is specified, the cell of the item with the highest inventory rank is specified, 1 is added to the corresponding cell, If store input count <input instruction number, move to item of next inventory number rank and add 1; repeat above process until store input number = input instruction number, if store input number = input instruction number The process proceeds according to the procedure of moving to the store where the next input is insufficient and performing the same addition process.

(3-1) Adjustment of the number of input instructions (addition 1):
Addition processing is performed on stores where the current store input number (vertical total), which is the result of the above processing, is less than the input instruction number, to match the instruction number. Referring to the number of distributions up to now shown in FIG. 5, it can be seen that 49 points have been distributed to the first store so far, which is one less than the number of input instructions. Although there are other shortages, the processing is performed in the order of the stores with the largest number of input instructions, so the first addition is performed for the first store. Therefore, when 1 is added to item 1, the value of the cell is changed from 15 to 16, and as shown in FIG. 6, 50 points instructed to be placed are distributed to the first store.

(3-2) Matching the number of input instructions (addition 2):
Similarly, referring to the distribution number up to the present shown in FIG. 6, it can be seen that seven points have been distributed to the tenth store so far, which is three less than the number of input instructions. Thus, adding 1 to item 1 changes the cell value from 1 to 2, adding 1 to item 2 changes the cell value from 1 to 2, and adding 1 to item 3 causes the cell value to be 1 As a result of the above, as shown in FIG. 7, 10 points instructed to be distributed are distributed to the tenth store.

(3-3) Matching the number of input instructions (addition 3):
Similarly, referring to the distribution number up to the present shown in FIG. 7, it can be seen that seven points have been distributed to the 11th store so far, which is three less than the number of input instructions. Thus, adding 1 to item 1 changes the cell value from 1 to 2, adding 1 to item 2 changes the cell value from 1 to 2, and adding 1 to item 3 causes the cell value to be 1 As a result of the above, as shown in FIG. 8, 10 points instructed to be distributed are distributed to the 11th store.

(3-4) Adjusting the number of input instructions (addition 4):
Similarly, referring to the distribution number up to the present shown in FIG. 8, it is understood that five points have been distributed to the 13th store so far, which is 5 less than the input instruction number. Thus, adding 1 to item 1 changes the cell value from 1 to 2, adding 1 to item 2 changes the cell value from 1 to 2, and adding 1 to item 3 causes the cell value to be 1 From 1 to 2, adding 1 to item 4 changes the cell value from 1 to 2, and adding 1 to item 5 changes the cell value from 1 to 2. As a result of the above, FIG. As shown, 10 points instructed to be input are distributed to the 13th store.

(3-5) Matching the number of input instructions (addition 5):
Similarly, referring to the number of distributions up to now shown in FIG. 9, it can be seen that five points have been allocated to the 17th store so far, which is five less than the number of input instructions. Thus, adding 1 to item 1 changes the cell value from 1 to 2, adding 1 to item 2 changes the cell value from 1 to 2, and adding 1 to item 3 causes the cell value to be 1 From 1 to 2, adding 1 to item 4 changes the cell value from 1 to 2, and adding 1 to item 5 changes the cell value from 1 to 2. As a result of the above, FIG. As shown, 10 points instructed to be input are distributed to the 17th store.

(4) Mitigation of excess:
In the processing so far, the addition processing was done to the store where the number of store inputs in the calculation result is insufficient for the number of input instructions, and the number adjustment was completed, so the next allocation will exceed the number instructed to input A subtraction process is performed on the store that has been made, but before that, a process for reducing the missing teeth of the cell is performed.

  This excess mitigation process is a process in the previous stage in which a subtraction process is performed contrary to the addition process of (3) described above. When the excessive amount mitigation process is not performed, a cell that becomes 0 when subtracting 1 from each cell for stores with the number of stores input> the number of input instructions is frequently generated. There is a possibility of increasing. However, as already described as a major premise, the basic policy for product distribution in the present invention is that, firstly, many items in stock are distributed at each store, and second, as many items as possible at each store. It was two points that items were allocated. The latter condition of “allocating as many items as possible at each store” can be rephrased as “to minimize the number of stores with missing numbers as much as possible”, and distribute many types of products to many stores. It can be said that it is a very natural condition that is required when doing so. The treatment for alleviating the missing teeth of the cell is necessary to satisfy this condition.

  Actually, if there is an item that is overstocked at the store where the number of store inputs> the number of input instructions, subtract 1 in advance for that item to reduce the excess of store inputs by the excess inventory. Keep it. As specific processing, an item that is overstocked in order from the lowest inventory number rank is specified. After specifying the item, a store cell in which the number of store inputs> the number of input instructions is specified. If it is greater than one, the process is performed by subtracting one. This is for preferentially arranging the number of stores inserted, and therefore, after the item is specified, the store subtraction process is performed with priority. Therefore, the subtraction process is continued even if the stock is not over on the way.

  Note that this excess mitigation process only mitigates by slightly reducing the excess of inventory over and input over. As described above, after this process, a subtraction process for complete number adjustment is performed on the excessive number of stores input.

(4-1) Mitigation of excess (subtraction 1):
Items that are in stock are identified in ascending order of the inventory number rank, and the excess is reduced by subtracting the stores whose number of stores (vertical total) exceeds the number of inputs. Referring to FIG. 10 in which the processing result up to this point is shown, even though the inventory that can be allocated to the item 5 is 20, 30 is allocated up to this point and the excess is 10. Therefore, the subtraction process is performed on the cell of the store that has been overfilled. Specifically, 1 is subtracted from the 2nd store cell to change the cell value from 3 to 2, and 1 is subtracted from the 4th store cell to change the cell value from 2 to 1. 1 is subtracted from the cell to change the cell value from 2 to 1, and 1 is subtracted from the 15th store cell to change the cell value from 2 to 1. As a result of this subtraction, the allocated quantity was changed from 30 to 26, so the excess was reduced from 10 to 6.

(4-2) Mitigation of excess (subtraction 2):
Referring to FIG. 11 showing the results of the processing up to this point, when looking at the next lowest stock quantity rank, item 4 has a distributionable inventory of 40. 47 is allocated until now, and the excess is 7. Therefore, the subtraction process is performed on the cell of the store that has been overfilled. Specifically, 1 is subtracted from the 4th store cell to change the cell value from 3 to 2, and 1 is subtracted from the 5th store cell to change the cell value from 2 to 1. Subtract 1 in the cell to change the cell value from 3 to 2, subtract 1 in the 7th store cell to change the cell value from 2 to 1 and subtract 1 in the 8th store cell Change the value from 2 to 1 and subtract 1 from the 9th store cell to change the cell value from 2 to 1 and subtract 1 from the 12th store cell to change the cell value from 2 to 1 Then, 1 is subtracted from the 14th store cell to change the cell value from 2 to 1, and 1 is subtracted from the 15th store cell to change the cell value from 4 to 3, and 1 from the 16th store cell. To change the value of the cell from 2 to 1. As a result of this subtraction, the allocated quantity has been changed from 47 to 37. Therefore, the excess of 7 is not enough, but conversely, it is insufficient by 3. However, as mentioned above, priority is given to subtraction of store input. To do. This shortage will be adjusted later in the inventory swap process.

(4-3) Mitigation of excess (subtraction 3):
Referring to FIG. 12 showing the result of the processing up to this point, when looking at the next lowest stock quantity rank, Item 3 has reached 70 up to this point even though the allocable stock is 70. 77 is allocated, and the excess is 7. Therefore, the subtraction process is performed on the cell of the store that has been overfilled. Specifically, 1 is subtracted from the 4th store cell to change the cell value from 5 to 4, and 1 is subtracted from the 5th store cell to change the cell value from 4 to 3. Subtract 1 in the cell to change the cell value from 5 to 4, change 1 in the 7th store cell to change the cell value from 4 to 3, and subtract 1 in the 15th store cell The value of is changed from 7 to 6. As a result of this subtraction, the allocated quantity was changed from 77 to 72, so the excess was reduced from 7 to 2.

(5) Adjusting the number of input instructions (subtraction):
Contrary to the addition process in (3) already described, the subtraction process is performed on the stores whose calculated number of stores exceeds the number of input instructions. A process of subtracting 1 from the cell is performed in the order of items with a small stock until the number of stores input = the number of input instructions. Actually, specify the cell of the item with the lowest inventory number rank, specify the store where the store input number> the input instruction number, and subtract 1 if the value of the cell is greater than 1, the next inventory Move to several rank items and execute the above process, repeat until the number of stores input = input instruction number (if the subtraction adjustment in a cell larger than 1 is no longer possible, repeat the above process under one or more conditions) Processing proceeds with the procedure.

(5-1) Matching the number of input instructions (subtraction 1):
A subtraction process is performed on the stores where the current store input number (vertical total), which is the result of the processing so far, exceeds the input instruction number, to match the instruction number. Referring to the number of distributions up to now shown in FIG. 13, it is possible to search from the item with the lowest inventory number rank, and the cell value can be subtracted from 1 in stores where the number of store inputs> the number of input instructions The resulting item is item 4. The stores with the number of store inputs> the number of input instructions are the fourth store, the fifth store, and the sixth store. When 1 is subtracted from the No. 4 store cell for this item 4, the value of the cell is changed from 2 to 1, and the number of store inputs is changed from 27 to 26. Next, when 1 is subtracted from the 6th store cell, the value of the cell is changed from 2 to 1, and the number of store inputs is changed from 26 to 25. For the 6th store, the number of input instructions coincides.

(5-2) Adjusting the number of input instructions (subtraction 2)
Next, referring to the current allocation number shown in FIG. 14, the next subtractable item is item 3. When 1 is subtracted from the No. 4 store cell for this item 3, the value of the cell is changed from 4 to 3, and the number of store inputs is changed from 26 to 25, which matches the input instruction number. Next, when 1 is subtracted from the No. 5 store cell, the value of the cell is changed from 3 to 2, and the number of store inputs is changed from 21 to 20, which matches the input instruction number.

  The result of the above processing is shown in FIG. 15, but the total number of items allocated to the stores for all stores from the 1st store to the 20th store coincided with the initially set input instruction number. Become.

(6) Swap processing:
As a result of the processing performed up to this stage, since the total number of items allocated for all stores coincides with the number of input instructions set initially, the number alignment in the X-axis direction is completed. The processing after this stage is aimed at the number alignment in the Y-axis direction. Regarding the X-axis direction, the number of stores inserted = the number of input instructions at each store, so that the number of stocks is exchanged between items so as not to destroy this relationship once obtained.

  Actually, it is checked whether or not the number of stocks is over for all items. If the stock is over, the following processing is executed. First, (a) specify the store with the highest number of input ranks (in descending order), then (b) search in descending order of the inventory rank, and specify items that are out of stock (calculation results are less than the number of inventory) (C) 1 is subtracted from the cell of the over-stock item in the corresponding store, and 1 is added to the cell of the shortage item (however, if the subtracted cell is 0), (d) ) If the stock is still over, move to the store of the next input rank and execute the processing of (b) and (c). Repeat the processing of (e) and above until the calculation result (horizontal total) ≤ stock quantity. The process proceeds according to the procedure.

(6-1) Swap processing between items (1)
When the stock is over, the stores are specified in the order of the number of inputs, and the swap process is performed for items that are short of stock. Specifically, referring to FIG. 15 in which the result of the processing up to this point is shown, the allocated number of items 5 is excessive by six. For item 5, if the store is specified by the number of input ranks, the first store corresponds. Next, when searching for an item whose inventory is insufficient, it is item 1 and the shortage is 1. Therefore, as shown in FIG. 16, swap is performed between item 5 and item 1 to move only one item.

(6-2) Swap process between items (2):
Referring to FIG. 16 in which the result of processing up to this point is shown, the number of items 5 is excessive by five. For item 5, if a store is specified by the number of input ranks, the second store corresponds. Next, when an item for which inventory is insufficient is searched, it is item 4 and the shortage is 5. Accordingly, as shown in FIG. 17, swap is performed between the item 5 and the item 4 to move the item by one.

(6-3) Swap process between items (3):
Referring to FIG. 17 in which the result of the processing up to this point is shown, the allocated number of item 5 is excessive by four. For item 5, if a store is specified by the number of input ranks, No. 3 store corresponds. Next, when an item for which inventory is insufficient is searched, it is item 4 and the shortage is 4. Therefore, as shown in FIG. 18, swap is performed between the item 5 and the item 4 to move the item by one.

(6-4) Swap process between items (4):
Referring to FIG. 18 in which the result of the processing up to this point is shown, the number of items 5 allocated is excessive by three. For the item 5, if the store is specified by the number of input ranks, the 15th store corresponds. Next, when searching for an item whose inventory is insufficient, it is item 4 and the shortage is 3. Accordingly, as shown in FIG. 19, swap is performed between the item 5 and the item 4 to move the item by one.

(6-5) Swap process between items (5):
Referring to FIG. 19 in which the result of the processing up to this point is shown, the number of items 5 allocated is excessive by two. For item 5, if a store is specified by the number of input ranks, No. 4 store corresponds. Next, when searching for an item whose inventory is insufficient, it is item 4 and the shortage is 2. Therefore, as shown in FIG. 20, swap is performed between the item 5 and the item 4 to move the item by one.

(6-6) Swap process between items (6):
Referring to FIG. 20 in which the result of the processing up to this point is shown, the allocated number of item 5 is excessive by one. For item 5, if a store is specified by the number of input ranks, No. 6 store corresponds. Next, when searching for an item whose inventory is insufficient, it is item 4 and the shortage is 1. Accordingly, as shown in FIG. 21, swap is performed between the item 5 and the item 4 to move the item by one.

  With the above processing, the items that are out of stock disappear, and the swap processing ends. As a result, as shown in FIG. 22, the calculation results of the X axis and the Y axis completely coincide with the respective input values. As a result of decomposition into a matrix according to the processing method as described above, (1) items with a large amount of stock are allocated at each store as described above, and (2) as many items as possible are allocated at each store. The distribution of numerical values could be realized in a manner that satisfied the basic policy of the

  In the process described above, in order to follow the second basic policy, the cell value is rounded up during the rounding process so that as many items as possible are allocated. However, other processes are possible. For example, if rounding is performed instead of rounding up, the number of cells having a value of 0 increases, but the influence of the composition ratio can be made stronger. Moreover, when the truncation process is performed, a result in which the influence of the composition ratio is further increased is obtained. In this way, different numerical distributions are obtained in the matrix depending on the method of fraction processing.

  Furthermore, as another method, it is possible to swap the number of inputs between stores after the number of stocks is matched, and a number of different methods can be obtained according to the order of processing as to how the numbers are matched. Therefore, depending on the purpose of applying the present invention, the rounding process employs any one of “rounded up”, “rounded down”, and “rounded off”, and the number for either the X axis or the Y axis. It is also possible to perform swap processing for the other axis after matching. As described above, when various items are allocated according to the present invention, it can be decomposed into various matrices according to the purpose.

  However, what is common in both processes is that the numerical arrangement arranged in each of the X-axis and the Y-axis is subjected to basic apportionment to the matrix first according to the composition ratio of each axis, Next, after performing rounding using any of “rounded up”, “rounded down”, and “rounded off”, the numbers of the respective axes are adjusted according to the numerical ranking of the X axis and the Y axis.

  Conventionally, it has been difficult to determine the cell values so that the vertical and horizontal totals in the matrix match the numerical values aligned on the X axis and the numerical values aligned on the Y axis. By doing so, the difficulties in the prior art are eliminated. The processing according to the present invention is possible in the entire range of the Y-axis total ≧ X-axis, and the X-axis numerical value can be adjusted according to the composition ratio within the range of the numerical values arranged on the Y-axis. Of course, the same applies when the axes are reversed.

  In the above, the example of “allocating the inventory of 12 kinds of merchandise to 20 stores” has been described, but the processing according to the present invention can also be used in other technical fields. For example, in the retail industry, the present invention can be applied to general ordering and shipping distribution for locations such as stores, and is particularly useful when there are several hundred or more target locations. In the manufacturing industry, wholesale trade, etc., it can also be applied to the allocation according to the capacity to the designated storage location of the warehouse. Capacity management is also possible if the capacity of the product is taken into account. It can also be applied to staffing according to specialized fields and roles.

2. General explanation using mathematical formulas :
Next, in order to explain the inventor's basic idea regarding item distribution according to the present invention, the processing described above using the specific examples will be described again abstractly using some mathematical expressions. The matrix in the present invention is a number table in which non-negative integers are arranged in a rectangular shape in the vertical and horizontal directions, and is different from the matrix in linear algebra. However, to express the matrix in the present invention, it is convenient to use symbols used for the matrix in the linear algebra, which can be easily understood by those skilled in the art and should not be misunderstood.

First, consider a matrix A of p rows and q columns composed of p rows (X-axis direction) and q columns (Y-axis direction). The matrix of p rows and q columns is a row in which q numbers are arranged in the horizontal direction from the first row to the p th row, and a column in which p numbers are arranged in the vertical direction is from the first column to the q th column. It means something up to. An element (also referred to as a component) in the m-th row and the n-th column of the matrix A is represented by a _mn . If attention is paid to elements, a matrix A composed of p × q components a _mn is represented by (a _mn ). Here, considering the sum of numerical values in the horizontal direction in the elements in the same row, that is, the matrix, the sum of the elements in the first row a ₁₁ + a ₁₂ +... + A _1q = H ₁ , the sum of the elements in the second row a ₂₁ + a ₂₂ +... + A _2q = H ₂ ,..., The sum of the elements in the p-th row is a _p1 + a _p2 +... + A _pq = H _p . Similarly, considering the sum of the elements in the same column, that is, the numerical values in the vertical direction, the sum a ₁₁ + a ₂₁ +... + A _p1 = V ₁ of the elements in the first column and the sum a ₁₂ + a of the elements in the second column ₂₂ +... + A _p2 = V ₂ ,..., The sum of elements in the q-th column is a _1q + a _2q +... + A _pq = V _q .

I would like to confirm the meaning of the above matrix symbols. The fact that the matrix is p rows and q columns means that the problem of allocating p types of items to q stores is considered. An element a _mn of m rows and n columns of the matrix means the number of m-th items allocated to the n-th store. The sum total of elements in the first row a ₁₁ + a ₁₂ +... + A _1q = H ₁ is the total number of first items distributed to q stores, and the sum a of elements in the first column a ₁₁ + a ₂₁ +... + A _p1 = V ₁ is the total number of p-type items allocated to the first store. Using these symbols, the present invention allows H ₁ , H ₂ ,..., H _p and V for the matrix A = (a _mn ) when allocating all of the items that are in stock. ₁ , V ₂ ,..., V _q is a system and method for determining all non-negative integer components a _mn of matrix A.

As already mentioned briefly, the present invention can be applied not only to distributing all items existing as stock to each store but also to distributing only a part of the total stock to each store. . An example of this partial allocation is when the quantity to be allocated to each store in January is determined from the total inventory for one year. For example, when there are 10,000 items in total, only 1,000 of them are allocated. When only a part of the total inventory is allocated in this way, there is a part that is not allocated to the store in the inventory of each item. That is, when the stock 1st item is assumed to be T _1, being allocated to each store in T ₁ is only _{H 1, T 1 -H 1 (} ≠ 0) is not allocated Remain. The same applies to the second to p-th items. When redefined so as to include the case where there is an item that is not distributed in this way, the present invention is T ₁ , T ₂ ,..., T _p and V ₁ , V _{2 for the} matrix A = (a _mn ). A system and method for determining all non-negative integer components a _mn of matrix A given V _q . _{However, T 1, T 2, ···} , T p is, _{T m} ≧ _{H m (m} is an integer from 1 to p) is a non-negative integer satisfying.

(1) Initial processing:
(1-1) Input processing:
First, input processing is performed as initial processing. As described above with reference to FIG. 1, the input process is to input numerical values serving as calculation original data to the X axis and the Y axis as input data. That is, according to the present invention, a given numerical value that is a premise for determining the number of distribution of each item to each store is input. Using the above-mentioned symbols, T ₁ which is the total number of stocks of the _first item to T _p which is the total number of stocks of the pth item is input, and V which is the number of inputs to the first store. Enter from ₁ to V _q which is the number of inputs to the q-th store. Here, referring to FIG. 23 showing an example in which the number of stores is 50, the total number of inventory is 21,600 points, and the number of items is 12, the total number of inventory is T ₁ = 3000, T ₂ = 2900,. ₁₂ = 800 is input, and V ₁ = 120, V ₂ = 120,..., V ₅₀ = 6 are input as the number of input instructions. 23. As shown in the upper left of the table shown in FIG.

(1-2) Apportionment by composition ratio:
The following is a proration according to the composition ratio. First, the composition ratio of the numerical value in each cell to the total inventory is calculated, and the entire inventory is allocated to each cell using the ratio. For example, consider the on instruction number for items 1 to a _11, i.e. No. 1 store. In the case of a ₁₁ , (X-axis composition ratio) = (ratio of the number of instructions for introduction to the first store in the total number of inventory) = (number of instructions for introduction to the first store) / (total number of inventory) = V ₁ / (T ₁ + T ₂ +... + T _p ), (Y-axis composition ratio) = (ratio of the inventory number of item 1 in the total inventory quantity) = (stock quantity of item 1) / (total inventory quantity) = T ₁ / (T ₁ + T ₂ +... + T _p ), the component ratio of the cell a ₁₁ is calculated by calculating the product of these component ratios (V ₁ / (T ₁ + T ₂ + · ·· + T _p )) × (T ₁ / (T ₁ + T ₂ +... + T _p )). Similarly, for _example, in the case of _{a 12} is, (X-axis component _{ratio) = V 2 / (T 1} + T 2 + ··· + T p), (Y -axis component _{ratio) = T 1 / (T 1} + T 2 + ... + T _p ), the composition ratio of the cell a ₁₂ is (V ₂ / (T ₁ + T ₂ +... + T _p )) × (T ₁ / (T ₁ + T ₂ +...). + T _p )). Therefore, generally, the composition ratio of a _mn , which is the number of items m to be introduced into the nth store, is (X-axis composition ratio) = V _n / (T ₁ + T ₂ +... + T _p ), ( Since the Y axis composition ratio) = T _m / (T ₁ + T ₂ +... + T _p ), the composition ratio of the cell a _mn is (V _n / (T ₁ + T ₂ +... + T _p )). × (T _m / (T ₁ + T ₂ +... + T _p )).

Using the cell composition ratio calculated in this way, a numerical value distributed to each cell is calculated. In the case of a ₁₁ , (total number of stocks) × (cell composition ratio) = (T ₁ + T ₂ +... + T _p ) × (V ₁ / (T ₁ + T ₂ +... + T _p )) × ( T ₁ / (T ₁ + T ₂ +... + T _p )) = V ₁ · T ₁ / (T ₁ + T ₂ +... + T _p ). Further, for _example, in the case of _{a 12 is, (T 1 + T 2 +} ··· + T p) × (V 2 / (T 1 + T 2 + ··· + T p)) × (T 1 / (T 1 + T ₂ +... + T _p )) = V ₂ · T ₁ / (T ₁ + T ₂ +... + T _p ). Therefore, in general, a numerical value that is prorated to the cell a _mn according to the composition ratio is V _n · T _m / (T ₁ + T ₂ +... + T _p ). By performing these calculations, the quantity of items to be apportioned to all cells of the matrix is determined.

However, as already described, the numerical value allocated to each cell of the matrix in the present invention corresponds to the number of items, and therefore must be a non-negative integer. However, for example, V _n · T _m / (T ₁ + T ₂ +... + T _p ) apportioned to the cell a _mn does not always take an integer value. Therefore, processing of numerical values after the decimal point is necessary, but there are at least three options as processing methods. In other words, they are rounded up, rounded off, and rounded down. Of course, in addition to these three options, special processing may be possible. However, processing other than these three (for example, rounding off with rounding off) is not so general and will not be considered here.

  In the following description, the case of round-up processing will be considered as was done in the specific examples that have already been made. The reason why the round-up process is performed as a representative process is that zero is not allocated to any cell at the apportioning stage, and 1 is allocated even in the minimum case. Even if a cell resulting in 0 is generated at the end of the allocation according to the present invention, for example, in the case of a clothing store, as many items as possible are allocated to each store, that is, This is based on the substantive reason that missing numbers such as a specific size is not allocated are avoided as much as possible. However, for example, even if missing numbers occur in many small stores, rounding or truncation may be more appropriate if the distribution is to be concentrated in large stores with a large ability to attract customers. . In the present invention, it is possible to select from three processes, rounding up, rounding off, and rounding down, and processing other than these so as to be optimal in an individual situation in which item allocation is executed.

  For reference, FIG. 24 and FIG. 25 show distribution results according to the present invention when rounding and truncation are employed.

  FIG. 26 shows the result of allocating the total number of 12 types of items to 50 stores when the rounding process is employed using the item distribution system according to the present invention, and the total number of the 12 types of items is 2000. Has been.

(1-3) Ranking process:
Next is the ranking process. The ranking processing of the present invention means processing for determining the order in which addition and subtraction processing of each cell is performed in a process described later. In the specific example described above, the order is assigned in descending order of the number of stocks and in descending order of the number of input instructions. In the case of the same order, the order is determined in the order to be processed first. Thus, it is normal to determine the ranking in descending order, but other rankings can be determined according to actual specific circumstances.

Although the numerical values are temporarily distributed to the matrix by the above processing, since processing after the decimal point (rounding up, rounding off, rounding down, etc.) is performed, at this stage, a ₁₁ + a ₁₂ +.・ ・ + A _1q = H ₁ ≦ T ₁ , a ₂₁ + a ₂₂ +... + A _2q = H ₂ ≦ T ₂ ,..., A _p1 + a _p2 +... + A _pq = H _p ≦ T _p A ₁₁ + a ₂₁ +... + A _p1 = V ₁ , a ₁₂ + a ₂₂ +... + A _p2 = V ₂ ,..., A _1q + a _2q +... + A _pq = V _q The relationship is not always fulfilled. In the following processing, processing is performed so that the sum of the horizontal and vertical directions satisfies the initial condition by correcting the numerical value of each cell.

(2) Basic adjustment:
First, basic adjustment. As a result of the processing so far, since rounding-up processing is performed in all cells, 1 is allocated at the minimum, and as a result, the sum exceeds the input value. For the column or row corresponding to this, the adjustment is performed such that 1 is allocated to the cells up to the input value rank in the ranking order and 0 is allocated to the others.
(2-1) For stores where the number of input instructions is smaller than the number of items:
First, consider the case where the number of input instructions is smaller than the number of items in the vertical direction. Note that the matrix considered here is p rows q columns. That is, although this matrix has p rows, for example, in the nth column, the relationship of p> the number of input instructions V _n is established. For the reasons described above, at least 1 is allocated to all the cells at this stage, so that V _n (the sum in the vertical direction of the numerical values in the p cells of the nth column) at this point is actually there is a possibility that a state beyond the on instruction number V _n occurs. In this case, the inventory Ranking is allocating one in from a cell of the top up-on instruction number of V _n-th cell in the order, the on instruction number of V _n +1 th and subsequent cell to allocate 0.

(2-2) If the number of stocks <the number of stores:
In order to perform the same processing in the horizontal direction, the case where the number of stocks <the number of stores is considered. The matrix under consideration has q columns. For example, in the m-th row, the relationship q> stock quantity T _m is established. For the reasons described above, since at least 1 is allocated to all the cells, H _m (the total sum of the numerical values in q cells of the m-th column) at this time is the actual number of stocks. There is a possibility that a state exceeding _Tm may occur. In this case, 1 is allocated to the cell of the inventory number T _{m in} order from the cell having the highest insertion instruction number ranking, and 0 is allocated to the cells after the inventory number T _m +1. However, it should be noted that the cell set to “0” in (2-1) should not be set to “1” in order to keep the adjusted number of inputs.

(3) Matching the number of input instructions (addition):
Next, a column having fewer numerical values generated as a result of the calculation up to this stage than the number of input instructions assumed at the beginning is specified, and addition processing is performed in cells in the column.

For example, in the n-th column, if the current number of store inputs (vertical sum V _n ) as a result of the above processing is less than the initially set input instruction number (V _n ), the n columns In the p number of cells included in, a process of adding 1 is performed in the order of ranking previously set until the number of stores inserted (total V _{n in the} vertical direction) = the number of input instructions V _n .

  When this addition process is completed for the nth column, the same process is performed for another column.

(4) Mitigation of excess:
With the above processing, the addition processing is performed on the stores where the calculated number of store inputs is insufficient with respect to the number of input instructions, and the number adjustment is completed. Next, on the contrary, the subtraction process is performed on the stores that have been allocated in excess of the quantity instructed to be thrown in, but before that, the process for reducing the missing teeth of the cell is performed.

  As described above, the excess relaxation process is a process in the previous stage in which the subtraction process is performed in the next stage, and is a process for minimizing the number of cells that become 0 in the entire matrix. The reason for minimizing the number of cells that are 0 is to “allocate as many items as possible at each store”, that is, “to minimize the number of stores where missing numbers occur”.

(5) Adjusting the number of input instructions (subtraction):
Contrary to the addition process in (3) already mentioned, the number of store inputs in the calculation result exceeds the number of input instructions, in other words, the process up to this point has exceeded the initially planned number of allocations. Then, the subtraction process is performed in the cell to which the distribution is made.

For example, in the n-th column, if the current number of store inputs (vertical sum V _n ) as a result of the above processing exceeds the initially set input instruction number (V _n ), then n In the p cells included in the column, a process of subtracting 1 is performed in the order of ranking set in advance until the number of stores inserted (total V _{n in the} vertical direction) = the number of input instructions V _n .

  When this subtraction process is completed for the nth column, the same process is performed for another column.

(6) Swap processing:
As a result of the above processing, since the total number of allocated items for all stores coincided with the initially set number of input instructions, the number alignment in the X-axis direction was completed. In other words, for V ₁ to V _q , the originally planned numerical value and the current numerical value match. While maintaining this relationship, subtract 1 from one cell and set 1 to the other between two cells in the same column so that the current value does not exceed the originally planned value for T ₁ to T _p. Performs swap processing by adding. That is, the numerical value is moved by 1 from one cell to the other cell. This swap process is performed in the order of the rankings determined in advance until the current values of H ₁ to H _p match or become smaller than the initially set values of T ₁ to T _p for all rows. Run in order. Here, as described above, the case where the current value of H ₁ to H _p is smaller than the initially set value of T ₁ to T _p includes (total number of stocks ≧ total number of input instructions) This is because the distribution according to the present invention is considered under the general condition of).

3. Hardware :
The distribution of numerical values to a plurality of cells in the matrix according to the present invention is realized by software including an instruction set that causes a computer to execute the steps corresponding to the above-described processes. In the following, how information processing by software is specifically realized using hardware resources, and how the software cooperates with hardware resources to achieve the intended purpose of the present invention. Will be described.

  FIG. 27 is a block diagram illustrating exemplary computer hardware on which software that performs numerical allocation to multiple cells in a matrix according to the present invention operates. The information processing performed by the present invention is abstractly distributing numerical values to a plurality of cells in a matrix, but more specifically, a plurality of items having a plurality of types (for example, clothing) It can also be expressed as distribution to a plurality of receiving means (for example, stores). An overview of a computer 11 operating with software for performing item allocation according to the present invention is shown in FIG. The computer 11 includes a processor 13, a memory 14, a storage device 15, an output interface 16, and an input interface 17 that are connected to each other via a bus 12. A display 20 is connected to the output interface 16, and a keyboard 18 and a mouse 19 are connected to the input interface 17.

  A computer program composed of an instruction set for causing each means constituting the item distribution system according to the present invention to execute a predetermined process is stored in the storage device 15. When information processing for item allocation according to the present invention is executed, a predetermined command is transferred to the memory 14 via the bus 12. The instruction read into the memory 14 is interpreted and executed by the processor 13. As described above, the initial condition setting means, the composition ratio calculation means, the apportioning means, and the adjusting means constituting the item distribution system according to the present invention further include a ranking processing means, an addition processing means, and an excess amount reducing means included in the adjusting means. The subtraction processing means and the swap processing means are realized as a function that the processor 13 interprets and executes an instruction loaded in the memory 14. The memory 14 holds instructions executed by the processor 13 together with the results. The processor 13 executes instructions to perform processing at each stage constituting the item allocation according to the present invention by fetching from the memory 14. The processor 13 is a microprocessor in the case of a personal computer or workstation, and may be a dedicated ASIC. Input to the computer 11 is made via the input device 17 of the keyboard 18 and mouse 19 and the input interface 17, and output from the computer 11 is made via the display 20 and the output interface 16 that are output devices. Note that the computer 11 in FIG. 27 is illustrated as a stand-alone single computer, but a plurality of computers constituting the network may be responsible for specific functions constituting the present invention separately. In the case where a network is configured by such a plurality of computers, those skilled in the art can easily understand the necessary corrections, and thus will not be described in detail.

  As described above, the item distribution system according to the present invention includes storage means, initial condition setting means, component ratio calculation means, apportioning means, and adjustment means. The adjustment means further includes a ranking processing means, a basic adjustment means, an addition processing means, an excess mitigation means, a subtraction processing means, and a swap processing means. These means perform each data processing which constitutes the present invention. Considering according to the block diagram shown in FIG. 27, each data processing is stored in the storage device 15, read out to the memory 14, is interpreted by the processor 13, and causes the computer 11 to execute a predetermined processing. It is realized by software composed of an instruction set.

  As will be understood by those skilled in the art, each data processing executed by each of the above-described means is executed on the computer 11 by a computer program composed of corresponding instructions. These means may exist in an embedded form in computer hardware executing such a computer program, as described in the processor 13 frame of FIG. Alternatively, it may be stored on various computer readable media. The computer-readable medium has a coded format that can be decoded when actually used in a specific information processing system. In this application, software or computer program means an expression in an arbitrary programming language of an instruction set for causing a computer hardware having information processing capability to execute a specific function.

  27 is merely an example, and the present invention is not limited to the specific architecture illustrated in FIG. The hardware configuration into which the means for configuring the item distribution system according to the present invention is incorporated varies depending on the individual implementation. Thus, the item distribution system and method according to the present invention is implemented as a combination of hardware and software. A typical combination of hardware and software is a computer system installed with a computer program that controls the computer to execute means and steps constituting the present invention when loaded into memory, interpreted and executed by a processor It is.

4). About system operation :
FIG. 28 is a flowchart showing an outline of the operation of the item distribution system according to the present invention.

This is an example of a matrix in which the vertical axis (Y axis) represents inventory and the horizontal axis (X axis) represents stores on a computer display. In FIG. 1, the number of stocks by item to be distributed and the number of input instructions by store to be distributed according to the present invention are input. It is a figure which shows the state which performed the distribution calculation by a structure ratio with respect to all the cells of a matrix, and allocated the obtained numerical value to all the cells. It is the figure which attached | subjected the ranking (ranking) obtained as a result of the ranking process on the upper side of the X axis and the left side of the Y axis. It is a figure which shows the state after a basic adjustment is made when the insertion instruction | indication number is smaller than the number of items. It is a figure which shows the state after a basic adjustment is made when the number of stock is smaller than the number of stores. It is a figure which shows the state after the 1st addition process for injection instruction number adjustment was made. It is a figure which shows the state after the 2nd addition process for injection instruction number adjustment was made. It is a figure which shows the state after the 3rd addition process for injection instruction number adjustment was made. It is a figure which shows the state after the 4th addition process for the instruction | indication instruction number adjustment was made. It is a figure which shows the state after the 5th addition process for injection instruction number adjustment was made. It is a figure which shows the state after the 1st subtraction process for relaxation of excess was made. It is a figure which shows the state after the 2nd subtraction process for relaxation of excess was made. It is a figure which shows the state after the 3rd subtraction process for relaxation of excess was made. It is a figure which shows the state after the 1st subtraction process for injection instruction number adjustment was made. It is a figure which shows the state after the 2nd subtraction process for injection instruction number adjustment was made. It is a figure which shows the state after the 1st swap process was made between items. It is a figure which shows the state after the 2nd swap process was made between items. It is a figure which shows the state after the 3rd swap process was made between items. It is a figure which shows the state after the 4th swap process was made between items. It is a figure which shows the state after the 5th swap process was made between items. It is a figure which shows the state after the 6th swap process was made between items. It is a figure which shows the state which all the required swap processes were complete | finished and the item allocation by this invention was completed. It is an allocation result when only a part of the total number of inventory is allocated to each store according to the present invention. However, this is a case where the round-up process is performed at the time of apportioning by the composition ratio. It is an allocation result when only a part of the total number of inventory is allocated to each store according to the present invention. However, this is the case where the rounding process is performed when apportioning according to the composition ratio. It is an allocation result when only a part of the total number of inventory is allocated to each store according to the present invention. However, this is the case where the truncation process is performed when allocating according to the composition ratio. When the rounding-up process is employed using the item distribution system according to the present invention, the total number of stocks of 12 types of items is 2000, and the result of distributing all of the total number of stocks to 50 stores is shown. It is a block diagram which shows the outline of the computer hardware which implement | achieves numerical value distribution by this invention. It is a flowchart which shows the information processing which comprises each step of the item allocation by this invention.

Claims (8)

Determining, using a computer, pq non-negative integer components a _mn of a p-by-q matrix (a _mn ), where m is a positive integer from 1 to p and n is a positive integer from 1 to q Accordingly, all or part of the p type of item from the first item ₁ T until the item of T _p pieces of the p, from the first receiving means for receiving _one item V the sum of p type An item distribution system that distributes up to q-th receiving means that receives V _q items in total of p types,
Storage means for storing the total number T ₁ to T _{p of} each item and the numbers V ₁ to V _q received by each receiving means;
Initial conditions of T ₁ to T _p that are the total number of the _first to _p-th items stored in the storage means and V ₁ to V _q received by the _first to _q-th receiving means, respectively. Initial condition setting means for reading out and setting T ₁ ≧ a ₁₁ + a ₁₂ +... + A _1q , T ₂ ≧ a ₂₁ between the initial condition and the non-negative integer component of the matrix. + A ₂₂ + ... + a _2q ,..., T _p ≧ a _p1 + a _p2 +... + A _pq , V ₁ = a ₁₁ + a ₂₁ +... + A _p1 , V ₂ = a ₁₂ + a ₂₂ + ... + a _p2 ,..., V _q = a _1q + a _2q +... + A _pq )
Using the initial condition set by the initial condition setting means, the horizontal composition ratio V _n / (T ₁ + T ₂ +... + T _p ) regarding the component a _mn in the m-th row and the n-th column of the matrix. And the vertical component ratio T _m / (T ₁ + T ₂ +... + T _p ), and the component a _mn , which is the product of the calculated horizontal component ratio and the vertical component ratio, is calculated. A composition ratio calculating means for calculating a composition ratio (V _n / (T ₁ + T ₂ +... + T _p )) × (T _m / (T ₁ + T ₂ +... + T _p ));
For each component a _mn , the product (V _n / (T ₁ + T ₂ +...) Of the product of the horizontal composition ratio and the vertical composition ratio calculated by the composition ratio calculation means and the total number of each item. + T _p )) × (T _m / (T ₁ + T ₂ +... + T _p )) · (T ₁ + T ₂ +... + T _p ) = V _n · T _m / (T ₁ + T ₂ + ··· A distribution means for calculating + T _p ), processing the decimal part of the numerical value obtained as a result of the calculation, making it an integer, and distributing it to each component a _mn ;
The initial condition set by the initial condition setting means and the non-negative integer component of the matrix are adjusted by adjusting the excess and undersize generated as a result of processing the fractional part in the numerical value prorated to each component a _mn by the apportioning means Adjustment means to satisfy the relationship between and
Item distribution system characterized by comprising. Determining, using a computer, pq non-negative integer components a _mn of a p-by-q matrix (a _mn ), where m is a positive integer from 1 to p and n is a positive integer from 1 to q Accordingly, all or part of the p type of item from the first item ₁ T until the item of T _p pieces of the p, from the first receiving means for receiving _one item V the sum of p type An item distribution system that distributes up to q-th receiving means that receives V _q items in total of p types,
Storage means for storing the total number T ₁ to T _p of each item and the number of items V ₁ to V _q received by each receiving means;
Initial conditions of T ₁ to T _p that are the total number of the _first to _p-th items stored in the storage means and V ₁ to V _q received by the _first to _q-th receiving means, respectively. Initial condition setting means for reading out and setting T ₁ ≧ a ₁₁ + a ₁₂ +... + A _1q , T ₂ ≧ a ₂₁ between the initial condition and the non-negative integer component of the matrix. + A ₂₂ + ... + a _2q ,..., T _p ≧ a _p1 + a _p2 +... + A _pq , V ₁ = a ₁₁ + a ₂₁ +... + A _p1 , V ₂ = a ₁₂ + a ₂₂ + ... + a _p2 ,..., V _q = a _1q + a _2q +... + A _pq )
Using the initial condition set by the initial condition setting means, the horizontal composition ratio V _n / (T ₁ + T ₂ +... + T _p ) regarding the component a _mn in the m-th row and the n-th column of the matrix. And the vertical component ratio T _m / (T ₁ + T ₂ +... + T _p ), and the component a _mn , which is the product of the calculated horizontal component ratio and the vertical component ratio, is calculated. A composition ratio calculating means for calculating a composition ratio (V _n / (T ₁ + T ₂ +... + T _p )) × (T _m / (T ₁ + T ₂ +... + T _p ));
For each component a _mn , the product (V _n / (T ₁ + T ₂ +...) Of the product of the horizontal composition ratio and the vertical composition ratio calculated by the composition ratio calculation means and the total number of each item. + T _p )) × (T _m / (T ₁ + T ₂ +... + T _p )) · (T ₁ + T ₂ +... + T _p ) = V _n · T _m / (T ₁ + T ₂ + ··· A distribution means for calculating + T _p ), rounding up the fractional part of the numerical value obtained as a result of the calculation to an integer, and dividing the result into each component a _mn ;
In the numerical values that are prorated to the respective components a _mn by the apportioning means, the excess and subtraction resulting from rounding up the decimal point are adjusted, the initial condition set by the initial condition setting means and the non-negative integer component of the matrix Adjustment means to satisfy the relationship between and
Item distribution system characterized by comprising. The item distribution system according to claim 2, wherein the adjustment unit includes:
Ranking processing means for presetting the order of adjustment of the excess and the minor;
When the sum of each row and each column of each component a _mn apportioned by the apportioning unit exceeds the initial condition preset by the initial condition setting unit, according to the order set by the ranking processing unit, Basic adjustment means for setting each component a _{mn up} to a range of initial conditions set in advance by the initial condition setting means as 1, and setting 0 as the component exceeding the sum,
In the p components included in the column in which the sum of the components in the vertical direction is less than V _n set by the initial condition setting unit, the initial condition setting unit sets the p components in the order set by the ranking processing unit. Addition processing means for adding 1 to each component a _mn until equal to each component V _n ;
In q components included in a row in which the sum of horizontal components of the matrix exceeds T _m set by the initial condition setting unit, each component a _mn follows the order set by the ranking processing unit. Excess relaxation means for subtracting 1 from
Set by the initial condition setting means in accordance with the order set by the ranking processing means in the p components included in the column in which the sum of the components in the vertical direction exceeds V _n set by the initial condition setting means Subtracting means for subtracting 1 from each component a _mn until equal to V _n, and making the sum of vertical components in all columns equal to V _n set by the initial condition setting means;
A first row sum of the horizontal component is greater than the T _m, which is set by the initial condition setting means, the sum of the horizontal component is T less than _m, which is set by the initial condition setting means 2 is specified, the process of subtracting 1 from the component of the first row and adding 1 to the component of the second row, the sum of horizontal components in all rows is determined by the initial condition setting means Swap processing means that continues until the set T _m or less,
An item distribution system characterized by including: Determining, using a computer, pq non-negative integer components a _mn of a p-by-q matrix (a _mn ), where m is a positive integer from 1 to p and n is a positive integer from 1 to q by all or part of the p type of item from the first item ₁ T until the item of T _p pieces of the p, from the first receiving means for receiving _one item V the sum of p type An item allocation method for distributing up to q-th receiving means for receiving a total of V _q items of p types,
T ₁ respectively of the total number of items of the total number T ₁ to T _p and the first to p to no number V ₁ item receives the receiving means and V _q are stored in the stored storage means of each item to a T _p, the receiving means of the first to q is a step of reading out the initial condition set in the V _q to no V ₁ received respectively, however, the non-negative integer component of the initial conditions and the matrix _{between, T 1 ≧ a 11 + a} 12 + ··· + a 1q, T 2 ≧ a 21 + a 22 + ··· + a 2q, ···, at _{T p ≧ a p1 + a p2} + ··· + a pq _{There, V 1 = a 11 + a} 21 + ··· + a p1, V 2 = a 12 + a 22 + ··· + a p2, ···, V q = a 1q + a 2q + ··· + a pq) is satisfied The initial condition setting Tep,
Using the initial condition set in the initial condition setting step, the horizontal composition ratio V _n / (T ₁ + T ₂ +... + T _p ) regarding the component a _mn in the m-th row and the n-th column of the matrix. And the vertical component ratio T _m / (T ₁ + T ₂ +... + T _p ), and the component a _mn , which is the product of the calculated horizontal component ratio and the vertical component ratio, is calculated. A composition ratio calculating step for calculating a composition ratio (V _n / (T ₁ + T ₂ +... + T _p )) × (T _m / (T ₁ + T ₂ +... + T _p ));
For each component a _mn , the product of the product of the horizontal composition ratio and the vertical composition ratio calculated by the composition ratio calculation step and the total number of each item (V _n / (T ₁ + T ₂ +...). + T _p )) × (T _m / (T ₁ + T ₂ +... + T _p )) · (T ₁ + T ₂ +... + T _p ) = V _n · T _m / (T ₁ + T ₂ + ··· A distribution step of calculating + T _p ), processing the decimal part of the numerical value obtained as a result of the calculation, making it an integer, and distributing it to each component a _mn ;
In the numerical values distributed to the respective components a _mn by the apportioning step, the excess and subtraction resulting from the processing of the fractional part are adjusted, and the initial condition set by the initial condition setting step and the non-negative integer component of the matrix An adjustment step to satisfy the relationship between
Item distribution method characterized by including. Determining, using a computer, pq non-negative integer components a _mn of a p-by-q matrix (a _mn ), where m is a positive integer from 1 to p and n is a positive integer from 1 to q Accordingly, all or part of the p type of item from the first item ₁ T until the item of T _p pieces of the p, from the first receiving means for receiving _one item V the sum of p type An item allocation method for distributing up to q-th receiving means for receiving a total of V _q items of p types,
T ₁ respectively of the total number of items of the total number T ₁ to T _p and the first to p to no number V ₁ item receives the receiving means and V _q are stored in the stored storage means of each item to a T _p, the receiving means of the first to q is a step of reading out the initial condition set in the V _q to no V ₁ received respectively, however, the non-negative integer component of the initial conditions and the matrix _{between, T 1 ≧ a 11 + a} 12 + ··· + a 1q, T 2 ≧ a 21 + a 22 + ··· + a 2q, ···, at _{T p ≧ a p1 + a p2} + ··· + a pq _{There, V 1 = a 11 + a} 21 + ··· + a p1, V 2 = a 12 + a 22 + ··· + a p2, ···, V q = a 1q + a 2q + ··· + a pq) is satisfied The initial condition setting Tep,
Using the initial condition set in the initial condition setting step, the horizontal composition ratio V _n / (T ₁ + T ₂ +... + T _p ) regarding the component a _mn in the m-th row and the n-th column of the matrix. And the vertical component ratio T _m / (T ₁ + T ₂ +... + T _p ), and the component a _mn , which is the product of the calculated horizontal component ratio and the vertical component ratio, is calculated. A composition ratio calculating step for calculating a composition ratio (V _n / (T ₁ + T ₂ +... + T _p )) × (T _m / (T ₁ + T ₂ +... + T _p ));
For each component a _mn , the product of the product of the horizontal composition ratio and the vertical composition ratio calculated by the composition ratio calculation step and the total number of each item (V _n / (T ₁ + T ₂ +...). + T _p )) × (T _m / (T ₁ + T ₂ +... + T _p )) · (T ₁ + T ₂ +... + T _p ) = V _n · T _m / (T ₁ + T ₂ + ··· A distribution step of calculating + T _p ), rounding up the decimal point of the numerical value obtained as a result of the calculation, making it an integer, and dividing the result into each component a _mn ;
In the numerical values allocated to the respective components a _mn in the apportioning step, the excess and subtraction resulting from rounding up the fractional part are adjusted, and the initial condition set by the step of setting the initial condition and the non-negative of the matrix An adjustment step to satisfy the relationship between the integer components;
Item distribution method characterized by including. 6. The item distribution method according to claim 5, wherein the adjustment step includes:
A ranking process step for presetting the order of adjustment of the excess and the minor;
When the sum of each row and each column of each component a _mn apportioned by the apportioning step exceeds the initial condition set in advance by the initial condition setting step, according to the order set by the ranking processing step, A basic adjustment step in which each component a _{mn up} to a range of initial conditions set in advance by the initial condition setting step is set to 1, and 0 is set for components exceeding the total sum;
In the p components included in the column in which the sum of the components in the vertical direction is less than V _n set by the initial condition setting step, the initial condition setting step sets the p components in the order set by the ranking processing step. An addition processing step of adding 1 to each component a _mn until equal to each component V _n ;
In the q components included in the rows in which the total sum of the horizontal components of the matrix exceeds T _m set by the initial condition setting step, each component a _mn follows the order set by the ranking processing step. An excess relaxation step of subtracting 1 from
Set by the initial condition setting step according to the order set by the ranking processing step in the p components included in the column whose total sum of vertical components exceeds V _n set by the initial condition setting step Subtracting 1 from each component a _mn until it equals V _n, and subtracting the sum of vertical components in all columns equal to V _n set by the initial condition setting step;
A first row sum of the horizontal component is greater than the T _m, which is set by the initial condition setting step, the sum of the horizontal component is lower than T _m, which is set by the initial condition setting step 2 is specified, the process of subtracting 1 from the component of the first row and adding 1 to the component of the second row, the sum of the horizontal components in all rows is determined by the initial condition setting step. A swap process step that continues until the _{Tm is} less than or equal to the set _Tm ;
Item distribution method characterized by including.   A computer-readable storage medium storing a computer program that causes a computer to execute each step included in the item distribution method according to claim 4.   A computer program for causing a computer to execute each step included in the item distribution method according to any one of claims 4 to 6.