JP4364801B2 - Area division system - Google Patents

Description

【Technical field】
[0001]
  The present invention provides a plurality ofstoreIs divided into multiple areas, and each area is divided intostoreThe area division system to whichThe
[Background]
[0002]
  In a business area including a plurality of traveling points, the shortest route for traveling these traveling points can be obtained by a so-called traveling salesman problem method. The traveling salesman problem is a problem of searching for the shortest route when a salesman travels through n cities once. If the number of cities is n, (n-1)! When there are combinations of / 2, and the number of n increases, the number of all combinations increases exponentially, so it is difficult to obtain an exact solution. Therefore, various approximation algorithms are used to optimize the combination. Examples of such approximate algorithms include random search, hill climbing method, simulated annealing (SA), genetic algorithm (GA), and MST (Minimum Spanning Tree).
[0003]
  2. Description of the Related Art Conventionally, for example, there has been proposed a circuit support system that supports the generation of a circuit for a patrol vehicle such as a helper for home care and a delivery company that delivers articles to efficiently perform a circuit (see Patent Document 1). ). In this document, the target traveling area is, for example, 1 km.²Divide the blocks into blocks of a certain size, find the shortest circuit that passes through all the blocks in the circuit area, and the time required to move the circuit and contact with the object person in the circuit area A technique is disclosed in which it is determined whether or not the total time is within the actual activity time of the patrol person, and a block is added to or deleted from the patrol area according to the time. Thereby, it is possible to easily create an optimum circuit without requiring special knowledge and experience, and it is possible to quickly change the created circuit.
[0004]
  In addition, it is necessary in various scenes of daily life to appropriately select a point that satisfies a desired condition from a plurality of candidate points distributed and arranged in one area. For example, when a service is provided in a certain area, an attempt is made to suitably arrange a plurality of service points so that the service is distributed throughout the area.
[0005]
  As such an example, in the field of mobile communication, it is important to install a base station of a wireless communication network at an appropriate position. When creating a base station installation plan or a base station maintenance plan, it is necessary to consider where in the service area the base station can be installed to provide a high-quality service efficiently.
[0006]
  For example, a method for preparing a plurality of different installation patterns of base stations for a predetermined service area, calculating a quality evaluation value and a cost evaluation value for each installation pattern, and determining an installation pattern based on these values is proposed. (See Patent Document 2). Here, the quality evaluation value is calculated as a ratio of the area of the callable area to the area of the service area based on the simulation result for each installation pattern by simulating the electric field intensity distribution for each installation pattern.
[0007]
[Prior art documents]
[Patent Literature]
  Japanese Patent Application Laid-Open No. 11-134389
  Patent Document 2 Japanese Patent Laid-Open No. 8-317458
SUMMARY OF THE INVENTION
[Problems to be solved by the invention]
[0008]
  However, in the conventional route setting technology, only the consideration is made from the viewpoint of how quickly each visitor can visit a pre-assigned assigned area. For example, even in Patent Document 1, a tour area where a patrol person patrols is determined in advance, and the tour time is calculated assuming that all blocks are visited by the shortest route, and compared with the actual activity time. Only the fine adjustment to change the patrol area is performed by adding or deleting blocks. In the conventional method, only partial optimization is performed, and when one business area is shared by multiple patrolmen, the viewpoint of appropriately distributing multiple patrol points to each patrolperson Overall optimization from is not considered. By improving the work efficiency of individual patrolmen, the overall work efficiency can also be expected to improve to some extent, but this alone is the optimum in consideration of the characteristics of sharing one sales area with multiple patrolmen. It cannot be said that it was made. Moreover, if it is going to improve the whole work efficiency by raising the work efficiency of each patrol person, it will depend on an individual patrol person's effort, and the burden on a patrol person will become heavy.
[0009]
  Considering the feature of sharing among multiple patrolmen, it is important to consider how the multiple patrol points included in the business area should be distributed to multiple patrolmen. Furthermore, conventionally, since the assigned tour points are not properly distributed to each visitor, it has been impossible to objectively grasp the visitor's effort. As a result, unfairness may occur among patrolmen.
[0010]
  Conventionally, when a customer in a sales area is assigned to multiple salesmen to conduct sales activities, each salesman is evaluated not on the activity process but on the results such as sales and order volume. There were many things. However, sales, orders received, etc. depend heavily on the experience and ability of each salesman, and if the salesman is evaluated only from the results, each person runs on an individualistic basis and is organized and systematically. There was a problem that it was difficult to carry out various sales activities. However, in the past, it was difficult for an administrator to grasp the activity process, and it was only possible to evaluate from results such as sales and order volume.
[0011]
  When conducting organized sales activities, it is important for each office worker to work efficiently and systematically in accordance with the standard manual, without relying on personal experience or ability. For this purpose, it is necessary to establish a method for appropriately evaluating the salesman's activity process.
[0012]
  The object of the present invention is tostoreIs to provide a technique for dividing a region including a plurality of areas so that statistics such as the amount of work in each area are equal. Another object of the present invention is to provide a technique for dividing an area to be divided into a plurality of areas so that the total amount of work in the entire area can be reduced. Another object of the present invention is to provide a technique for dividing an area so that a person in charge in each area has a fair feeling. Another object of the present invention is to provide a technique for dividing an area into a plurality of areas on an objective basis while taking into consideration circumstances peculiar to the area to be divided. Another object of the present invention is to provide a technique for appropriately dividing an area according to the progress of a business plan in consideration of a series of business plans. Still another object of the present invention is included in the area to be divided.storeIt is an object of the present invention to provide a technique for quickly dividing an area even when the frequency fluctuates frequently.
[Means for Solving the Problems]
[0013]
  According to the present invention,
  pluralstoreIs divided into multiple areas, and each area isstoreIs an area division system to which
The plurality of store information data including at least location information of the store, and store information data including information about the store, which is data necessary for calculating the amount of work when performing work via the store. Store information storage unit for storing each store of
In order to store, for each of the areas, a statistic that is a work amount when work is performed via a store belonging to the area, a candidate store to be a candidate to be attributed to the area, and a store included in the area. An area division information storage unit,
A process of selecting a seed which is a store serving as a starting point of each area, causing the store to belong to the area, and storing the store in the area division information storage unit as a store belonging to the area is performed for each area. An initial setting section to perform,
With reference to the area division information storage unit and the store information storage unit, a representative point of the area is calculated based on the position information of the store that has already belonged to each area. Based on the distance, a candidate store that is a candidate to be added and attributed to the area is selected, and the process of storing the candidate store in the area division information storage unit as a candidate to be attributed to the area is performed for each area. A candidate selection processing unit;
With reference to the area division information storage unit and the store information storage unit, the store already belonging to the area based on the store information data of the store and the candidate store already belonging to the area And the amount of work when working through the candidate storeCalculate statisticsAnd the process which matches the said statistic with the said area and memorize | stores in the said area division | segmentation information storage part is performed for every said areaA statistic calculator,
With reference to the area division information storage unit, the area with the smallest statistical amount is selected as a specific area from the plurality of areas, the candidate store in the specific area is attributed to the specific area, A candidate attribution processing unit for storing the store in the area division information storage unit as a store belonging to the area;
An end condition setting accepting unit for accepting setting of an end condition for ending selection of the candidate store by the candidate selection processing unit and attribution of the candidate store by the candidate attribution processing unit;
The candidate store selection by the candidate selection processing unit and the attribution of the candidate store by the candidate attribution processing unit are sequentially executed until the end condition is satisfied.An area division system is provided.
[0014]
  here,storeThe term “operator” refers to a point where a worker stops when carrying out patrol work. for exampleQuotientVarious stores such as convenience stores when delivering goods, target customers for door-to-door sales and interviews, target customers for various delivery services such as newspapers and milk, target facilities for distributing leaflets, etc. It can be. The fact that the difference in statistics in each area is small means that, for example, when area division processing is performed, the average value of the difference in statistics between each area is the smallest, and the maximum difference in statistics between areas is Is the smallest, or it is determined that the statistics in each area are equal in consideration of these and individual circumstances.
[0015]
  According to the area division system of the present invention, a plurality of areas are reduced so that a difference in statistics in a plurality of areas is reduced.storeAre assigned to a plurality of areas, so that each area can be divided fairly by setting a statistic considering the purpose of area division.
[0016]
  Here, the end condition is, for example, all in this area.storeIs attributed to any area, the candidate selection process has been performed a predetermined number of times, the difference in statistics between the areas is within a predetermined range, or a combination of these conditions has been met. It can be when.
[0017]
  In this way, if candidate selection and candidate attribution are repeated and end conditions are set as appropriate, the target area can be objectively divided into areas according to predetermined criteria.
[0018]
  In the area division system of the present invention, the division processing unit includes all of the areas belonging to each area.storeThe representative point can be determined based on the position information.
[0019]
  In the area division system of the present invention, the division processing unit belongs to each area.storeCan be determined as a representative point. If it does in this way, the area used as object can be suitably divided into an area of a predetermined shape in the shape of a block.
[0020]
  In the area division system of the present invention,Candidate selection processing sectionBelongs to each areastoreSo that the distance between them is within the predetermined distancestoreCan be attributed to any of the areas. In this way, points at relatively close positions that are within a predetermined range of each other are classified into the same area, so that the target area can be divided into areas. Also for examplestoreWhen performing the work of patroling the space, the work time in each area can be shortened.
[0021]
  here,storeFor example, information aboutstoreLocation information,storeWorking hours atstoreThe type ofstoreThe purpose of patrol and the time required to achieve the purpose, etc.storeThis is data necessary for calculating the amount of work when work is performed via.
[0022]
  storeThe purpose of patrolstoreIs a store, such as strengthening relationships with stores, collecting information, sales proposals, contracts, verifications, and maintenance work such as product replenishment and delivery.
[0023]
  ReturnMaintaining the genus state is already attributed to any areastoreHowever, in the next area division processing, it is to belong to the area. In this way, if the difference in statistics in each area varies and re-area division processing must be performed, it is not desired to change the area.storeSince the belonging state can be maintained, re-area division processing can be performed according to the actual situation.
[0024]
  The area division system of the present invention can further include a weight setting unit that adds weights to the statistics in a plurality of areas, and the statistics calculation unit can calculate the statistics in consideration of the weights.
[0025]
  The area division system of the present invention includes a plurality of areas.storeShould be divided into the same areastoreA combination designation accepting unit that accepts the designation of the combination, and the division processing unit has designated the combinationstoreCan belong to the same area.
[0026]
  In the area division system of the present invention, the initial setting unit may include an area number setting reception unit that receives the number of areas to be set in the area, and the number of areas corresponding to the number of areasstoreCan be selected as the initial value of each area.
[0027]
  In order for the store selection department to select the store for processing to belong to the areaThe predetermined condition can be appropriately set according to the purpose of circulating the processing target points. For example, if the point being processed is a store in that region,storeDepending on the type of store, products handled, transaction years, past transaction information, sales strategy, etc.storeCan be elected.
[Brief description of the drawings]
[0028]
  The above-described object and other objects, features, and advantages will become more apparent from the preferred embodiments described below and the accompanying drawings.
FIG. 1 is a flowchart showing a procedure of area division processing in a 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 simulator device that performs area division processing in the first embodiment of the present invention;
4 is a diagram showing a part of the data structure of the store information storage unit shown in FIG. 3;
FIG. 5 is a block diagram showing in detail an initial setting unit shown in FIG. 3;
6 is a diagram showing a part of the data structure of the initial setting storage unit shown in FIG. 3;
7 is a block diagram showing in detail the division control unit shown in FIG. 3; FIG.
FIG. 8 is a block diagram showing in detail the logic storage unit shown in FIG. 3;
FIG. 9 is a diagram showing a part of the data structure of the area division information storage unit shown in FIG. 3;
FIG. 10 is a flowchart showing a procedure for seed setting processing in the first embodiment of the present invention;
FIG. 11 is a diagram for explaining an example of seed setting processing shown in FIG. 10;
12 is a diagram illustrating another example of the seed setting process illustrated in FIG.
FIG. 13 is a flowchart showing a procedure of area division processing in the present embodiment;
14 is a flowchart showing a procedure for selecting store candidates in step 104 shown in FIG. 13;
15 is a diagram for explaining an example of area division processing shown in FIGS. 13 and 14. FIG.
FIG. 16 is a flowchart showing a procedure for calculating the total number of courses in each divided area.
FIG. 17 is a diagram illustrating a part of the data structure of an 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 illustrating a screen for performing parameter setting and initial setting.
FIG. 21 is a diagram showing a screen for performing parameter setting and initial setting.
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 processing procedure when an adjustment receiving unit receives a replacement process from a user.
FIG. 25 is a flowchart showing a procedure for seed setting processing and area division processing according to the second embodiment of the present invention;
FIG. 26 is a diagram showing a setting screen for the number of seed candidates and selection conditions in the second embodiment of the present invention.
FIG. 27 is a block diagram illustrating a configuration of an area simulator apparatus according to a third embodiment of the present invention.
FIG. 28 is a block diagram showing in detail the initial setting unit shown in FIG. 27;
29 is a block diagram showing in detail the logic storage unit shown in FIG. 27. FIG.
FIG. 30 is a flowchart showing a procedure for seed setting processing and area division processing according to the third embodiment of the present invention;
31 is a flowchart showing a procedure of area number calculation processing in step 222 shown in FIG. 30;
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 performing parameter setting and initial setting.
FIG. 35 is a diagram showing an area simulator system including an area simulator device according to a fifth embodiment of the present invention.
FIG. 36 is a diagram showing another example of part of the data structure of the store information storage unit;
FIG. 37 is a diagram showing another example of a part of the data structure of the store information storage unit;
FIG. 38 is a block diagram showing a configuration when the area simulator apparatus in the first embodiment has a data registration accepting unit.
FIG. 39 shows a screen for registering store information data.
FIG. 40 shows a screen for registering store information data.
FIG. 41 is a diagram showing an area simulator system including an area simulator device according to a sixth embodiment of the present invention.
FIG. 42 is a diagram showing a part of the data structure of a store information storage unit in the sixth embodiment.
FIG. 43 is a diagram showing part of the data structure of a parameter storage unit in the sixth embodiment;
FIG. 44 is a flowchart illustrating a procedure of processing in which a division state determination unit determines whether or not a division state of each area is appropriate.
FIG. 45 is a flowchart showing a procedure for selecting an arrangement point of a base station according to the seventh embodiment of the present invention.
FIG. 46 is a block diagram showing a configuration of an arrangement point selection device according to a seventh embodiment of the present invention.
FIG. 47 is a flowchart illustrating a procedure by which an arrangement point selection unit selects an arrangement point of a base station in the seventh embodiment.
FIG. 48 is a diagram specifically explaining the arrangement point selection processing described with reference to FIG. 47;
FIG. 49 is a diagram for explaining another example of the arrangement point selection process described with reference to FIG. 47;
FIG. 50 is a flowchart showing a procedure for selecting an arrangement point of a base station when there is a difference in regional characteristics within a business area.
51 is a diagram for specifically explaining the procedure shown in FIG. 50; FIG.
FIG. 52 is a flowchart showing another example of a procedure for selecting an arrangement point of a base station when there is a difference in regional characteristics within a business area.
FIG. 53 is a diagram for specifically explaining the modified map creation method described in step 52 of FIG. 52;
FIG. 54 is a diagram schematically showing a modified map created by an arrangement point selection unit.
FIG. 55 is a diagram schematically showing an original diagram before the deformation process described with reference to FIGS. 52 to 54 and a deformation map after the deformation process is performed.
BEST MODE FOR CARRYING OUT THE INVENTION
[0029]
  In the embodiment of the present invention, an example will be described in which a business area including a plurality of stores is divided into areas in charge of persons in charge of the store patrol work. Here, when the stores included in the business area to be divided are shared by a plurality of persons in charge to perform patrol work, the area is divided so that the overall work efficiency increases and the labor of each person in charge is equalized. I do. In addition, each person in charge goes around the store in his / her area starting from a base such as a sales office every day, strengthens the relationship with the store, collects information, proposes sales, contracts, verifications, replenishment / delivery of products, etc. The maintenance work is performed, and the patrol work of returning to the base again at the end of the day is performed. Therefore, in order to increase the overall work efficiency, it is preferable to divide the area so that the distance between the base where the person in charge moves and the distance between the shop and the shop are as short as possible. Further, in order to equalize the labor of each person in charge, it is preferable to divide the area while adjusting the labor of the patrol work in a plurality of areas.
