JP4451622B2 - Business support system - Google Patents

Description

  The present invention relates to a technology for supporting a business by dividing a region including a plurality of traveling points into a plurality of areas, assigning the traveling points to each area, and formulating a route for traveling around the traveling points in the area.

  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.

  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 a product is delivered, there are a large number of stores in an area where a single depot is in charge, and a plurality of delivery staff distributes the products to those stores. Each person in charge visits a store in his / her area and delivers the goods.

As a method for logically creating a traveling route, a so-called traveling salesman problem and its approximation algorithm 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 car such as a helper for home care and a delivery company delivering goods to efficiently perform a patrol has been proposed. (See Patent Document 1).
Japanese Patent Laid-Open No. 11-134389

  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.

  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.

  In addition, due to the diversification of service forms, not only stores that are fixedly installed, but also stores that are installed according to the season, such as a sea house, stores that are installed in the short term in concert venues, cars, etc. There are also stores that frequently move using a means of transportation. In order to increase work efficiency, it is necessary to treat these various types of stores as traveling points and distribute them to any one of the traveling people.

  An object of the present invention is to provide a technique for dividing an area including a plurality of traveling points in various forms into a plurality of areas so that statistics such as work amount 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 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.

According to the present invention,
A business support system that divides a region including a plurality of traveling points including a moving point installed in a short period 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 for each traveling point;
A movement plan storage unit for storing a movement plan including an installation period installed in the area for each movement point;
Accepting designation of date and time, based on the date and time and the travel plan, targeting the patrol point installed in the area at the date and time,
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.
A statistic calculator that calculates, for each area, a statistic that is a work amount determined by position information of the cyclic point and the candidate cyclic point already belonging to the area, based on the cyclic point information data; ,
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,
Including
Provided is a business support system characterized in that selection of the candidate cyclic points by the candidate selection processing unit and attribution of the candidate cyclic points by the candidate attribution processing unit are sequentially executed until a predetermined end condition is satisfied. .

“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.
According to the business support 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. Each area can be divided fairly.
According to the business support system of the present invention, fixed points that are installed in the long term and movement points that are installed in the short term can belong to a predetermined area. This makes it possible to divide multiple fixed points and moving points into several areas and automate the work assigned to each person in charge, so a system that supports work by reducing the time and labor required for area division Can be provided. In addition, since such processing can be executed at high speed by a computer, it is possible to respond quickly to changes in the distribution form due to an increase in the number of moving points, and to enable efficient distribution work.

