JP4529062B2 - Method for maintaining the capacity of goods in vending machines - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a method for maintaining the number of goods accommodated in a vending machine, and more specifically, without confirming the number of goods accommodated or sold in a plurality of vending machines regularly on site. Further, the present invention relates to a method capable of grasping the remaining number of stored or sold products in a plurality of vending machines from a remote place and replenishing the products at an appropriate time.
[0002]
[Prior art]
Along with recent changes in lifestyle, the sales style of products has changed greatly. For those who sell products, one of the important issues is to reduce labor costs and logistics costs.
[0003]
As one means for solving such problems, the development of electronic commerce represented by the Internet is expected. However, in Japan today, the Internet penetration rate in each home is not high compared to other countries such as Europe and the United States, and it is not possible to immediately achieve reductions in labor costs, logistics costs, etc. related to sales.
[0004]
As an example of the above-mentioned sales style, in recent years, sales of products using vending machines have been performed in Japan. Vending machines are located in various locations, for example, drinks such as juice and beer, confectionery, foods such as cup noodles and rice, luxury goods such as tobacco, and household goods such as shampoos and sleds Has been. Vending machines are rapidly spreading as a means of greatly reducing labor costs for sales, and the number of vending machines deployed in Japan is enormous.
[0005]
With the rapid spread of vending machines, new problems have occurred in recent years. That is, there is a problem that the number of users increases rapidly with the spread of vending machines, and the products in the vending machines arranged in various places are insufficient or sold out. Usually, the number of goods stored in the vending machine is checked regularly by a store or company that manages the number of goods stored in each vending machine. And in order to return the number of accommodation to the maximum state, it was necessary to replenish the vending machine with new products according to the shortage or the number of sold out items.
[0006]
However, a lot of waste occurs in terms of time and cost in the work of periodically visiting each installation place in this way to confirm the number of each vending machine accommodated and to introduce new products.
[0007]
Usually, a vending machine that handles products as described above stocks a plurality of products for each vehicle because it can provide various products to the user. Therefore, in order to check the number of accommodations and replenish new products, it is necessary to move a large number of products handled by each vending machine at the same time when visiting each placement location. In addition, there may be cases where there are no or very few products to be replenished when the number of accommodations is confirmed by patrol. Therefore, such a method of visiting each installation location to check the number of accommodations and replenishing new products is inefficient and still has a problem of increased logistics costs and labor costs.
[0008]
In addition, for stores or companies that own multiple vending machines, the number of products stored in the vending machines arranged for each unit, as well as the number of products stored in the vending machines for the entire region in charge, are ascertained. There is a need. Even if one product in a vending machine installed in a certain area is sold out or the number is reduced to the extent that it should be replenished, only the installation location is visited to introduce the product into the vending machine. That is inefficient. That is, it is preferable to grasp how much the specific product is insufficient in the entire jurisdiction area and replenish the entire jurisdiction area with the product corresponding to the shortage.
[0009]
For this reason, it is also important to grasp the total remaining number of products in all vending machines under the jurisdiction.
[0010]
[Problems to be solved by the invention]
The present invention has an object to solve the above-mentioned problems, and the object is to periodically sell a plurality of vending machines from a remote location without confirming the number of goods contained in the vending machines regularly. It is an object of the present invention to provide a method for maintaining the number of goods accommodated in a plurality of vending machines that can grasp the number of goods accommodated in a machine and appropriately replenish new goods.
[0011]
[Means for Solving the Problems]
The present invention is a method for maintaining the number of goods accommodated in a vending machine, and the remaining number of goods accommodated in n number of vending machines (where n is an integer of 2 or more). Is detected by the counting means respectively connected to the vending machine; the count values (a ₁ , a ₂ ,... A _n ) obtained from the counting means are transferred from the counting means to the first calculating means. A transmitting step; in the first calculation means, the sum S ₁ of the count values (a ₁ , a ₂ ,... A _n ), and the total maximum accommodation number S _{2 of the} products in the n vending machines step calculates each difference R between該和S ₁ and; when該和S ₁ is representative of the following preset value p _min of at said first calculating means, said difference obtained from said first arithmetic means Outputting R; and the sum of the number of inputs to the n vending machines matches the difference R So that the step of the product respectively introduced into the n-number of vending machines; including.
[0012]
The present invention is also a method for maintaining the number of items accommodated in a vending machine, wherein the number of items sold in n vending machines (where n is an integer equal to or greater than 2), A step of detecting by the second counting means respectively connected to the vending machine; the count values (b ₁ , b ₂ ... B _n ) obtained from the second counting means are sent from the second counting means to the second A step of transmitting to the calculating means; a step of calculating a sum S ′ ₁ of the count values (b ₁ , b ₂ ... B _n ) in the second calculating means; the sum S ′ ₁ being the second calculating means A step of outputting the sum S ′ ₁ when representing a value greater than or equal to a preset value at, and the sum of the number of inputs to the n vending machines matches the output sum S ′ ₁ A step of introducing the products into the n vending machines.
[0013]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, the present invention will be described in detail with reference to the drawings. In the drawings, the same reference numerals represent the same means.
[0014]
FIG. 1 is a schematic conceptual diagram showing an arrangement example of a vending machine and other means for explaining the first method of the present invention. FIG. 1 describes, as an example, a case where the first method of the present invention is used for three vending machines.
[0015]
In the first method of the present invention, first, n number (n is 2 or more an integer) vending machine X _{1 of,} X _2, the same number of accommodated items remaining in · · · X _n (hereinafter , the remaining number of accommodated _{items) m 1, m 2, ···} m n is a vending machine _{X 1,} X 2, counting means connected to the _{··· X n Y 1, Y 2} , ··· Y _n , respectively. Here, the term “vending machine” used in the present invention is a product that is individually separated in advance, for example, cans, plastic bottles, bottles, paper packs and other packaging containers, juice, water, To sell alcoholic beverages such as beer, confectionery, cup noodles, rice and other foods, tobacco, and other household goods; and shampoos, shavers, and other household goods; Say things.
[0016]
Counting means _{Y 1, Y 2, ··· Y} n is the remaining number of accommodated _m 1 of the vending machine of _products, m 2, and the remaining counting mechanism for counting the · · · _{m n,} obtained by counting count a ₁ of the number of remaining housing as electronic _data, a _2, a data conversion mechanism for converting the · · · a _n, and a transmission mechanism for transmitting the count value (none shown ) The remaining count mechanism includes a device that can output the remaining number of items for each product in each vending machine by, for example, subtracting the number of sales obtained by means such as a counter meter from the maximum number of items accommodated. These remaining count mechanism, data conversion mechanism and transmission mechanism are not particularly limited, and those having a structure well known to those skilled in the art are used.
[0017]
Then, counting means _{Y 1,} Y 2, the count value obtained by _{··· Y n a 1, a 2} , ··· a n , via any communications medium 52 such as a telephone line, a first It is transmitted to the calculation means 30.
[0018]
In the first calculation means 30, the vending machine _{X 1,} X 2 First, the count value based on _{··· X n a 1, a 2} , a sum _{S 1} of · · · _{a n} is calculated.
[0019]
In the first calculation means 30 further, the maximum number of summed the same product to be accommodated in the n-number of the vending machine (hereinafter, referred to as total Max number) is also a difference R between S ₂ and the sum S ₁ is computed. In the first calculation means 30, the total maximum number of accommodated S ₂ is set in advance for each one of products. Total Max number S _2, the type of vending machines managed by the present invention can be suitably modified by those skilled in the art depending on the number or the like.
[0020]
More first calculation means 30, the vending machine _{X 1, X 2, ··· X} n limit the number of the sum of the same product to be accommodated in (hereinafter, referred to the total limit number of accommodated) p _min is each type of goods Is set in advance. This total lower limit accommodation number p _min is not particularly limited. For example, from the total number of sales expected for a certain period (for example, one week or one month) expected from vending machines arranged at each installation location for the same product. Calculated and set. The total lower limit accommodation number p _min can be freely changed as necessary by a person skilled in the art.
[0021]
Next, the first calculation means 30 performs a calculation for comparing the sum S ₁ and the total lower limit accommodation number p _min . Operation in the first computing means, for example, from the total lower housing number _{p min} by subtracting the sum _{S 1} of the count value _(p min -S ₁₎ is performed by calculating the comparison value r. As a result, the comparison value r is 0 or more, that is, the sum S _{1 of the} count values (the sum of the remaining number of the same product in _n vending machines X ₁ , X ₂ ,... X _n ). When the total lower limit accommodation number p _min or less (S ₁ ≦ p _min ), the total maximum accommodation number S _{2 of the} same product to be accommodated in the n vending machines calculated above and the sum S of the count values S The difference R from ₁ is transmitted to the output means 50 via an arbitrary communication medium 54 such as a telephone line. On the other hand, when the comparison value r is smaller than 0 (when the sum S ₁ of the count values exceeds the total lower limit accommodation number p _min (S ₁ > p _min )), the first calculation means 30 sends an arbitrary communication medium 53. after it counting means _{Y 1, Y 2,} the signal is sent to the · · · _{Y n,} the detected remaining number of accommodated in each vending machine _{X 1, X 2, ··· X} n again. Note that the timing for detecting the remaining number of accommodations is not particularly limited. Re-detection may be performed continuously, or may be performed at a desired time interval.
[0022]
When the sum S ₁ of the count values is equal to or less than the total lower limit capacity p _min (S ₁ ≦ p _min ), the difference R transmitted through the communication medium 54 is transmitted through the output means 50 connected to the communication medium 54. Is output. Examples of the output means 50 include arbitrary display means such as a printer and a display. The output difference R is recognized by the administrator of the vending machine. Agent there was a contact from the manager or administrator, the same product of the number that corresponds to the difference R is newly prepared, vending machine X _1, X _2, each of the installation location of the ··· X _n Move to. Then, the same number of the same products corresponding to the difference R is newly introduced in each vending machine.
[0023]
In this way, it is possible to maintain the number of products accommodated in n vending machines without causing a shortage.
[0024]
In the first method of the present invention, a calculation for obtaining the sum S ₁ of the count value by the first calculation means 30, from the total limit number of accommodated p _min subtracting the sum S ₁ of the count value (p _min −S ₁ ) The calculation for obtaining the comparison value r is performed, and when the comparison value r is 0 or more, before transmission to the output means 50, the first calculation means 30 (not shown) is arranged at a remote location. in another operation means it has a difference R between the total Max number S ₂ and the sum S ₁ is may be calculated. In this case, the difference R is transmitted to the output means 50 through other calculation means (not shown).
[0025]
FIG. 2 is a schematic conceptual diagram showing an arrangement example of a vending machine and other means for explaining the second method of the present invention. FIG. 2 describes, as an example, a case where the second method of the present invention is used for three vending machines.
[0026]
In the second method of the present invention, _first , the number k ₁ , k ₂ of the same product sold in n (n is an integer of 2 or more) vending machines X ₁ , X ₂ ,... X _n . , · · · _{k n} is a vending machine _{X 1,} X 2, second counting means connected to the _{··· X n Z 1, Z 2} , are detected by · · · _{Z n.}
[0027]
Second counting means _{Z 1, Z 2, ··· Z} n is not shown, the automatic vending machine _{X 1, X 2,} ··· _X sales _k 1 of the same product in the _n, k 2, · · · and sales counting mechanism for counting the k _n, sales _k 1 obtained by _{counting, k 2,} ··· k _n count _b 1 as an electronic _data, b 2, a · · · _{b n} Each includes a data conversion mechanism for converting and a transmission mechanism for transmitting the count value. The sales counting mechanism is a device (for example, a counter meter) that accumulates the number of one type of product in the vending machine every time one product is sold from a state in which the maximum number of products is stored in advance. . These sales counting mechanism, data conversion mechanism and transmission mechanism are not particularly limited, and those having a structure well known to those skilled in the art are used.
[0028]
Next, the count values b ₁ , b ₂ ,... B _n obtained by the second counting means Z ₁ , Z ₂ ,... Z _{n are} transmitted via an arbitrary communication medium 52 such as a telephone line. It is transmitted to the second calculation means 32.
[0029]
In the second calculation means 32, the total sales upper limit number (hereinafter simply referred to as the total sales upper limit number) q _max in the vending machine for warning is stored in advance for each type of the same product accommodated in each vending machine. Is set. The total sales upper limit number q _max is a value equal to or less than the maximum number that can be accommodated by the n vending machines to be managed. In this range, the total sales upper limit q _max can be freely changed as appropriate by those skilled in the art.
[0030]
In the second calculation means 32, the vending machine _{X 1,} X 2 First, the count value based on _{··· X n b 1, b 2} , the sum S _'1 of · · · _{b n} is calculated. Further, the second calculation means 32 also performs a calculation for comparing the sum S ′ _{1 of the} respective count values b ₁ , b ₂ ,... B _n with the total sales upper limit q _max . The calculation in the second calculation means 32 is performed by, for example, subtracting the total sales upper limit q _max from the sum S ′ _{1 of the} obtained count values (S ′ ₁ −q _max ) and calculating the comparison value r ′. Done. As a result, 'it is 0 or more, i.e., the sum of each count value obtained S' comparison value r _{1 (vending} machine X _1, X _2, total sales of the same product · · · X _n) is When the total sales upper limit q _max is equal to or greater than (S ′ ₁ ≧ q _max ), the sum S ′ ₁ of the respective count values is transmitted to the output means 56 via an arbitrary communication medium 54 such as a telephone line. On the other hand, when the comparison value r is smaller than 0 (when the sum S ′ ₁ of the count values is less than the total sales upper limit q _max (S ′ ₁ <q _max )), the second calculation means 32 sends an arbitrary communication medium. counting means _Z 1 through _53, Z 2, is sent the signal to · · · _{Z n,} each vending machine _{X 1,} X 2 again, sales in · · · _{X n} is detected. Note that the timing for detecting the number of sales of each vending machine again is not particularly limited. Re-detection may be performed continuously, or may be performed at a desired time interval.
[0031]
The sum S ′ ₁ of the respective count values transmitted to the output means 56 is output in a form recognizable by the administrator of the vending machine, and this administrator or the agent who has contacted the administrator outputs this sum. the same product of the number corresponding to the sum S _'1 of the count value and newly prepared, vending machine X _1, X _2, to move to each location of ··· X _n. Then, the same product number of total in each vending machine corresponds to the sum S _'1 of the count value is newly introduced.
[0032]
【The invention's effect】
ADVANTAGE OF THE INVENTION According to this invention, it can maintain, without making the accommodation number of the goods accommodated in the vending machine short. For the administrator, replenishment of products to these vending machines is not necessary unless the total number of identical products remaining in each vending machine falls below a certain number. As a result, there is no need to periodically check the remaining number of items stored at the installation location of each vending machine, and it is not necessary to transport an excessive amount of products to the installation location of each vending machine.
[Brief description of the drawings]
FIG. 1 is a schematic conceptual view showing an arrangement example of vending machines and other means for explaining a first method of the present invention.
FIG. 2 is a schematic conceptual view showing an arrangement example of a vending machine and other means for explaining a second method of the present invention.
[Explanation of symbols]
First calculation means 30
Second computing means 32
Output means 50, 56
Communication media 52, 53, 54
Vending machines X ₁ , X ₂ , X _n
Counting means Y ₁ , Y ₂ , Y _n
Second counting means Z ₁ , Z ₂ , Z _n

Claims (2)

A method for maintaining the number of items stored in a vending machine,
a step of detecting the remaining capacity of each of the products in n vending machines (where n is an integer equal to or greater than 2) by counting means respectively connected to the vending machines;
Transmitting the count values (a ₁ , a ₂ ,... A _n ) obtained from the counting means from the counting means to the first calculating means;
In the first calculation means, the sum S ₁ of the count values (a ₁ , a ₂ ,... A _n ), and the total maximum accommodation number S ₂ and the sum S of the products in the n vending machines Calculating each difference R from ₁ ;
Outputting the difference R obtained from the first computing means when the sum S ₁ is less than or equal to a value p _min preset by the first computing means; and to the n vending machines A step of introducing each of the products into the n vending machines such that the sum of the number of inputs coincides with the difference R;
Including the method. A method for maintaining the number of items stored in a vending machine,
detecting the number of sales of the product in n vending machines (where n is an integer equal to or greater than 2) by second counting means respectively connected to the vending machine;
Transmitting count values (b ₁ , b ₂ ... B _n ) obtained from the second counting means from the second counting means to the second computing means;
Calculating a sum S ′ ₁ of the count values (b ₁ , b ₂ ... B _n ) in the second computing means;
A step of outputting the sum S ′ ₁ when the sum S ′ ₁ is greater than or equal to a value preset by the second computing means; and a sum of the number of inputs to the n vending machines Injecting the goods into the n vending machines so as to coincide with the sum S ′ _{1 made} ;
Including the method.

Images