JP4258704B2 - Area division system - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a technique for dividing a region including a plurality of traveling points into a plurality of areas and assigning the traveling points to each area.
[0002]
[Prior art]
With the development of information processing technology, computerization is also progressing in the logistics field. For example, at a convenience store, sales management, inventory management, product management, etc. are performed simultaneously with the sale of products. As a result, the inventory can be managed in real time, so that the product can be replenished before the product becomes short. Information processing technology, mainly inventory information due to improvements in computer processing capacity and network technology, is processed quickly and automatically, but the work of actually delivering products to stores is currently done manually. Has been done.
[0003]
In general, products produced in a factory are first transported to a large distribution center called a base. Next, they are transported from the base to warehouses called depots provided for each area. And according to the order from a store, goods are delivered to each store from a depot. For example, when cigarettes are delivered, there are innumerable stores in the area where one depot is in charge, and a plurality of persons in charge distribute the cigarettes to those stores. Each person in charge visits stores in his area and delivers cigarettes.
[0004]
As a method of logically creating a traveling route, a so-called traveling salesman problem and an approximation algorithm thereof include, for example, random search, hill climbing method, simulated annealing (SA), genetic algorithm (GA), MST (Minimum Spanning). Tree). For example, a circuit support system that supports the generation of a circuit for a patrol vehicle such as a helper for home care or a delivery company delivering goods to efficiently perform a patrol has been proposed. (See Patent Document 1).
[0005]
[Patent Document 1]
Japanese Patent Laid-Open No. 11-134389
[0006]
[Problems to be solved by the invention]
However, in the conventional technology, only consideration is made from the viewpoint of how fast each patrol person can patrol 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 travel time is calculated assuming that all blocks travel around the shortest route, and is 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.
[0007]
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.
[0008]
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.
[0009]
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.
[0010]
An object of the present invention is to provide a technique for dividing a region including a plurality of traveling points into 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 to provide a technique for quickly dividing an area even when the traveling points included in the area to be divided frequently fluctuate. Still another object of the present invention is to provide a technique for visualizing the arrangement state of the tour points.
[0011]
[Means for Solving the Problems]
The present inventor has already applied for a technique for distributing a plurality of traveling points to any one of a plurality of areas so that statistics such as the amount of work in each area are equal (Japanese Patent Application No. 2002-311292). As a result of further study of this technology, we came up with the idea that it would be possible to divide the area more suitable for actual operation by improving the handling of traveling points placed inside high-rise buildings.
[0012]
  According to the present invention,
Multiple tour pointsIncluding regionIs divided into multiple areas.The patrol pointAn area division system to be assigned,
A traveling point information storage unit that stores traveling point information data including position information of the traveling point including position information in the height direction of each traveling point, for each of the plurality of traveling points included in the region;
An initial setting unit that sets a plurality of areas each including one traveling point that is a seed serving as a starting point in the region,
Based on the cyclic point information data in the cyclic point information storage unit, candidate cyclic points that are candidates to be added and attributed to each of the plurality of areas, respectively, for each of the plurality of areas.selectCandidateChoiceprocessingAnd
Each saidFor each areaBased on the traveling point information data, the position information of the traveling point and the candidate traveling point already belonging to the areaSettleWork amountStatistics,Each saidPosition of the patrol point in the height directionInformationIn consideration ofRespectivelyA statistic calculator to calculate;
A candidate attribution processing unit that selects, from among the plurality of areas, the area with the smallest statistical quantity calculated by the statistical quantity calculation unit as a specific area, and causes the candidate circulation point in the specific area to belong to the specific area When,
The candidate selection point by the candidate selection processing unit and the attribution of the candidate circulation point by the candidate attribution processing unit are sequentially repeated until a predetermined end condition is satisfied.An area dividing system is provided.
[0013]
“Circuit points” are, for example, objects that can be specified as geographical location information such as vending machines when performing filling operations, stores when delivering products, sales offices such as insurance products, or simply targets It is a point. “Statistics” refers to, for example, the number of courses indicating the amount of work per day in each area, 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 The average distance, the average distance between stores, the number of stores per course, the total sales, the average sales per store, and the like indicate the characteristics of stores included in each area. “The difference in statistic in each area is small” means, for example, that when the area division process is performed, the average value of the statistic difference between the areas is the smallest, This is the case where the maximum value of the difference is the smallest, or the statistics in each area are judged to be almost equal in consideration of these and individual circumstances.
[0014]
According to the area division system of the present invention, a plurality of cyclic points are attributed to a plurality of areas so that a difference in statistics in a plurality of areas becomes small. Therefore, by setting a statistic considering the purpose of area division, Each area can be divided fairly. Furthermore, even when the person in charge moves in the height direction along with the patrol, for example, when the patrol point is inside the building, the area can be divided in consideration of the movement.
[0015]
  The area division system of the present inventionBased on the traveling point information data,A determination unit that determines whether or not the traveling point exists at a position different from the ground surface can be further provided, and the statistic calculation unit calculates a distance from the ground surface to another traveling point. It can have a distance calculation part and the calculating part which calculates a statistic based on distance. “Ground surface” is, for example, the ground where the entrance of the building is located, the ground where the delivery truck is stopped, etc., and is a surface that is used as a reference when the person in charge starts patrol in the building.
[0016]
According to the area division system of the present invention, the movement of the person in charge in the height direction can be added to the calculation of the statistics.
[0017]
In the area division system according to the present invention, the distance calculation unit can calculate the distance to reach another traveling point via a point obtained by orthogonally projecting the traveling point on the ground surface. According to the area division system of the present invention, for example, an elevator, an escalator, a staircase, and the like can be used to model a delivery operation in a building where a person in charge moves in the height direction. Thereby, a statistic can be approximated to an actual work amount.
[0018]
  According to the present invention,For the tour point existing inside the building, it may further include a building information storage unit that stores an internal structure file of the building,The statistic calculator isFor the patrol points that exist inside the building,Of the buildingBased on the internal structure file,According to internal structureAboveCalculate statisticsA statistic calculating unit for each building, and an in-area statistic calculating unit that calculates a statistic based on a distance between the building and a traveling point existing outside the building, The candidate attribution processing unit integrates the statistic calculated by the building-specific statistic calculation unit and the statistic calculated by the in-area statistic calculation unit from a plurality of areas, and calculates the statistics. The area with the smallest statistical amount calculated by the quantity calculation unit can be selected as a specific area, and the candidate tour points in the specific area can be attributed to the specific area.