"Statistic" is, for example, the number of courses that indicates the amount of work per day for each area, the number of stores that are included in each area, the average working time per store, average monthly number of visits per store, from the site of 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.

  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.

  As mentioned above, according to this invention, the technique which divides | segments the area containing a fixed point and a movement point into a plurality of areas so that statistics, such as a work amount in each area, may become equal may be provided.

  In the present embodiment, a plurality of stores included in a business area are attributed to any area, and the business area is divided into a plurality of areas. These stores may be fixed stores, mobile stores, event venue stores, or seasonal stores. In the present embodiment, when the stores included in the business area are shared by a plurality of persons in charge to perform the patrol work, the overall work efficiency is increased and the area of each person in charge is equalized. I do. In addition, each person in charge visits a store in his / her area, starting from a base such as a sales office, every day to strengthen relationships with the store, collect information, propose sales, contract, verify, and replenish and deliver products. The maintenance work such as the above 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.

  FIG. 1 is a configuration diagram of an area simulator apparatus 100 according to the first embodiment. The store information storage unit T3 includes a movement point storage unit 710 and a fixed point storage unit 712. The movement point storage unit 710 holds information regarding seasonal stores provided according to the season, stores provided at event venues such as concerts, and mobile stores that frequently move. The fixed point storage unit 712 holds information related to stores that exist in a fixed manner. Hereinafter, store information is stored in the movement point storage unit 710 and stores that are installed for a short period of time are expressed as movement points. Store information that is stored in the fixed point storage unit 712 and is fixedly installed is referred to as fixed points. Express. In addition, the movement point and the fixed point are collectively referred to as a traveling point.

  The movement plan storage unit T8 holds a movement plan including an installation period and an installation location of the movement point. The instruction unit 700 instructs the division processing unit 115 to execute the area division processing based on the movement plan held in the movement plan storage unit T8. The instruction unit 700 controls the execution timing of the area division process according to the period during which the movement point is installed so that the movement point after installation is included as the target of the area division process.

  In order to make a movement point that is systematically installed in accordance with a movement plan an object of area division like a fixed point, it is necessary to perform area division processing according to the installation period of the movement point. In other words, the location of the moving point is determined at a certain point in time, similar to the fixed point. Therefore, the time when the moving point exists is specified based on the moving plan, and the area division processing is executed in accordance with the time. This makes it possible to divide the area including the moving points, and the work amount of the person in charge calculated mainly from the distance aspect in each area can be made substantially uniform. In addition, since there are a large number of movement plans for movement points, processing is frequently performed according to the movement plans. Although it is possible to shorten the time interval for executing the area division processing and to execute it periodically, it is appropriate to determine the execution time based on the installation period of the moving point.

  For example, when there is no moving point, that is, when there is only a fixed point, the instruction unit 700 instructs the execution of area division processing at a relatively long interval, such as once every quarter. When there is a moving point, the execution of area division processing is instructed at a relatively short interval according to the type of the moving point and the installation period.

  In response to an instruction from the instruction unit 700, the division processing unit 115 executes an area division process in which each traveling point held in the store information storage unit T3 belongs to any area. For example, the division processing unit 115 calculates a movement route between each point using a known route calculation method such as MST (Minimum Spanning Tree), and the work amount of the person in charge in each area is mainly from a distance viewpoint. Area division processing is performed so as to be substantially uniform. After completing the area division processing, the division processing unit 115 outputs a list of cyclic points belonging to each area to the route formulation unit 702. Based on the list supplied from the division processing unit 115, the route formulation unit 702 formulates a route for making a round of the tour points included in the list using a known method such as MST. The route formulation unit 702 provides the formulated route information to the person in charge of the patrol work in each area.

  FIG. 2 is a flowchart showing the procedure of area division processing. First, various data necessary for area division processing is registered (S10). Next, the timing for executing the area division process is determined based on the movement plan (S12). Then, a store to be subjected to area division processing is selected (S14). Subsequently, parameters necessary for area division are set (S16). Next, initial settings such as setting of the number of areas provided in the business area (S18) and setting of seeds as starting points in each area (S20) 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 (S22). The area division may be performed not only in a plane but also in a three-dimensional manner for a store in a high-rise building, for example. Thereafter, the result of area division is displayed, and evaluation and adjustment are performed (S24).

  FIG. 3 is a diagram schematically showing the procedure shown in FIG. Prior to the area division processing, various data such as map information data, base information data, store information data, and movement plan data are registered. Subsequently, the timing for executing the area division process is determined based on the registered movement plan data. At that timing, the base and the store are mapped as points on the map information and corresponding positions on the map information based on the various registered data. 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. And the route which goes around a store for every area is formulated.

  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.

  FIG. 4 is a diagram showing an example of the display screen 300 by the area simulator apparatus 100 of FIG. 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. Further, the store icon 303 may have different shapes so that the fixed point and the movement point can be intuitively recognized. By performing such display, the user can visually check the distribution status of the stores and intuitively understand whether the stores are movement points or fixed points. 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

  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 fixed point icon 312 indicates, for example, a fixed point that is a store that requires permission for sale of a specific product or a store that is assumed to exist for a long time. One store as a fixed point may exist in the building, or a plurality of stores may exist. The movement point icon 310 is, for example, a store installed every season such as “Umi no Ie”, a store temporarily installed in a concert venue, a mobile store installed in a moving means such as a car, etc. Indicates the movement point. The supplementary information display area 306 is for displaying supplementary information such as the name of the building, the number of stores inside the building, the type of store, the installation period, and the like regarding the traveling point corresponding to the icon designated by the cursor 308. It is an area. In this way, by changing the shape of the icon according to the type of patrol point, the user can intuitively grasp the labor required for delivery, 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. Furthermore, the shape and color of the icon may be changed according to the number of days remaining until the moving point is installed and the number of days remaining until the moving point is removed.

  FIG. 6 is a detailed configuration diagram of the area simulator apparatus 100 of FIG. 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 variations in the implementation method, apparatus, and system, which are realized by any combination of the wears. Each of the drawings described below shows a functional unit configuration, 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, an instruction unit 700, and a route formulation. Unit 702, map information storage unit T1, base information storage unit T2, store information storage unit T3, parameter storage unit T4, initial setting storage unit T5, area division information storage unit T6, and logic storage unit T7 And a movement plan storage unit T8. The division processing unit 115 includes a candidate selection processing unit 116 and a division control unit 400.

  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 includes the movement point storage unit 710 and the fixed point storage unit 712 in FIG. 2, and stores store information at the movement point and store information at the fixed point. The movement plan storage unit T8 stores a movement plan for each movement point.

  FIG. 7 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. In this figure, when a character string is held like “0125”, it indicates that a fixed building exists. “-” Indicates that there is no fixed building as a moving point. The attribute column 457 holds information for specifying the attribute of the tour point. In this figure, “fixed” indicates a fixed point, and “event” indicates a store installed at the event venue. “Season” indicates a seasonal store, and “move” indicates a mobile store.

  The position information column 458 holds position information of a store that is a traveling point. 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 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 require sales qualifications, such as alcohol and medicine, can be included, for example.