[0030]
  (First embodiment)
  In this embodiment, when each person in charge carries out patrol work such as replenishment / delivery of goods to the store, the overall work efficiency is increased and the area of each person in charge is equalized. An example of performing division will be described.
[0031]
  FIG. 1 is a flowchart showing a procedure of area division processing according to the first embodiment of the present invention. First, various data necessary for area division processing is registered (S1). Next, a store to be subjected to area division processing is selected (S2). Subsequently, parameters necessary for area division are set (S3). Next, initial settings such as setting of the number of areas provided in the business area (S4) and setting of seeds as starting points in each area (S5) are performed. Subsequently, area division is performed starting from the seed (S6). Thereafter, the result of area division is displayed, and evaluation and adjustment are performed (S7).
[0032]
  FIG. 2 is a diagram schematically showing the procedure shown in FIG.
  Prior to area division processing, various data such as map information data, base information data, and store information data are registered. Subsequently, based on the various registered data, the base information and the store are mapped on the screen as map points and corresponding positions on the map information. Here, the area division can be performed for all stores in which the store information data is registered, but can also be performed for only stores that meet a predetermined condition. When area division is performed only for stores that match a predetermined condition, the predetermined condition is input, and stores that match the condition are mapped as points at corresponding positions on the map information. In addition, parameters necessary for area division and initial settings are performed. Based on the parameters and initial settings, the business area is divided into areas by the area division engine. Subsequently, map information and area division states are mapped on the screen. At the same time, the statistics for each area are listed. Here, the statistics are, for example, the number of courses in each area (the amount of work per day), the number of stores included in each area, the average work time per store, the average number of monthly visits per store, and the bases per store Information indicating the characteristics of stores included in each area, such as average distance from store, average distance between stores, number of stores per course, total sales, average sales per store, and the like. The user can view the displayed divided areas and statistics on a screen (not shown), and can confirm the divided state of the areas. Based on the statistics for each area, parameter resetting is performed manually or automatically as necessary, and area division is performed again. In addition, the user can manually perform a point reassignment operation for a store to be attributed to each area based on the displayed information. Through the above processing, area division data is created, and this data is stored.
[0033]
  FIG. 3 is a block diagram showing a configuration of an area simulator device that performs area division processing in the present embodiment. The area simulator device 100 includes a display processing unit 108, a parameter setting unit 110, an initial setting unit 114, a division processing unit 115, a condition input receiving unit 154, a store selection unit 156, a map information storage unit T1, It has a base information storage unit T2, a store 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 unit 115 includes a candidate selection processing unit 116 and a division control unit 118.
[0034]
  The map information storage unit T1 stores map information data of business areas to be divided. The base information storage unit T2 stores base information data. The base information data includes a base identification code, a base name, a base position (latitude and longitude, or X coordinate and Y coordinate), and the like. Here, the base is, for example, a sales office or an inventory center in the business area.
[0035]
  The store information storage unit T3 stores store information data. The store information data includes the base identification code, the store identification code, the store name, the store location (latitude, longitude and height, or X coordinate, Y coordinate and Z coordinate), monthly sales (yen), and each product. To calculate statistics such as monthly sales volume (pieces), working time per minute (minutes), number of monthly visits, travel speed from the base (km / hour), travel speed between stores (km / hour), etc. Contains necessary information. The store information storage unit T3 may further include information necessary for selecting stores subject to area division processing, such as store types, group classifications such as chain stores and franchise chains, products handled, and transaction years. it can. The handling products can include information on products that require permission for sale, such as alcohol, tobacco, and medicine. FIG. 4 is a diagram showing a part of the data structure of the store information storage unit T3 in the present embodiment. Here, for example, the store with the store code “a” belongs to the base with the base code “1000”, the name is “super”, and the position is “(X₁, Y₁) ”, The height is“ above ground ”, the working time at this store is“ 25 minutes ”, the group belongs to“ A chain ”, and the handling product is“ alcohol / cigarette ”.
[0036]
  Returning to FIG. 3, the condition input receiving unit 154 receives an input of conditions for selecting a store to be subjected to the area division process from the user. The store selection unit 156 selects a store to be subjected to area division processing based on the conditions received by the condition input reception unit 154 with reference to the store information storage unit T3. With reference to FIG. 4, a process of selecting a store to be subjected to the area division process will be described. For example, when a product is replenished / delivered to a specific chain store or franchise chain, the user can input a group as a condition. For example, when the condition input reception unit 154 receives “K store” as the group classification, the store selection unit 156 refers to the store information storage unit T3 and stores “railway A station (platform 1)” of the store code “c” and Select "Railway A Station (Platform 2)" with store code "d". In addition, when replenishing / delivering a specific product, the user can input the handled product as a condition. For example, when the condition input receiving unit 154 receives “cigarette” as the handling product as a condition, the store selecting unit 156 refers to the store information storage unit T3 and stores the store codes “a”, “c”, “d”, “ e "stores can be selected. As described above, in the present embodiment, a store subject to area division processing is selected according to the purpose from a plurality of stores whose store information is stored in the store information storage unit T3, and the selected store is selected. Since the area division process is performed as a target, the area division process according to the purpose can be performed.
[0037]
  Returning to FIG. 3, the display processing unit 108 performs a process of displaying various data on a screen (not shown). The parameter setting unit 110 receives parameter settings necessary to divide the business area. The parameters include the daily standard work time of each person in charge, the standard work time at each store, the standard travel speed between stores, the standard travel speed between bases and stores, distance magnification, store acquisition limit distance, and the like. The parameter storage unit T4 stores these parameters.
[0038]
  The initial setting unit 114 performs initial settings necessary for dividing the business area into areas. The initial setting unit 114 receives selection of a seed setting method, number of areas (number of seeds), 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 unit 114 includes a seed setting unit 122, a combination designation receiving unit 132, a weight setting receiving unit 134, and an end condition setting receiving unit 135. The seed setting unit 122 includes a seed setting method reception unit 124, a seed setting reception unit 126, an area number setting reception unit 128, and a seed selection unit 130.
[0039]
  Here, the seed is a store that is a starting point in each area when the area is divided. In the present embodiment, for example, when the business area to be divided is divided into four, four seeds are set. The seed setting unit 122 selects a store to be a seed from a plurality of stores. The seed setting method reception unit 124 receives manual or automatic selection as a seed setting method. When the seed setting method reception unit 124 receives manual as the seed setting method, the seed setting reception unit 126 receives an input of seed setting from the user. When the seed setting method receiving unit 124 receives automatic as the seed setting method, the area number setting receiving unit 128 receives the setting of the number of areas from the user. The seed selection unit 130 automatically selects the number of seeds set by the area number setting reception unit 128. There are various seed automatic setting methods, and the seed is set so that the business area is divided into areas when the stores in the business area are classified starting from each seed.
[0040]
  The combination designation receiving unit 132 receives, from the user, designation of a combination of stores to be divided into the same area among a plurality of stores. For example, the user can specify a combination for a store in the same building or a store that is preferably visited by the same person in charge. Thereby, each person in charge can work efficiently. The user can specify the combination with reference to the store points mapped on the screen, or can specify the combination with reference to the store information storage unit T3.
[0041]
  The weight setting accepting unit 134 accepts the setting of weights to be added to the statistics when calculating the statistics in a plurality of areas each set with the seed set by the seed setting unit 122 as a starting point.
[0042]
  The end condition setting accepting unit 135 accepts setting of a condition for ending the area division process. As an end condition, for example, (i) when all stores come to belong to any area, (ii) when processing for acquiring stores into any area is performed a predetermined number of times, (iii) ) When the difference in statistics in each area falls within a predetermined range, or when the conditions appropriately combining (i) to (iii) are satisfied.
[0043]
  Returning to FIG. 3, the initial setting storage unit T5 stores these initial settings. FIG. 6 is a diagram illustrating a part of the data structure of the initial setting storage unit T5. Here, for example, stores with store codes “a” to “z” are included in the business area to be divided. Here, the store with the store code “a” is selected as the seed for area 1. As the seed of area 2, the store with the store code “e” is selected. In addition, weight “1” is added to area 1 and weight “2” is added to area 2. Note that the combination of the store with the store code “c” and the store with the store code “d” is designated. As a result, when one of the store of the store code “c” and the store of the store code “d” is acquired in any area, the other of the store of the store code “c” and the store of the store code “d” Is also acquired in that area at the same time.
[0044]
  Returning to FIG. 3, the division processing unit 115 performs area division of the business area to be divided, starting from each seed set by the initial setting unit 114. For each area, the candidate selection processing unit 116 selects a store located near the representative point of that area as a candidate to be classified into that area. The division control unit 118 causes a corresponding candidate store to belong to any area so that the statistics of each area are the most uniform among the areas. As illustrated in FIG. 7, the division control unit 118 includes a statistic calculation unit 136, a candidate attribution processing unit 138, and an adjustment receiving unit 140. The statistic calculator 136 calculates a statistic determined based on the stores included in each area. The candidate attribution processing unit 138 sequentially assigns a plurality of stores to each area so that the statistics for each area calculated by the statistics calculation unit 136 are substantially equal in all areas. The adjustment receiving unit 140 receives an adjustment such as store replacement belonging to each area from the user after the area is divided by the candidate selection processing unit 116, the statistic calculation unit 136, and the candidate attribution processing unit 138. When the adjustment receiving unit 140 receives an adjustment from the user, the statistic calculating unit 136 calculates the statistic of each area when the adjustment is performed. As a result, if the amount of change due to the adjustment is within an allowable range, the adjustment receiving unit 140 permits the adjustment.
[0045]
  As shown in FIG. 8, the logic storage unit T7 includes a seed selection logic storage unit T7a, a candidate selection logic storage unit T7b, and a statistic calculation logic storage unit T7c. The seed selection logic storage unit T7a stores logic necessary 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 attributed to each area in the candidate selection processing unit 116. The statistic calculation logic storage unit T7c stores logic necessary for calculation of the statistic in the statistic calculation unit 136 of the division control unit 118.
[0046]
  When the automatic area division processing by the division processing unit 115 is completed, the result is stored in the area division information storage unit T6. FIG. 9 is a diagram illustrating a part of the data structure of the area division information storage unit T6. Here, the business area is divided into four areas, area 1 to area 4. For example, stores with store codes “a” and “b” belong to area 1. Similarly, the store with the store code “d” belongs to area 2, the store with the store code “u” belongs to area 3, and the store with the store code “z” belongs to area 4. The area division information storage unit T6 can store various data calculated based on store information of stores belonging to each area for each area. The area division information storage unit T6 is, for example, a base-store average travel time M.₁, Average travel time between stores M₂, Number of stores that need processing₂, Statistic (total number of courses), etc. These calculation methods will be described later.
[0047]
  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 state, the user can make adjustments such as setting a parameter again, changing an initial setting, or changing a store belonging to each area.
[0048]
  FIG. 10 is a flowchart showing the logic necessary for the seed selection unit 130 to automatically set the seed stored in the seed selection logic storage unit T7a in the present embodiment.
[0049]
  The area number setting reception unit 128 receives the setting of the number of areas (number of seeds) from the user (S10). Subsequently, the seed selection unit 130 selects an arbitrary point of the number of areas as an initial point from points corresponding to a plurality of stores in the business area (S12). The seed selection unit 130 can select initial points in the order of the list with reference to the store information storage unit T3. The seed selection unit 130 determines the shortest distance I between the selected initial points.₁Is detected (S14). Next, the seed selection unit 130 selects the next store in the list of the store information storage unit T3 as an inspection point (S16). The seed selection unit 130 includes, among the initial points, the shortest distance I between the initial point closest to the inspection point and the inspection point.₂Is calculated (S18). Subsequently, the seed selection unit 130 performs a first inspection (S20). In the first inspection, the seed selection unit 130 determines the shortest distance I between the initial points detected in step 14.₁And the shortest distance I calculated in step 18₂Are compared (S22). Minimum distance I₂Is the shortest distance I₁If it is larger (Yes in S22), the seed selection unit 130 replaces the inspection point with one of the initial points to make a new selection point (S24). Here, the replacement target is the shortest distance I between the initial points.₁Is the initial point with the shorter distance from the inspection point.
[0050]
  In step 22, the shortest distance I₂Is the shortest distance I₁In the following case (No in S22), the seed selection unit 130 determines the shortest distance I from the inspection point to an initial point other than the nearest initial point.₃Is calculated (S26). The seed selection unit 130 also determines the shortest distance I from the nearest initial point to another initial point.₄Is calculated (S28). Subsequently, the seed selection unit 130 performs a second inspection (S30). In the second inspection, the seed selection unit 130 determines the shortest distance I between the nearest initial point and another initial point.₄And the shortest distance I calculated in step 26₃Are compared (S32). Minimum distance I₃Is larger (Yes in S32), the process proceeds to step 24, and the seed selection unit 130 replaces the inspection point with the nearest initial point to make a new selection point (S24).
[0051]
  In step 32, the shortest distance I₃Is the shortest distance I between the nearest initial point and other initial points I₄If it is the following (No in S32), the point is not replaced.
[0052]
  The above processing is performed a predetermined number of times, for example, 100 times here, for all points in the business area. In step 34, when i is 100 or less (No in S34), the process returns to step 14, and the shortest distance I between the new selection points is obtained.₁Is selected. The seed selection unit 130 selects the next store in the list of the store 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 (Yes in S34), the point selection process ends. The seed selection unit 130 selects a selection point at this stage as a seed.
[0053]
  FIG. 11 is a diagram for specifically explaining the seed setting process described with reference to FIG. 10. Hereinafter, the store will be described as a point. Here, the number of areas is “3”. First, as shown in FIG. 11A, point a, point b, and point c are selected as initial points. The seed selection unit 130 detects the shortest distance between these initial points. Here, the shortest distance L is between point a and point b.₁It becomes. Next, 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. Here, the shortest distance L is between point d and point c.₂It becomes. The seed selection unit 130 determines the shortest distance L₁And the shortest distance L₂And compare. Where the shortest distance L₂> Minimum distance L₁Therefore, the seed selection unit 130 replaces the point d with another initial point and sets it as a new selection point. Here, the object to be replaced with the point d is the shortest distance L₁Is either point a or point b. In order to determine the point to be replaced with the point d, the seed selection unit 130 determines the distance L between the point d and the points a and b to be replaced as shown in FIG.₃And L₄Is calculated. Where L₄> L₃Therefore, the point a becomes a replacement target. By the above processing, as shown in FIG. 11C, point b, point c, and point d are set as new selection points. The same process is repeated, and the selection point at the time when the predetermined number of processes is completed is selected as a seed.
  FIG. 12 is a diagram illustrating another example of seed setting processing. Again, the number of areas is “3”. First, as shown in FIG. 11A, point a, point b, and point c are selected as initial points. The seed selection unit 130 detects the shortest distance between these initial points. Here, the shortest distance L is between point a and point b.₁It becomes. Next, 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. Here, the shortest distance L is between point e and point b.₂It becomes. The seed selection unit 130 determines the shortest distance L₁And the shortest distance L₂And compare. Where the shortest distance L₂<Shortest distance L₁Therefore, the seed selection unit 130 performs the second inspection.
[0054]
  As shown in FIG. 11B, the seed selection unit 130 sets the shortest distance L between the point a and the point e closest to the point e next to the initial point b nearest to the point e that is the inspection point.₃Is calculated. The shortest distance L between the nearest point b and the nearest point a₁Is calculated. The seed selection unit 130 determines the shortest distance L₃And the shortest distance L₁And compare. Here, the shortest distance L₃> Minimum distance L₁Therefore, the point e is replaced with the nearest point b. By the above processing, as shown in FIG. 11C, point a, point c, and point e are set as new selection points. The same process is repeated, and a selection point selected when a predetermined number of processes is completed is set as a seed.
[0055]
  In the above processing, in the first inspection, since the selection point is replaced when the shortest distance between the inspection point and the existing selection point is longer than the shortest distance between the existing selection points, the distance between the points is short. Such combinations of points will be eliminated. Moreover, since the selection point with the shorter distance from the inspection point among the selection points to be replaced is replaced, the distance between the new selection points can be further increased. Even if the conditions of the first inspection are not satisfied, in the second inspection, when the inspection point and the existing selection point are replaced, the point is replaced when the distance from the other selection point becomes longer. Done. Therefore, the selected points are replaced so that the distance between the points becomes longer. Through the above processing, a store where the distance between the stores is equally long can be set as a seed.