[0019]
According to the area division system of the present invention, it is possible to calculate a statistic generated by an operation of visiting a store existing inside a building in consideration of a structure such as a passage inside the building.
[0021]
According to the area division system of the present invention, it is possible to calculate a statistic suitable for each installation place environment even when the traveling point exists inside the building or when the traveling point exists outside the building. That is, in the actual area to be divided into areas, the tour points are installed under various environments, but the statistics corresponding to the locations of the tour points can be calculated as appropriate.
[0022]
In the area division system of the present invention, the building-specific statistic calculation unit is determined based on the internal structure, the distance calculation unit that calculates the movement distance inside the building, and the statistic inside the building based on the movement distance. And a calculation unit for calculating.
[0023]
According to the area division system of the present invention, a statistic can be calculated based on a moving distance inside a building.
[0024]
  In the area division system of the present invention,The building information storage unit can store, for each building, position information of a relay point through which the person in charge always passes before reaching the patrol point in the building. A route generation unit that generates a route including the tour point and the relay point can be further provided, and the statistic calculation unit can calculate a travel distance of the route generated by the route generation unit.
[0025]
The “relay point” is a point through which the person in charge always passes before reaching the patrol point, such as an elevator platform installed on each floor or an entrance / exit of the floor. At least one relay point is set for each floor. Also, a plurality of relay points may be set according to the structure such as a corridor in the floor, whereby the movement distance of the person in charge can be calculated with higher accuracy.
[0033]
  The area division system according to the present invention overlaps the internal structure and is built inside the building.ExistA display processing unit that displays the tour points on the display unit can be further provided. The display unit may visualize the internal structure using a projection method such as a wire frame so that the internal structure can be understood three-dimensionally.
[0034]
  According to the area division system of the present invention, for example, an administrator of an operation company can intuitively grasp the work of the person in charge in the building. In addition, since the person in charge can grasp the work in the building before the actual work, efficient delivery can be performed.