FIG. 8 is a diagram illustrating an example of a data structure of the movement plan storage unit T8 of FIG. The store code column 750 holds a store code that specifies a movement point. With this store code, a relationship is established between the store information storage unit T3 and the movement plan storage unit T8 in FIG. The installation time column 752 holds the installation time of the movement point. The installation location column 754 holds information specifying the installation location of the mobile store in the same format as the location information column 458 described with reference to FIG. The store attribute column 756 holds information specifying the attribute of the mobile store. In this figure, for example, the movement point specified by the store code “aa” is a seasonal store, and is specified by “X _aa , Y _aa ” between “July 1, 2003 and August 31, 2003”. It is installed at the position to be. By having such a data structure, the details will be described later, but the instruction unit 700 in FIG. 2 can designate the timing for executing the division processing. Furthermore, as described with reference to FIG. 5, the icon shape can be changed according to the type of the tour point.

  Returning to FIG. 6, the condition input receiving unit 154 receives an input of a condition for selecting a store to be subjected to the area division process from the user. The store selection unit 156 selects a store to be subjected to area division processing based on the conditions received by the condition input reception unit 154 with reference to the store information storage unit T3. The candidate selection processing unit 116 described later selects a store to be attributed to any area from the stores selected by the store selection unit 156. The display processing unit 108 performs processing for displaying various data such as the display screen described with reference to FIGS. 4 and 5 on the display unit 107, for example.

  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.

  FIG. 9 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.

  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 setting methods. For example, the seed selection unit 130 sets the seed so that the distances between the plurality of traveling points and the seeds in each area are as long as possible.

  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.

  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.

  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.

  Returning to FIG. 6, the initial setting storage unit T <b> 5 stores the setting value set by the initial setting unit 114. FIG. 10 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.

  Returning to FIG. 6, the management unit 704 receives registration, change, deletion, and the like of the movement plan at the movement point from the user, and manages the movement plan. When receiving the registration of a new movement plan, the management unit 704 stores the movement plan in the movement plan storage unit T8. In addition, when an instruction for change or deletion is received from the user, the management unit 704 performs a change or deletion process on the movement plan stored in the movement plan storage unit T8.

  The instruction unit 700 instructs the division processing unit 115 to execute the division processing based on the movement plan storage unit T8. The instruction unit 700 determines the timing for executing the division process based on the contents of the movement plan held in the movement plan storage unit T8. The instruction unit 700 first determines whether or not the movement plan is held in the movement plan storage unit T8. When the movement plan is not held in the movement plan storage unit T8, that is, when there is no movement point, the instruction unit 700 instructs the division processing unit 115 to execute the area division processing at intervals of about once a quarter. Instruct.

  When the movement plan is held in the movement plan storage unit T8, that is, when there is a movement point, the instruction unit 700 determines the timing for executing the area division process according to the movement plan. For example, when a seasonal store movement plan is held, the instruction unit 700 instructs the division processing unit 115 to execute the division processing for each season. In addition, when the event venue store or the movement plan of the mobile store is held, the instruction unit 700 determines the timing for executing the area division processing, for example, for each month, each day, and each date. That is, in the case of only fixed points, the fixed points that are subject to area division exist at the same position semi-permanently, so the assigned areas are the same regardless of when the area division processing is performed. However, in the case of a movement point whose installation location changes based on the movement plan, the area to which the area belongs depends on the timing at which the area division processing is performed. Therefore, the instruction unit 700 determines the timing for performing the area division processing according to the movement plan, and instructs the division processing unit 115.

  For example, when the area simulator apparatus 100 is always operating and performing area division processing in real time in response to an instruction from the instruction unit 700, the instruction unit 700 performs the division process when it is time to perform the area division processing. The unit 115 may be instructed to execute the division process. In addition, when the area simulator device 100 performs area division in a predetermined period at a time in advance, the instruction unit 700 supplies information related to date and time to the division processing unit 115, and the division processing unit 115 performs area division processing on the date and time. May be executed.

  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, with the traveling points existing at the timing or date and time instructed by the instruction unit 700 as targets. . Candidate selection processing unit 116 targets each traveling point that actually exists at the time pointed to by instruction unit 700 from the traveling points selected by store selection unit 156, from the seed of that area. A tour point at a close position, that is, a store is selected as a candidate to be classified into the 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.

  FIG. 11 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. The specifying unit 402 refers to the store information storage unit T3 and reads store information such as store attributes, location information, and work hours associated with the store code. The instruction unit 404 instructs the statistic calculation unit 720 to perform a statistic calculation process according to the store information.

  The candidate attribution processing unit 410 uses the statistic calculated by the statistic calculating unit 720 to sequentially assign candidate stores to each area so that the statistic for each area is substantially equal in all areas. Go. The adjustment receiving unit 412 receives adjustments such as store replacement belonging to each area from the user after the area is divided by the candidate selection processing unit 116, the statistic calculation unit 720, and the candidate attribution processing unit 410. When the adjustment reception unit 412 receives an adjustment from the user, the statistic calculation unit 720 calculates 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.

  FIG. 12 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 calculation of the statistic in the statistic calculation unit 720 of the division control unit 400.

  Returning to FIG. 6, when the automatic area division processing by the division processing unit 115 is completed, the division processing unit 115 stores the result in the area division information storage unit T <b> 6, and stores of stores that are circulation points included in each area The code is output to the route formulation unit 702. FIG. 13 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 stores, for example, the base-store average travel time M1, the inter-store average travel time M2, the number of stores required for processing N2, the statistic (total number of courses), and the like. These calculation methods will be described later.

  Returning to FIG. 6, the route formulation unit 702 formulates a route for visiting the stores based on the store code for each area supplied from the division processing unit 115. For example, the route formulation unit 702 maps each store to a map held in the map information storage unit T1, and formulates a route using a known method such as MST, for example. Then, the route formulation unit 702 outputs the cyclic route for each area to the display processing unit 108. As a result, the tour route for each area is displayed on the display unit 107.

  FIG. 14 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 scale instruction component 301 in FIG. 4 is operated, the display instruction reception unit 430 instructs the display data generation unit 431 to display the enlarged area screen 304 in FIG. 5 on the display unit 107 in FIG. The display data generation unit 431 includes an area display data generation unit 432 and a tour route display data generation unit 434. 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 tour route display data generation unit 434 generates a screen data for displaying a store for each area and displaying a route for visiting the store, for example, superimposed on a two-dimensional map.

  FIG. 15 is an internal block diagram of the area display data generation unit 432 of FIG. The icon storage unit 440 holds an icon in association with information specifying the attribute of the tour point. For example, in the present embodiment, the icon storage unit 440 holds the fixed point icon 312 in FIG. 5 in association with “fixed point” and associates with the “movement point” in the movement point icon 310 in FIG. Hold. 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. In addition, the placement unit 442 requests the selection unit 441 for an icon corresponding to the attribute associated with the store. The selection unit 441 selects an icon corresponding to the store attribute from the icon storage unit 440 and supplies the selected icon 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.

  FIG. 16 is a flowchart showing a procedure of area division processing by the area simulator apparatus 100 according to the present embodiment. First, the seed is set manually or automatically by the initial setting unit 114 of FIG. 6 (S102). The candidate selection processing unit 116 in FIG. 6 selects store candidates that belong to the same area for each seed (S104).

  Here, with reference to FIG. 17, the procedure in which the candidate selection processing unit 116 selects store candidates 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.

  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.

  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 S148), the candidate selection process for this area is terminated.

  Returning to FIG. 16, it is determined whether or not a candidate has been selected in step 104 (S106). The identifying unit 402 in FIG. 11 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).

  Returning to FIG. 16, the candidate attribution processing unit 410 in FIG. 11 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.

  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 acquired stores and candidates in the area, so the process returns to step 110 and it is determined again whether or not the statistic is minimized (S110). ).

  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.

  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.

  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.

  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.

  FIG. 18 is a diagram illustrating an example of the area division processing illustrated in FIGS. 16 and 17. Here, the area division is performed so that the total number of courses in each area is equal. As shown in FIG. 18A, 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. 6 will be described.

  As shown in FIG. 18B, the seed setting unit 122 in FIG. 9 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. 6 performs processing so that points belonging to different areas are displayed with different marks and different colors.

  As illustrated in FIG. 18C, the candidate selection processing unit 116 illustrated in FIG. 6 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. Select as. The first statistic calculator 406 or the second statistic calculator 408 in FIG. 11 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. 11 acquires candidates from an 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.

  Hereinafter, the process of selecting the next candidate point in the area 3 will be described with reference to FIG. As described in step 132 in FIG. 17, 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.

  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.

  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.

  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.

  FIG. 19 is a flowchart showing the logic used by the statistic calculator 720 of FIG. 11 to calculate the total number of courses in each area. Since the same processing is performed for each area, only one area will be described here. The statistic calculation unit 720 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. Calculate the total number of courses, that is, the statistic by the procedure

  First, the statistic calculator 720 calculates the average travel time M1 from the base to the stores that already belong to the area and candidate stores (S160). First, after obtaining the total distance from the base to each store, the total travel time is obtained by dividing the total distance by the base-store travel speed set by the parameter setting unit 110 in FIG. Next, M1 is calculated by dividing the total travel time by the total number of stores in the area.

  Subsequently, the statistic calculation unit 720 calculates an average travel time M2 between stores (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. Next, by dividing this total travel time by n, average travel times m1 to mn from each store to other stores are obtained. Subsequently, M2 is calculated by adding these average travel times m1 to mn and dividing by the total number of stores in the area. Here, when n is small, the total number of stores in the area can be set to n.

  Subsequently, the statistic calculation unit 720 calculates the number of stores N1 that can be worked on in one day (S164). Total work time per day

Tz = 2 × M1 + M2 × (N1-1) + T × N1

(T is the average work time per store)

So, transform this equation

N1 = (Tz−2 × M1 + M2) / (M2 + T)

Is calculated.

  Further, the statistic calculation unit 720 calculates the number N2 of stores that need to be processed per day (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 of each person in charge is 4 weeks × 5 days = 20, N2 = W / 20 is obtained.

  Thereafter, the statistic calculation unit 720 calculates the number of courses = N2 / N1 in each area by dividing the number of stores N2 that need to be processed per day by the number of stores N1 that can be worked on in one day (S168). ).

  According to the above processing, when calculating the number N1 of stores that can be worked on in one day, the travel time from the base to the stores in each area is also taken into consideration, so the distances from the bases to each area are almost equal. Can be divided so that 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.

  FIG. 20 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, as shown in FIG. 13, the area division information storage unit T6 further stores, for each area, the base-store average travel time M1 column, the inter-store average travel time M2 column, the number of stores required for processing N2 column, and the statistics ( Includes total number of courses).

  FIG. 20A 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 associated with the area column “2”. Although the point w belongs to the area 4 but is a candidate in the area 3, “w” is displayed in the “affiliated store code” field associated with the area field “4”, and the area field “3”. “W” is also stored in the “candidate store code” field associated with “”. Here, for example, when the point w is selected as a candidate in the area 3, it is necessary to recalculate the statistics in the area 3. In that case, a mark is stored in the recalculation column associated with area 3. Thereby, the statistic calculation part 720 can grasp | ascertain the area which needs recalculation of a statistic. The statistic calculation unit 720 recalculates the statistic only for the marked area. The results calculated by the statistic calculation unit 720 are the base-store average travel time M1 column, the inter-store average travel time M2 column, the number of stores required for processing N2 column, and the statistic (total number of courses) column of the corresponding area. Is remembered.

  If the point w is originally acquired in the area 3 and has been taken by the area 4 in the immediately preceding process, the point w is associated with the area column “4” as shown in FIG. A mark is written in the immediately preceding take-off column of the given point w. As a result, the area 3 and other areas cannot select the point w as the next candidate.

  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. Thereby, the work efficiency in a sales area can be improved.

  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.

  FIG. 21 is a diagram showing a form in which a moving node joins on a moving path of the node and replenishes goods and the like. The moving node is, for example, a store that can provide an arbitrary service at an arbitrary place using a moving means such as a mobile store, a mobile library, a mobile beauty salon, or a mobile restaurant (hereinafter simply referred to as a “moving spot”). ). By replenishing materials on the movement path of such a moving spot, it becomes possible to efficiently replenish materials and provide services immediately after arrival at the destination.

  A moving spot car 316 indicates a car for providing such a moving spot. The moving spot vehicle 316 itself may be a dedicated vehicle formed as a moving spot, or may be a transport vehicle loaded with equipment for setting up the moving spot. The moving spot car 316 in the figure moves to the destination Pc along the first route Rc. In this figure, the destination Pc is indicated by a movement point icon 310. The first route Rc is not a route planned in advance, but is a route through which the moving spot vehicle 316 passes as a result.

  The first fixed point icon 312a, the second fixed point icon 312b, and the third fixed point icon 312c are patrol points in a predetermined area, and the patrol vehicle 314 for replenishing supplies is a second route from the base Pa. It circulates through each traveling point along Ra. For example, the second route Ra is formulated by the area simulator device 100 described with reference to FIG. The person in charge of driving the patrol car 314 receives information on the second route Ra from the area simulator device 100 when leaving the base Pa, and patrols each patrol point based on the information to replenish necessary supplies.

  The area simulator apparatus 101 according to a second embodiment to be described later acquires current positions of the traveling car 314 and the moving spot car 316, estimates the moving path of the moving spot car 316, and replenishes the supplies. Is determined. When the area simulator device 101 determines the junction point Pb, the area simulator device 101 formulates a third route Rb up to that point and notifies the traveling vehicle 314 of it. When the person in charge is notified of the third route Rb, the person in charge changes the travel route and heads to the junction Pb. Generally, when transporting using a road, it is difficult to make a reliable schedule because the moving speed changes depending on traffic conditions such as traffic jams. Therefore, by grasping the position information of the traveling car 314 and the moving spot car 316 in real time, an appropriate junction Pb can be dynamically determined, and the replenishment of materials efficiently on the moving route of the moving spot car 316 Is possible.

  FIG. 22 is a configuration diagram of the area simulator apparatus 101 according to the second embodiment. Configurations denoted by the same reference numerals as those already described in the figure are substantially the same in function and operation as those already described. The following description will focus on points that differ from the functions in the configuration already described. When the route formulation unit 702 formulates a route, the route formulation unit 702 outputs the route to the display processing unit 108 and the update unit 730. The update unit 730 acquires the current position information of the traveling vehicle 314 and the moving spot vehicle 316 in FIG. 21, determines the joining point Pb in FIG. 21, and travels a new traveling route from the current position to the joining point Pb. 314 and the moving spot car 316 are notified.

  FIG. 23 is an internal block diagram of the updating unit 730 in FIG. The first management unit 733 manages the current movement state of the moving spot car 316 that is a movement point. The first management unit 733 includes a first position information acquisition unit 732 and a route prediction unit 734. The first position information acquisition unit 732 acquires the current position information of the moving spot car 316 from the moving spot car 316 in FIG. For example, the moving spot vehicle 316 is equipped with a GPS (Global Positioning System), acquires position information at predetermined time intervals, and transmits the position information to the area simulator apparatus 101 as needed using radio. For example, the moving spot car 316 transmits position information to the area simulator apparatus 101 at intervals of several seconds. The moving spot vehicle 316 preferably transmits position information at time intervals that approach real time.

  The first position information acquisition unit 732 acquires the position information transmitted as described above. The first position information acquisition unit 732 outputs the position information of the moving spot vehicle 316 to the route prediction unit 734. The route prediction unit 734 processes the received position information in time series and compares it with map information to identify a road that is running and calculate an average moving speed. Then, the route prediction unit 734 outputs route information including the traveling road and the moving speed to the joining point determination unit 736.

  The second management unit 735 manages the current movement state of the patrol vehicle 314. The second management unit 735 includes a second position information acquisition unit 740 and a planned route provision unit 742. The second position information acquisition unit 740 acquires position information from the patrol car 314 of FIG. 21 at a predetermined time interval by the same method as the first position information acquisition unit 732. Then, the second position information acquisition unit 740 outputs the position information of the traveling vehicle 314 and the average moving speed to the joining point determination unit 736.

  The planned route providing unit 742 acquires the information on the initial travel route of the traveling vehicle 314 from the route formulating unit 702, that is, the information on the second route Ra described with reference to FIG. 21, and outputs the information to the junction determining unit 736.

  The junction point determination unit 736 determines an appropriate junction point based on the current position information of the patrol car 314 and the moving spot car 316, the moving speed, the moving path of the patrol car 314, and the planned moving path of the moving spot car 316. To do. For example, the merging point determination unit 736 determines a space where the traveling car 314 and the moving spot car 316 can be parked, such as a parking lot or a park existing in the traveling direction of the traveling car 314 and the moving spot car 316, based on the map information. You can search for them and use it as a meeting point. There are various methods for determining the junction point. In short, the junction point determination unit 736 does not increase the moving distance of the traveling car 314 and the moving spot car 316 and can secure a parking space for two cars. Search points based on map information. Then, the junction point determination unit 736 outputs information such as latitude, longitude, and name that specifies the determined junction point to the notification unit 738 and the route change unit 744.

  The route changing unit 744 changes the moving route of the patrol vehicle 314 and formulates a new moving route so as to go from the current position to the next patrol point via the junction. That is, the route changing unit 744 formulates the third route Rb described with reference to FIG. 21 when the junction point is determined. Then, the route changing unit 744 outputs the third route Rb to the notification unit 738.

  The notification unit 738 transmits various information necessary for merging, such as a merging point, a moving route to the merging point, and a scheduled merging time, to the traveling car 314 and the moving spot car 316. Thereby, the passenger | crew of the traveling vehicle 314 and the movement spot vehicle 316 can grasp | ascertain the movement path | route to a merge point, merge time, and a merge point, moving.

  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. .