[0056]
  FIG. 13 is a flowchart showing a procedure of area division processing by the area simulator apparatus 100 in the present embodiment. First, the seed is set manually or automatically by the initial setting unit 114 (S102). The candidate selection processing unit 116 selects store candidates to be attributed to the same area for each seed (S104).
[0057]
  Here, with reference to FIG. 14, the procedure in which the candidate selection process part 116 selects the candidate of the store which belongs to each area in step 104 is demonstrated. FIG. 14 is a flowchart showing logic necessary for the candidate selection processing unit 116 to select a candidate stored in the candidate selection logic storage unit T7b 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 point corresponding to the store acquired in the area as a representative point (S130). At the stage where each area contains only seeds, the point corresponding to the seed store becomes the center of gravity.
[0058]
  Next, the candidate selection processing unit 116 detects a store in the shortest position from the representative point of the area as a temporary candidate from unaffiliated stores that do not yet belong to any area (S132). Next, among the stores already acquired in the area, the shortest distance between the store detected as a temporary candidate and the temporary candidate store is calculated (S134). The shortest distance calculated here is compared with the store acquisition limit distance preset by the parameter setting unit 110 (S136). If the shortest distance is within the limit (Yes in S136), the temporary candidate store is The area is determined as a candidate (S138). When a new candidate is determined in any area, the candidate selection processing unit 116 sets a flag in that area. On the other hand, if the shortest distance is not within the limit in step 136 (No in S136), it is determined whether there are other unaffiliated stores (S140). When there is another unaffiliated store (Yes in S140), the process returns to step 132, and the store at the next shortest position from the representative point of the area is detected as a temporary candidate. Thereafter, the same processing is repeated.
[0059]
  In step 140, if there is no other unaffiliated store (No in S140), the shortest position from the representative point of the area is selected from all stores including acquired stores already acquired in other areas. A certain store is detected as a temporary candidate (S142). Subsequently, among the stores already acquired in the area, the shortest distance between the store detected as the temporary candidate and the temporary candidate store is calculated (S144). The shortest distance calculated here is compared with the store acquisition limit distance preset by the parameter setting unit 110 (S146). If the shortest distance is within the limit (Yes in S146), the temporary candidate store is The area is determined as a candidate (S138). On the other hand, if the shortest distance is not within the limit in step 146 (No in S146), it is determined whether there are other acquired stores that can be taken (S148). If there is something that can be taken (Yes in S148), the process returns to step 142, and the store at the next shortest position from the representative point of the area is detected as a candidate. Thereafter, the same processing is repeated. In step 148, if there is no store that can be taken (No in S138), the candidate selection process for this area is terminated.
[0060]
  Returning to FIG. 13, it is determined whether or not a candidate has been selected in step 104 (S106). The statistic calculator 136 determines whether or not a candidate has been selected in step 104 based on whether or not a flag is set for each area. If a candidate is selected in step 104 (Yes in S106), the statistic calculation unit 136 calculates the statistic of the area including the candidate store (S108). For example, the total number of courses can be used as the statistic. A method for calculating the total number of courses will be described later.
[0061]
  Subsequently, the candidate attribution processing unit 138 detects an area where the statistical amount of the area is minimum (S110). If the candidate attribution processing unit 138 detects that the statistic is minimum (Yes in S110), the candidate attribution processing unit 138 causes the area to acquire a candidate store (S112). Subsequently, the candidate attribution processing unit 138 refers to the initial setting storage unit T5 and determines whether or not the area division processing satisfies the end condition (S114). As an end condition, for example, there are no unaffiliated stores in the business area, the candidate acquisition process in step 112 is performed a predetermined number of times, for example, 100 times or more, or the difference in statistics in each area is within a predetermined range Can be set. If the end condition is not satisfied (No in S114), the process returns to step 104 to select the next candidate. If the end condition is satisfied in step 114 (Yes in S114), the area division process ends.
[0062]
  When it is detected in step 110 that the statistic is not the minimum (No in S110), the process proceeds to step 116, and the candidate attribution processing unit 138 suspends the processing for that area until a candidate is acquired by another area. (No in S116). In step 116, when a candidate is acquired by another area (Yes in S116), the candidate attribution processing unit 138 detects whether or not the store that has already been acquired in that area has been taken by another area ( S118). If it has not been taken (No in S118), it means that there is no change in the already acquired stores and candidates in the area, so the process returns to step 110 to determine again whether or not the statistic is minimized.
[0063]
  In step 118, if a store that has already been acquired in the area is taken by another area (Yes in S118), the process proceeds to step 114, and it is determined whether the end condition is satisfied. Here, when the end 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.
[0064]
  On the other hand, if no candidate has been selected in step 104 (No in S106), the process proceeds to step 120, and the candidate attribution processing unit 138 suspends processing for that area until a candidate is acquired by another area (in S120). No). In step 120, when a candidate is acquired by another area (Yes in S120), the candidate attribution processing unit 138 detects whether the store that has already been acquired in that area has been taken by another area ( S122). If a store that has already been acquired in the area is taken by another area (Yes in S122), the process proceeds to step 114, and it is determined whether or not the end condition is satisfied. Here, when the end 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.
[0065]
  On the other hand, in step 122, if the store that has already been acquired in the area is not taken by another area (No in S122), the process proceeds to step 124, and the candidate attribution processing unit 138 refers to the initial setting storage unit T5. Thus, it is determined whether the area division process satisfies the end condition. If it is determined in step 124 that the end condition is satisfied (Yes in S124), the area division process ends. If it is determined in step 124 that the termination condition is not satisfied (No in S124), the process returns to step 120, and the candidate attribution processing unit 138 suspends processing for that area until a candidate is acquired by another area. (No in S120). Thereafter, the same processing is performed.
[0066]
  In the candidate selection process in step 104, a store selected as a candidate for any area is treated as unaffiliated. In addition, when candidate stores of a plurality of areas overlap, an area with a high priority of acquisition acquires the store.
[0067]
  FIG. 15 is a diagram illustrating an example of the area division process illustrated in FIGS. 13 and 14. Here, the area division is performed so that the total number of courses in each area is equal. As shown in FIG. 15A, stores and bases corresponding to points a to z are installed in this business area. Hereinafter, a case where the number of areas is set to 4 by the initial setting unit 114 will be described.
[0068]
  As shown in FIG. 15B, 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 and different colors.
[0069]
  As illustrated in FIG. 15C, the candidate selection processing unit 116 selects point candidates to be attributed to area 1, area 2, area 3, and area 4. Here, the candidate selection processing unit 116 selects the point e as the area 1 candidate, selects the point g as the area 2 candidate, selects the point q as the area 3 candidate, and selects the point y as the area 4 candidate. Choose as. The statistic calculation unit 136 sequentially calculates the total number of courses in each area according to a calculation method described later. The candidate attribution processing unit 138 acquires a candidate from an area where the total number of courses is minimum, and each time an area acquires a candidate, detects an area where the total number of courses is minimum, and acquires a candidate. repeat.
[0070]
  When points are sequentially selected for each area in this manner, a plurality of points gradually belong to each area as shown in FIG.
[0071]
  Hereinafter, a process of selecting the next candidate point in the area 3 will be described with reference to FIG. As described in step 132 of FIG. 14, the candidate selection processing unit 116 first detects a temporary candidate from unaffiliated points. The temporary candidate at this time is point o. The candidate selection processing unit 116 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 unit 116 compares this distance with a preset store acquisition limit distance. Here, it is assumed that the calculated distance is larger than the acquisition limit distance. In this case, the candidate selection processing unit 116 cannot select the point o as the area 3 candidate.
[0072]
  The candidate selection processing unit 116 detects temporary candidates in order from the closest distance from the center of gravity of the area 3 for the unaffiliated points. As a result, if the shortest distance from any point that already belongs to the area 3 is greater than the store acquisition limit distance, the candidate selection processing unit 116 includes the stores already acquired in other areas. Re-detect the candidate. As a result, the candidate selection processing unit 116 detects the point x that already belongs to the other area 4 as a temporary candidate. The candidate selection processing unit 116 calculates the distance between the point s and the point x closest to the point x among the points already acquired in the area 3. The candidate selection processing unit 116 compares this distance with a preset store acquisition limit distance. Here, when the calculated distance is equal to or less than the acquisition limit distance, the candidate selection processing unit 116 selects the point x as the area 3 candidate.
[0073]
  It should be noted that points taken from other areas in the immediately preceding process are prevented from being taken, for example, by setting a flag. In this way, for example, if the point x was originally acquired in the area 3 and was taken by the area 4 immediately before this processing, the area 3 is re-established from the area 4 as the next candidate. It cannot be taken. By doing so, it is possible to prevent the candidate acquisition process from being substantially stopped by repeating one point between the two areas.
[0074]
  According to the area division processing in the present embodiment, a store near the representative point such as the center of gravity of the area is selected as the next candidate, so that each area can be formed in a block shape. Accordingly, when a plurality of stores included in the business area are divided into a plurality of groups in consideration of the statistics of the stores, these stores can be divided into areas without crossing between the regions. Therefore, it is easy to grasp the state of grouping, and the person in charge can have a sense of fairness.
[0075]
  FIG. 16 is a flowchart showing the logic stored in the statistic calculation logic storage unit T7c and used by the statistic calculation unit 136 to calculate the total number of courses in each area. Since the same processing is performed for each area, only one area will be described here. The statistic calculation unit 136 appropriately refers to the base information data stored in the base information storage unit T2, the store information data stored in the store information storage unit T3, and the parameters stored in the parameter storage unit T4. The total number of courses is calculated according to the procedure.
[0076]
  First, the statistic calculator 136 calculates the average travel time M from the base to stores that already belong to the area and candidate stores.₁Is calculated (S160). First, after obtaining the total distance from the base to each store, the total travel time is obtained by dividing the total distance by the base-store travel speed set by the parameter setting unit 110. The total travel time is then divided by the total number of stores in the area.₁Is calculated.
[0077]
  Subsequently, the statistic calculator 136 calculates the average travel time M between stores.₂Is calculated (S162). First, after obtaining the total distance from each store to the nearest n stores, the total travel time is obtained by dividing the total distance by the inter-store travel speed set by the parameter setting unit 110. Then, the average travel time m from each store to other stores is obtained by dividing this total travel time by n.₁~ M_nGet. Next, the average travel time m₁~ M_nAnd M by dividing by the total number of stores in the area₂Is calculated. Here, when n is small, the total number of stores in the area can be set to n.
[0078]
  Subsequently, the statistic calculation unit 136 determines the number N of stores that can be worked on in one day.₁Is calculated (S164). Total work time per day
Tz = 2 × M₁+ M₂× (N₁-1) + T × N₁
(T is the average work time per store)
So, transform this equation
N₁= (Tz-2 × M₁+ M₂) / (M₂+ T)
Is calculated.
[0079]
  On the other hand, the statistic calculation unit 136 determines the number N of stores that need to be processed per day.₂Is calculated (S166). First, the number of times of loading W per month is calculated by calculating and summing the number of times of loading per month for each store. Next, assuming that the number of working days in January for each person in charge is 4 weeks x 5 days = 20, N₂= W / 20 is obtained.
[0080]
  Thereafter, the statistic calculator 136 calculates the number N of stores that need to be processed per day.₂N stores that can work in a day₁The number of courses in each area = N₂/ N₁Is calculated (S168).
[0081]
  According to the above processing, the number of stores that can be worked in one day N₁Since the travel time from the base to the store in each area is also taken into consideration when calculating the value, each area can be divided so that the distances from the base are substantially equal. In addition, since the number of courses is calculated in consideration of the distance between stores in each area, it is possible to divide the business area so that the moving distance in each area is equal.
[0082]
  FIG. 17 is a diagram illustrating a part of the data structure of the area division information storage unit T6. The area division information storage unit T6 selects the area column, the belonging store code column, the candidate store code column, the immediately preceding take-off column indicating a store taken immediately from another area, and a new candidate, and recalculates statistics. Includes a recalculation column that shows the areas that need to be. Further, the area division information storage unit T6, as shown in FIG.₁Column, average travel time between stores M₂Column, number of stores required for processing N₂Column and statistics (total number of courses) column. FIG. 17A will be described on the assumption that a plurality of points are classified into areas as shown in FIG. At this time, since the point a is classified into the area 1, “a” is stored in the “affiliated store code” field associated with the area field “1”. Further, since the point c is a candidate in the area 2, “c” is stored in the “candidate store code column” column associated with the area column “2”. Although the point w belongs to the area 4 but is a candidate in the area 3, “w” is displayed in the “affiliated store code” field associated with the area field “4”, and the area field “3”. “W” is also stored in the “candidate store code” field associated with “”. Here, for example, when the point w is selected as a candidate in the area 3, it is necessary to recalculate the statistics in the area 3. In that case, a mark is stored in the recalculation column associated with area 3. Thereby, the statistic calculation part 136 can grasp | ascertain the area which needs recalculation of a statistic. The statistic calculator 136 recalculates the statistic only for the marked area. The result calculated by the statistic calculator 136 is the average travel time M between bases and stores in the corresponding area.₁Column, average travel time between stores M₂Column, number of stores required for processing N₂Column and statistic (total number of courses) column.
[0083]
  If the point w is originally acquired in the area 3 and has been taken by the area 4 in the immediately preceding process, the point w is associated with the area column “4” as shown in FIG. A mark is written in the immediately preceding take-off column of the given point w. As a result, the area 3 and other areas cannot select the point w as the next candidate.
[0084]
  According to area simulator device 100 in the present embodiment, since stores are acquired in order from the area where the statistic such as the total number of courses is minimized, the statistic in all areas can be made equal. In addition, in each area, candidate stores are selected so that the distance between stores is shortened, so that the travel time in each area can be reduced, and the travel time in all areas can be kept low. Thereby, the work efficiency in a sales area can be improved.
[0085]
  18 to 23 show screens for performing parameter setting and initial setting. FIG. 18 shows a division method selection screen. Here, “Tokyo 2” is selected as the base to be divided. Further, there are “seed manual setting” and “seed automatic setting” as options of the division method. Here, “seed manual setting” is selected.
[0086]
  FIG. 19 shows a basic condition setting screen for division. In this business area, set the daily work time (operating time) of each person in charge, work time for each store, travel speed between bases and stores, travel speed between stores and stores, distance magnification, store acquisition limit distance To do. Here, the daily work time of each person in charge is “7 hours 30 minutes”, the work time for each store is “20 minutes”, the movement speed between the bases and the stores is “50 Km / h”, and between the stores and the stores. The moving speed is set to “50 km / h”, the distance magnification is set to “1”, and the store acquisition limit distance is set to “10 km”. These parameters are used when calculating the number of courses in each area described with reference to FIG.
[0087]
  At that time, for example, if the distance magnification is set to “2”, the total distance from the base to each store and the total distance from each store to the nearest n stores in the processing of Step 160 and Step 162 in FIG. Average travel time M as 2 times₁And average travel time M₂Is calculated. The number of courses in each area is calculated from the travel time calculated from the base-store travel distance, the store-store travel distance, and the work time in each store, but by appropriately setting the distance magnification, the travel time Can be weighted. In the present embodiment, for the calculation of the number of courses, linear distances between bases and stores and between stores and stores are used. However, when actually moving between a base and a store and between a store and a store, it often passes through a winding road or a complicated road. Therefore, the actual distance traveled can be reflected in the number of courses by setting a predetermined distance magnification as a regional characteristic for each business region.
[0088]
  If the store acquisition limit distance is set to “10 km”, in step 146 of FIG. 14, stores that are more than 10 km away from any of the stores already acquired in that area are not acquired in that area. To be done. Therefore, the shortest distance between stores in each area can be 10 km or less, and the business area can be divided into blocks of a plurality of areas. The store acquisition limit distance can be appropriately set according to the size of the business area to be divided.
[0089]
  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. 20A, the user can set a seed from a list of stores, and can also set a seed from the map as shown in FIG.