In the area division system of the present invention, the work amount can be calculated based on a moving distance between the traveling points.
In the area division system according to the present invention, the candidate selection processing unit, for each of the plurality of areas from among the unaffiliated cyclic points that do not yet belong to any area, is located at a position close to the representative point of the area. A certain tour point can be selected as the candidate tour point.
In the area division system of the present invention, the candidate selection processing unit can calculate the center of gravity of the traveling points acquired in the plurality of areas as the representative point.
In the area division system according to the present invention, the predetermined end condition is that there are no unaffiliated circulation points that do not belong to any area in the area, and that the candidate circulation points are attributed by the candidate attribution processing unit. Either a predetermined number of times has been performed, or the difference between the statistics in each of the plurality of areas is within a predetermined range.
[0035]
It should be noted that any combination of the above-described constituent elements and a conversion of the expression of the present invention between a method, an apparatus, a system, a recording medium, a computer program, etc. are also effective as an aspect of the present invention.
[0036]
DETAILED DESCRIPTION OF THE INVENTION
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.
[0037]
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. The “seed” is a store that is a starting point in each area when the area is divided. Subsequently, area division is performed starting from the seed (S6). The area division is performed not only in a plane but also in a three-dimensional manner, for example, for a store in a high-rise building. Thereafter, the result of area division is displayed, and evaluation and adjustment are performed (S7).
[0038]
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 the initial settings, statistics are calculated for each area by the area division engine, and the business area is divided into areas. Subsequently, map information and area division states are mapped on the screen. At the same time, the statistics for each area are listed. 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.
[0039]
Although details will be described later, the area division engine mainly repeats the store selection process, the statistics calculation process for each area, and the store attribution process to the area, and gradually expands the area from the seed. I do. The purpose of this embodiment is to divide the area so that the work amount of the person in charge is equal. For this reason, the statistic in the following description indicates the amount of work calculated based on the movement distance of the person in charge unless otherwise specified. In another form, a statistic may be arbitrarily set according to the purpose of area division.
[0040]
FIG. 3 is a diagram for explaining a process of calculating a movement distance between stores. When the store is simply placed in a three-dimensional coordinate system and the distance traveled between stores is calculated, the distance l from the store A to the store B connected in a straight line₁become. For example, if the store A is on the 5th floor of the building A and the store B is on the 15th floor of the building B, the person in charge moves from the 5th floor of the building A to the 15th floor of the building B. In other words, it is impossible to take into account the movement of the person in charge in the height direction that occurs with the movement between stores. For this reason, an error occurs between the work amount calculated as the statistic and the actual work amount. Furthermore, since this error becomes larger as a plurality of buildings are included in the area, it is difficult to equalize the statistics for each area.
[0041]
On the other hand, when considering the movement of the person in charge in the height direction, the travel distance l from store A to store B₂Is from the store A to the store B via the relay point A ′ and the relay point B ′. Here, the relay point A ′ in the figure is a position when the store A is orthogonally projected onto the ground surface, and the relay point B ′ is a position when the store B is orthogonally projected onto the ground surface. In this way, by taking into account the movement in the height direction of the person in charge that occurs according to the location of the store, it is possible to approach the actual work amount. Thereby, even when a plurality of buildings are included in the area, the stores can be divided so that the statistics for each area are equal. The following embodiments have a function of calculating a statistic in consideration of the movement of the person in charge that occurs in accordance with the location of such a store and the restrictions at the time of movement.
[0042]
FIG. 4 is a diagram showing an example of a display screen 300 by the area simulator apparatus according to the present embodiment. The area screen 302 is a screen for displaying the position of a store on a map, and each store is mapped as a store icon 303 at the corresponding position. By performing such display, the user can visually confirm the distribution status of the stores. The scale instruction component 301 is a component for designating the range of the area to be displayed on the area screen 302. A map of the designated scale is displayed, and the position of the store icon 303 is adjusted in conjunction with the scale of the map. The
[0043]
FIG. 5 is a diagram illustrating an example of the enlarged area screen 304. This figure shows an example when a specific area is enlarged and displayed by operating the scale instruction component 301 of FIG. The first type building icon 312 indicates that, for example, a store such as a tobacco store is generally on the first floor, and one store exists in the building. Hereinafter, such a building is referred to as a “first type building”. The second type building icon 310 indicates that there is a store inside a building having a plurality of floors such as a department store, a shopping mall, and an office building. Hereinafter, such a high-rise building is referred to as “second-class building”. The supplementary information display area 306 is an area for displaying supplementary information such as a building name and the number of stores in the building, for example, regarding the building corresponding to the icon designated by the cursor 308. Thus, by changing the shape of the icon according to the type of building, the user can intuitively grasp the labor required for delivery, the time, the number of stores, and the like. In another example, the size and color of the icon may be changed according to the number of stores in the building and the amount of movement in the height direction in the building. In addition, the presence / absence of a parking space for a delivery truck, the presence / absence of an elevator and an escalator in a building, and the like may be intuitively understood.
[0044]
FIG. 6 is a diagram illustrating an example of a screen 320 that displays the internal structure of a building. This screen is displayed, for example, when the user clicks the cursor 308 over the second type building icon 310 of FIG. The internal structure drawing 324 is a three-dimensional drawing of the interior of the building using a wire frame. In other examples, the floor plan may be drawn on a floor-by-floor basis, or viewed from an arbitrary angle. It may be a bird's-eye view of time. In the internal structure diagram 324, at least an entrance 326 to the building and an elevator door 328 serving as an entrance to each floor are drawn. That is, the entrance / exit used for carrying in goods is displayed. In another example, a partition or a corridor for each floor may be drawn. Further, the number of floors for each floor is drawn in the floor number display area 325 so as to correspond to each floor in the internal structure diagram 324. The store display button 322 is a button for instructing to display the store position on the internal structure diagram 324.
[0045]
FIG. 7 is a diagram showing an example of a store display screen 330 displayed by pressing the store display button 322 of FIG. On this screen, a store icon 336 is displayed at a corresponding position in the internal structure diagram 324 based on the actual store arrangement. As a result, the user can intuitively grasp the store arrangement information inside the building. For example, the person in charge can check the arrangement status of the store in the building before the actual delivery, or the administrator can check the labor force of the person in charge. Can be used as a standard for objectively judging. In other words, it is easier for the manager to imagine the labor of the person in charge than simply presenting the number of stores and work hours inside the building as numerical values. The new registration button 334 is pressed when a new store is added inside the building. With this action as a trigger, a store icon 336c that moves according to the movement of the cursor 338 is newly displayed. And if a user moves the store icon 336c to the arbitrary positions inside a building and designates it, a store can be newly registered. This facilitates the registration of the store inside the building and prevents input errors compared to the case of registering the store on a numerical basis. The route display button 332 is a button for instructing display of a route for visiting a store existing in the building. In another example, the shape and color of the store icon 336 may be changed according to the size of the store, the number of deliveries, and the like.
[0046]
FIG. 8 is a diagram showing an example of a route display screen 340 displayed by pressing the route display button 332 in FIG. On this screen, a path 346 is displayed for each floor so as to overlap the internal structure diagram 324. In this embodiment, the elevator door 328 is set as the relay point 347. This path 346 is guided by a known method such as MST. For example, the route 346b on the second floor passes through the first store icon 336a, the second store icon 336b, and the relay point 347c. Thereby, the person in charge can grasp | ascertain the optimal path | route for every floor. The structure diagram display button 323 is a button for displaying the structure display screen 320 of FIG. The store display button 322 is a button for displaying the store display screen 330 of FIG.
[0047]
FIG. 9 is a configuration diagram of the area simulator apparatus 100 that performs area division processing in the present embodiment. Each component of the area simulator apparatus 100 includes hardware and software centering on a storage unit such as a CPU, a memory of the arbitrary computer, a program for realizing the components of the figure loaded in the memory, and a hard disk for storing the program. Those skilled in the art will understand that there are various modifications in the implementation method and apparatus, which are realized by any combination of the wears. Each drawing described below shows a functional unit block, not a hardware unit configuration. The area simulator apparatus 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, a logic storage unit T7, and a building information storage unit T8. . The division processing unit 115 includes a candidate selection processing unit 116 and a division control unit 400.
[0048]
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 in the business area. The store information storage unit T3 stores store information. The building information storage unit T8 holds various information related to the building, along with shape data for forming the internal structure of the building described with reference to FIG. 6, a relay point for each floor, a photograph, and the like.
[0049]
FIG. 10 is a diagram illustrating an example of a data structure of the store information storage unit T3. The base code column 450 holds base identification information. The store code column 452 holds store identification information. The building code column 454 holds identification information of the building where the store exists. The type column 456 holds information for identifying the type of building. In this figure, “0” indicates a first type building, and “1” indicates a second type building. The position information column 458 holds store position information. This position information may be expressed by, for example, longitude, latitude, and altitude, may be expressed by coordinate values defined for each building, or expressed as a relative position with respect to the base. Also good. The expression form of the position information may be arbitrary as long as it can be used for simulation. The height column 460 holds information on the floor on which the store exists. The work time column 462 holds the work time per time in the store. In addition to these data, the store information storage unit T3 stores the store name, monthly sales (yen), monthly sales volume for each product (pieces), the number of monthly visits, travel speed from the base (km / hour), and between stores Information necessary for calculating a statistic such as a moving speed (km / hour) is included. 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. As handling goods, information about goods which need sales qualification, such as alcohol, tobacco, medicine, etc. can be included, for example.
[0050]
FIG. 11 is a diagram illustrating an example of a data structure of the building information storage unit T8. In addition to the table having this data structure, the building information storage unit T8 holds a building shape data file, a data file that holds coordinate values of relay points, and the like. The building code column 470 holds a building code. The building name column 472 holds a building name. The internal structure file column 474 holds the file name of the shape data of the building. The relay point file column 476 holds the name of a file that holds information on the relay point for each floor. The store information storage unit T3 and the building information storage unit T8 described with reference to FIG. 10 are related using the building code as a key. For example, “ABC building” with the building code “0125” has stores with store codes “a”, “b”, and “c” inside. The file indicating the internal structure of the ABC building is “ABC.dat”. By having such a data structure, it becomes possible to change the shape of the icon according to the type of building as described with reference to FIG. 5, and as described with reference to FIGS. Display is possible. Display processing using these data will be described later.
[0051]
Returning to FIG. 9, the condition input receiving unit 154 receives an input of conditions for selecting a store to be subjected to area division processing 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. The display processing unit 108 performs processing for displaying various data on the display unit 107. 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. 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, the number of areas, weight setting, combination specification, and the like from the user.
[0052]
FIG. 12 is an internal block diagram of the initial setting unit 114 of 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.
[0053]
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.
[0054]
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. For example, a store code and a building code may be associated by this process. 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.
[0055]
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. The “weight” is generally referred to as “weighting”. For example, when moving between stores, there are many cases of passing through a winding road, a complicated road, and a road with heavy congestion. By adding such regional characteristics for each business area as weights to the calculation of statistics, it becomes possible to calculate with higher accuracy.
[0056]
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 in 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.
[0057]
Returning to FIG. 9, the initial setting storage unit T5 stores the setting values set by the initial setting unit. FIG. 13 is a diagram illustrating an example of a data structure of the initial setting storage unit T5. The store code column 500 holds store codes. The seed field 502 holds information that specifies whether or not it is a seed. In this figure, the seed column 502 holds information for specifying an area, and means that it is a seed of the area. For example, in the figure, the store with the store code “e” is the seed of the second area. The weight column 504 holds a weight. The combination column 506 holds store codes of stores to be selected in combination. In this figure, 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.
[0058]
Returning to FIG. 9, 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 400 causes candidate stores to belong to any of the areas so that the statistics of the respective areas are closest to each other.
[0059]
FIG. 14 is an internal configuration diagram of the division control unit 400. The specifying unit 402 receives the store code of the store selected by the candidate selection processing unit 116. And the specific | specification part 402 reads the classification of the building matched with the shop code with reference to the shop information storage part T3. The specifying unit 402 determines whether the store exists in the first type building based on the read type, and outputs the result to the instruction unit 404. The instruction unit 404 supplies the selected store code to the first statistic calculation unit 406 or the second statistic calculation unit 408 according to the determination result, and instructs the statistic calculation processing. When the selected store exists in the first type building, the instruction unit 404 instructs the first statistic calculation unit 406 to calculate the statistic. In addition, when the selected store exists in the second type building, the instruction unit 404 instructs the second statistic calculation unit 408 that calculates the statistic in consideration of the movement in the height direction to calculate the statistic. To do.
[0060]
FIG. 15 is an internal block diagram of the second statistic calculator 408 of FIG. The extraction unit 420 reads the building code associated with the store code supplied from the instruction unit 404 from the store information storage unit T3 with reference to the store information storage unit T3. Then, the extraction unit 420 reads all the store codes associated with the building code and supplies them to the floor statistic calculation unit 422. That is, the extraction unit 420 extracts all stores existing in the same building from the store information storage unit T3.
[0061]
The per-floor statistic calculation unit 422 calculates a statistic for each floor, targeting stores on the same floor. For this calculation, the per-floor statistic calculation unit 422 supplies the store code for each floor to the route generation unit 426, and instructs the creation of a tour route. In response to the instruction, the route generation unit 426 creates a tour route including a store and a relay point for each floor using a solution such as MST. Then, the per-floor statistic calculation unit 422 calculates the statistic based on this cyclic route. In addition, the route generation unit 426 stores the created tour route in the building information storage unit T8. This cyclic route is used for the display of the route described with reference to FIG.
[0062]
The per-floor statistic calculation unit 422 outputs the statistic calculated for each floor to the integration unit 424. The integration unit 424 adds a correction value corresponding to the moving distance in the height direction to the statistics for each floor, and calculates the statistics for the entire building (hereinafter simply referred to as “statistics in the building”). Then, the integration unit 424 supplies the in-building statistics to the candidate attribution processing unit 410. Thereby, the 2nd statistics calculation part 408 can calculate the statistics in a building for every building.
[0063]
Returning to FIG. 14, the candidate attribution processing unit 410 integrates the statistics calculated by the first statistic calculation unit 406 and the second statistic calculation unit 408 so that the statistics for each area are almost equal in all areas. The candidate stores are assigned to each area sequentially. The adjustment receiving unit 412 is a store that belongs to each area from the user after the area is divided by the candidate selection processing unit 116, the first statistic calculation unit 406, the second statistic calculation unit 408, and the candidate attribution processing unit 410. Accept adjustments such as replacement. When the adjustment receiving unit 412 receives an adjustment from the user, the first statistic calculating unit 406 and the second statistic calculating unit 408 calculate the statistic of each area again. As a result, if the amount of change due to the adjustment is within an allowable range, the adjustment receiving unit 412 permits the adjustment.
[0064]
FIG. 16 is an internal configuration diagram of the logic storage unit T7 of FIG. 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 calculating the statistic in the first statistic calculation unit 406 and the second statistic calculation unit 408 of the division control unit 400.
[0065]
Returning to FIG. 9, 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. 17 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, an average travel time M between bases and stores.₁, 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.
[0066]
FIG. 18 is an internal block diagram of the display processing unit 108 of FIG. The display instruction receiving unit 430 receives an instruction of a screen type to be displayed from the user. For example, when the store display button 322 in FIG. 8 is pressed, the display instruction receiving unit 430 instructs the display data generating unit 431 to display the store display screen 330 in FIG. 7 on the display unit 107 in FIG. . The display data generation unit 431 includes an area display data generation unit 432 and a building display data generation unit 433. The area display data generation unit 432 generates screen data for displaying a store on a two-dimensional map such as the enlarged area screen 304 described with reference to FIG. The building display data generation unit 433 generates screen data for displaying the inside of the building such as the route display screen 340 described with reference to FIG.
[0067]
FIG. 19 is an internal block diagram of the area display data generation unit 432 of FIG. The icon storage unit 440 holds icons in association with information specifying the type of building. For example, in the present embodiment, the icon storage unit 440 holds the first type building icon 312 in FIG. 5 in association with the “first type building” and associates with the “second type building”. Then, the second type building icon 310 of FIG. 5 is held. The arrangement unit 442 reads a map from the map information storage unit T1 based on an instruction from the display instruction reception unit 430, and arranges the store read from the store information storage unit T3 on the map. The placement unit 442 requests the selection unit 441 for an icon corresponding to the type of building associated with the store. The selection unit 441 selects an icon corresponding to the type of building from the icon storage unit 440 and supplies it to the arrangement unit 442. Then, the placement unit 442 places the icon at a predetermined position on the map. Thereby, data for displaying the enlarged area screen 304 described with reference to FIG. 5 is generated.
[0068]
FIG. 20 is an internal configuration diagram of the building display data generation unit 433 in FIG. The icon storage unit 449 holds icons in association with store information. For example, the icon may be prepared according to the type or nature of the store, such as the type of store, group, and handling product. The data generation unit 446 instructs the shape data reading unit 445 to read the shape data of the building designated by the user based on the instruction from the display instruction receiving unit 430. The shape data reading unit 445 reads the shape data of the designated building from the building information storage unit T8. When the structure display screen 320 of FIG. 6 is displayed, the data generation unit 446 generates data for displaying the internal structure of the building based on the shape data, and outputs the data to the display unit 107. When the store display screen 330 of FIG. 7 is displayed, the arrangement unit 447 causes the selection unit 444 to select the store icon associated with the building designated by the user. And the arrangement | positioning part 447 arrange | positions the selected icon in the predetermined position inside a building. Thereby, data for displaying the store display screen 330 is generated. When the route display screen 340 of FIG. 8 is displayed, the route synthesis unit 448 superimposes the tour route read from the building information storage unit T8 on the image inside the structure generated by the placement unit 447. Thereby, data for displaying the route display screen 340 is generated.
[0069]
FIG. 21 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 of FIG. 9 (S102). The candidate selection processing unit 116 in FIG. 9 selects store candidates to be attributed to the same area for each seed (S104).
[0070]
Here, with reference to FIG. 22, a procedure in which the candidate selection processing unit 116 selects a store candidate to be attributed to each area in step 104 will be described. This figure is an example of a flowchart of candidate selection processing in the candidate selection processing unit 116 stored in the candidate selection logic storage unit T7b of FIG. 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.
[0071]
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 is calculated based on a two-dimensional coordinate system. That is, the distance is calculated while being mapped on the map. Next, the calculated shortest distance is compared with the store acquisition limit distance set in advance by the parameter setting unit 110 (S136). If the shortest distance is within the limit (Yes in S136), the temporary candidate store is selected. 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 for the 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.
[0072]
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.
[0073]
Returning to FIG. 21, it is determined whether or not a candidate has been selected in step 104 (S106). The identifying unit 402 in FIG. 14 makes this determination based on whether or not a flag is set for each area. When a candidate is selected in step 104 (Yes in S106), the process proceeds to a statistic calculation process (S108).
[0074]
FIG. 23 is an example of a detailed flowchart of the statistic calculation process in step 108. The identifying unit 402 in FIG. 14 identifies the type of building associated with the store, and determines whether the building is a first type building (S500). In the case of the first type building (Yes in S500), the first statistic calculation unit 406 in FIG. 14 calculates the statistic of the area by a method described later (S502). Further, when the building is a second type building (No in S500), the second statistic calculation unit 408 in FIG. 14 moves the statistic of the area in the height direction including the entire store inside the building. (S504).
[0075]
FIG. 24 is an example of a flowchart of the statistical amount calculation process inside the building in step 504. The extraction unit 420 in FIG. 15 extracts all stores existing inside the building from the store information storage unit T3 in FIG. 9 (S510). Then, the per-floor statistic calculation unit 422 in FIG. 15 sets the floor for which the statistic is to be calculated, for example, to the first floor (S512), and calculates the statistic on that floor (S514). After the calculation of the statistics on the floor is completed, the floor-specific statistics calculation unit 422 determines whether there is a floor for which statistics are not calculated (S516). If the floor remains (Yes in S516), the process returns to step 512, and a floor is set on the upper floor, for example. When the statistics of all the floors are calculated (No in S516), the integration unit 424 in FIG. 15 adds up the statistics calculated for each floor, and adds the time, labor, and the like that occur as the floor moves. A comprehensive statistic that is a statistic of the entire building is calculated (S518). Thereby, for example, area division can be performed in consideration of the movement time in a high-rise building, labor required for movement, work time, and the like. In the present embodiment, in the subsequent processing, the entire building is handled as one point, that is, one store, rather than being handled for each store inside the building.
[0076]
Returning to FIG. 21, the candidate attribution processing unit 410 of FIG. 14 detects an area where the statistics of the area, that is, the number of courses is the smallest (S110). If the candidate attribution processing unit 410 detects that the statistic is minimum (Yes in S110), the candidate attribution processing unit 410 causes the area to acquire a candidate store (S112). Subsequently, the candidate attribution processing unit 410 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, that 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.
[0077]
In step 110, when it is detected that the statistic is not the minimum (No in S110), the process proceeds to step 116, and the candidate attribution processing unit 410 suspends processing of the 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 410 detects whether or not a 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.
[0078]
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.
[0079]
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 410 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 410 detects whether or not a 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.
[0080]
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, where the candidate attribution processing unit 410 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 410 suspends processing for that area until a candidate is acquired by another area. (No in S120). Thereafter, the same processing is performed.
[0081]
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.
[0082]
FIG. 25 is a diagram illustrating an example of the area division processing illustrated in FIGS. 21 and 22. Here, the area division is performed so that the total number of courses in each area is equal. As shown in FIG. 25A, 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 of FIG. 9 will be described.
[0083]
As shown in FIG. 25B, the seed setting unit 122 in FIG. 12 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 in FIG. 9 performs processing so that points belonging to different areas are displayed with different marks and different colors.
[0084]
As illustrated in FIG. 25C, the candidate selection processing unit 116 illustrated in FIG. 9 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 first statistic calculation unit 406 or the second statistic calculation unit 408 in FIG. 14 sequentially calculates the total number of courses in each area according to a calculation method described later. The candidate attribution processing unit 410 in FIG. 14 acquires candidates from the area where the total number of courses is the smallest, and each time an area acquires a candidate, detects the area where the total number of courses is the smallest, and acquires the candidate. Repeat the process. When points are sequentially selected for each area in this way, a plurality of points gradually belong to each area as shown in FIG.
[0085]
Hereinafter, the process of selecting the next candidate point in area 3 will be described with reference to FIG. As described in step 132 of FIG. 22, 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.
[0086]
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. When a store in the second type building is selected during the candidate selection, the processing described with reference to FIG. 24 is performed. Thereafter, all stores in the building are regarded as one store. It is processed.
[0087]
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.
[0088]
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.
[0089]
FIG. 26 is a flowchart showing the logic used by the first statistic calculator 406 of FIG. 14 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 first statistic calculation unit 406 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, that is, the statistic is calculated by the following procedure.
[0090]
The first statistic calculation unit 406 first 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 this total distance by the base-store travel speed set by the parameter setting unit 110 in FIG. The total travel time is then divided by the total number of stores in the area.₁Is calculated.
[0091]
Subsequently, the first statistic calculation unit 406 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.
[0092]
Subsequently, the first statistic calculation unit 406 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.
[0093]
On the other hand, the first statistic calculation unit 406 has a number N of stores that require processing 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.
[0094]
Thereafter, the first statistic calculation unit 406 determines 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).
[0095]
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.
[0096]
FIG. 27 is a flowchart showing the logic used by the second statistic calculator 408 of FIG. 14 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 second statistic calculation unit 408 appropriately refers to the data stored in the store information storage unit T3 and the building information storage unit T8, and calculates the total number of courses, that is, the statistic in the following procedure.
[0097]
The second statistic calculator 408 first calculates the average travel time M from the base to the store that changes as the second type building is added to the area.₁Is calculated (S520). In the present embodiment, the second statistic calculator 408 calculates the average travel time M based on the distance between the building and the base.₁Is calculated. That is, the travel time between the store and the base in the second type building is the average travel time M₁Is not taken into account. Next, the second statistic calculation unit 408 travels T when traveling around a plurality of stores existing in the second type building._bIs calculated (S522).
[0098]
FIG. 28 is an example of a detailed flowchart of step 522. The floor-by-floor statistics calculation unit 422 in FIG. 15 sets, for example, the floor for calculating the movement distance to the first floor (S530). Next, the per-floor statistic calculation unit 422 requests the route generation unit 426 in FIG. 15 to generate a cyclic route in the floor. The route generation unit 426 generates a cyclic route (S532). Then, the floor-by-floor statistic calculation unit 422 divides the patrol route by the moving speed in the floor and calculates the floor moving time T._fIs calculated (S534). The floor-by-floor statistic calculation unit 422 uses the floor movement time T until there is no unprocessed floor._fIs continued (Yes in S536).
[0099]
Floor travel time T for all floors_f(No in S536), the integration unit 424 in FIG._fAre summed (S538). Floor travel time T_fTotal floor movement time T_faThat's it. Next, the floor-by-floor statistic calculation unit 422 moves between floors T_lfThe integration unit 424 calculates the movement time T between floors._eAre totaled (S540). Floor travel time T_eIs the total travel time between floors T_eaThat's it. For example, the floor-by-floor statistic calculation unit 422 holds in advance the unit movement time required to move the floor to the first floor, and multiplies the number of floor movements by the unit movement time, thereby moving the movement time T between floors._eaMay be calculated. The floor-by-floor statistic calculation unit 422 holds unit movement time for each means for moving between floors, for example, elevators, escalators, and stairs, and refers to information inside the building in the building information storage unit T8 in FIG. Then, it may be selectively used as appropriate.
[0100]
Further, the floor-by-floor statistic calculation unit 422 calculates a time generated due to a situation peculiar to a building, a delivery situation, or the like as a correction time T_a(S542). Then, the integration unit 424 determines that the floor movement time T_fa, Floor travel time T_ea, Correction time T_aTotal travel time T in the building_bIs calculated (S544).
[0101]
Returning to FIG. 27, the second statistic calculator 408 calculates the total travel time T_bThe average travel time between stores M₂Is calculated (S524). And the number N of stores that can be processed per day as in step 164 of FIG.₁Is calculated (S526). In addition, the second statistic calculation unit 408 uses the number N of stores that need to be processed per day as in step 166 of FIG.₂Is calculated (S530). Then, the second statistic calculation unit 408 calculates the number of courses, that is, the statistic (S528).
[0102]
FIG. 29 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. 29A 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. Accordingly, the first statistic calculation unit 406 and the second statistic calculation unit 408 can grasp an area where the recalculation of the statistic is necessary. The first statistic calculator 406 and the second statistic calculator 408 recalculate the statistic only for the marked area. The result calculated by the first statistic calculation unit 406 and the second statistic calculation unit 408 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.
[0103]
Further, when 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.
[0104]
According to the area simulator device 100 in the present embodiment, the stores are acquired in order from the area where the statistic such as the total number of courses is the smallest, so that the statistic in all areas can be equalized. 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. In addition, since the movement of the person in charge in the height direction can be taken into account, the statistic can be calculated in a form close to the actual work of the person in charge, and the traveling points can be divided into a plurality of areas by using it. Thereby, the work efficiency in a sales area can be improved.
[0105]
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.
[0106]
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.
[0107]
The first modification relates to the division control unit 400 described with reference to FIG. FIG. 30 is an internal configuration diagram of a division control unit 600 having a configuration different from that of the division control unit 400. The building-specific statistic calculation unit 602 has the same configuration as the second statistic calculation unit 408 in FIG. 14, for example, and is a comprehensive statistic for each building generated by making a round of the stores existing inside the building. Is calculated. The building-specific statistical amount calculation unit 602 outputs the calculated total statistical amount to the regional statistical amount calculation unit 604. The in-region statistics calculation unit 604 arranges stores on the map and calculates in-region statistics based on the distance between stores obtained from two-dimensional coordinate values. When calculating a statistic including the second type building, the in-region statistic calculation unit 604 uses the in-building statistic supplied from the per-building statistic calculation unit 602. In this way, the total statistics calculated for each building can be used for an area division method based on two dimensions.
[0108]
FIG. 31 relates to the division processing unit 115 described with reference to FIG. FIG. 31 is an internal configuration diagram of a division processing unit 610 having a configuration different from that of the division processing unit 115. The detection unit 612 refers to the store information storage unit T3 and the building information storage unit T8, and detects a store newly added, moved, or deleted in the building, or a building whose internal structure is changed. The detection unit 612 instructs the building-specific statistical amount calculation unit 614 to calculate the total statistical amount of the building. The building-specific statistical amount calculation unit 614 refers to the store information storage unit T3 and the building information storage unit T8, and calculates the total statistical amount of the building instructed to the detection unit 612. The building-specific statistical amount calculation unit 614 stores the calculated total statistical amount in the building-specific statistical amount storage unit 616 in association with information for specifying the building. The internal configuration of the building-specific statistical calculation unit 614 is substantially the same as the configuration of the second statistical calculation unit 408 described with reference to FIG.
[0109]
The division control unit 618 reads and uses comprehensive statistics from the building-specific statistics storage unit 616 when the stores selected by the candidate selection processing unit 116 are allocated to each area. In this way, the processing speed can be improved by calculating the total statistics in advance and using them in the actual area division processing.
[0110]
【The invention's effect】
As described above, according to the present invention, there is provided a technique for dividing an area including a plurality of traveling points into a plurality of areas so that statistics such as a work amount in consideration of movement in the height direction in each area are equalized. be able to.
[Brief description of the drawings]
FIG. 1 is an example of a flowchart showing a procedure of area division processing according to the present embodiment;
FIG. 2 is a diagram schematically showing a procedure shown in FIG.
FIG. 3 is a diagram for explaining a calculation process of a movement distance between stores;
FIG. 4 is a diagram showing an example of a display screen according to the present embodiment.
FIG. 5 is a diagram showing an example of an enlarged area screen according to the present embodiment.
FIG. 6 is a diagram showing an example of a structure display screen according to the present embodiment.
FIG. 7 is a diagram showing an example of a store display screen according to the present embodiment.
FIG. 8 is a diagram showing an example of a route display screen according to the present embodiment.
FIG. 9 is an internal configuration diagram of an area simulator apparatus according to the present embodiment.
10 is a diagram illustrating an example of a data structure of a store information storage unit in FIG. 9;
11 is a diagram illustrating an example of a data structure of a building information storage unit in FIG. 9;
12 is an internal configuration diagram of an initial setting unit in FIG. 9;
13 is a diagram illustrating an example of a data structure of an initial setting storage unit illustrated in FIG. 9;
14 is an internal block diagram of the division control unit in FIG. 9;
15 is an internal block diagram of a second statistic calculator in FIG. 14;
16 is an internal configuration diagram of the statistics calculation logic storage unit of FIG. 9;
17 is a diagram illustrating an example of a data structure of an area division information storage unit in FIG. 9;
18 is an internal configuration diagram of the display processing unit in FIG. 9;
19 is an internal configuration diagram of an area display data generation unit in FIG. 18;
20 is an internal configuration diagram of the building display data generation unit of FIG. 18;
FIG. 21 is a flowchart showing an example of area division processing in the area simulator apparatus of FIG. 9;
FIG. 22 is a detailed flowchart of processing in step 104 shown in FIG. 21;
FIG. 23 is a detailed flowchart of processing in Step 108 shown in FIG. 21;
FIG. 24 is a detailed flowchart of processing in Step 504 of FIG.
FIG. 25 is a diagram for conceptually explaining area division processing;
FIG. 26 is a flowchart illustrating an example of a course number calculation process in the first statistic calculation unit of FIG. 14;
FIG. 27 is a flowchart illustrating an example of a course number calculation process in the second statistic calculation unit of FIG. 14;
FIG. 28 is a detailed flowchart of the process in step 522 of FIG. 27;
FIG. 29 is a diagram illustrating an example of a data structure of an area division information storage unit;
30 is a diagram showing another form of the division control unit in FIG. 14;
FIG. 31 is a diagram showing another form of the division processing unit in FIG. 9;
[Explanation of symbols]
100 area simulator equipment
107 Display section
108 Display processing unit
110 Parameter setting section
114 Initial setting section
115 Division processing unit
116 Candidate selection processing unit
122 Seed setting section
124 Seed setting method reception
126 Seed setting reception
128 Area number setting reception
130 Seed selector
132 Combination designation reception part
134 Weight setting reception part
135 End condition setting reception part
154 Condition input reception part
156 store selection department
300 Display screen
301 Scale indication component
302 area screen
303 Store icon
304 Enlarged area screen
306 Supplementary information display area
308 cursor
310 Type 2 building icon
312 Type 1 building icon
320 Structure display screen
322 Store display button
323 Structure view button
324 Internal structure diagram
325 Floor number display area
326 doorway
328 Elevator door
330 store display screen
332 Route display button
334 New registration button
336 store icon
340 Route display screen
346 route
347 relay point
400 Division control unit
402 Specific part
404 indicator
406 First statistic calculation unit
408 Second statistic calculation unit
410 Candidate attribution processing unit
412 Adjustment reception
420 Extraction unit
422 Statistics calculation unit by floor
424 Integration Department
426 path generation unit
430 Display instruction receiving part
431 Display data generator
432 Area display data generator
433 Building Display Data Generation Unit
440 Icon storage
441 Selector
442 Arrangement part
444 selection part
445 Shape data reading part
446 Data generation unit
447 Placement section
448 Path synthesis unit
449 Icon storage
600 Division controller
602 Statistics calculation unit by building
604 Regional statistics calculator
610 Division processing unit
612 detector
614 Statistics calculation unit by building
616 Statistics storage by building
618 Division control unit
T1 map information storage unit
T2 site information storage
T3 store information storage
T4 parameter storage unit
T5 initial setting memory
T6 area division information storage unit
T7 logic storage
T7a seed selection logic storage
T7b candidate selection logic storage unit
Logic storage unit for T7c statistics calculation
T8 Building information storage