It is a block diagram of the area simulator apparatus which concerns on 1st Embodiment. It is an example of the flowchart which shows the procedure of the area division | segmentation process which concerns on this Embodiment. It is the figure which showed the procedure shown in FIG. 2 typically. It is a figure which shows an example of the display screen which concerns on this Embodiment. It is a figure which shows an example of the expansion area screen which concerns on this Embodiment. It is an internal block diagram of the area simulator apparatus which concerns on this Embodiment. It is a figure which shows an example of the data structure of the shop information storage part of FIG. It is a figure which shows an example of the data structure of the movement plan memory | storage part of FIG. It is an internal block diagram of the initial setting part of FIG. It is a figure which shows an example of the data structure of the initial setting memory | storage part of FIG. It is an internal block diagram of the division | segmentation control part of FIG. It is an internal block diagram of the logic memory | storage part for statistic calculation of FIG. It is a figure which shows an example of the data structure of the area division | segmentation information storage part of FIG. It is an internal block diagram of the display process part of FIG. It is an internal block diagram of the area display data generation part of FIG. It is a flowchart which shows an example of the area division process in the area simulator apparatus of FIG. It is a detailed flowchart of the process in step 104 shown in FIG. It is a figure for demonstrating an area division process notionally. It is a flowchart which shows an example of the calculation process of the number of courses in the 1st statistics calculation part of FIG. It is a figure which shows an example of the data structure of an area division | segmentation information storage part. It is a figure which shows the form which joins on the movement path | route of the node and replenishes goods etc. with respect to the node which is moving. It is a block diagram of the area simulator apparatus which concerns on 2nd Embodiment. It is an internal block diagram of the update part of FIG.