[0090]
  When the seed is set, the set seed is displayed on the map as shown in FIG. Here, points indicating the stores are indicated by ● on the map. The stores set as initial seeds are marked with a circle around ●. The setting screen includes a “store information” display screen and a “statistical information” display screen. When the user moves the pointer to one of the stores on the map, information related to the store is displayed on the “store information” display screen.
[0091]
  Also, when “seed automatic selection” is selected on the division method selection screen shown in FIG. 18, an area number input screen is displayed as shown in FIG. Here, the user inputs the number of areas (number of seeds) under the division target base. Here, the number of areas is set to be “6”.
[0092]
  Next, as shown in FIG. 22, a weight setting screen is displayed. For example, when there are 1 to 6 areas, the number of courses in any area can be weighted. The weight set here is used when calculating a statistic in each area. For example, the weight “2” is set in the area “4” here. Accordingly, the statistic calculation unit 136 compares the number of courses calculated in the area “4” with the number of courses in other areas in the calculation process of the total number of courses illustrated in FIG. In this way, the number of courses in area 4 is finally set to about half of the other areas. For example, such weight setting can be performed when a part-time person in charge is assigned to a person in area 4.
[0093]
  Subsequently, as shown in FIG. 23, a combination designation screen is displayed. Here, among a plurality of stores, a combination of stores to be divided into the same area can be designated. For example, if a user is a store in the same building, a store attached to the same site, or a store where the delivery vehicle is stopped, the store is more efficient if divided into the same area. Combinations can be specified. For example, the point c and the point d are designated in combination here. In this case, when either one of the points c and d is selected as a candidate in any area, the candidate selection processing unit 116 selects either the point c or the point d as a candidate for that area. The statistic calculation unit 136 calculates the statistic in consideration of all points designated for combination. The point c and the point d designated in such a combination are simultaneously acquired in any area.
[0094]
  As shown in FIG. 37, the store information storage unit T3 can store information related to a preset combination of stores in addition to the data structure shown in FIG. Here, for example, stores with store codes “b”, “c”, and “d” are installed in the same building and are named “shopping mall 1 (store A)”, “shopping mall 1 (store B)”. And “Shopping Mall 1 (Store C)”. These are installed in the same shopping mall 1, and their positions are “(X₁₀, Y₁₀) "," (X₁₁, Y₁₁) "," (X₁₂, Y₁₂) ”. All of them are on the “ground” at the same height. When selecting a store point designated in such a combination as a candidate, the statistic calculation unit 136 considers the total work time in each store and the movement time in the height direction between the points designated in combination. To calculate the statistics. In this way, stores scattered in the same building can be added to the calculation target as a visit destination.
[0095]
  Further, for example, stores with store codes “e”, “f”, and “g” are all installed in the railway A station, and the names are “railway A station (platform 1 north)”, “railway A station (platform). 1 South) ", and" Railway A Station (Platform 2) ". Since stores with store codes “e” and “f” are provided side by side, the positions on the plane are substantially equal, and both “(X₃, Y₃) ”. In addition, the store heights of the store codes “e” and “f” are both “ground”. When selecting a store point designated in such a combination as a candidate, the statistic calculation unit 136 does not need to consider the travel time between stores, but considers the total work time in each store. Calculate statistics.
[0096]
  When the area division processing is performed as described above, the result is stored in the area division information storage unit T6. The user can appropriately read the area division state from the area division information storage unit T6 and display it on the screen by the display processing unit. The adjustment receiving unit 140 can receive a correction instruction from the user with restrictions. The restriction in the correction instruction from the user may be in various forms, but the adjustment receiving unit 140 can receive the correction only when, for example, the difference in statistics of each area due to the correction is within a predetermined range.
[0097]
  FIG. 24 is a flowchart illustrating a processing procedure when the adjustment receiving unit 140 receives a replacement process from the user. When an instruction to change the store is received from the user (S270), the adjustment receiving unit 140 determines whether or not there is an authority to change processing (S272). Here, the determination as to whether or not the user has the authority for the replacement process can be made by, for example, user authentication as to whether or not the user has the authority. In addition, if the replacement process has already been performed several times for the area division process, if the replacement process is permitted many times, the meaning of performing the automatic area division is lost. It can also be determined whether or not it is within the number of times. If it is determined in step 272 that there is an authority for the replacement process (Yes in S272), the statistic calculation unit 136 calculates the statistic in each area when the replacement is performed according to the user's instruction (S274). . Subsequently, the adjustment receiving unit 140 determines whether or not the difference in statistics in each area when replacement is performed is within an allowable range (S276). When the difference in 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 in the area division information storage unit T6. It is memorized (S278). On the other hand, when it is determined in step 272 that there is no authority (No in S272), or in the case where it is not within the allowable range in Step 276 (No in S276), the adjustment receiving unit 140 receives a replacement instruction from the user. If it is not possible to do so, a notice of non-replacement is made (S280).
[0098]
  As described above, according to the area division processing in the present embodiment, in each area, stores are sequentially taken in such a way that the distance between stores is shortened. Are classified into each area. Therefore, one business area can be divided into areas in units of blocks so that the movement distance between stores in each area can be reduced. As described above, according to the area division processing in the present embodiment, it is possible to divide the business area so as to increase the efficiency of the store patrol work in each area. In addition, since the stores are taken into each area so that the statistics of a plurality of stores included in each area are equal, the person in charge can have a sense of fairness. Further, since these results are mapped together with the map information, the person in charge can objectively recognize the fairness.
[0099]
  (Second embodiment)
  Also in the present embodiment, the area division processing is performed by the area simulator device 100 shown in FIG. Hereinafter, description will be given with reference to FIG. In the present embodiment, the seed setting process in step 4 shown in FIG. 1 is different from the first embodiment. Here, first, a number of seeds larger than the number of seeds actually required is selected, and a seed satisfying a predetermined condition is finally selected as a seed from among the seeds.
[0100]
  FIG. 25 is a flowchart illustrating a procedure of seed setting processing in the present embodiment. The area number setting accepting unit 128 accepts the setting of the number of seed candidates and the selection condition (S200). Here, the selection conditions are, for example, how many seeds are selected under what conditions from the number of seed candidates.
[0101]
  The seed selection unit 130 sets the number of seed candidates set as the number of seed candidates in the same procedure as shown in FIG. 10 (S202). Subsequently, the seed selection unit 130 performs group division for causing the store in the business area to belong to any of the seed candidates set in step 202 (S204).
[0102]
  As the group division, the stores in the business area can be attributed to the seed candidates located closest to each of the seed candidates set in step 200. As another example of group division, the division processing unit 115 performs preliminary area division in the same procedure as shown in FIGS. 13 and 14 with the seed candidate set in step 200 as a starting point. It can also be done.
[0103]
  Thereafter, the seed selecting unit 130 selects some seed candidates as seeds based on the selection conditions in consideration of the information of the stores divided into the seed candidates as a result of the group division (S206).
[0104]
  Through the above processing, a seed for actually performing area division is set, and area division is performed in the same procedure as shown in FIGS. 13 and 14 (S208).
[0105]
  FIG. 26 is a diagram illustrating a setting screen for the number of seed candidates and selection conditions in the present embodiment. Here, “6” is input as a seed candidate. In addition, as a selection condition, "How many seeds can be selected as a seed candidate from a group with a large number of stores from the segmentation result?" "Do you want to select?" Here, “3” is input for the condition “How many seeds are selected as seed candidates from the group with a small number of stores from the division result”.
[0106]
  When input is made in this way, first, six stores are selected as seed candidates, and the other stores are assigned to any of these six stores and group division is performed. Subsequently, the number of stores in each group is detected, and among the six groups, three groups are selected in order from the smallest number of stores, and seed candidates in the groups are selected as final seeds.
[0107]
  According to the area division processing in the present embodiment, area division is performed starting from the seeds so that the number of courses in a plurality of areas becomes equal. Therefore, if seeds are provided in an area where stores are densely populated, the seeds travel less to neighboring stores. Therefore, the area including the seed may include more stores than other areas even if the number of courses is the same. If the number of stores in a plurality of areas is extremely different, even if the number of courses is set to be the same, an unfair feeling may occur between the persons in charge.
[0108]
  Moreover, if only one store installed at a position extremely away from other stores is used as a seed, the moving distance from the seed to a nearby store becomes long. Therefore, in the area including the seed, even if the area is divided so that the number of courses is the same as the other areas in the course number calculation process during the area division process, the result may be an inefficient area division result. There is also sex.
[0109]
  According to the area division processing in the present embodiment, it is possible to avoid setting seeds in an area where stores are densely populated or setting seeds at positions extremely away from other stores. The areas can be divided so that the number of courses in each area is equal and the number of stores included in each area is also close. Thereby, the unfair feeling of the person in charge in charge of each area can be reduced.
[0110]
  (Third embodiment)
  This embodiment is different from the first embodiment and the second embodiment in that the number of seeds is automatically set.
[0111]
  FIG. 27 is a block diagram showing a configuration of the area simulator apparatus 100 in the present embodiment. In the present embodiment, the area simulator device 100 differs from the area simulator device 100 in the first embodiment in that it has a split state determination unit 120. Although not shown here, also in the present embodiment, the area simulator device 100 is similar to the area simulator device 100 in the first embodiment shown in FIG. A portion 156 can be included. In FIG. 27, the same components as those shown in FIG. 3 are denoted by the same reference numerals, and description thereof will be omitted as appropriate.
[0112]
  The division state determination unit 120 compares the statistics in each divided area after the division processing is performed by the division processing unit 115, and determines whether or not the division is properly performed. When the division state determination unit 120 determines that the division is not properly performed, the parameters and initial settings are performed again, and the division process is performed again.
[0113]
  FIG. 28 is a block diagram showing in detail the initial setting unit 114 in the present embodiment. The initial setting unit 114 further includes a course number setting reception unit 142 and an area number calculation unit 144 in addition to the configuration described with reference to FIG. 5 in the first embodiment. The seed setting method accepting unit 124 accepts selection of seed manual setting, seed automatic setting, or course number setting as a seed setting method. When the seed setting method receiving unit 124 receives a seed manual setting or a seed automatic setting, the same processing as in the first embodiment or the second embodiment is performed. When the seed setting method accepting unit 124 accepts the selection of the course number setting, the course number setting accepting unit 142 accepts the setting of the number of courses from the user. The area number calculation unit 144 calculates the number of areas based on the number of courses received by the course number setting reception unit 142.
[0114]
  FIG. 29 is a block diagram showing in detail the logic storage unit T7 in the present embodiment. In addition to the configuration shown in FIG. 8 in the first embodiment, the logic storage unit T7 further includes an area number calculation logic storage unit T7d. The logic storage unit T7d stores logic necessary for the area number calculation unit 144 to calculate the number of areas.
[0115]
  FIG. 30 is a flowchart showing the logic used by the area number calculation unit 144, which is stored in the area number calculation logic storage unit T7d, to calculate the number of areas into which the business area is divided.
[0116]
  The course number setting reception unit 142 receives an input of the number of courses in each area from the user (S220). Here, the number of courses is the amount of work that each person in charge can perform per day, so “1” is set as the initial value of the number of courses in each area. However, in the busy busy season, for example, the number of courses can be set to 1 or more, or the number of courses can be set to 1 or less in consideration of business hours other than the patrol work. Subsequently, the area number calculation unit 144 calculates the necessary number of areas in the business area (S222).
[0117]
  FIG. 31 is a flowchart showing the logic used by the area number calculation unit 144, which is stored in the area number calculation logic storage unit T7d, to calculate the necessary 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 appropriately refers to the base information data stored in the base information storage unit T2, the store information data stored in the store information storage unit T3, and the parameters stored in the parameter storage unit T4. The total number of courses is calculated according to the procedure.
[0118]
  First, the area number calculation unit 144 calculates the average travel time M from a base to a store in the business area.₃Is calculated (S250). First, after obtaining the total distance from the base to each store, the total travel time is obtained by dividing the total distance by the base-store travel speed set by the parameter setting unit 110. Then, by dividing this total travel time by the total number of stores, M₃Is required.
[0119]
  Subsequently, the area number calculation unit 144 calculates the average travel time M between stores.₄Is calculated (S252). First, after obtaining the total distance from each store to the nearest n stores, the total travel time is obtained by dividing the total distance by the inter-store travel speed set by the parameter setting unit 110. Then, the average travel time m from each store to other stores is obtained by dividing this total travel time by n.₁~ M_nGet. Next, the average travel time m₁~ M_nAnd M by dividing by the total number of stores₄Is calculated.
[0120]
  Subsequently, the area number calculation unit 144 has the number N of stores that can work in one day in this business area.₃Is calculated (S254). Total work time per day
Tz = M₃× 2 + M₄(N₃-1) + T × N₃
(T is the average work time per store)
So, transform this equation
N₃= (Tz-M₃× 2 + M₄) / (M₄+ T)
Is calculated.
[0121]
  On the other hand, the number-of-areas calculation unit 144 has the number N of stores that require processing per day₄Is calculated (S256). First, the number of times of loading W per month is calculated by calculating and summing the number of times of loading per month for each store. Next, assuming that the number of working days in January for each person in charge is 4 weeks x 5 days = 20, N₄= W / 20 is obtained.
[0122]
  Thereafter, the area number calculation unit 144 determines the number N of stores that need to be processed per day.₄N stores that can work in a day₃Divided by the number of required courses per day = N₄/ N₃Is calculated (S258). The area number calculation unit 144 calculates the necessary number of areas in this business area by dividing the necessary number of courses calculated in this way by the number of courses input in Step 220 of FIG. 30 (S260).
[0123]
  Referring back to FIG. 30, the seed selection unit 130 sets seeds that are twice the number of necessary areas calculated in the same procedure as shown in FIG. 10 (S224).
  Subsequently, the seed selection unit 130 performs group division in the same procedure as described in the second embodiment (S226). Thereafter, the seed selection unit 130 selects the seeds for the necessary number of areas in order from the seeds with the smallest number of stores in consideration of the number of stores attributed to each seed as a result of the group division. The seed selected here is set as the final seed (S228).
[0124]
  Through the above processing, a seed for actual area division is set, and area division is performed in the same procedure as shown in FIGS. 13 and 14 (S230).
[0125]
  Subsequently, the division state determination unit 120 calculates the number of courses in the area actually divided under these conditions, and evaluates the division state (S232). As a result, if the calculated number of courses is within the allowable range (Yes in S234), this process ends and the result is displayed. If it is not within the allowable range (No in S234), the process returns to step 222, and a new number of areas is calculated.
[0126]
  32 to 34 show screens for performing parameter setting and initial setting in the present embodiment. FIG. 32 shows a division method selection screen. In the present embodiment, in addition to the content described with reference to FIG. 18 for the first embodiment, “setting the number of courses” is included as an option for the division method. Here, “set number of courses” is selected as the division method.
[0127]
  FIG. 33 shows a basic condition setting screen for division. In the present embodiment, the number of working days per week is included as an item in addition to the contents described in the first embodiment with reference to FIG. Here, “5” days are set as the number of working days per week.
[0128]
  When “Course number setting” is selected on the division method selection screen shown in FIG. 32, a course number input screen is displayed as shown in FIG. Here, the user inputs the number of courses in each area. Here, “1” is input as the number of courses. Subsequently, the user inputs an allowable error range. Here, it is set to + 10% and −10%. Therefore, area division is performed so that the number of courses in each area is 0.9 to 1.1.
[0129]
  According to the area division processing in the present embodiment, the business area to be divided can be divided into a plurality of areas simply by setting the number of courses in each area. The business area is automatically divided by the area simulator device 100 so that the statistics of a plurality of stores included in each area are equalized, so that the objective area division can be performed and the person in charge feels fair. Can be given. In each area, stores are sequentially taken in such a way that the distance between the stores is shortened, so that stores having a short distance between the areas are finally classified into the respective areas. Therefore, it is possible to divide one business area into areas in units of blocks, and it is possible to reduce the travel distance between stores in each area, so that the efficiency of the patrol work of the stores can be improved.