Claims (11)

An area dividing system that divides a region including a plurality of traveling points into a plurality of areas and assigns the traveling points to each area,
A traveling point information storage unit that stores traveling point information data including position information of the traveling point including position information in the height direction of each traveling point, for each of the plurality of traveling points included in the region;
An initial setting unit that sets a plurality of areas each including one traveling point that is a seed serving as a starting point in the region,
Candidate selection processing units that select candidate cyclic points for each of the plurality of areas, based on the cyclic point information data in the cyclic point information storage unit, and candidates for addition to each of the plurality of areas .
For each of the areas , based on the traveling point information data , a statistical amount that is a work amount determined by position information of the traveling points and candidate traveling points already belonging to the area is calculated as the height of each traveling point. A statistic calculation unit that calculates the position information in each direction,
A candidate attribution processing unit that selects, from among the plurality of areas, the area with the smallest statistical quantity calculated by the statistical quantity calculation unit as a specific area, and causes the candidate circulation point in the specific area to belong to the specific area When,
An area division system that repeatedly executes selection of the candidate cyclic point by the candidate selection processing unit and attribution of the candidate cyclic point by the candidate attribution processing unit until a predetermined end condition is satisfied . A determination unit for determining whether or not the traveling point exists at a position different from the ground surface based on the traveling point information data ;
The statistic calculator includes a distance calculator that calculates a distance from the ground surface to another patrol point, and an arithmetic unit that calculates the statistic based on the distance; The area division system according to claim 1.   The area dividing system according to claim 2, wherein the distance calculation unit calculates a distance to reach another traveling point via a point obtained by orthogonally projecting the traveling point on the ground surface. A building information storage unit for storing an internal structure file of the building for the traveling point existing inside the building;
The statistic calculator is
For each traveling point existing inside the building, based on the internal structure file of the building, a statistical quantity calculation unit for each building that calculates the statistics according to the internal structure of the building;
An in-area statistic calculating unit that calculates a statistic based on a distance between the building and a traveling point existing outside the building , and
The candidate attribution processing unit integrates the statistic calculated by the building-specific statistic calculation unit and the statistic calculated by the in- area statistic calculation unit from a plurality of areas. 4. The method according to claim 1, wherein the area having the smallest statistical amount calculated by a quantity calculation unit is selected as a specific area, and the candidate tour point in the specific area is attributed to the specific area. 5. The described area division system. The building-specific statistic calculation unit is determined based on the internal structure, and a distance calculation unit that calculates a moving distance inside the building;
An arithmetic unit that calculates a statistic inside the building based on the moving distance;
The area dividing system according to claim 4 , comprising:   The building information storage unit stores, for each building, position information of a relay point through which the person in charge always passes before reaching the patrol point in the building,
  A route generation unit for generating a route including the traveling point and the relay point in the building;
  The area division system according to claim 5, wherein the statistic calculation unit calculates a movement distance of the route generated by the route generation unit. The area division system according to any one of claims 4 to 6, further comprising a display processing unit that causes a display unit to display a tour point existing inside the building so as to overlap the internal structure.   The area division system according to claim 1, wherein the work amount is calculated based on a moving distance between the traveling points.   The candidate selection processing unit, for each of the plurality of areas, from among the unaffiliated cyclic points that do not yet belong to any area, select the cyclic points that are close to the representative points of the areas. The area division system according to claim 1, wherein the area division system is selected as a point.   The area dividing system according to claim 9, wherein the candidate selection processing unit calculates the center of gravity of the traveling points acquired in each of the plurality of areas as the representative point.   The predetermined end condition is that the unaffiliated traveling point that does not belong to any area in the area is eliminated, the attribution of the candidate traveling point by the candidate attribution processing unit is performed a predetermined number of times, or The area division system according to any one of claims 1 to 10, wherein the difference between the statistics in each of the plurality of areas is within a predetermined range.

Images