Classifications

• • G—PHYSICS
  • G07—CHECKING-DEVICES
  • G07F—COIN-FREED OR LIKE APPARATUS
  • G07F5/00—Coin-actuated mechanisms; Interlocks
  • G07F5/18—Coin-actuated mechanisms; Interlocks specially adapted for controlling several coin-freed apparatus from one place
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q10/00—Administration; Management
  • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
  • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q10/00—Administration; Management
  • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
  • G06Q10/063—Operations research, analysis or management
  • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
  • G06Q10/06311—Scheduling, planning or task assignment for a person or group
• • G—PHYSICS
  • G07—CHECKING-DEVICES
  • G07F—COIN-FREED OR LIKE APPARATUS
  • G07F9/00—Details other than those peculiar to special kinds or types of apparatus
  • G07F9/001—Interfacing with vending machines using mobile or wearable devices
• • G—PHYSICS
  • G07—CHECKING-DEVICES
  • G07F—COIN-FREED OR LIKE APPARATUS
  • G07F9/00—Details other than those peculiar to special kinds or types of apparatus
  • G07F9/002—Vending machines being part of a centrally controlled network of vending machines
• • G—PHYSICS
  • G07—CHECKING-DEVICES
  • G07F—COIN-FREED OR LIKE APPARATUS
  • G07F9/00—Details other than those peculiar to special kinds or types of apparatus
  • G07F9/02—Devices for alarm or indication, e.g. when empty; Advertising arrangements in coin-freed apparatus
  • G07F9/026—Devices for alarm or indication, e.g. when empty; Advertising arrangements in coin-freed apparatus for alarm, monitoring and auditing in vending machines or means for indication, e.g. when empty

Definitions