[0130]
  (Fourth embodiment)
  Also in the present embodiment, the area division processing is performed by the area simulator device 100 shown in FIG. Hereinafter, description will be given with reference to FIG. In the present embodiment, when the statistic calculation unit 136 calculates the number of courses in each area, the number of courses is calculated in consideration of the actual work time for each store stored in the store information storage unit T3. , Different from the first to third embodiments. In the first to third embodiments, for example, as described in step 164 of FIG. 16 in the first embodiment, the number of courses in each area is calculated as the basic condition of FIG. It has been described that the average work time of every work time is used. However, the actual working time at a store varies depending on characteristics such as the type of store and the purpose of visiting the store. In the present embodiment, the statistic calculation unit 136 reflects the work time set for each store with reference to the type and characteristics of the store stored in the store information storage unit T3 and the purpose of visiting the store. Since the statistical amount is calculated, the number of courses corresponding to the actual work amount can be calculated with higher accuracy. In this way, by storing the characteristics of each store in the store information storage unit T3 and using the information, it is possible to divide the area more strictly and equalize the labor of the person in charge in each area. be able to.
[0131]
  Processing of the statistic calculation unit 136 in the present embodiment will be described with reference to FIG. As in the first embodiment, the statistic calculator 136 calculates the average travel time M from the base to stores that already belong to the area and candidate stores.₁Is calculated (S160). Subsequently, as in the first embodiment, the statistic calculator 136 calculates the average travel time M between stores.₂Is calculated (S162).
[0132]
  Subsequently, the statistic calculation unit 136 determines the number N of stores that can be worked on in one day.₁Is calculated (S164). First, the statistic calculation unit 136 refers to the store information storage unit T3, and calculates the total work time T in the stores already acquired in the area and the candidate stores._oIs calculated. In this case, the total work time per day
Tz = 2 × M₁+ M₂× (N₁-1) + T_o
So, transform this equation
N₁= {(Tz-2M₁-T_o) / M₂} +1
Is calculated.
[0133]
  On the other hand, the statistic calculation unit 136 is similar to the first embodiment in that the number N of stores that need to be processed per day is N.₂Is calculated (S166). Thereafter, the statistic calculator 136 calculates the number N of stores that need to be processed per day.₂N stores that can work in a day₁The number of courses in each area = N₂/ N₁Is calculated (S168).
[0134]
  FIG. 36 is a diagram illustrating another example of part of the data structure of the store information storage unit T3. Here, the store information data includes “store classification”, “parking status”, and the like for each store. Here, the store type can be determined according to the amount of work in the store. For example, “A” for stores that only deliver products, “B” for stores that need to deliver products and collect unnecessary items, deliver products, collect unnecessary items, collect sales, etc. Can be classified as “C”. The parking situation can be determined according to the ease of parking of the delivery vehicle. For example, “1” when the vehicle can be parked immediately, “2” when the distance between the store and the parking position is within 20 m, for example, and “3” when the distance between the store and the parking position is more than 20 m. Can be set. The statistic calculator 136 may calculate the working time at each store based on the classification and parking status of each store, and the delivery amount (not shown). In this case, the statistic calculation unit 136 can calculate the number of courses in each area described above using the work time calculated in this way.
[0135]
  By doing so, the statistic calculator 136 can calculate the statistic by referring to the store information storage unit T3 for each store and reflecting the actual work time and the situation of each store. The number of courses can be calculated more precisely, and the labor of the person in charge in each area can be made equal. In addition, the number of stores that can work in one day N₁Since the travel time from the base to the store in each area is also taken into consideration when calculating the value, each area can be divided so that the distances from the base are substantially equal. Furthermore, since the number of courses is calculated in consideration of the distance between stores in each area, the business districts can be divided so that the movement distance in each area is equal.
[0136]
  (Fifth embodiment)
  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. In the present embodiment, user terminal 150 may be anything as long as it can communicate with area simulator device 100 via network 148. For example, the user terminal 150 can be a PC, a PDA, a mobile phone, or any other hardware.
[0137]
  In this way, the user can transmit the instruction necessary for the area division processing to the area simulator device 100 while actually traveling around the business area where the store is installed with the user terminal 150. As a result, it is possible to input a combination designation to the combination designation receiving unit 132 or to input a replacement process to the adjustment receiving unit 140, reflecting the actual situation at the site.
[0138]
  In addition to the configuration described in each embodiment, the area simulator device 100 described in the first to fourth embodiments has a data registration reception that receives registration of various data such as base information data and store information data. You may have a part.
[0139]
  FIG. 38 is a block diagram illustrating a configuration when the area simulator apparatus 100 according to the first embodiment includes the data registration receiving unit 152. The data registration accepting unit 152 accepts registration of various data from the user and stores these data in the base information storage unit T2 or the store information storage unit T3. Thus, the user can register various data while actually traveling around the business area where the store 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 store information storage unit T3. Even if various data are registered in advance in the base information storage unit T2 or the store information storage unit T3, the data can be updated quickly when there is a change in the situation at the site. By appropriately and quickly preparing various data stored in the base information storage unit T2 and the store information storage unit T3, it is possible to appropriately divide the target business area.
[0140]
  39 and 40 show screens for registering store information data. FIG. 39A shows a screen for inputting a store code of a store in which data is registered. FIG. 39B shows an input screen for store information data corresponding to the store code input in FIG. Here, “b” is input as the store code in FIG. When the store code is designated by the user, the data registration receiving unit 152 refers to the store information storage unit T3 to determine whether store information data of the corresponding store is already stored. When the store information data of the corresponding store is already stored, the data registration receiving unit 152 reads the store information data. The store information data read by the data registration receiving unit 152 is displayed on the screen of FIG. On the other hand, when the store information data of the corresponding store is not yet stored, or when there are items that are not stored, the screen of FIG. 39B is displayed in a blank state. Here, the store base code of the store code “b” is “1000”, the name is “shopping mall 1 (store A)”, and the position is “X = X₁₀"," Y = Y₁₀", The store information data whose height is" ground "is displayed. When there is a correction, the user can correct these store information data. Further, since the work time is blank, the user inputs the work time.
[0141]
  When the input of the screen of FIG. 39B is finished, as shown in FIG. 40A, the data registration receiving unit 152 determines whether or not to specify the combination of the store with the store code “b” with any store. Inquire. If the user selects “No”, the registration of the store information data of the store code “b” is terminated. On the other hand, when the user selects “Yes”, the data registration receiving unit 152 causes the user to specify a store for which the combination is specified. At this time, the data registration receiving unit 152 may input the store code of the store for which the combination is specified. For example, as shown in FIG. It is also possible to present to the user a list of stores that are likely to be designated. In this case, the user can select and specify a store to be combined with the store with the store code “b” from the stores included in the list.
[0142]
  In the present embodiment, since information necessary for the area simulator apparatus 100 can be transmitted and received from the user terminal 150 to the area simulator device 100 via the network 148, information necessary for area division can be obtained while actually traveling around the business area. It can be transmitted to the simulator device 100. Therefore, for example, various data can be updated accurately and quickly, and the accuracy of optimization of area division can be improved.
[0143]
  (Sixth embodiment)
  In the first to fifth embodiments, an example has been described in which each person in charge performs a patrol work such as replenishment / delivery of goods to the store. In this embodiment, the person in charge is a store in the area. As an example, an area division in the case of developing a new customer with the target as a target will be described. When developing a new customer, sales activities are carried out in accordance with predetermined approach steps such as relationship strengthening, information collection, proposal, countermeasure implementation, follow-up verification and maintenance. The visit time spent when visiting each store differs depending on the stage of this approach step. In addition, when a new customer is developed, processing such as adding a new target or removing it from the target due to unsuccessful sales activities is frequently performed, and changes in visit destinations are drastic. In the present embodiment, the area simulator device 100 performs area division in consideration of such characteristics.
[0144]
  FIG. 41 is a diagram showing the area simulator device 100 in the present embodiment. In the present embodiment, the area simulator device 100 further includes a data registration accepting unit 152 and a division state determining unit 120 in addition to the components of the area simulator device 100 shown in FIG. 3 for the first embodiment. The data registration accepting unit 152 accepts registration of various data from the user and stores these data in the base information storage unit T2 or the store information storage unit T3. The division state determination unit 120 causes the statistic calculation unit 136 (see FIG. 7) to recalculate the statistics in each area under a predetermined condition, and whether or not the division state is appropriate based on the recalculated statistics. Judging. The division state determination unit 120 determines whether the division state is appropriate when, for example, the data in the base information storage unit T2 or the store information storage unit T3 is updated. Further, the division state determination unit 120 can also determine whether the division state is appropriate based on an instruction from the user. Furthermore, the division state determination unit 120 can also periodically determine whether the division state is appropriate. When the division state determination unit 120 determines that the division state is not appropriate as a result of recalculation, the division state determination unit 120 notifies the user that the re-division process is necessary. Here, whether or not the division state is appropriate is determined by, for example, whether or not the difference in statistics between each area is within a predetermined range, or the difference between the absolute value of the statistics in each area and a predetermined reference value. It can be determined whether or not it is within a predetermined range, whether or not the difference from the statistical amount of each area at the previous division processing is within the predetermined range, and the like.
[0145]
  FIG. 42 is a diagram showing a part of the data structure of the store information storage unit T3 in the present embodiment. The store information storage unit T3 includes a store code column, a name column, a position column, a height column, an individual coefficient column, an approach step plan column, a current state column, and a change prohibition column. Approach steps include relationship strengthening, information gathering, suggestions, action implementation, follow-up verification, and maintenance. Each person in charge conducts sales activities according to this approach step when developing a new customer. Here, store information storage part T3 memorizes a plan of an approach step, and its achievement state. For example, for the store with the store code “a”, follow-up verification has been achieved, and the current state is the “maintenance” stage. The store with the store code “b” is a store newly added to the store information storage unit T3 and is currently in a “reinforcement” stage. The store with the store code “d” was planned to strengthen relationships, collect information, make proposals, implement countermeasures, and follow-up verification. As a result, the current status is “Cancel”.
[0146]
  Here, the individual coefficient is an individual coefficient that is integrated with the time required for a visit to each store. When developing a new customer, it is necessary to negotiate with the store owner, but the time spent for such negotiation varies depending on the store owner. For example, the individual coefficient of the store with the store code “e” is “1”, and the individual coefficient of the store with the store code “a” is “2”. This means that a store with a store code “a” takes twice as long as a visit for the same purpose as a store with a store code “e”.
[0147]
  The change prohibition column can be marked when the person in charge is prohibited from changing. For example, it is necessary to strengthen the personal relationship between the person in charge and the store owner at the stage before the implementation of contracts and countermeasures such as strengthening the relationship → collecting information → proposing etc. If the person in charge changes at this stage, even if the relationship with the store owner becomes good and the contract is about to be concluded, it may be wasted. Therefore, the change of the person in charge can be prohibited at this stage. The area simulator device 100 processes stores that are marked in the change prohibition column so as not to move to other areas when performing the area re-division processing.
[0148]
  FIG. 43 is a diagram illustrating a part of the data structure of the parameter storage unit T4 in the present embodiment. In the present embodiment, the parameter storage unit T4 stores a standard time such as a negotiation time at each stage of the approach step. For example, the standard time for negotiation required in the “reinforcement” stage is 20 minutes. Returning to FIG. 42, for example, in the store with the store code “a”, since the individual coefficient is “2”, the individual coefficient is added to the standard time, and the negotiation at the “reinforcement” stage for the store with the store code “a” is performed. The time is calculated as 40 minutes.
[0149]
  FIG. 44 is a flowchart illustrating a processing procedure in which the division state determination unit 120 determines whether the division state of each area is appropriate. The division state determination unit 120 is configured to update the statistical amount calculation unit 136 (see FIG. 6) when the site information storage unit T2 or the store information storage unit T3 is updated, when an instruction is given from the user, or periodically every predetermined period. 7) is instructed to recalculate the statistics in each area (S300). The statistic calculation unit 136 refers to the area division information storage unit T6, the base information storage unit T2, and the store information storage unit T3, and recalculates the statistic of each area at that time (S302). The division state determination unit 120 determines whether or not the difference in statistics in each area is within an allowable range (S304). If the difference in statistics is not within the allowable range (No in S304), the division state determination unit 120 inquires of the user whether or not to re-divide the area (S306). When there is an instruction for subdivision from the user (Yes in S306), the division state determination unit 120 causes the division processing unit 115 to perform subdivision (S308). At this time, the initial setting unit 114 sets, in the store information storage unit T3 shown in FIG. 42, a store marked in the change prohibition column as a seed in the area to which the store belongs. When there are a plurality of stores that are marked in the change prohibition column in one area, the division processing unit 115 performs the area re-division processing using the position of the center of gravity of these stores as a seed. When the re-division process is completed, the division state determination unit 120 notifies the user to that effect (S310). When the difference in statistics is within the allowable range in step 304, the corresponding content is notified even if there is no subdivision instruction in step 306 (S310).
[0150]
  In the present embodiment, the statistic calculation unit 136 calculates the statistic according to the purpose of the person in charge visiting the store. Therefore, the statistic calculation unit 136 more strictly reflects the fact that the stay time at each store differs depending on the purpose of the visit. The number of courses can be calculated, and the labor of the person in charge in each area can be equalized. In addition, if the area has already been divided, the previous area division status can be reflected, so even if the number of stores in the target area increases or decreases, the subdivision process can be performed easily. Can do. Moreover, since the previous area division state can be reflected when the area is subdivided, the subdivision process can be easily performed even during a series of sales activities.
[0151]
  Next, in the present embodiment, a process in which the store selection unit 156 selects a store to be divided will be described. In the present embodiment, in addition to the information shown in FIG. 42, the store information storage unit T3 adds the number of visits for each store, the presence or absence of visit rejection, the stay time at each visit, etc. Information on the surrounding environment such as the presence / absence and size of a parking lot can be included. In this way, when developing a new customer under a certain sales strategy, it is possible to select preferable stores and perform sales activities for those stores. For example, the user is likely to be able to cultivate a store with 3 visits or less as a new customer, and the condition input reception unit 154 selects “store with 3 visits or less” as a condition for selecting a store to be divided. Can be entered. In this case, the store selection unit 156 refers to the store information storage unit T3 and selects a store having a visit count of 3 or less. For example, when it is desired to develop a store that can sell a large amount of products as a new customer, a store that can carry in a large amount of products at a time can be selected as the target of the new customer. In this case, for example, the user can input the condition “a store with a parking area of a specific area or more” to the condition input receiving unit 154 as a condition for selecting a store to be divided. The store selection unit 156 refers to the store information storage unit T3, and selects a store with a parking lot of a specific area or more. The division processing unit 115 performs division processing for the stores selected by the store selection unit 156 in this way.
[0152]
  In the above embodiment, although the form which selects the shop used as a seed at the time of area division as a representative point was demonstrated, the following facilities can also be selected as a representative point.
[0153]
  (Seventh embodiment)
  In this embodiment, an example will be described in which a base station placement point is selected from a business area including a plurality of base station candidate points in a wireless communication network.
[0154]
  FIG. 45 is a flowchart showing a procedure for selecting an arrangement point of a base station according to the seventh embodiment of the present invention. First, various data necessary for selecting a base station arrangement point is registered (S1). Here, for example, map information data of the business area, candidate point information data of the base station, area information data and the like are registered. Subsequently, as an initial setting, the number of base station arrangement points set in the business area is set (S2). Thereafter, the arrangement points of the base stations having the number of arrangement points set in step 2 are selected (S3).
[0155]
  FIG. 46 is a block diagram showing a configuration of the arrangement point selection device according to the present embodiment. The arrangement point selection device 10 includes a display processing unit 12, an initial setting unit 14, an arrangement point selection unit 16, a map information storage unit 20, a candidate point information storage unit 22, an area information storage unit 24, and an initial setting. A storage unit 25, a logic storage unit 26, and an arrangement point information storage unit 28 are included.
[0156]
  The map information storage unit 20 stores map information data of a business area where the base station is installed. The candidate spot information storage unit 22 stores candidate spot information data. The candidate point information data includes the identification code of the candidate point, the name of the candidate point, the plane position (latitude and longitude, or X coordinate and Y coordinate) of the candidate point, the height of the candidate point, and the like. The area information storage unit 24 parameterizes and stores regional characteristics in the business area such as the radio wave state and population distribution.