Explanation of symbols

100 Area simulator device 101 in the first embodiment Area simulator device 107 in the second embodiment Display unit 108 Display processing unit 110 Parameter setting unit 114 Initial setting unit 115 Division processing unit 116 Candidate selection processing unit 120 Division state determination Unit 400 division control unit 402 identification unit 404 instruction unit 406 first statistic calculation unit 408 second statistic calculation unit 410 candidate attribution processing unit 412 adjustment reception unit 420 extraction unit 422 floor-specific statistic calculation unit 424 integration unit 426 route determination Unit 430 display instruction reception unit 432 area display data generation unit 433 building display data generation unit 440 icon storage unit 441 selection unit 442 arrangement unit 445 shape data reading unit 447 arrangement unit 448 route synthesis unit T1 map information storage unit T2 base information storage Part T4 Parameter storage part T5 first Setting storage unit T6 Area division information storage unit T7 Logic storage unit T7a Seed selection logic storage unit T7b Candidate selection logic storage unit T7c Statistics calculation logic storage unit T7d Area number calculation logic storage unit T8 Movement plan storage unit 700 Instruction Unit 702 route planning unit 704 management unit 710 movement point storage unit 712 fixed point storage unit 720 statistic calculation unit 730 update unit 732 first position information acquisition unit 734 route prediction unit 736 meeting point determination unit 738 notification unit 740 second position information Acquisition unit 742 Planned route providing unit 744 Route changing unit