• the present invention relates to a system for dividing an area where a plurality of vending machines are installed into an area in charge of a worker who performs patrol work of the vending machines.
• a vendor such as Potola, which sells products at vending machines, regularly replenishes products, checks inventory, collects cash, replenishes change, and collects garbage for each vending machine.
• a vendor such as Potola
• area division is performed manually using a map so that the area of each assigned area is approximately equal. Was. By using the map in this way, the state of the area division can be visually grasped.
• Patent Document 1 Japanese Patent Application Laid-Open No. Hei 9-1990
• Patent Document 2 Japanese Patent Application Laid-Open No. 2000-4-2022
• An object of the present invention is to provide a technology for objectively dividing an area where a plurality of vending machines are installed into a plurality of areas in charge so that workers who patrol the vending machines can have a fair feeling. It is in.
• Another object of the present invention is to provide a technique for dividing an area in which a plurality of vending machines are installed into a plurality of areas in charge so that the amount of work performed by workers performing patrol work of the vending machines is equal. Is to do.
• Yet another object of the present invention is to provide an area in which a plurality of vending machines are installed in an area in which a worker who objectively patrols the vending machines can visually grasp the divided state. It is to provide a technology for dividing into.
• Still another object of the present invention is to provide a technology for dividing an area where a plurality of vending machines are installed into a plurality of areas in charge so that a worker who patrols the vending machines can efficiently perform the patrol work.
• Still another object of the present invention is to provide a plurality of vending machines in an area where a plurality of vending machines are installed so as to reduce the total work volume of all workers who perform patrol work of the vending machines. The purpose is to provide the division technology to the responsible area.
• an area division system for dividing an area where a plurality of vending machines are installed into an area in charge of a worker who performs patrol work of the vending machines.
• Initial setting unit that sets multiple areas including vending machines according to the number of persons in charge, calculation unit that calculates statistics determined by the characteristics of vending machines included in each area, and identification unit that takes into account statistics After selecting an area, vending to that specific area
• a processing unit for repeatedly executing processing for expanding the area by adding machines, terminating the processing when predetermined conditions are satisfied, and determining the obtained area as an area in charge of a plurality of persons in charge.
• a featured area division system is provided.
• the characteristics of vending machines include the location information of vending machines, arrangement information between vending machines, working time, sales, type, moving speed and moving time between vending machines, and certain locations such as bases. Includes the moving speed, moving time, etc.
• the statistics can be calculated based on the characteristics of all vending machines included in the area, but the characteristics of vending machines exhibiting specific characteristics in comparison with other vending machines can be calculated. Can also be calculated based on
• the predetermined condition is, for example, when all the vending machines are assigned to any area in this area, when the candidate is selected a predetermined number of times, and when the statistics between the areas are calculated.
• the difference can be set when the difference falls within a predetermined range or when a condition in which these are appropriately combined is satisfied.
• the target area can be objectively divided into areas according to a predetermined standard.
• the area dividing system according to the present invention can further include a candidate selecting section for selecting a vending machine candidate to be added for each area, and the calculating section adds a vending machine candidate for each area.
• the processing unit can calculate a statistic at the time of the addition, and the processing unit can select a specific area in consideration of the statistic at the time when the vending machine candidate is added.
• the processing unit can select the specific area so that the difference in the statistic of each area becomes small in a state where the vending machine is added to any of the areas.
• the processing unit evaluates the uniformity of the statistics of each area when a vending machine is added to any of the areas, and selects a specific area based on the evaluation result. can do.
• the processing unit can select the specific area so that the difference in the statistics of each area when the vending machine is added to any of the areas is the most equal. . In this way, vending machines can be assigned to any area so that the statistics are even, and the target area can be divided fairly can do.
• the processing unit changes the area to which the vending machine is added, evaluates the uniformity of the statistic in each case, and specifies the uniformity by comparing the uniformity. You can select an area.
• the area dividing system according to the present invention can further include a position information storage unit that stores position information of the vending machine, and the candidate selection unit can select a candidate by referring to the position information of the vending machine. it can.
• the candidate selecting unit can sequentially select the candidate in consideration of the distance from the representative point determined based on the position information of the vending machine already assigned to each person in charge.
• the candidate vending machine is selected in consideration of the distance from the representative point of the area, so that the target area can be appropriately divided into areas having a predetermined shape.
• the candidate selection unit can determine the representative point based on the position information of all vending machines already assigned to each person in charge.
• the candidate selection unit can determine, as the representative point, the center of gravity of the position of the vending machine already assigned to each person in charge.
• the statistic may be the amount of work of each person in the case where the work is performed by patroling the vending machines included in each area in charge.
• the target area can be equally divided into the areas in charge so that the workload of each person in charge becomes equal. it can.
• the calculation unit can calculate the statistic in consideration of the travel time between vending machines.
• the area dividing system according to the present invention can further include a characteristic information storage unit that stores information on characteristics of each vending machine.
• the characteristic information storage unit can store the position information of each vending machine, and the calculating unit automatically stores the position information based on the position information between the vending machines.
• the travel time between vending machines can be calculated.
• the area can include the base, and the calculation unit can calculate the statistic in consideration of the travel time between the base and each vending machine.
• the area division system according to the present invention can further include a base information storage unit that stores position information of the base.
• the calculation unit can calculate the statistic in consideration of the working time of each vending machine.
• the calculation unit can calculate the statistic based on the type of each vending machine.
• the processing unit can add vending machines to each assigned area such that the distance between the vending machines included in each assigned area is within a predetermined limit distance. In this manner, vending machines at relatively close positions within a predetermined range of each other are classified into the same area, so that the target area can be divided into areas. In addition, when performing work between patrol machines, the work time in each area can be reduced.
• the area division system according to the present invention can further include an weight setting unit that adds a weight to the statistic for each area, and the calculation unit can calculate the statistic in consideration of the weight.
• the area division system can further include a combination designation receiving unit that receives designation of a combination of vending machines to be included in the same assigned area among a plurality of vending machines, and an initial setting unit.
• the processing unit can include the vending machine for which the combination is specified in the same area in charge.
• An area division system includes a map information storage unit that stores map information of a region, and a display process that displays vending machines included in each service area together with map information so that differences between the service areas can be recognized. And a unit.
• the area division system can further include a characteristic information receiving unit that receives input of information on characteristics of a vending machine via a network.
• a region where a plurality of vending machines are installed is used for patrol work of vending machines.
• the first data section that stores the identification information of vending machines that are candidates to be assigned, and information on the characteristics of vending machines that have already been assigned to each assigned area and vending machines that can be assigned next.
• a second data storage section storing a statistic calculated on the basis of the data structure. In this way, vending machines that have already been assigned to each assigned area can be distinguished from vending machines that are the next candidate to be assigned to each assigned area. It is also possible to calculate the amount and the like.
• the data structure of the present invention is a data storage system in which a statistic determined by the characteristics of a vending machine already assigned to each assigned area and a vending machine to be assigned next to each assigned area is stored for each assigned area. A part may be further included.
• the information on the characteristics of the vending machine includes the position information of each vending machine, and the data structure is based on the position information of the vending machine already assigned to each assigned area.
• the information processing apparatus may further include a data section for storing position information of the determined representative point for each assigned area.
• the data structure of the present invention may further include a data section for marking a corresponding area in charge when the identification information of the vending machine stored in the first data section changes. Can be.
• FIG. 1 is a flowchart showing the procedure of the area dividing process according to the first embodiment of the present invention.
• FIG. 2 is a diagram schematically showing the procedure shown in FIG.
• FIG. 3 is a block diagram showing a configuration of an area mirroring device that performs an area dividing process according to the first embodiment of the present invention.
• FIG. 4 is a diagram showing a part of the data structure of the vending machine information storage unit shown in FIG.
• FIG. 5 is a block diagram showing the initial setting unit shown in FIG. 3 in detail.
• FIG. 6 is a diagram showing a part of the data structure of the initial setting storage unit shown in FIG.
• FIG. 7 is a block diagram showing the division control unit shown in FIG. 3 in detail.
• FIG. 8 is a block diagram showing the logic storage unit shown in FIG. 3 in detail.
• FIG. 9 is a diagram showing a part of the data structure of the area division information storage unit shown in FIG.
• FIG. 10 is a flowchart showing a procedure of a setting process of a seed according to the first embodiment of the present invention.
• FIG. 11 is a diagram illustrating an example of the seed setting process illustrated in FIG. 10.
• FIG. 12 is a view for explaining another example of the seed setting processing shown in FIG.
• FIG. 13 is a flowchart showing a procedure of an area dividing process according to the embodiment of the present invention.
• FIG. 14 is a flowchart showing a procedure for selecting a vending machine candidate in step 102 shown in FIG.
• FIG. 15 is a view for explaining an example of the area dividing process shown in FIGS. 13 and 14.
• Fig. 16 is a flowchart showing the procedure for calculating the total number of courses in each divided area.
• FIG. 17 is a diagram showing a part of the data structure of the area division information storage unit.
• FIG. 18 is a diagram showing a screen for performing parameter setting and initial setting.
• FIG. 19 is a diagram showing a screen for performing parameter setting and initial setting.
• FIG. 20 is a diagram showing a screen for performing parameter setting and initial setting.
• FIG. 21 is a diagram showing a screen for setting parameters and initial settings.
• FIG. 22 is a diagram showing a screen for performing parameter setting and initial setting.
• FIG. 23 is a diagram showing a screen for performing parameter setting and initial setting.
• FIG. 24 is a flowchart illustrating a procedure of a process when the adjustment receiving unit receives a replacement process from a user.
• FIG. 25 is a diagram showing a seed setting process and area division according to the second embodiment of the present invention. It is a flowchart which shows the procedure of a process.
• FIG. 26 is a diagram showing a screen for setting the number of seed candidates and the selection condition in the second embodiment of the present invention.
• FIG. 27 is a block diagram illustrating a configuration of an area simula- tion device according to the third embodiment of the present invention.
• FIG. 28 is a block diagram specifically showing the initial setting unit shown in FIG.
• FIG. 29 is a block diagram showing the logic storage unit shown in FIG. 27 in detail.
• FIG. 30 is a flowchart showing a procedure of a shield setting process and an area dividing process according to the third embodiment of the present invention.
• FIG. 31 is a flowchart showing the procedure of the area number calculation process in step 222 shown in FIG.
• FIG. 32 is a diagram showing a screen for performing parameter setting and initial setting.
• FIG. 33 is a diagram showing a screen for performing parameter setting and initial setting.
• FIG. 34 is a diagram showing a screen for setting parameters and initial settings.
• FIG. 35 is a diagram showing an area simulator system including the area simulation device according to the fifth embodiment of the present invention.
• FIG. 36 is a diagram showing another example of a part of the data structure of the vending machine information storage unit.
• FIG. 37 is a diagram showing another example of a part of the data structure of the vending machine information storage unit.
• FIG. 38 is a block diagram showing a configuration in a case where the eraser device in the first embodiment has a data registration receiving unit.
• Figure 39 shows a screen for registering vending machine information.
• FIG. 40 shows a screen for registering vending machine information data.
• vending machines a business area including a plurality of vending machines (hereinafter, simply referred to as “vending machines”) is divided into areas in charge of workers who perform patrol work of vending machines.
• the vending machine included in the division to be divided is divided into a plurality of workers to carry out patrol work, the overall work efficiency increases and the labor of each worker is equal.
• Area division is performed as follows. In addition, each worker goes from a base, such as a sales office, to a vending machine in his or her area every day to carry out replenishment and delivery of goods, and to return to the base at the end of the day. Shall be performed.
• the area so that the distance between each vending machine and each vending machine to which each worker moves and the distance between the vending machine and the vending machine are as short as possible. Also, in order to equalize the labor of each worker, it is preferable to divide the area while adjusting the labor of the patrol work in a plurality of areas.
• FIG. 1 is a flowchart showing the procedure of the area dividing process according to the first embodiment of the present invention.
• various data required for the area division processing is registered (S 1).
• parameters necessary for area division are set (S2).
• initial settings such as setting of the number of areas provided in the business area (S 3) and setting of a seed serving as a starting point in each area (S 4) are performed.
• area division is performed starting from the seed (S5).
• the result of area division is displayed, and evaluation and adjustment are performed (S6).
• FIG. 2 is a diagram schematically showing the procedure shown in FIG.
• map information data Prior to area division processing, various data such as map information data, base information data, vending machine information data, etc. are registered. Subsequently, based on the registered various data, the map information is mapped on the screen, and the base and the vending machine are mapped to the corresponding positions on the map information as points. In addition, parameters and initial settings required for area division are set. The business division is divided into areas based on the parameters and initial settings by the area division engine. Subsequently, the map information and the area division status are mapped on the screen. At the same time, statistics for each area are listed.
• the statistics are, for example, the number of courses in each area (the amount of work per day), the number of vending machines included in each area, the average loading work time per vending machine, the average number of monthly loadings per vending machine, the vending machine
• the characteristics of vending machines included in each area such as the average distance from the base per site, the average distance between vending machines, the number of vending machines per course, the total sales, the average sales per vending machine, etc. This is the information shown.
• the user can see the displayed divided area and statistics on a screen (not shown), and can confirm the divided state of the area. Based on the statistics for each area, parameters are reset manually or automatically as necessary, and area division is performed again. The user can also manually change the points of vending machines belonging to each area based on the displayed information.
• the area division data is created, and this data is stored.
• FIG. 3 is a block diagram showing a configuration of an Eleash-Millet device for performing an area division process according to the present embodiment.
• the area simulation device 100 includes a display processing unit 108, a parameter setting unit 110, an initial setting unit 114, a division processing unit 115, a map information storage unit T1, It has a base information storage unit T2, a vending machine information storage unit T3, a parameter storage unit T4, an initial setting storage unit T5, an area division information storage unit T6, and a logic storage unit T7.
• the division processing section 115 has a candidate selection processing section 116 and a division control section 118.
• the map information storage unit T1 stores map information data of a business area to be divided.
• the site information storage unit T2 stores site information data.
• the base information data includes a base identification code, a base name, a base position (latitude and longitude, or X and Y coordinates), and the like.
• the base is, for example, a sales office in the business area.
• the vending machine information storage unit T3 stores vending machine information data.
• Vending machine information data includes base identification code, vending machine identification code, vending machine name, vending machine location (latitude, longitude and height, or X, Y, and Z coordinates), monthly sales (yen), and monthly loading Includes quantity (pieces), loading time per load (minutes), number of times of monthly loading, travel speed from base (kmZ hours), travel speed between vending machines (km / hour), etc.
• FIG. 4 is a diagram showing a part of the data structure of the vending machine information storage unit T3 in the present embodiment.
• the vending machine with the vending machine code “a” belongs to the base with the base code “100”, the name is “super”, the position is “(XY i) j, and the height is“ ground ”. ”, And the work time in this vending machine is“ 25 minutes ”.
• the display processing unit 108 performs a process of displaying various data on a screen (not shown).
• the parameter setting section 1 110 is the required parameter for dividing the business area into areas. We accept setting of lame overnight.
• the parameters include the standard daily working hours of each worker, the standard working hours of each vending machine, the standard traveling speed between vending machines, the standard traveling speed between bases and vending machines, the distance magnification, the restricted distance for vending machine acquisition, etc. Including.
• the parameter storage unit T4 stores these parameters.
• the initial setting unit 1 1 4 performs initial settings necessary for dividing the business area into areas.
• the initial setting unit 1 14 accepts selection of a seed setting method, number of areas, weight setting, combination designation, and the like from the user.
• FIG. 5 is a block diagram showing in detail the initial setting unit 114 shown in FIG.
• the initial setting section 114 includes a seed setting section 122, a combination designation receiving section 132, a wait setting receiving section 134, and an end condition setting receiving section 135.
• the seed setting unit 122 includes a seed setting method receiving unit 124, a seed setting receiving unit 126, an area number setting receiving unit 128, and a seed selecting unit 130.
• the seed is a vending machine that serves as a starting point in each area when dividing an area.
• the seed setting unit 122 selects a vending machine to be a seed from a plurality of vending machines.
• the seed setting method receiving unit 124 receives a manual or automatic selection as a seed setting method.
• the seed setting receiving unit 126 receives the input of the seed setting from the user.
• the area number setting receiving unit 128 receives the setting of the number of areas from the user.
• the seed selection section 130 automatically selects the number of seeds set in the area number setting reception section 128. There are various methods for automatically setting seeds. Seeds are set so that the sales area is divided into areas when vending machines within the business area are classified starting from each seed.
• the combination designation receiving unit 1332 receives from a user a designation of a combination of vending machines to be divided into the same area among a plurality of vending machines.
• the user can also specify the combination by referring to the vending machine points mapped on the screen, and can also specify the vending machine information storage unit.
• the combination can also be specified with reference to T3.
• the weight setting receiving unit 1 3 4 receives the seed set by the seed setting unit 1 2 2 When calculating the statistic of a plurality of areas set as the starting points, accept the setting of the weight to be added to the statistic.
• the end condition setting receiving unit 135 receives a setting of a condition for ending the area division processing.
• the termination conditions include, for example, (i) when all vending machines belong to any area, (ii) when vending machines are acquired in any area a predetermined number of times, (Iii) When the difference between the statistics in each area falls within a predetermined range, or when a condition where (i) to (iii) are appropriately combined is satisfied.
• FIG. 6 is a diagram showing a part of the data structure of the initial setting storage unit T5.
• vending machine codes “ a ” to “ z ” are included in the business area to be divided.
• the vending machine with the vending machine code “a” is selected as the seed for area 1.
• the vending machine with vending machine code “e” is selected as the area 2 seed.
• Area 1 has a weight of “1”, and area 2 has a weight of “2”.
• the combination of vending machine with vending machine code “c” and vending machine with vending machine code “d” is specified.
• the division processing unit 115 performs the area division of the division target business area starting from each seed set in the initial setting unit 114.
• the candidate selection processing unit 116 selects a vending machine located at a position close to the representative point of each area as a candidate to be classified into the area.
• the division control unit 118 assigns a corresponding candidate vending machine to any area so that the statistics of each area are the most equal among the areas.
• the division control unit 118 includes a statistic calculation unit 1336, a candidate belonging processing unit 1338, and an adjustment reception unit 140.
• the statistic calculation unit 136 calculates a statistic determined based on vending machines included in each area.
• the candidate attribution processing unit 13 8 stores the statistics for each area calculated by the statistics calculation unit 13 6 in all areas. A plurality of vending machines are sequentially assigned to each area so that they are almost equal. After the adjustment reception unit 140 has been divided into areas by the candidate selection processing unit 1 16, the statistic calculation unit 13 6, and the candidate belonging processing unit 1 38, the vending machine belonging to each area from the user is attached. Accept adjustments such as replacement. When the adjustment receiving unit 140 receives the adjustment from the user, the statistic calculation unit 136 calculates the statistic of each area when the adjustment is performed. As a result, if the change amount due to the adjustment is within the allowable range, the adjustment receiving unit 140 permits the adjustment.
• the logic storage unit T7 includes a logic storage unit T7a for selecting seeds, a logic storage unit T7b for selecting candidates, and a logic storage unit T7c for calculating statistics.
• the seed selection logic storage unit T7a stores logic required for automatic seed setting in the seed selection unit 130.
• the candidate selection logic storage unit T7b stores logic necessary for selecting candidate points to be assigned to each area in the candidate selection processing unit 116.
• the statistic calculation logic storage unit T7c stores the logic required for the calculation of the statistic in the statistic calculation unit 1336 of the division control unit 118.
• FIG. 9 is a diagram showing a part of the data structure of the area division information storage unit T6.
• the business area is divided into four areas, Area 1 to Area 4.
• vending machines with vending machine codes “a” and “b” belong to Area 1.
• vending machine with vending machine code “d” belongs to area 2
• vending machine with vending machine code “u” belongs to area 3
• vending machine with vending machine code “z” belongs to area 4.
• the area division information storage unit T6 can store various data calculated based on vending machine information of vending machines belonging to each area for each area.
• Eria division information storage unit T 6 includes, for example, the site one vending machine between the mean travel time vending machines between the average travel time M 2, processing necessary vending machine number N 2, stores the statistics (the total number of courses), and the like. These calculation methods will be described later.
• the display processing unit 108 displays the area division state on a screen (not shown). Thereby, the user can grasp the area division state. Based on the displayed area division status, the user can set parameters again, change initial settings, or change each area. Adjustments such as vending machine replacement belonging to a vendor.
• FIG. 10 is a flowchart illustrating logic required for the seed selection unit 130 to perform automatic seed setting, which is stored in the seed selection logic storage unit T7a in the present embodiment. is there.
• the number-of-areas setting receiving unit 128 receives the setting of the number of areas (the number of seeds) from the user (S10). Subsequently, the seed selection unit 130 selects an arbitrary number of areas as an initial point from points corresponding to a plurality of vending machines in the business area (S12). The seed selection unit 130 can select the initial points in the order of the list with reference to the vending machine information storage unit T3. The seed selection unit 130 detects the shortest distance It between the selected initial points (S14). Next, the seed selection unit 130 selects the next vending machine in the list in the vending machine information storage unit T3 as the inspection point (S16).
• Seed selection unit 130 in the initial point, and calculates the shortest distance I 2 between the test point and the initial point of nearest neighbors from the inspection point (S 18). Subsequently, the side selection unit 130 performs a first inspection (S20). In the first test, seed selection selecting section 130 compares the shortest distance I E between the initial point detected in step 14, the shortest distance I 2 calculated in Sutetsu flop 18 (S 22). If the shortest distance I 2 is greater than the shortest distance I i (Ye s of S 22), seed selection unit 130, the inspection point is replaced with any of the first period point as a new selection point (S 24). Here, the replacement point is the initial point that has the shorter distance from the inspection point among the points that make up the shortest distance I between the initial points.
• step 22 if the shortest distance I 2 is equal to or less than the shortest distance I i (No in S 22), seed selection unit 130 calculates the shortest distance I 3 from the inspection Bointo to the initial Boyne bets other than the uppermost points of the initial Bointo Yes (S26). The seed selection unit 130, recently calculates the shortest distance I 4 from the initial point next to the other initial point (S 28). Subsequently, the seed selection unit 130 performs a second inspection (S30). In the second test, shea one mode selection unit 130 compares the shortest distance I 3 calculated recently shortest distance I 4 and step 26 of the adjacent initial Bointo and other early Bointo (S 32).
• step 24 the seed selecting unit 130, the inspection The point is replaced with the nearest initial point to make a new selected point (S24).
• step 32 (No in S 32) The shortest distance I 4 below If there disengagement of the shortest distance I 3 are nearest neighbors of the initial point and other early point Bok, substitution point is not performed. The above processing is performed a predetermined number of times for all the points in the business area, for example, 100 times here.
• step 34 if i is 100 or less (No in S34), the process returns to step 14, and the shortest distance Ii between the new selected points is selected.
• the seed selection unit 130 selects the next vending machine in the list in the vending machine information storage unit T3 as an inspection point (S16), and thereafter repeats the same processing. On the other hand, if i> 100 in step 34 ((63 of 334), the point selection process ends. The seed selection unit 130 selects the selected point at this stage as a seed.
• FIG. 11 is a diagram specifically illustrating the seed setting process described with reference to FIG. Here, the number of areas is assumed to be “3”.
• points a, b, and c are selected as initial points.
• the seed selector 130 detects the shortest distance between these initial points.
• the shortest distance is between point a and point b.
• point d is selected as the inspection point.
• the seed selection unit 130 detects the nearest initial point from the point d, and calculates the shortest distance between the point d and the nearest initial point.
• the shortest distance L 2 is between point d and point c.
• Seed Selection section 1 30 compares the shortest distance 1 ⁇ and the shortest distance L 2.
• the seed selection unit 130 replaces the point d with another initial point and sets it as a new selected point.
• the point to be replaced with the point d is either the point a or the point b that forms the shortest distance 1 .
• the seed selection unit 130 determines the distances L 3 and L 3 between the point d and the points a and b to be replaced, as shown in FIG. Calculate 4 .
• L 4 > L 3 the point a is a replacement target.
• FIG. 12 is a diagram illustrating another example of the seed setting process. Again, the number of areas is assumed to be “3”.
• points a, b, and c are selected as initial points.
• the seed selection unit 130 detects the shortest distance between these initial points. Here, the shortest distance is between point a and point b.
• point e is selected as the inspection point.
• the seed selection unit 130 detects the nearest initial point from the point e, and calculates the shortest distance between the point e and the nearest initial point.
• the shortest distance L 2 is between point e and point b.
• Shi one mode selection unit 1 3 0 compares the shortest distance to x and the shortest distance L 2.
• the seed selection unit 130 performs the second inspection.
• the seed selection unit 130 sets the point between the point a and the point e close to the point e next to the initial point b closest to the inspection point point e. to calculate the shortest distance L 3.
• the shortest distance 1 ⁇ between the nearest point b and the nearest point a is calculated.
• Seed Selection section 1 3 0 compares the shortest distance 1 ⁇ and the shortest distance L 3.
• the point e is replaced with the nearest point b.
• the first inspection if the shortest distance between the inspection point and the existing selection point is longer than the shortest distance between the existing selection points, replacement of the selection point is performed. Short combinations of points will be eliminated. Further, among the selection points to be replaced, the selection point having the shorter distance to the inspection point is replaced, so that the distance between the new selection points can be further increased. In addition, even if the conditions of the first inspection are not satisfied, in the second inspection, when the inspection point is replaced with an existing selection point, the point is replaced if the distance between the other selection point becomes longer. Is performed. Therefore, the selected points are replaced so that the distance between the points becomes longer. With the above processing, multiple vending machines Therefore, it is possible to set vending machines whose distances from each other are equally long as seeds.
• FIG. 13 is a flowchart showing a procedure of an area dividing process performed by the area simulation device 100 according to the present embodiment.
• the seed is set manually or automatically by the initial setting unit 114 (S102).
• the candidate selection processing unit 116 selects a vending machine candidate belonging to the same area for each seed (S104).
• FIG. 14 is a flowchart showing the logic stored in the candidate selection logic storage unit T7b and required by the candidate selection processing unit 116 to select a candidate in the present embodiment. Since the candidate selection processing unit 116 performs the same processing for each area, only one area will be described. First, the candidate selection processing unit 116 calculates the position of the representative point in each area. Here, the candidate selection processing unit 116 calculates the center of gravity of the vending machine already acquired in the area as a representative point (S130). At the stage where each area contains only seeds, the position of the vending machine on the side becomes the center of gravity.
• the candidate selection processing unit 116 detects a vending machine located at the shortest position from the representative point of the area as a tentative candidate from vending machines that do not belong to any area yet (S132). Subsequently, among the vending machines already acquired in the area, the shortest distance between the shortest vending machine from the vending machines detected as the tentative candidates and the vending machine of the tentative candidate is calculated (S134). The minimum distance calculated here is compared with the vending machine acquisition limit distance preset by the parameter setting unit 110 (S136). If the minimum distance is within the limit (Yes; of S136), The vending machine of the temporary candidate is determined as a candidate for the area (S138).
• the candidate selection processing unit 116 sets a flag in that area.
• the shortest distance is not within the limit in step 136 (No in S136)
• step 140 if there is no independent vending machine (1 ⁇ 0 of 3140), the shortest point from the representative point of the area is selected from all vending machines including acquired vending machines already acquired in other areas.
• the vending machine at the position is detected as a temporary candidate (S142).
• the shortest distance between the shortest vending machine from the vending machines detected as the tentative candidates and the vending machine of the tentative candidate is calculated (S144).
• the shortest distance calculated here is compared with the vending machine acquisition limit distance preset by the parameter setting unit 110 (S146). If the shortest distance is within the limit (Yes of S146), the temporary candidate is set. Is determined as a candidate for the area (S138). On the other hand, in step 146, if the shortest distance is not within the limit (No in S146), it is determined whether or not there is another vending machine that can be acquired among the acquired vending machines (S148).
• step 148 If there is something that can be captured (Yes in S148), the process returns to step 142, and the vending machine at the next shortest position from the representative points in the area is detected as a candidate. Hereinafter, the same processing is repeated. If there is no vending machine that can be seized at step 148 (1 ⁇ 0 of 3138), the process of selecting a candidate for this area ends.
• the statistic calculation unit 136 determines whether or not a candidate has been selected in step 104 based on whether or not a flag has been set for each area.
• the statistic calculation unit 136 calculates the statistic of the area including the vending machine of the candidate (S108). For example, the total number of courses can be used as the statistic. The method for calculating the total number of courses will be described later.
• the candidate belonging processing unit 138 detects an area where the statistic of the area is the smallest (S110).
• the candidate attribution processing unit 138 detects that the statistic is the minimum (Yes in S110), the candidate attribution processing unit 138 causes the area to acquire a vending machine as a candidate (S112). Subsequently, the candidate belonging processing unit 138 determines whether or not the area division processing satisfies the termination condition with reference to the initial setting storage unit T5 (S114).
• the termination condition may be, for example, that there are no independent vending machines in the business area, that the candidate acquisition process in step 112 has been performed a predetermined number of times, for example, 100 times or more, or that the difference in statistics in each area is within a predetermined range. Set that it is within can do. If the termination condition is not satisfied (No in S114), the process returns to step 104 and selects the next candidate. In step 114, if the termination condition is satisfied (31, 63), the area division processing ends.
• step 110 If it is detected in step 110 that the statistic is not the minimum (No in S110), the process proceeds to step 116, where the candidate belonging processing unit 138 determines the area until another candidate is obtained by another area. Is suspended (No in S116).
• step 116 when the candidate is acquired by another area (Yes in S116), the candidate belonging processing unit 138 determines whether the vending machine already acquired in that area has been taken by another area. It is detected whether or not it is (S118). If the statistic has not been captured (No in S118), it means that there is no change in the vending machines and candidates already obtained in the area, so the process returns to step 110 to determine again whether or not the statistics are minimized. (S110).
• step 118 if the vending machine already acquired in that area is taken by another area (Yes in S118), the process proceeds to step 114, where it is determined whether or not the end condition is satisfied. . If the end condition is not satisfied (1 ⁇ 0 of 3114), the process returns to step 104, and the candidate selection processing unit 116 performs a process of selecting a new candidate. On the other hand, if no candidate is selected in step 104 (No in S106), the process proceeds to step 120, and the candidate belonging processing unit 138 suspends processing of the area until a candidate is acquired by another area. (1 ⁇ 0 of 3120).
• step 120 when the candidate is acquired by another area (Yes in S120), the candidate belonging processing unit 138 determines whether or not the vending machine already acquired in that area has been taken by another area. Detect (S122). If the vending machine already acquired in that area is taken by another area (Yes in S122), the process proceeds to step 114 to determine whether or not the end condition is satisfied. Here, when the termination condition is not satisfied (No in S114), the process returns to step 104, and the candidate selection processing unit 116 performs a process of selecting a new candidate.
• step 122 if the vending machine already acquired in the area is not taken by another area (No in S122), the process proceeds to step 124, and the candidate attribution processing section 138 sets the initial setting storage section T5 With reference to, it is determined whether or not the area division process satisfies the termination condition.
• step 124 it is determined that the termination condition is satisfied In this case (63 of 3124), the area division processing ends. If it is determined in step 124 that the termination condition is not satisfied (1 ⁇ 0 in 3124), the process returns to step 120, and the candidate belonging processing unit 138 repeats the process until a candidate is acquired by another area. The processing of the area is suspended (No in S120). Hereinafter, the same processing is performed.
• the candidate selection processing in step 104 a vending machine selected as a candidate for any of the areas is treated as independent. Also, if vending machines that are candidates for multiple areas overlap, the area with the highest priority for acquisition shall acquire that vending machine.
• FIG. 15 is a view for explaining an example of the area dividing process shown in FIGS. 13 and 14.
• areas are divided so that the total number of courses in each area is equal.
• vending machines and bases corresponding to points a to z are installed in this business area.
• the number of areas is set to 4 by the initial setting unit 114 will be described.
• the seed setting unit 122 sets point a, point d, point u, and point z as seeds for area 1, area 2, area 3, and area 4, respectively.
• the display processing unit 108 performs processing so that points belonging to different areas are displayed with different marks or different colors.
• the candidate selection processing unit 116 selects point candidates belonging to the area 1, the area 2, the area 3, and the area 4, respectively.
• candidate selection processing section 116 selects point e as a candidate for area 1, selects point g as a candidate for area 2, selects point Q as a candidate for area 3, and selects point y for area 4 Select as a candidate.
• the statistic calculation unit 136 sequentially calculates the total number of courses in each area according to a calculation method described later.
• the candidate belonging processing unit 138 causes the candidate to be obtained from the area where the total number of courses is the smallest, and every time a certain area acquires the candidate, the area where the total number of courses is the smallest is detected, and the candidate Is repeated.
• the candidate selection processing section 1 16 first detects a temporary candidate from independent points.
• the tentative candidate at this time is point o.
• the candidate selection processing unit 1 16 calculates the distance between the point S and the point O closest to the point O among the points already acquired in the area 3.
• the candidate selection processing section 1 16 compares this distance with a preset vending machine acquisition limit distance.
• the candidate selection processing unit 116 cannot select the point o as a candidate for the area 3.
• the candidate selection processing section 1 16 sequentially detects temporary candidates in the order of distance from the center of gravity of the area 3 for the independent points. As a result, if the shortest distance of any point to a point already belonging to area 3 is larger than the vending machine acquisition limit distance, the candidate selection processing unit 1 16 includes vending machines already acquired in other areas. To detect the temporary candidate again. As a result, the candidate selection processing section 1 16 detects a point X already belonging to another area 4 as a temporary candidate. The candidate selection processing unit 1 16 calculates the distance between the point X and the point s closest to the point X among the points already acquired in the area 3. The candidate selection processing section 1 16 compares this distance with a preset vending machine acquisition limit distance. Here, when the calculated distance falls below the acquisition limit distance, the candidate selection processing unit 1 16 selects a point X as a candidate for the area 3.
• a point close to a representative point such as the center of gravity of the area is determined. Since the vending machine at a different position is selected as the next candidate, each area can be formed into a block shape.
• a plurality of vending machines included in the business area are divided into a plurality of groups in consideration of the statistics of the vending machines, these vending machines can be divided into areas without extending over areas. Therefore, it is easy to grasp the status of grouping, and it is possible to give workers a sense of fairness.
• FIG. 16 is a flow chart showing the logic stored in the statistic calculation logic storage unit T7c and used by the statistic calculation unit 1336 to calculate the total number of courses in each area. Since similar processing is performed for each area, only one area will be described here.
• the statistic calculation section 1336 stores the base information data stored in the base information storage section T2, the vending machine information data stored in the vending machine information storage section T3, and the parameters stored in the parameter storage section T4. Calculate the total number of courses in the following procedure, referring to it as appropriate.
• the statistic calculation unit 136 first calculates the average travel time Mi from the base to the vending machine already belonging to the area and to the candidate vending machine (S160). First, after calculating the total distance from the base to each vending machine, the total distance is calculated by dividing the total distance by the moving speed between the base and the vending machine set by the parameter setting unit 110. Next, Mi is calculated by dividing the total travel time by the number of all vending machines in the area. Then, statistic calculation unit 1 3 6 calculates an average travel time M 2 between the vending machine (S 1 6 2). First, after calculating the total distance from each vending machine to the last n vending machines, the total distance is calculated by dividing the total distance by the moving speed between vending machines set by the parameter setting unit 110.
• the statistic calculation unit 136 calculates the number of vending machines that can be worked in one day (S164). Total working hours per day
• T z 2 XM 1 + M 2 X (N ⁇ l) + TXN X (T is the average working time per vending machine)
• the statistical amount calculation section 1 3 you calculation processing a vending machine number N 2 required per day (S 1 6 6).
• the number of reloads per month is calculated and summed for each vending machine to calculate the number of reloads W per month.
• the travel time from the base to the vending machine in each area is also taken into consideration, so that the distance from each area to the base is almost equal It can be divided so that In addition, since the number of courses is calculated in consideration of the distance between vending machines in each area, the operating area can be divided so that the moving distance in each area is equal.
• FIG. 17 is a diagram showing a part of the data structure of the area division information storage unit T6.
• the area division information storage section T6 includes an area column, an assigned vending machine code column, a candidate vending machine code column, a immediately preceding robbery column indicating a vending machine taken immediately before from another area, and a new candidate being selected and a statistic. Includes a recalculation column that indicates the area that needs to be recalculated.
• the area division information storage section T6 further includes, for each area, the average travel time between bases and vending machines M i column, the average travel time between vending machines M 2 column, and the number of vending machines requiring processing N 2 And statistics (total number of courses).
• the statistic calculation unit 1336 can grasp the area where the statistic needs to be recalculated.
• the statistic calculator 1 36 recalculates the statistic only for the marked areas.
• the results calculated by the statistic calculation unit 1336 are as follows: the average travel time between bases and vending machines in the corresponding area M i column, the average travel time between vending machines M 2 column, the number of vending machines required for processing N 2 column, and It is stored in the statistics (total number of courses) column.
• point w was originally acquired in area 3 and was captured in area 4 in the previous processing, it corresponds to area column ⁇ 4 '' as shown in Figure 17 (b) A mark is written in the capture column immediately before the attached point w. Thus, area 3 and other areas cannot select point w as the next candidate.
• vending machines are acquired in order from the area having the smallest statistic such as the total number of courses, so that the statistic in all areas is equalized. Can be.
• candidate vending machines are selected such that the distance between vending machines is reduced, so that the travel time in each area can be reduced, and the travel time in all areas can be reduced. As a result, work efficiency in the business area can be improved.
• FIGS. 18 to 23 show screens for setting parameters and initial settings.
• FIG. 18 shows a screen for selecting a division method. Here, “Tokyo 2” is selected as the division target base. Also, there are “seed manual setting” and “seed automatic setting” as options of the dividing method. Here, “seed manual setting” is selected.
• FIG. 19 shows the screen for setting the basic conditions for splitting.
• each worker's daily working time operating time
• working time for each vending machine moving speed between the base and vending machine
• moving speed between the vending machine and vending machine moving speed between the vending machine and vending machine
• distance magnification and vending machine acquisition limit distance Set.
• the daily work time of each worker is “7 hours 30 minutes”
• the work time of each vending machine is ⁇ 20 minutes ''
• the traveling speed between the base and vending machine is ⁇ 50 Km / h ''
• the traveling speed between the vending machine and the vending machine is ⁇ 50 KmZh ''
• the distance magnification is ⁇ 1
• the vending machine acquisition limit distance is ⁇ 10 km ”.
• the distance magnification is set to “2”
• the total distance from the base to each vending machine in the processing of step 16 and step 16 in FIG. 16 and the last n vending machines from each vending machine total distance average travel time and average moving time as twice to M 2 is calculated.
• the number of courses in each area is calculated from the travel time calculated from the travel distance between the base and the vending machine or between the vending machine and the vending machine, and the working time at each vending machine. Can be weighted.
• the straight line distance between the base and the vending machine and between the vending machine and the vending machine is used for calculating the number of courses.
• the vending machine acquisition limit distance is set to “10 km”, the distance exceeding 10 km from any of the vending machines already acquired in the area in step 1446 in Figure 14 Vending machines at will not be acquired in that area. Therefore, the shortest distance between vending machines in each area can be reduced to 10 Km or less, and the business area can be divided into a plurality of e-books.
• the vending machine acquisition limit distance can be set appropriately according to the size of the business area to be divided.
• seed manual setting When “seed manual setting” is selected on the division method selection screen shown in FIG. 18, a seed setting screen is displayed as shown in FIG. As shown in FIG. 20 (a), the user can set a seed from a list of vending machines, and as shown in FIG. 20 (b), can set a seed on a map.
• the set seed is displayed on the map as shown in Fig. 20 (b).
• points indicating vending machines are indicated by Hata on the map.
• vending machines set as initial seeds are marked with a ⁇ around the chin.
• the setting screen includes a “vending machine information” display screen and a “statistics information” display screen.
• a weight setting screen is displayed as shown in FIG.
• the weight set here is used when calculating a statistic in each area.
• weight “2” is set for area “4”. Therefore, in the process of calculating the total number of courses shown in FIG. 16, the statistic calculation unit 1336 doubles the number of courses calculated in area “4” by the number of courses in other areas. Compare with. In this way, the number of courses in area 4 will eventually be set to about half of the other areas. For example, such a weight setting can be made when a part-time worker is assigned to a person in area 4.
• a combination designation screen is displayed as shown in FIG.
• Vending machine combinations can be specified.
• point c and point d are specified in combination. In this case, when either one of the points c and d is selected as a candidate in one of the areas, the candidate selection processing unit 1 16 selects the other of the points c and d as the candidates for the area. select.
• the statistic calculation unit 136 calculates the statistic in consideration of all the points designated as the combination.
• the vending machine information storage unit T3 can store information on a preset combination of vending machines in addition to the data structure shown in FIG.
• vending machines with vending machine codes “b”, “c” and “d” are installed in the same building, and are named “Maru Building 1”, “Maru Building 2” and “Maru Building 3”. Since they are installed in the same building, their positions on the plane are almost the same, "(X 2 , Y 2 )”.
• the height of the vending machine with vending machine code "b" is “2nd floor”
• the height of vending machine with vending machine code "c” is “5th floor”
• the height of vending machine with vending machine code “d” is “8th floor” It is.
• the statistic calculation unit 1336 calculates the total time of the working time in each vending machine and the moving time in the height direction between the points designated as the combination. The statistic is calculated in consideration of the above.
• vending machines with vending machine codes “e” and “f” are both installed in Training Center A, and are called “Training Center Al” and “Training Center A 2”. Since these are installed side by side, their positions on the plane are almost equal, and both are “(X 3 , Y 3 )”. The height of vending machines with vending machine codes "e” and "f” is also "ground”.
• the statistic calculation unit 1336 does not need to consider the travel time between vending machines, but calculates the total working time of each vending machine. Calculate the statistic considering this.
• the result is stored in the area division information storage unit T6.
• the user can appropriately read the state of the area division from the area division information storage unit T6, and can display the state on the screen by the display processing unit 108.
• the adjustment receiving unit 140 can receive an instruction for correction from the user with some restrictions. Various restrictions can be considered for the restriction of the correction instruction from the user, but the adjustment receiving unit 140 may receive the correction only when, for example, the difference in the statistics of each area due to the correction is within a predetermined range. it can.
• FIG. 24 is a flowchart illustrating a procedure of a process when the adjustment receiving unit 140 receives a replacement process from a user.
• the adjustment reception unit 140 determines whether or not the user has the authority to perform the replacement process (S272).
• it is determined whether or not the user has the authority for the replacement process for example, For example, it can be performed by user authentication as to whether the user has authority.
• the replacement process has already been performed several times for the area division process, it is meaningless to perform the automatic area division if the replacement process is permitted many times. It is also possible to judge whether the number is within the number of times.
• step 272 If it is determined in step 272 that the user has the authority to perform the replacement process (Yes in S272), the statistic calculation unit 136 performs the replacement as instructed by the user. The statistic in each area is calculated (S274). Subsequently, the adjustment receiving unit 140 determines whether or not the difference in the statistic in each area when the replacement is performed is within an allowable range (S276). If the difference in the statistics is within the allowable range (Yes in S276), the adjustment receiving unit 140 sets the area division result reflecting the replacement instruction from the user as a new area division result. The data is stored in the area division information storage unit T6 (S278).
• step 272 determines that the user does not have the authority ( ⁇ 0 of 522) or if it is not within the allowable range in step 276 (No of S276).
• the adjustment receiving unit 140 determines that it is not possible to receive a replacement instruction from the user, and makes a notification that the replacement is not possible (S280).
• vending machines are sequentially taken in so that the distance between vending machines is reduced in each area, so that the distance between the areas is finally short.
• Vending machines are classified into each area. Therefore, one business area can be divided into block-based areas so as to reduce the distance between vending machines in each area.
• the business area can be divided so that the efficiency of the patrol work of the vending machine in each area is enhanced.
• vending machines are taken into each area so that the statistics of multiple vending machines included in each area are equal, workers can be given a sense of fairness. Furthermore, since these results are mapped together with the map information, the person in charge can objectively recognize the sense of fairness.
• the seed setting process in step 4 shown in FIG. Different from the embodiment.
• seeds having a number larger than the actually required number of seeds are selected, and a seed satisfying a predetermined condition is finally selected as a seed from the seeds.
• FIG. 25 is a flowchart showing a procedure of a seed setting process in the present embodiment.
• the area number setting receiving unit 128 receives the setting of the number of seed candidates and the selection condition (S200).
• the selection condition refers to how many seeds are finally selected under what conditions based on the number of seed candidates.
• the seed selection unit 130 sets the number of seed candidates set as the number of seed candidates in the same procedure as that shown in FIG. 10 (S202). Subsequently, the seed selection unit 130 performs group division in which the vending machines in the business area belong to one of the seed candidates set in step 202 (S204).
• vending machines in the business area can be attributed to the closest seed candidates among the seed candidates set in step 200.
• the division processing unit 115 may start with the seed candidate set in step 200 as a starting point and perform the same procedure as that shown in FIGS. 13 and 14. However, preliminary area division can be performed.
• the seed selection unit 130 selects some seed candidates as seeds based on the selection condition in consideration of the information on the vending machine divided into each seed candidate as a result of the group division (S200). 6).
• FIG. 26 is a diagram showing a setting screen for setting the number of seed candidates and selection conditions according to the present embodiment.
• “6” is input as a seed candidate.
• the selection conditions are as follows: "How many seeds are selected as seed candidates from the group with the largest number of vending machines based on the split result?" Would you like to select it as a potential candidate? "
• “3” is entered for the condition “How many of the groups with less vending machines will be selected as seed candidates based on the split result?”.
• six vending machines are selected as seed candidates, and the other vending machines are assigned to one of these six vending machines and are divided into groups.
• the number of vending machines in each group is detected, and among the six groups, three groups are selected in ascending order of the number of vending machines, and seed candidates in the group are selected as final seeds. You.
• area division is performed with the seeds as starting points so that the number of courses in a plurality of areas becomes equal. Therefore, if seeds are placed in an area where vending machines are densely populated, the seeds travel less to neighboring vending machines. For this reason, the area containing the shade may include more vending machines than other areas even with the same number of courses. If the number of vending machines in multiple areas is extremely different, there may be a sense of unfairness among workers, even if the number of courses is set the same.
• the area dividing process in the present embodiment it is possible to avoid setting a seed in an area where vending machines are densely set, or setting a seed at a position ft extremely far from other vending machines. Areas can be divided so that the number of courses in each area is equal, and the number of vending machines included in each area is also close. As a result, the unfairness of the worker in charge of each area can be reduced.
• the present embodiment differs from the first embodiment and the second embodiment in that the setting of the number of seeds is also performed automatically.
• FIG. 27 is a block diagram showing a configuration of area scheduler device 100 in the present embodiment.
• the area schmilay device 100 is divided into It is different from the Eliasmi-Smiret device 100 in the first embodiment in having a state determination unit 120. 27, the same components as those shown in FIG. 3 are denoted by the same reference numerals, and the description thereof will not be repeated.
• the division state determination unit 120 compares the statistics in each divided area to determine whether the division has been performed properly. . When the division state determination unit 120 determines that division has not been performed properly, parameters and initial settings are performed again, and the division processing is performed again.
• FIG. 28 is a block diagram showing details of the initial setting unit 114 in the present embodiment.
• the initial setting unit 114 further includes a course number setting receiving unit 142 and an area number calculating unit 144 in addition to the configuration described with reference to FIG. 5 in the first embodiment.
• the seed setting method receiving unit 124 receives a seed setting method such as seed manual setting, seed automatic setting, or course number setting.
• the seed setting method receiving unit 124 receives the seed manual setting or the seed automatic setting, the same processing as in the first embodiment or the second embodiment is performed.
• the seed setting method receiving unit 124 receives the selection of the course number setting
• the course number setting receiving unit 142 receives the setting of the course number from the user.
• the number-of-areas calculation unit 144 calculates the number of areas based on the number of courses received by the number-of-courses setting reception unit 144.
• FIG. 29 is a block diagram showing the mouthpiece storage unit T7 in the present embodiment in detail.
• the logic storage unit T7 further includes a logic storage unit T7d for calculating the number of areas in addition to the configuration shown in FIG. 8 in the first embodiment.
• the logic storage unit T7d stores logic necessary for calculating the number of areas in the area number calculation unit 144.
• FIG. 30 is a flowchart showing the logic stored in the area number calculation logic storage unit T 7 d and used by the area number calculation unit 144 to calculate the number of areas that divide the business area. is there.
• the number-of-courses setting receiving section 144 receives an input of the number of courses in each area from the user (S220).
• the number of courses is the amount of work each worker can do in one day, and therefore “1” is set as an initial value of the number of courses in each area. Have been. However, for example during busy periods, the number of courses can be set to one or more, or the number of courses can be set to one or less in consideration of business hours other than patrol work. Subsequently, the number-of-areas calculating section 144 calculates the required number of areas in the business area (S22)
• FIG. 31 is a flowchart showing the logic stored in the area number calculation logic storage unit T7d and used by the area number calculation unit 144 to calculate the required number of areas in this business area. This process is performed in the same procedure as the calculation of the total number of courses in each area described with reference to FIG.
• the area number calculation unit 144 is stored in the base information data stored in the base information storage unit T2, the vending machine information data stored in the vending machine information storage unit T3, and the parameter storage unit T4. Refer to the parameters as needed and calculate the total number of courses by the following procedure.
• number calculating unit 1 4 4 area calculates the average travel time M 3 to vending machines of the operating zone from the station (S 2 5 0). First, after calculating the total distance from the base to each vending machine, the total distance is calculated by dividing the total distance by the moving speed between the base and the vending machine set by the parameter setting unit 110. Then, the M 3 obtained by dividing the total travel time for all vending machines number.
• number calculating unit 1 4 4 area calculates the average travel time M 4 between vending machine (S 2 5 2).
• the total distance is calculated by dividing the total distance by the moving speed between vending machines set by the parameter setting unit 110. Then, by dividing this total travel time by n, the average travel time from each vending machine to another vending machine! ! ⁇ ⁇ :] !. Get. Subsequently, the sum of these average travel time mi ⁇ m n, to calculate the M 4 by dividing the total vending machine number.
• number calculating unit 1 4 4 area in this operating region, to calculate a vending machine number N 3 which can work in one day (S 2 5 4). Total working hours per day
• T z M 3 X 2 + M 4 (N 3 - 1) + TXN 3
• T is the average working time per vending machine
• ⁇ 3 ( ⁇ ⁇ - ⁇ 3 ⁇ 2 + ⁇ 4 ) / ( ⁇ 4 + ⁇ ) Is calculated.
• the seed selection unit 130 sets seeds twice as many as the calculated required number of areas in the same procedure as shown in FIG. 10 (S224).
• the seed selection unit 130 divides the group according to the same procedure as described in the second embodiment (S226). Thereafter, as a result of the drop division, the seed selection unit 130 selects seeds of the required number of areas in ascending order of vending machines in consideration of the number of vending machines assigned to each seed. The seed selected here is set as the final seed (S228).
• the division state determination unit 120 calculates the number of courses in the area actually divided under this condition, and evaluates the division state (S232). As a result, if the calculated number of courses is within the allowable range (Yes of S234), this processing ends and the result is displayed. If not (1 ⁇ 0 of 3234), the process returns to step 222 to calculate a new number of areas.
• FIGS. 32 to 34 show screens for setting parameters and initial settings in the present embodiment.
• FIG. 32 shows a screen for selecting a division method.
• the setting of the number of courses is included as an option of the dividing method in addition to the contents described with reference to FIG. 18 in the first embodiment.
• Figure 33 shows the screen for setting the basic conditions for splitting.
• the number of working days per week is included as an item.
• “5” days is set as the number of working days per week.
• “number of courses” is selected on the division method selection screen shown in FIG. 32
• a course number input screen is displayed as shown in FIG. 34.
• the user inputs the number of courses in each area.
• “1” is entered as the number of courses.
• the user inputs an allowable error range.
• it is set to + 10% and 1-10%. Therefore, area division is performed so that the number of courses in each area is 0.9 to 1.1.
• the business area to be divided can be divided into a plurality of areas only by setting the number of courses in each area. Since the operating area is automatically divided by the Area Schmilay device 100 so that the statistics of multiple vending machines included in each area are equalized, objective area division can be performed. Members can be given a sense of fairness.
• vending machines are sequentially taken into each area so that the distance between vending machines becomes shorter, so that vending machines with shorter distances between areas are finally classified into each area. Therefore, one business area can be divided into blocks of blocks, and the travel distance between vending machines in each cell can be reduced, so that the efficiency of patrol operations of vending machines can be improved. it can. (Fourth embodiment)
• the statistic calculation unit 1336 calculates the number of courses in each area
• the course is calculated in consideration of the actual work time for each vending machine stored in the vending machine information storage unit T3. It differs from the first to third embodiments in that the number is calculated.
• the calculation of the number of courses in each area includes the basic conditions shown in FIG. It has been described that the average work time of the work time for each vending machine input as "is used.” But for example In recent vending machines, some vending machines can check the stock quantity from a remote location, and some are cashless. The actual working time with vending machines differs depending on the characteristics such as the type of vending machine.
• the statistic calculation unit 1336 calculates the statistic by reflecting the work time set for each vending machine with reference to the type and characteristics of the vending machine stored in the vending machine information storage unit T3. Therefore, the number of courses corresponding to the actual amount of work can be calculated more accurately. In this way, the characteristics of each vending machine are stored in the vending machine information storage unit T3, and by using the information, the area can be divided more strictly, and the labor of the workers in each area can be evenly distributed. Can be
• the processing of the statistic calculation unit 1336 in the present embodiment will be described with reference to FIG.
• the statistic calculation unit 1336 calculates the average travel time Mi from the base to the vending machine already belonging to the area and the candidate vending machine, as in the first embodiment (S160).
• statistic calculation unit 1 3 6, as in the first embodiment calculates the average travel time M 2 between the vending machine (S 1 6 2).
• the statistic calculation unit 136 calculates the number of vending machines that can be worked in one day (S164).
• the statistic calculation unit 1336 first refers to the vending machine information storage unit T3, and obtains the total working time T of the vending machines and candidate vending machines already acquired in the area. Is calculated. In this case, the total working time of one day
• T z 2 XM X + M 2 X (N “l) + T.
• the statistic calculation unit 1336 calculates the number of vending machines ⁇ 2 that need to be processed per day, similarly to the first embodiment (S166). Then, statistic calculation portion 1 3 6, Ri by the dividing one day Oh or processing the vending machine number ⁇ 2 required by the vending machine number ⁇ E that can work in a single day, in each area Is calculated (S168).
• FIG. 36 is a diagram showing another example of a part of the data structure of the vending machine information storage unit T3.
• the vending machine information data includes “vending machine classification” and “parking status” for each vending machine.
• the vending machine type can be determined according to the amount of work in the vending machine. it can. For example, vending machines that do not require collection of sales proceeds because they are cashless and have a communication function, and do not require collection of sales, etc. Vending machines that cannot be used can be classified as “B”, and vending machines that require collection of sales proceeds, replenishment of change, confirmation of the amount of replenishment, etc., as “C”.
• the parking status can be determined according to the parking lot of the delivery car.
• the statistic calculation unit 1336 may calculate the working time of each vending machine based on the classification and parking status of each vending machine, the loading amount (not shown), and the like. In this case, the statistic calculation unit 1336 can calculate the number of courses in each area described above using the work time calculated as described above.
• the statistic calculation unit 1 36 refers to the vending machine information storage unit T 3 for each vending machine and calculates the statistic by reflecting the actual work time and the difference in the situation of each vending machine. Therefore, the number of courses can be calculated more strictly, and the labor of the workers in each area can be equalized. Also, when calculating the number of vending machines N i that can work in one day, the travel time from the base to the vending machines in each area is also taken into consideration, so that the distance from each base to the base is almost equal. Can be split. Further, since the number of courses is calculated in consideration of the distance between vending machines in each area, the business area can be divided so that the travel distance in each area is equal.
• FIG. 35 is a diagram showing an area simulator system 146 including the area simulator device 100 described in the first to fourth embodiments.
• the processing from the user described in the first to fourth embodiments can be performed from the user terminal 150 via the network 148.
• the user terminal 150 may be any device as long as it can communicate with the area simulation device 100 via the network 148.
• user terminal 150 can be a PC, PDA, mobile phone, or any other hardware.
• the user transmits an instruction necessary for the area division processing to the area shuffle device 1000 while actually patroling the business area where the vending machine is installed, with the user terminal 150. be able to.
• the area calendar device 100 described in the first to fourth embodiments has various data such as base information data and vending machine information data.
• a data registration receiving unit for receiving registration may be provided.
• FIG. 38 is a block diagram showing a configuration in a case where the area calendar device 100 in the first embodiment has a data registration receiving unit 152.
• the data registration receiving section 152 receives registration of various data from the user, and stores the data in the base information storage section T2 or the vending machine information storage section T3.
• the user can register various data while actually patrol the business area where the vending machine is installed with the user terminal 150. Therefore, more accurate and accurate information can be stored in the base information storage unit T2 and the vending machine information storage unit T3. Even if various data are registered in the base information storage unit T2 or vending machine information storage unit T3 in advance, if the situation at the site changes, the data should be updated promptly. Can be done.
• FIG. 39 and Fig. 40 show screens for registering vending machine information.
• Figure 39 (a) shows the screen for entering the vending machine code of the vending machine for which data is to be registered.
• FIG. 39 (b) shows an input screen for vending machine information data corresponding to the vending machine code input in FIG. 39 (a).
• “b” is input as the vending machine code in FIG. 39 (a).
• the data registration receiving unit 152 refers to the vending machine information storage unit T3 to determine whether the vending machine information data of the corresponding vending machine is already stored. If the vending machine information data of the corresponding vending machine is already stored, the data registration accepting unit 152 reads out the vending machine information data. You.
• the vending machine information data read out by the data registration reception unit 152 is displayed on the screen shown in Fig. 39 (b).
• the screen in FIG. 39 (b) is displayed in a blank state.
• the site code of the vending machine vending machine code "b" is "1 0 0 0"
• position "X X 2"
• Y Y 2”
• a height "second floor Vending machine information data is displayed. If there is a correction, the user can correct these vending machine information data. Also, since the work time is blank, the user inputs the work time.
• the data registration reception unit 152 replaces the vending machine with the vending machine code "b" with one of the vending machines. Inquires whether to specify combination.
• the data registration reception unit 152 allows the user to specify the vending machine for which the combination is to be specified.
• the data registration reception unit 152 may input the vending machine code of the vending machine for which the combination is specified. For example, as shown in FIG.
• the position information of the vending machine code "b" may be input.
• a list of vending machines that are likely to be specified for combination can be presented to the user based on the.
• the user can select and specify a vending machine to be combined with the vending machine with the vending machine code “b” from the vending machines included in the list.
• the user terminal 150 can transmit and receive necessary information to and from the user terminal 150 via the network 148, it is possible to actually travel around the business area and The information necessary for the division can be transmitted to the Eliasmi millet apparatus 100. Therefore, for example, various data can be updated accurately and quickly, and the accuracy of optimization of area division can be improved.
• the area division processing described with reference to FIGS. 13 to 15 Can be performed using various procedures.
• the vending machine located at the shortest position from the center of gravity of the vending machine already acquired in each area is detected as a candidate (Fig. 14, S130 and S130).
• 1 3 2) may detect the shortest vending machine as a candidate from vending machines set as seeds in each area.
• the determination as to whether to determine the detected vending machine as a candidate can be made by the same processing as in FIG.
• the initial setting unit 114 may receive the input of the number of courses from the user.
• the number of areas can be calculated by the processing shown in FIG. 31 with reference to the logic storage unit T7, and the required number of areas can be presented to the user.
• the user can select whether to perform the setting of the seed manually or automatically, and can fine-tune the setting of the weight and the like as necessary.
• the total number of courses in each area was described as an example as a statistic, but in each cell 7, for example, the number of vending machines included in each cell, the average loading time per vending machine, , Average monthly number of vending machines per vending machine, average distance from base per vending machine, average distance between vending machines, number of vending machines per course, total sales, average sales per vending machine, etc.
• Area division can also be performed. For example, when the average sales per vending machine is used as a statistic, sales in each area can be equalized.
• such processing can be combined with the processing of setting a seed candidate larger than the actually required number of seeds and performing group division. .
• an area in which a plurality of vending machines are installed can be objectively divided into a plurality of areas in charge so that a worker who patrols the vending machines can have a sense of fairness. Further, according to the present invention, it is possible to divide an area where a plurality of machines are installed into a plurality of areas in charge so that the amount of work performed by a worker performing patrol work of the vending machines is equal. ADVANTAGE OF THE INVENTION According to this invention, the area
• region where several vending machines are installed can be divided into several responsible areas so that the patrol work of the worker who patrols vending machines can be made more efficient.
• an area where a plurality of vending machines are installed can be divided into a plurality of areas in charge so that the total work amount of all workers who perform patrol work of the vending machines can be reduced. it can.