[0157]
  The display processing unit 12 performs a process of displaying various data on a screen (not shown). The initial setting unit 14 performs initial settings necessary for selecting the location of the base station. The initial setting unit 14 receives the number of arrangement points of base stations installed in the target business area from the user. The initial setting storage unit 25 stores initial setting information.
  The arrangement point selection unit 16 selects the arrangement points of the base stations having the number of arrangement points set by the initial setting unit 14 from among a plurality of candidate points in the business area. The arrangement point selection unit 16 has a function of selecting a temporary arrangement point from among a plurality of candidate points, a function of selecting a point to be replaced, and a function of comparing distances between the points. The logic storage unit 26 stores logic necessary for the arrangement point selection unit 16 to select an arrangement point. The arrangement point information storage unit 28 stores the arrangement point information selected by the arrangement point selection unit 16.
[0158]
  FIG. 47 is a flowchart illustrating a procedure in which the arrangement point selection unit 16 selects an arrangement point of the base station in the present embodiment. The arrangement point selection unit 16 selects an arbitrary candidate point of the number of arrangement points of the base station received by the initial setting unit 14 as an initial point from among a plurality of candidate points in the business area (S12). The arrangement point selection unit 16 can select the initial points in the order of the list with reference to the candidate point information storage unit 22. The placement point selector 16 selects the shortest distance I between the selected initial points.₁Is detected (S14). Next, the arrangement point selection unit 16 selects the next candidate point in the list of the candidate point information storage unit 22 as an inspection point (S16). The arrangement point selection unit 16 has the shortest distance I between the inspection point and the nearest point among the initial points.₂Is calculated (S18). Subsequently, the arrangement point selection unit 16 performs a first inspection (S20). In the first inspection, the arrangement point selection unit 16 determines the shortest distance I between the initial points detected in step 14.₁And the shortest distance I from the inspection point calculated in step 18₂Are compared (S22). Minimum distance I from inspection point₂Is the shortest distance I₁If it is larger (Yes in S22), the arrangement point selection unit 16 replaces the inspection point with any of the initial points to make a new selection point (S24). Here, the replacement target is the shortest distance I between the initial points.₁Among the points that give, the point with the shorter distance from the inspection point.
[0159]
  In step 22, the shortest distance I₂Is the shortest distance I₁In the following case (No in S22), the arrangement point selection unit 16 uses the shortest distance I from the inspection point to an initial point other than the nearest initial point.₃Is calculated (S26). In addition, the arrangement point selection unit 16 performs the shortest distance I from the nearest initial point to another initial point.₄Is calculated (S28). Subsequently, the arrangement point selection unit 16 performs the second inspection (S30). In the second inspection, the arrangement point selection unit 16 determines the shortest distance I between the nearest initial point calculated in step 28 and another initial point.₄And the shortest distance I calculated in step 26₃Are compared (S32). Minimum distance I₃Is larger (Yes in S32), the process proceeds to step 24, where the arrangement point selection unit 16 replaces the inspection point with the nearest initial point to be a new selection point (S24).
[0160]
  In step 32, the shortest distance I₃Is the shortest distance I between the nearest initial point and other initial points I₄If it is the following (No in S32), the initial point is not replaced.
[0161]
  The above processing is performed for all points in order a predetermined number of times, for example, 100 times here. In step 34, when n is 100 or less (No in S34), the process returns to step 14 and the shortest distance I between the selected points at this stage.₁Is calculated. The arrangement point selection unit 16 selects the next candidate point in the list of the candidate point information storage unit 22 as an inspection point (S16), and thereafter repeats the same processing. On the other hand, if n> 100 in step 34 (Yes in S34), the point selection process ends. The arrangement point selection unit 16 selects the selection point at this stage as the arrangement point.
[0162]
  FIG. 48 is a diagram for specifically explaining the arrangement point selection processing described with reference to FIG. 47. Here, the number of base station arrangement points is “3”. First, as shown in FIG. 48A, candidate point a, candidate point b, and candidate point c are selected as initial points. The arrangement point selection unit 16 detects the shortest distance between these points. Here, the shortest distance L is between the candidate point a and the candidate point b.₁It becomes. Next, a candidate point d that is the next point in the list in the candidate point information storage unit 22 is selected as an inspection point. The arrangement point selection unit 16 detects the nearest candidate point from the candidate point d, and calculates the shortest distance between the candidate point d and the nearest candidate point. Here, the shortest distance L is between the candidate point d and the candidate point c.₂It becomes. Arrangement point selection unit 16 has the shortest distance L₁And the shortest distance L₂And compare. Where the shortest distance L₂> Minimum distance L₁Therefore, the arrangement point selection unit 16 replaces the candidate point d with the initial point and sets it as a new selection point. Here, the candidate for replacement with the candidate point d is the shortest distance L₁Is either candidate point a or candidate point b. As shown in FIG. 48B, the initial setting unit 14 determines the distance between the candidate point d and the candidate point a and candidate point b to be replaced in order to determine the candidate point to be replaced with the candidate point d. L₃And L₄Are calculated respectively. Where L₄> L₃Therefore, candidate point a becomes a candidate for replacement of candidate point d. Through the above processing, as shown in FIG. 48C, candidate point b, candidate point c, and candidate point d become new selection points. The same process is repeated, and the selection point at the time when the predetermined number of processes is completed is selected as the arrangement point.
[0163]
  FIG. 49 is a diagram for explaining another example of arrangement point selection processing. Again, the number of arrangement points is “3”. First, as shown in FIG. 49A, candidate point a, candidate point b, and candidate point c are selected as initial points. The arrangement point selection unit 16 detects the shortest distance between these points. Here, the shortest distance L is between the candidate point a and the candidate point b.₁It becomes. Next, a candidate point e that is the next point in the list in the candidate point information storage unit 22 is selected as an inspection point. The arrangement point selection unit 16 detects the nearest candidate point from the candidate point e, and calculates the shortest distance between the candidate point e and the nearest candidate point. Here, the shortest distance L is between the candidate point e and the candidate point b.₂It becomes. Arrangement point selection unit 16 has the shortest distance L₁And the shortest distance L₂And compare. Where the shortest distance L₂<Shortest distance L₁Therefore, the arrangement point selection unit 16 performs the second inspection as shown in FIG. The arrangement point selection unit 16 has a shortest distance L between the candidate point e which is an inspection point and the candidate point a next to the candidate point e after the candidate point b.₃Is calculated. Further, the shortest distance L between the nearest candidate point b and the candidate point a closest to the candidate point b₁Is calculated. Arrangement point selection unit 16 has the shortest distance L₃And the shortest distance L₁And compare. Here, the shortest distance L₃> Minimum distance L₁Therefore, the candidate point e is replaced with the candidate point b. Through the above processing, as shown in FIG. 49 (c), candidate point a, candidate point c, and candidate point e become new selection points. The same process is repeated, and the selection point at the time when the predetermined number of processes is completed is selected as the arrangement point.
[0164]
  In the above processing, in the first inspection, the selection point is replaced when the shortest distance between the inspection point and the existing selection point is longer than the shortest distance between the selection points. Combinations will be eliminated. Moreover, since the point with the shorter distance from the inspection point among the selection points to be replaced is replaced, the distance between the newly selected points can be further increased. Even if the conditions for the first inspection are not satisfied, the selection point for the second inspection is when the distance between the inspection point and one of the existing selection points is longer and the distance to the other selection point is longer. Is replaced. Therefore, the points are replaced so that the distance between the points becomes longer. In addition, since such a process is repeated a predetermined number of times, combinations of points with a short distance between points are eliminated, and a point with a larger average distance between points and a smaller distance difference is selected. become. According to the arrangement point selection method in the present embodiment, a candidate point corresponding to the point selected at this stage is selected as the arrangement point of the base station. Therefore, it is possible to select an arrangement point that has a large average distance between candidate points and a small difference between the distances from among a plurality of candidate points.
[0165]
  With the above processing, it is possible to select an arrangement point of a base station that can efficiently transmit radio waves to the entire business area from among a plurality of candidate points.
[0166]
  Next, processing when regional characteristics are different in a business area will be described. Here, a case will be described as an example where the radio wave state varies depending on the region.
[0167]
  FIG. 50 is a flowchart illustrating a procedure for selecting a base station arrangement point when there is a difference in regional characteristics within a business area. Prior to selection of an arrangement point, the arrangement point selection unit 16 reads area information from the area information storage unit 24 and candidate point information from the candidate point information storage unit 22 (S40). Based on the area information, the arrangement point selection unit 16 reflects the area information in the candidate point information and performs a weighting process on each candidate point (S42). The arrangement point selection unit 16 stores the weighting result in the candidate point information storage unit 22. Thereafter, the arrangement point selection unit 16 selects an arrangement point of the base station from among a plurality of candidate points by the same method as described with reference to FIG. 47 (S44). At this time, the arrangement point selection unit 16 selects points in consideration of the result of the weighting process for each candidate point.
[0168]
  FIG. 51 is a diagram for specifically explaining the procedure shown in FIG.
  This business area includes an area 1 where the radio wave condition is good, an area 2 where the radio wave condition is medium, and an area 3 where the radio wave condition is bad. For example, in an area where the radio wave condition is bad, the range in which the radio wave reaches from each base station is narrowed. Therefore, it is necessary to narrow the base station installation interval compared to an area where the radio wave condition is good. Also, in areas where there are many users of wireless communication, it is necessary to install more base stations than in areas where there are few users. Here, as an example, it is assumed that the radio range of the base station in region 1 is 300 m, the radio range of the base station in region 2 is 200 m, and the radio range of the base station in region 3 is 100 m. Information regarding these radio wave ranges is stored in the area information storage unit 24 as a parameter. In this case, if region 3 is used as a reference, base stations may be installed in region 2 at intervals twice as large as region 3, and base stations may be installed in region 1 at intervals three times that of region 3.
[0169]
  As described above, according to the selection method of arrangement points in the present embodiment, a plurality of arrangement points are selected from among a plurality of candidate points so that the average value of the distances between them is large. Therefore, there is a low possibility that candidate points having a short distance from each other are selected as arrangement points, and the longer the mutual distance is, the higher the possibility of being selected as an arrangement point. The arrangement point selection unit 16 performs weighting processing on each candidate point so that more arrangement points are selected in an area where the radio wave condition is poor. Here, the placement point selection unit 16 refers to the candidate point information storage unit 22 and the area information storage unit 24 and assigns a weighting coefficient “1” to the candidate points included in the region 1 and the candidate points included in the region 2. Is associated with the weighting coefficient “2”, and the candidate point included in the region 3 is associated with the weighting coefficient “3”.
[0170]
  The placement point selection unit 16 calculates the virtual distance by multiplying the actual distance between the candidate points by a value that considers the weighting coefficient associated with each candidate point in the placement point selection process shown in FIG. The placement point is selected according to the length of the virtual distance between the candidate points.
[0171]
  Again, the number of base station arrangement points is “3”. First, as shown in FIG. 51A, candidate point a, candidate point b, and candidate point c are selected as initial points. Here, the actual distance between candidate point a and candidate point c is L₁It is. Since candidate point a is included in region 3 and candidate point c is included in region 1, virtual distance L ′ between candidate point a and candidate point c₁= (1 + 3) / 2 × L₁= 2L₁It becomes. Similarly, the actual distance between candidate point a and candidate point b is L₃It is. Since the candidate point a is included in the region 3 and the candidate point b is included in the region 1, the virtual distance L ′ between the candidate point a and the candidate point b₃= (1 + 3) / 2 × L₃= 2L₃It becomes. The actual distance between candidate point b and candidate point c is L₂It is. Since candidate point b and candidate point c are both included in region 1, virtual distance L ′ between candidate point b and candidate point c₂= L₂It becomes. Arrangement point selection part 16 is virtual distance L '.₁, L '₂And L '₃And detect the shortest distance. Here, the virtual distance L ′ between the candidate point b and the candidate point c₂Is the shortest distance.
[0172]
  Next, candidate point d is selected as an inspection point. As shown in FIG. 51B, the arrangement point selection unit 16 detects the nearest candidate point from the candidate point d, and calculates the shortest distance between the candidate point d and the nearest candidate point. Here, the actual distance between candidate point d and candidate point a is L₄It is. Since candidate point d and candidate point a are both included in region 3, virtual distance L ′ between candidate point d and candidate point a₄= (3 + 3) / 2 × L₄= 3L₄It becomes. The actual distance between candidate point d and candidate point c is L₅It is. Since the candidate point d is included in the region 3 and the candidate point c is included in the region 1, the virtual distance L ′ between the candidate point d and the candidate point c₅= (1 + 3) / 2 × L₅= 2L₅It becomes. Similarly, the distance between candidate point d and candidate point b is L₆It is. Since the candidate point d is included in the region 3 and the candidate point b is included in the region 1, the virtual distance L ′ between the candidate point d and the candidate point b₆= (1 + 3) / 2 × L₆= 2L₆It becomes. Arrangement point selection part 16 is virtual distance L '.₄, L '₅And L '₆And detect the shortest distance. Here, the virtual distance L ′ between the candidate point d and the candidate point a₄Is the shortest distance.
[0173]
  The arrangement point selection unit 16 determines the shortest distance L ′.₂And the shortest distance L '₄And compare. Here, the shortest distance L ′₄> Shortest distance L '₂Therefore, the arrangement point selection unit 16 replaces the candidate point d with one of the initial points to make a new selection point. Here, the candidate point d is to be replaced with the shortest distance L ′.₂Is either candidate point b or candidate point c. The initial setting unit 14 determines a virtual target distance d ′ between the candidate point d and the candidate point b to be replaced in order to determine a candidate point to be replaced with the candidate point d.₅And the virtual distance L ′ between the candidate point d and the candidate point c to be replaced₆Compare Where L ′₅> L '₆Therefore, the candidate point b is a replacement target. Through the above processing, as shown in FIG. 51C, candidate point a, candidate point c, and candidate point d become selection points.
[0174]
  According to the arrangement point selection method in the present embodiment, an arrangement point is selected from among a plurality of candidate points so that the average value of the distances between candidate points is large and the difference between the distances is small. Therefore, if you select a placement point based on a virtual distance weighted according to the radio wave condition of the area as described above, the placement point is selected at a narrower interval in an area where the radio wave condition is poor compared to an area where the radio wave condition is good can do. Thereby, in the entire business area, an appropriate arrangement point reflecting the radio wave condition of each area is selected.
[0175]
  FIG. 52 is a flowchart illustrating another example of a procedure for selecting a base station arrangement point when there is a difference in regional characteristics within a business area. Here, a modified map is created in consideration of the weighting coefficient associated with each candidate point, and an arrangement point is selected using the modified map. First, prior to selection of an arrangement point, the arrangement point selection unit 16 reads area information from the area information storage unit 24 and candidate point information from the candidate point information storage unit 22 (S50). The placement point selection unit 16 refers to the area information and candidate point information, and creates a modified map in which the position of each candidate point is deformed in consideration of the weighting coefficient associated with each candidate point (S52). ). The arrangement point selection unit 16 causes the candidate point information storage unit 22 to store the position information of the candidate points on the modified map. Thereafter, the arrangement point selection unit 16 selects an arrangement point of the base station from among a plurality of candidate points by the same method as described with reference to FIG. 47 (S54). At this time, the arrangement point selection unit 16 selects points using the position information on the modified map.
[0176]
  FIG. 53 is a diagram for specifically explaining the modified map creation method described in step 52 of FIG. 52.
  As shown in FIG. 51, this business area includes a region 1 where the radio wave condition is good, a region 2 where the radio wave condition is medium, and a region 3 where the radio wave condition is bad. Here, for example, it is assumed that the radio range of the base station in region 1 is 300 m, the radio range of the base station in region 2 is 200 m, and the radio range of the base station in region 3 is 100 m. Information regarding these radio wave ranges is stored in the area information storage unit 24 as a parameter.
[0177]
  In this method, first, a reference point G is set. Hereinafter, an example of a method for setting the reference point G will be described with reference to FIG. First, when a candidate point in the business area is expressed in xy coordinates, a straight line m parallel to the y-axis passes through the candidate point where the value of x is the smallest and the candidate point where the value of x is the largest.₁And m₂. Similarly, a straight line n parallel to the x axis so as to pass through a candidate point where the value of y is minimum and a candidate point where the value of y is maximum₁And n₂. Next, straight line m₁And straight line n₂Intersection point and straight line m₂And straight line n₁A straight line g passing through the intersection of₁. Straight line m₂And straight line n₂Intersection point and straight line m₁And straight line n₁A straight line g passing through the intersection of₂. Then straight line g₁And straight line g₂Let the intersection point with be the reference point G.