Claims (10)

A business support system that divides a region including a plurality of traveling points including a moving point installed in a short period 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 for each traveling point;
A movement plan storage unit for storing a movement plan including an installation period installed in the area for each movement point;
Accepting designation of date and time, based on the date and time and the travel plan, targeting the patrol point installed in the area at the date and time,
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.
A statistic calculator that calculates, for each area , a statistic that is a work amount determined by position information of the cyclic point and the candidate cyclic point already belonging to the area, based on the cyclic point information data ; ,
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,
Including
A business support system , wherein the selection of the candidate cyclic points by the candidate selection processing unit and the attribution of the candidate cyclic points by the candidate attribution processing unit are sequentially executed until a predetermined end condition is satisfied . The business support system according to claim 1,
The patrol point also includes a fixed point that is installed in the long term,
The traveling point information storage unit also stores position information for each fixed point,
The initial setting unit, the candidate selection processing unit, the statistic calculation unit, and the candidate attribution processing unit are installed in the area at the designated date and time when the fixed point stored in the traveling point information storage unit is stored. A business support system that performs area division processing for assigning the traveling point to any area . In the business support system according to claim 1 or 2,
Based on the movement plan, further includes an instruction unit for designating a timing for performing an area division process for assigning the traveling point to any area ,
The initial setting unit, the candidate selection processing unit, the statistic calculation unit, and the candidate attribution processing unit, based on the date and time at the timing instructed by the instruction unit and the movement plan, A business support system for performing an area division process for assigning the traveling point to any area, targeting the traveling point installed in the interior. In the business support system according to claim 3,
The movement plan storage unit stores, for each movement point, an attribute corresponding to the length of the installation period of each movement point,
The said instruction | indication part is the work assistance system which determines the said timing according to the said attribute. In the business support system according to any one of claims 1 to 4,
A map information storage unit for holding map information in the area;
A route formulation unit that formulates a travel route for patrolling the patrol point belonging to an area based on the map information;
A business support system that further includes: The business support system according to claim 5,
A first position information acquisition unit for acquiring first position information of the moving point during movement as needed;
A second position information acquisition unit that acquires second position information of a patrolman who is traveling along the movement route as needed;
A prediction unit that predicts a movement route of the movement point based on the first position information and the map information;
A moving path of the moving point the prediction unit predicts a moving path of the crawler, the a first position information, on the basis of the second position information, the junction between the crawler and the moving point A determination unit for determining
A business support system that further includes: The business support system according to claim 6,
A route changing unit for changing the travel route of the patrol person so as to go around the junction;
A notification unit for notifying the patrol person of the changed travel route;
A business support system that further includes:   In the business support system according to any one of claims 1 to 7,
  The candidate selection processing unit calculates, for each of the plurality of areas, a representative point of the area based on the cyclic point that has already belonged to each area based on the cyclic point information data. A business support system that selects each of the candidate tour points for each of the plurality of areas based on the distance.   The business support system according to claim 8,
  The business support system, wherein the representative point is a center of gravity of the traveling point already belonging to each area.   The business support system according to claim 8 or 9,
  The candidate selection processing unit is a business support system that selects each of the plurality of areas as the candidate tour point in order from the tour point having a short distance from the representative point.

Images