Landscapes

• Business, Economics & Management (AREA)
• Physics & Mathematics (AREA)
• General Physics & Mathematics (AREA)
• Human Resources & Organizations (AREA)
• Engineering & Computer Science (AREA)
• Strategic Management (AREA)
• Economics (AREA)
• Entrepreneurship & Innovation (AREA)
• Game Theory and Decision Science (AREA)
• Development Economics (AREA)
• Accounting & Taxation (AREA)
• Marketing (AREA)
• Operations Research (AREA)
• Quality & Reliability (AREA)
• Tourism & Hospitality (AREA)
• General Business, Economics & Management (AREA)
• Theoretical Computer Science (AREA)
• Educational Administration (AREA)
• Control Of Vending Devices And Auxiliary Devices For Vending Devices (AREA)
• Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Priority Applications (1)

Applications Claiming Priority (2)

Publications (1)

Family

ID=32063847

Family Applications (1)

Country Status (5)

Families Citing this family (9)

Citations (3)

• 2002
  • 2002-10-03 JP JP2002291644A patent/JP3911225B2/ja not_active Expired - Fee Related
• 2003
  • 2003-09-29 WO PCT/JP2003/012436 patent/WO2004032073A1/ja active Application Filing
  • 2003-09-29 CN CNB038139340A patent/CN100345166C/zh not_active Expired - Fee Related
  • 2003-09-29 AU AU2003266686A patent/AU2003266686A1/en not_active Abandoned
  • 2003-09-29 KR KR1020057005836A patent/KR100691642B1/ko not_active IP Right Cessation

Patent Citations (3)

Also Published As

Similar Documents

Legal Events