[0178]
  Next, the arrangement point selection unit 16 converts the position coordinates of the candidate points by multiplying the position coordinates of each candidate point by a weighting coefficient associated with each position, with the reference point G as the center. Here, the placement point selection unit 16 refers to the candidate point information storage unit 22 and the area information storage unit 24 and assigns a weighting coefficient “1” to the candidate points included in the region 1 and the candidate points included in the region 2. Is associated with the weighting coefficient “2”, and the candidate point included in the region 3 is associated with the weighting coefficient “3”. For example, as shown in FIG. 53 (b), since the candidate point a is included in the region 3, the weighting coefficient “3” is associated. The arrangement point selection unit 16 moves the candidate point a on a straight line connecting the reference point G and the candidate point a in a direction away from the reference point G, and the distance from the reference point G is the actual distance L to the candidate point a.₁A position a ′ that is three times as large as the conversion position coordinates of the candidate point a. Similarly, since the candidate point b is included in the region 2, the weighting coefficient “2” is associated. The arrangement point selection unit 16 moves the candidate point b on a straight line connecting the reference point G and the candidate point b in a direction away from the reference point G, and the distance L from the reference point G is the actual distance L between the candidate point b and the candidate point b.₂The position b ′ that is twice as large is the converted position coordinate of the candidate point b.
[0179]
  FIG. 54 is a diagram schematically showing a modified map created by the arrangement point selection unit 16. As shown in FIG. 54A, each candidate point is moved to a point having a distance obtained by multiplying the distance from the reference point G by a weighting coefficient on the radiation connecting the reference point G and each candidate point. For example, the candidate points included in the region 3 are converted so that the distance to the reference point G is three times the actual distance, and the candidate points included in the region 2 are each twice the distance from the reference point G to the actual distance. Is converted to Here, since the weighting to the candidate points included in the region 1 is “1”, the position of the candidate points included in the region 1 does not change.
[0180]
  FIG. 54B shows a modified map created by the above processing. The placement point selection unit 16 performs the same process as shown in FIG. 47 using this modified map, and selects a placement point. The position information of the candidate point selected as the arrangement point here is associated with the position information before conversion. The display processing unit 12 displays the mark of the arrangement point on the screen (not shown) together with the map information based on the position information before the conversion of the selected arrangement point.
[0181]
  FIG. 55 is a diagram schematically illustrating an original diagram before the deformation process described with reference to FIGS. 52 to 54 and a deformation map after the deformation process is performed. FIG. 55A shows the original diagram, and FIG. 55B shows a modified map. For example, in FIG.₁, Point 2 in region 2₂, Point 3 in area 3₃Is included. These points are indicated by points P in FIG.₁', Point P₂', Point P₃Converted to '. Point P included in region 1 of the original figure₁Is multiplied by a weighting factor of 1, so the point P₁And point P included in the modified map₁There is no change in the position of '. Point P included in region 2 of the original figure₂Is multiplied by a weighting factor of 2, so that point P in the modified map₂Is point P in the original figure.₂Compared to GP₂It moves in the direction away from the reference point G by twice the distance between them. Point P included in region 3 of the original figure₃Is multiplied by a weighting factor of 3, so the point P in the modified map₃Is point P in the original figure.₃Compared to GP₃It moves in the direction away from the reference point G by a distance of three times between them. As a result of the same transformation for the points included in each region, as shown in FIG. 55 (b), there is no change in the distance between points in region 1, but the distance between points in region 2 and region 3 It becomes wider than the figure.
  According to the arrangement point selection method in the present embodiment, an arrangement point is selected from among a plurality of candidate points so that the distance between them becomes longer. Therefore, if you select placement points based on the modified map created by weighting the position coordinates of each candidate point according to the radio wave condition of the area as described above, you can select more arrangement points from areas with poor radio wave conditions can do. When the arrangement points selected in this way are reflected on the original map, the arrangement points are selected at a narrower interval in an area where the radio wave condition is poor than in an area where the radio wave condition is good. Thereby, in the entire business area, an appropriate arrangement point reflecting the radio wave condition of each area is selected. Also, here, by setting a predetermined reference point and multiplying the distance from the reference point to each point by a weighting coefficient, a modified map can be created approximately. By such processing, weighting processing can be performed with a smaller amount of data, and representative points can be selected quickly. Note that the reference point setting method described here is an example, and can be set by various methods.
[0182]
  The present invention has been described based on the embodiments. The embodiments are exemplifications, and it will be understood by those skilled in the art that various modifications can be made to combinations of the respective constituent elements and processing processes, and such modifications are within the scope of the present invention. . Hereinafter, such modifications will be described.
[0183]
  In the first embodiment, the area division processing described with reference to FIGS. 13 to 15 can be performed using various procedures. For example, in the candidate selection process in step 104 in FIG. 13, a store in the shortest position from the center of gravity of the store position acquired in each area is detected as a candidate (FIG. 14, S130 and S132). The store in the shortest position from the store position set as the seed may be detected as a candidate. Also in this case, it is possible to determine whether or not to determine the detected store as a candidate by the same process as in FIG.
[0184]
  Further, using the same principle as MST (minimum spanning tree), a store in the shortest position may be detected as a candidate from any of the stores acquired in each area. Also in this case, it is possible to determine whether or not to determine the detected store as a candidate by the same process as in FIG.
[0185]
  Further, in the third embodiment, it has been described that when the number of courses is input, the seed is automatically set. However, when the initial setting unit 114 receives the number of courses from the user, the logic storage unit It is also possible to calculate the number of areas by the process shown in FIG. 31 with reference to T7 and present the necessary number of areas to the user. In this case, the user can select whether the seed setting is performed manually or automatically, and can perform fine adjustment such as setting of the weight as necessary.
[0186]
  In the first to sixth embodiments described above, the statistics are calculated in consideration of the travel time between the base in the target business area and the store. For example, the worker leaves the home. As in the case of patrol between stores, the statistics can be calculated in consideration of the travel time from a point other than the base to any one of the stores.
[0187]
  In the first to sixth embodiments described above, the total number of courses in each area is exemplified and described as a statistic. In each area, for example, the number of stores included in each area, per store Statistics other than the number of courses, such as average work hours, average number of monthly visits per store, average distance from bases per store, average distance between stores, number of stores per course, total sales, average sales per store, etc. The area can be divided so that For example, when the average sales per store is used as a statistic, sales in each area can be made uniform. As described in the second embodiment and the third embodiment, such a process can be combined with a process of performing group division by setting more seed candidates than the number of seeds actually required. In this case, it is possible to appropriately set seeds so that the number of stores included in each area is equal, so that the number of courses in each area is finally equalized to some extent, and sales in each area are also equalized. You can also Thereby, a worker's fairness can also be raised more.
[0188]
  In the first embodiment and the sixth embodiment, the functions of the condition input reception unit 154 and the store selection unit 156 have been described. In addition, the selection of stores to be subjected to area division processing is performed by This can be done as appropriate in consideration of various aspects such as business conditions, methods of sales activities, and logistics. For example, when a patrol work is performed for a specific convenience store or franchise chain, the condition input reception unit 154 receives the specification of the convenience store or franchise chain, and the store selection unit 156 selects the specified convenience store or franchise chain. You can select stores that belong to the chain. The store selection unit 156 can also select stores to be subjected to area division processing according to the products handled by the store. For example, when conducting a sales promotion strategy for a product that requires permission to sell, such as alcohol, tobacco, and medicine, the condition input receiving unit 154 receives the specification of the product, and the store selection unit 156 handles the specified product. Can be selected. Thereby, an appropriate area division process can be performed according to the purpose.
[0189]
  Also, the area dividing method of the present inventionIsApplicable to various stores such as chain stores such as convenience stores, target customers for door-to-door sales and interview surveys, targets for various delivery services such as newspapers and milk, target facilities for distributing leaflets, etc. can do. Moreover, although the above embodiment demonstrated the example which divides | segments a business area into a some area, when setting a some business area, the same method can also be used. In this case, the base in each business area can be set by the same method as that for setting the seed in the above embodiment.
[0190]
  The arrangement point selection method described in the seventh embodiment is left when a plurality of facilities are already arranged in a certain area and some facilities are left out of the existing facilities to reduce the facilities. It can also be used to select a facility to power. Moreover, this arrangement point selection method is not limited to equipment installed fixedly at a fixed point, and can also be used to select an arrangement point of mobile equipment.
[0191]
  Further, in the seventh embodiment, the processing in the case where there is a difference in regional characteristics has been described with reference to FIGS. 50 to 54, but the same weighting processing is also performed in the case where the characteristics of each of the plurality of candidate points are different. It can be performed. For example, the same weighting process can be performed when an antenna having a different range in which radio waves reach is used. In addition, for example, when selecting an arrangement position of a store with a different trade area, the same weighting can be performed.
[0192]
The present invention also includes other forms.
  In the conventional method of selecting a desired point, it is necessary to prepare a plurality of installation patterns, and it is necessary to calculate quality evaluation values and cost evaluation values for all of the prepared installation patterns.
[0193]
  Here, each base station of the wireless communication network has a range where radio waves reach, and an area that each base station is responsible for is determined by this range. Therefore, in order to economically install a base station in a certain service area, it is important to appropriately select the installation position of the base station so that the areas handled by the base stations do not overlap as much as possible. As described above, such a problem needs to be considered when setting a plurality of service points in an area so that the service is distributed throughout the area.
[0194]
  For example, when a chain store such as a convenience store is developed in a certain area, it is necessary to consider an appropriate arrangement so that the commercial areas of the stores do not overlap so that the stores do not compete with each other.
[0195]
  On the other hand, multiplestoreIf the sales area including the system is divided into areas in charge of multiple workers, the patrol work can be performed efficiently without increasing the number of workers.storeIncreasing the number of is an important issue. In order to perform the patrol work efficiently,storeIt is preferable to divide the assigned area so that the movement distance between them is reduced. As an example for that, multiplestoreThe distance between each other is shortstoreA method of classifying the combinations into a plurality of areas so that the combinations are included in the same area. However, if such processing is performed in a disorderly manner, the business area cannot be divided into clean areas, and the efficiency may deteriorate as a whole. Therefore, multiplestoreThe starting point for each areastoreIt is important to select appropriately.
[0196]
  The present invention also has the following points.
  Another object of the present invention is to provide a technique for selecting a plurality of representative points in an appropriate arrangement from a plurality of candidate points arranged in a target area. Another object of the present invention is to provide a technique for efficiently arranging a plurality of service points in an area so that when the service is provided in a target area, the service is distributed throughout the area. Another object of the present invention is to provide a technique for selecting an arrangement in which a plurality of service points are arranged in a target area so that the effect at each service point is enhanced in relation to the position of other service points. It is to be. Another object of the invention is to provide a plurality ofstoreWhen the target area including the area is divided into areas, it becomes the starting point of each areastoreIt is to provide a technique for selecting the appropriate.
[0197]
  According to the present invention, a method for selecting a plurality of representative points from a plurality of points included in a target area, wherein after selecting a plurality of temporary representative points from a plurality of points, positional information between the temporary representative points The representative point selection method is characterized by repeatedly executing a process of re-selecting a plurality of temporary representative points so that the distance parameter determined based on The
[0198]
  According to the present invention, there is provided a method for selecting a plurality of representative points from a plurality of points included in a target area by a computer system, the computer system comprising provisional representative point selection means and distance parameter comparison means. After the temporary representative point selection means selects a plurality of temporary representative points from the plurality of points, the distance parameter comparison means has a plurality of distance parameters determined based on the positional information between the temporary representative points. There is provided a representative point selection method characterized by repeatedly executing the process of reselecting the temporary representative point and then determining the temporary representative point as the representative point.
[0199]
  Since the representative point selection method according to the present invention repeatedly executes the process of reselecting the temporary representative point so that the distance parameter becomes large, it is possible to select representative points that are appropriately distributed. Temporary representative points can be selected arbitrarily. The distance parameter can be, for example, a minimum value between the temporary representative points, an average value between the temporary representative points, or a combination of these and the reciprocal of the difference between the temporary representative points. Here, for example, the point selected as the temporary representative point when the process of reselecting the temporary representative point is performed a predetermined number of times can be determined as the representative point. It is also possible to determine the selected point as the representative point when the change amount of the distance parameter when the temporary representative point is selected again becomes a predetermined value or less.
[0200]
  According to the present invention, a method for selecting a plurality of representative points from a plurality of points included in a target area, wherein after selecting a plurality of temporary representative points from a plurality of points, other than the temporary representative points The first step of selecting a replacement candidate point from the points and the first distance parameter determined based on the position information of the temporary representative point, and the position of the temporary representative point when the temporary representative point is replaced with the replacement candidate point Calculating a second distance parameter determined based on the information, and sequentially replacing a temporary representative point with a replacement candidate point when the second distance parameter is larger than the first distance parameter. A representative point selection method is provided which is repeatedly executed and then determines a temporary representative point as a representative point.
[0201]
  According to the present invention, there is also provided a method for selecting a plurality of representative points from a plurality of points included in a target area by a computer system, wherein the computer system includes temporary representative point selection means, replacement candidate point selection means, and Distance parameter comparing means, and after the temporary representative point selecting means selects a plurality of temporary representative points from a plurality of points, the replacement candidate point selecting means selects replacement candidate points from other points than the temporary representative points. The first step to be selected and the position of the temporary representative point when the distance parameter comparison means calculates the first distance parameter determined based on the position information of the temporary representative point and replaces the temporary representative point with the replacement candidate point. A second distance parameter determined based on the information is calculated, and the second distance parameter is A representative point selection method characterized by selecting a plurality of representative points by sequentially repeating the second step of replacing a temporary representative point with a replacement candidate point when the distance parameter is larger than Provided.
[0202]
  In the representative point selection method according to the present invention, when the distance parameter becomes large, the process of replacing the temporary representative point with the replacement candidate point is repeatedly performed, and therefore, the representative points with appropriately distributed positions are selected. Can do. In addition, since the distance parameter when replaced with the replacement candidate point is compared with the distance parameter of the existing temporary representative point, it is not necessary to calculate the distance parameter of the temporary representative point that was not replaced in the previous process, and the distance The procedure for performing parameter comparison can be simplified. Thereby, a representative point can be selected quickly. Further, the replacement candidate points can be sequentially selected from a plurality of points. This makes it possible to determine whether or not to replace all the points with temporary representative points, so that representative points with suitably distributed arrangements can be selected. In addition, by repeatedly executing such processing, it is possible to optimize the distribution state of the representative points.
[0203]
  In the representative point selection method of the present invention, the distance parameter can be the minimum value of the temporary representative point distance.
[0204]
  In the representative point selection method of the present invention, the distance parameter comparison unit can use the minimum value of the temporary representative point distance as the distance parameter.
[0205]
  In this way, combinations of points that reduce the distance between the points are eliminated, and finally, a combination of points whose distances between the points are separated from each other can be selected as the representative point.
[0206]
  In the representative point selection method of the present invention, the distance parameter can be an average value of the temporary representative point distances.
[0207]
  In the representative point selection method of the present invention, the distance parameter comparison means can use an average value of the distances between temporary representative points as a distance parameter.
[0208]
  In this way, a combination of points that increases the distance between points is selected as a temporary representative point, so finally, a combination of points whose distances between points are separated from each other is selected as a representative point. Can do.
[0209]
  In the representative point selection method of the present invention, the distance parameter can be the reciprocal of the difference between the temporary representative point distances. In the representative point selection method of the present invention, the distance parameter comparison means can use the reciprocal of the difference between the temporary representative point distances as the distance parameter.
[0210]
  In this way, a combination of points that reduces the difference in distance between points is selected as a temporary representative point. Finally, a combination of points that approach the distance between points is selected as a representative point. can do. Thereby, the regional bias of the representative points can be prevented.
[0211]
  In the representative point selection method of the present invention, attribute information can be assigned to each of a plurality of points, and the distance parameter can be calculated in consideration of the attribute information of the temporary representative points.
[0212]
  In the representative point selection method of the present invention, the distance parameter comparison unit can assign attribute information to each of a plurality of points, and calculate the distance parameter in consideration of the attribute information of the temporary representative points.
[0213]
  In this way, even when the attributes are different among a plurality of points, it is possible to select appropriately distributed representative points in consideration of the difference in attributes.
[0214]
  In the representative point selection method of the present invention, attribute information is given to each of a plurality of points, the distance between the line segments connecting the temporary representative points is calculated, and the distance between the line segments is calculated for each line segment distance. The distance parameter can be calculated by multiplying the weighting coefficient determined based on the attribute information.
[0215]
  Further, in the representative point selection method of the present invention, the distance parameter comparison unit gives attribute information to each of the plurality of points, calculates the distance between the line segments connecting the temporary representative points, and for each line segment distance, The distance parameter can be calculated by multiplying the weighting coefficient determined based on the attribute information of the points at both ends of the line segment.
[0216]
  In the representative point selection method of the present invention, the attribute information can be based on the characteristics of the area where the points are arranged.
[0217]
  In this case, even if there are differences in regional characteristics depending on where a plurality of points are arranged, representative points that are appropriately distributed can be selected in consideration of such differences in regional characteristics. Here, the regional characteristics are appropriately selected according to the purpose of selecting the representative points. For example, population density, altitude of points, presence or absence of obstacles, etc. For example, when the point is an arrangement position of equipment, the attribute information can be a factor that the equipment exerts on the surroundings. Here, factors affecting the surroundings are appropriately selected according to the purpose of selecting the representative points. For example, it may be a trade area when the point is an arrangement position of a store, a range where radio waves reach when the point is an antenna such as a base station for wireless communication, and the like.
[0218]
  According to the present invention, a method for selecting a plurality of representative points from a plurality of points included in a target area, wherein a plurality of temporary representative points are arbitrarily selected from a plurality of points, and then other than the temporary representative points. The first step of adding one point arbitrarily selected from the points to the temporary representative point, and the step of removing either one of the points at both ends of the shortest line segment from the temporary representative points. The representative point selection method is characterized in that the two steps are sequentially repeated and then the temporary representative point is determined as the representative point.
[0219]
  Further, according to the present invention, the computer system is a method for selecting a plurality of representative points from a plurality of points included in the target area, and the computer system includes provisional representative point selection means and distance comparison means, After the temporary representative point selecting means arbitrarily selects a plurality of temporary representative points from a plurality of points, the temporary representative point selecting means selects one point arbitrarily selected from points other than the temporary representative points. And a second step in which the distance comparison means sequentially removes one of the points at both ends of the shortest line segment from the temporary representative point, among the line segments connecting the temporary representative points. The representative point selection method is characterized in that the temporary representative point is determined as the representative point. It is.
[0220]
  In this representative point selection method, in the second step, among the points at both ends of the shortest line segment among the line segments connecting the temporary representative points, the point with the shorter shortest distance from the other temporary representative points is selected. It can be removed from the temporary representative points. In this representative point selection method, in the second step, the distance from the point added in the first step among the points at both ends of the shortest line segment among the line segments respectively connecting the temporary representative points is The shorter point can be removed from the temporary representative point.
[0221]
  In the representative point selection method of the present invention, the step of assigning a point other than the representative point to any one of the representative points and the number of points belonging to each representative point or the arrangement state of the points are considered. Deleting one or more points from and selecting representative points.
[0222]
  In the representative point selection method of the present invention, the computer system may further include a representative point selecting unit, and the representative point selecting unit assigns another point other than the representative point to any one of the representative points; The method may further include the step of selecting one or more points from the representative points in consideration of the number of points belonging to each representative point or the arrangement state of the points, and selecting the representative points.
[0223]
  In this way, it is possible to select a suitable representative point according to the purpose according to the arrangement of other points from the appropriately distributed representative points, and select a representative point that satisfies a desired condition. be able to.
[0224]
  In the representative point selection method of the present invention, the target area can be divided into a plurality of areas, and a representative point can be selected as a starting point when the plurality of points belong to each area.
[0225]
  In this method, representative points that are appropriately distributed are used as starting points of a plurality of areas, and other points belong to each area. Therefore, the plurality of points can be divided into blocks.
[0226]
  In the representative point selection method of the present invention, a representative point can be selected as an arrangement position of equipment in the target area.
[0227]
  If it does in this way, a plurality of facilities can be distributed appropriately. Thereby, since a plurality of facilities can be appropriately arranged so that areas covered by the facilities do not overlap each other, the entire target region can be efficiently covered. In addition, for example, when facilities are competing with each other as in a store or the like, it is possible to effectively make a profit by arranging the facilities so that the ranges affected by the facilities do not overlap.
[0228]
  According to the present invention, a step of selecting a plurality of representative points from a target area including a plurality of points, a step of setting a plurality of areas including the selected representative points as initial values, and a point to be added to each area A process of selecting each area in consideration of the distance from the representative point, expanding each area, and assigning a plurality of points to any area. An area dividing method is provided, wherein a plurality of representative points are selected by any of the representative point selection methods described above.
[0229]
  In this way, among the representative points that are appropriately distributed, the representative points that are appropriately distributed according to the arrangement of the other points are used as starting points of a plurality of areas, and other points belong to each area. A plurality of points can be divided into blocks.
[0230]
  According to the present invention, a method for selecting a plurality of facility arrangement points from a plurality of candidate points included in a target area, wherein a plurality of representative points are selected and selected by any one of the above-described representative point selection methods. An arrangement point selection method is provided, wherein the representative point selected is selected as an arrangement point for a plurality of facilities.
[0231]
  If it does in this way, a plurality of facilities can be distributed appropriately. Thereby, since a plurality of facilities can be appropriately arranged so that areas covered by the facilities do not overlap each other, the entire target region can be efficiently covered. In addition, for example, when facilities are competing with each other as in a store or the like, it is possible to effectively make a profit by arranging the facilities so that the ranges affected by the facilities do not overlap.
[0232]
  According to the present invention, an area dividing method for dividing a target area including a plurality of points into a plurality of areas by using a computer system and assigning the points to each area, the computer system includes representative point selection means, and After the area dividing means is selected and the representative point selecting means selects a representative point selected by any of the above-described representative point selecting methods, the area dividing means sets a plurality of areas including the representative points as initial values. The area division is characterized in that each area is expanded by repeating the process of selecting points to be added to each area in consideration of the distance from the representative point of the area, and multiple points are attributed to any area. A method is provided.
[0233]
  According to the present invention, there is provided a method for selecting a plurality of facility arrangement points from a plurality of candidate points included in a target area by a computer system, the computer system comprising representative point selection means, and representative point selection means. However, there is provided an arrangement point selection method, wherein a plurality of representative points are selected by any one of the above-described representative point selection methods, and the selected representative points are selected as arrangement points of a plurality of facilities.
[0234]
  Conventionally, when selecting a plurality of representative points from a plurality of points, it has been manually performed arbitrarily. However, in the present invention described above, a plurality of representative points can be automatically selected from a plurality of points according to a certain procedure. Thereby, a plurality of representative points satisfying a desired condition can be objectively selected from a plurality of points without depending on intuition or experience.
[0235]
  For this reason, for example, area division will be described as an example. Conventionally, it is not assumed that representative points of each area that is the starting point when dividing an area are selected from among a plurality of points. The technique of automatically selecting representative points according to a certain procedure has never been studied. According to the present invention, when the target area is divided into areas, the representative point that is the starting point of each area can be appropriately selected, so that the area can be divided into a desired shape.
[0236]
  According to the present invention, there is provided a method for selecting a representative point from a plurality of points, and after selecting a plurality of temporary representative points from a plurality of points, a plurality of points other than the temporary representative points are selected. Of these, the step of arbitrarily selecting a replacement candidate point, the step of calculating the length of the first line segment that is the shortest among the line segments connecting the temporary representative points, and the temporary representative points, Calculating the length of the second line segment connecting the first temporary representative point closest to the replacement candidate point and the replacement candidate point, and including the first line segment and the second line segment A step of performing a first inspection for comparing the lengths of the line segments, and, if the second line segment is longer than the first line segment in the first inspection, any of the points at both ends of the first line segment. Either one from the temporary representative point In the step of selecting a replacement candidate point as a new temporary representative point and the first inspection, if the second line segment is shorter than the first line segment, the second closest position from the replacement candidate point A step of calculating a length of a third line segment connecting the second temporary representative point and the replacement candidate point, and a third of the temporary representative points closest to the first temporary representative point. Calculating a length of the fourth line segment connecting the temporary representative point and the first temporary representative point, and comparing the length of the third line segment with the length of the fourth line segment. In the second inspection, and in the second inspection, when the third line segment is longer than the fourth line segment, the first temporary representative point is removed from the temporary representative point, and the replacement candidate point is newly set. Selecting steps as temporary representative points in sequence Ri return run, then the representative point selection method characterized by determining the provisional representative points as representative points are provided.
[0237]
Industrial applicability
  As described above, according to the present invention, a plurality ofstoreIt is possible to provide a technology that divides a region including the number of areas into a plurality of areas so that statistics such as the amount of work in each area are equal. Further, according to the present invention, it is possible to select a plurality of representative points in an appropriate arrangement from a plurality of candidate points arranged in the target area. According to the present invention, when a service is provided in a target area, a plurality of service points can be efficiently arranged in the area so that the service is distributed throughout the area. According to the present invention, when a plurality of service points are arranged in a target area, it is possible to select an arrangement that enhances the effect at each service point in relation to the position of other service points. According to the present invention, a plurality ofstoreWhen the target area including is divided into areas, it becomes the starting point of each areastoreCan be selected appropriately.

Claims (18)

An area division system that divides a region including a plurality of stores into a plurality of areas and assigns the stores to each area,
The plurality of store information data including at least location information of the store, and store information data including information about the store, which is data necessary for calculating the amount of work when performing work via the store. Store information storage unit for storing each store of
In order to store, for each of the areas, a statistic that is a work amount when work is performed via a store belonging to the area, a candidate store to be a candidate to be attributed to the area, and a store included in the area. An area division information storage unit,
A process of selecting a seed which is a store serving as a starting point of each area, causing the store to belong to the area, and storing the store in the area division information storage unit as a store belonging to the area is performed for each area. An initial setting section to perform,
With reference to the area division information storage unit and the store information storage unit, a representative point of the area is calculated based on the position information of the store that has already belonged to each area. Based on the distance, a candidate store that is a candidate to be added and attributed to the area is selected, and the process of storing the candidate store in the area division information storage unit as a candidate to be attributed to the area is performed for each area. A candidate selection processing unit;
With reference to the area division information storage unit and the store information storage unit, the store already belonging to the area based on the store information data of the store and the candidate store already belonging to the area And calculating a statistic that is a work amount in the case of performing work via the candidate store, and storing the statistic in association with the area in the area division information storage unit for each area. A statistic calculation unit
With reference to the area division information storage unit, the area with the smallest statistical amount is selected as a specific area from the plurality of areas, the candidate store in the specific area is attributed to the specific area, A candidate attribution processing unit for storing the store in the area division information storage unit as a store belonging to the area;
An end condition setting accepting unit for accepting setting of an end condition for ending selection of the candidate store by the candidate selection processing unit and attribution of the candidate store by the candidate attribution processing unit;
An area division system that sequentially and repeatedly executes the selection of the candidate store by the candidate selection processing unit and the attribution of the candidate store by the candidate attribution processing unit until the end condition is satisfied .   In the area division | segmentation system of Claim 1,
  The said candidate selection process part is an area division | segmentation system which calculates the said representative point of the said area based on the said positional information of all the said shops already belonging to each said area.   In the area division system according to claim 1 or 2,
  The said candidate selection process part is an area division | segmentation system which calculates the gravity center of all the said stores as said representative point based on the said positional information of all the said stores already belonging to each said area.   In the area division | segmentation system in any one of Claim 1 to 3,
  The said candidate selection process part is an area division | segmentation system which selects the said store in the position close | similar to the said representative point as said candidate store based on the said positional information of each said several store for every said area. In the area division | segmentation system in any one of Claim 1 to 4 ,
The said candidate selection process part is an area division | segmentation system which selects the said candidate store so that the distance between the said stores which belongs to each said area may be in a predetermined | prescribed limit distance. In the area division | segmentation system of Claim 5 ,
The candidate selection processing unit refers to the store information storage unit for each area, and based on the position information of each of the plurality of stores,
From the stores that do not belong to any of the areas, select the store that is close to the representative point as the candidate store, and the candidate store and the other already belonging to the area Among the stores, it is determined whether or not the distance between the candidate store and the nearest store is within a predetermined limit distance, and when the distance is within the predetermined limit distance, the candidate store is As a candidate store,
If the distance is not within the predetermined limit distance, the candidate store is not determined as a candidate store of the area, and the next closest position from the representative point among the stores not belonging to any of the areas The area division system which selects the said store in a new candidate store, and repeats the same process until the said distance becomes in the said predetermined limit distance.   In the area division | segmentation system of Claim 6,
  The candidate selection processing unit refers to the store information storage unit for each area, and based on the position information of each of the plurality of stores, there is no store that does not belong to any of the areas. If the candidate store whose distance is within the predetermined limit distance is not determined, the store is next closest to the representative point among all stores including the store already belonging to the other area. An area division system in which the store at the position is newly selected as the candidate store and the same processing is repeated. In the area division | segmentation system in any one of Claim 1 to 7,
The store information data includes work hours in each of the plurality of stores,
The statistic calculation unit refers to the store information storage unit, as the work amount, the travel time between the stores based on the location information of the store and the candidate store that already belong to each area, and the The area division system which calculates the said statistic including the said working time of the said store and said candidate store which have already belonged to an area. In the area division | segmentation system in any one of Claim 1 to 7,
The store information data includes the purpose of visiting each of the plurality of stores,
A standard time storage unit that stores the purpose of visiting the store and the standard time required to achieve the purpose,
The statistic calculation unit refers to the store information storage unit and the standard time storage unit, and based on the location information of the store and the candidate store that have already belonged to each area as the work amount The area division system which calculates the said statistic including the travel time between stores, and the said standard time in the said store which has already belonged to the said area, and the said candidate store . The area division system according to claim 8 or 9, wherein the area includes a base.
A base information storage unit that stores base information data including position information of the base;
The statistic calculation unit, by referring to the base information storage unit, based on the position information of the base, as the amount of work between the store and the candidate store already belong to the site and the area An area division system that calculates the statistics including the travel time between them. In the area division | segmentation system in any one of Claim 1 to 10,
With reference to the area division information storage section, based on the statistics of each of said areas after having satisfied the terminating condition, the area division state determines whether it is appropriate, again if area division state is not appropriate An area division system further including a division state determination unit that instructs area division.   In the area division | segmentation system of Claim 11,
  The division state determination unit determines whether or not an area division state is appropriate based on whether or not a difference in statistics between the plurality of areas is within a predetermined range. The area division system according to any one of claims 1 to 12,
When the area division processing is already performed after the area division processing has already been performed, the image processing apparatus further includes a designation receiving unit that accepts designation of maintaining the belonging state of the store belonging to any area to the area,
The candidate attribution processing unit assigns the plurality of stores to any one of the areas so that the stores designated to maintain the belonging state belong to the corresponding area. The area division system according to any one of claims 1 to 13,
After the plurality of stores are attributed to any area, a change instruction to attribute the store to another area is received, and the statistics in each area when the store is attributed to another area by the change instruction The area division system further includes an adjustment accepting unit that permits or disallows the change instruction based on whether or not the difference in statistics between the plurality of areas is within a predetermined range . The area division system according to any one of claims 1 to 14,
An area division system, further comprising: a display processing unit that causes another terminal to display a state where the area is divided into a plurality of areas via a network. In the area division | segmentation system in any one of Claim 1 to 15,
An area division system further comprising a communication processing unit that receives an instruction to divide the region into a plurality of areas via a network. In the area division | segmentation system in any one of Claim 1 to 16,
The region includes a plurality of stores to be processed,
Further example Bei store selection unit for selecting a processing target store which meets a predetermined condition as a store for assigning to the area out of the plurality of processing target store,
Area division system that performs processing be assigned to any of the said areas the previous SL store elected by the shop selection unit as a target. The area division system according to claim 17,
A condition input receiving unit that receives an input of the predetermined condition;
A processing target store information storage unit that stores information on each of the processing target stores ,
The shop selection unit area division system to elect a store for assigning to the area with reference to the processing object store information storage unit.

Images