JP2010079650A - Apparatus, method and program for generating patrol schedule - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an apparatus, a method and a program for generating a patrol schedule capable of performing an area division process by which days of patrol when all points to be patrolled are patrolled are dispersed, while keeping a predetermined day of patrol for each point to be patrolled and days of patrol after a change to a patrol schedule from varying. <P>SOLUTION: In the apparatus 1 for generating a patrol schedule, an area dividing unit 400 divides points to be patrolled into areas, which are a set of adjacent points to be patrolled such that in-area patrol operation hours are averaged. For each of the areas, a patrol schedule calculating unit 500 sets a candidate date of patrol when the amount that days of patrol are changed is at its minimum as a new common date of patrol within each area. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to a traveling schedule generation device, a traveling schedule generation method, and a traveling schedule generation program that suppress a change in a predetermined traveling date when performing a traveling operation and improve the efficiency of the traveling operation.

  2. Description of the Related Art In recent years, there is a technique for determining a patrol route, a patrol schedule, and the like in a patrol area at the time of patrol work by a vehicle in a predetermined range accompanying delivery of an article, a delivery worker, or the like. For example, the technique disclosed in Patent Document 1 reads out map data of a target area, divides the target area into predetermined blocks, and the number of points to be visited in each divided block and the requirement for circulation in the block This is a technique for determining the order of patrol between blocks based on time.

Patent Document 2 describes a technology that supports a traveling schedule determination in which a traveling area is displayed on a map with a traveling area displayed on a map, and the user determines the traveling area by referring to the display. Has been. Further, in Patent Document 3, as a technique for area-dividing an area including a plurality of traveling points, area division is performed so that the traveling distance for each period is the same even when the traveling points change from season to season. Technology is shown.
According to such a technology for determining a patrol route and a patrol schedule, it is possible to improve the work efficiency related to patrol by dividing the area to be patroled into areas so that the travel distance and work time are equal. is there.
Japanese Patent Laid-Open No. 11-134389 JP 2002-145417 A JP 2005-53683 A

  By the way, for example, a meter reading day for meter reading for billing water bills, electricity bills, gas bills, etc., a regular meter reading date that is usually predetermined for each household, such as the third day of every month, is set. Such meter reading date is often linked with a charge request date such as a charge payment deadline or a charge withdrawal date from a bank or the like. Therefore, if the currently set periodic meter reading date is changed, the charge billing date may be changed, which may reduce convenience for consumers.

Therefore, when applying a patrol route or a patrol schedule that improves the efficiency of meter reading work, it is possible to create a patrol route or patrol schedule that achieves efficiency without significant changes from the current periodic meter reading date. It is desired.
However, since the above-described techniques of Patent Documents 1 to 3 do not consider the above-described regular default meter reading date, there is a problem that it is not possible to create a traveling schedule that suppresses the change of the default meter reading date. .

  The present invention has been made in consideration of such circumstances, and has been made to solve the above-described problem, and its purpose is to suppress a change between a predetermined tour date for each tour point and a tour date after a tour schedule change. Another object of the present invention is to provide a traveling schedule generation device, a traveling schedule generation method, and a traveling schedule generation program capable of performing area division processing for distributing the traveling days for traveling all the traveling points.

  In order to solve the above problem, the present invention provides a predetermined tour date (for example, a default meter reading date in the embodiment) predetermined for each tour location (for example, a household in the embodiment) and identification information ( For example, a traveling location information storage unit (for example, an embodiment) that stores, for each traveling location, the traveling location information that associates the customer ID in the embodiment with the location information of the circulating location (for example, the address in the embodiment). Customer information storage unit 10), a work time information storage unit for storing a traveling work time (for example, a time required for meter reading in the embodiment) for each traveling site, and the position information of the traveling site. The map information storage unit for storing the map information in which the adjacency relationship between the circulation places is associated, and the set of the adjacent circulation places as one area, the map Based on the information and the work time information, an in-area traveling work time (for example, the required time in the area in the embodiment) that is the sum of the traveling work times of the traveling places included in the area is calculated and expanded Select any one of the adjacent patrol locations that are adjacent to the area and are not included in any area, repeat the area expansion process to be included in the area to be expanded, and set the patrol location that is the target of the tour schedule creation within the area tour An area dividing unit that divides the work time into a predetermined number of areas (for example, the number of areas Na to be divided in the embodiment) and a new tour date common to the divided areas are included in the area. A travel date change amount between the predetermined tour date and the tour candidate date (for example, the meter reading candidate date in the embodiment) at the tour location, Among cyclic candidate date of a cyclic schedule generating device, characterized in that it comprises a cyclic schedule calculation unit for setting a patrol candidate date that the cyclic date change amount becomes minimum as the new cyclic date above.

  Further, the tour schedule generation device of the present invention is based on the map information stored in the map information storage unit and the tour location information stored in the tour location information storage unit. Adjacent types at two tour locations are determined, and weight value information (for example, a city block in the embodiment) in which a weight value determined in advance for each adjoining category is associated with each combination of the first tour location and the second tour location. A graph creation unit for creating a graph adjacency table (301), and the area dividing unit is configured to apply the area expansion process to the area in the adjacent cyclic locations based on the weight value information created by the graph creation unit. An adjacent tour location having the smallest weight value between the included tour location and the adjacent tour location is newly included in the area.

  Further, the weight value for each adjacent type of the present invention is a value corresponding to a difference in schedule between a first predetermined tour date of the first tour location and a second default tour date of the second tour location. Features.

  Further, the weight value for each adjacent type according to the present invention is a value determined in advance for each land type between the first tour location and the second tour location.

  The present invention relates to tour location information that stores, for each tour location, tour location information in which a predetermined tour date determined in advance for each tour location, identification information of the visit location, and position information of the visit location are associated with each other. A map in which a storage step, a work time information storage step for storing a traveling work time for each traveling place for each traveling place, the position information of the traveling place, and an adjacent relationship between the traveling places are associated with each other A map information storage step for storing information, and a set of adjacent tour locations as one area, based on the map information and the work time information, the total of the tour work times of the tour locations included in the area Is calculated by selecting one of the adjacent patrol locations that are adjacent to the expansion target area and are not included in any area, An area division step for repeating the area expansion process to be included in the rear, and dividing the tour location for which the travel schedule is to be created into a predetermined number of areas obtained by averaging the travel time within the area, and a new common to the divided areas As a tour day, the travel date change amount between the default tour date and the tour candidate date in the tour location included in the area is calculated, and the tour day change amount is the smallest among all tour candidate dates. And a tour schedule calculation step for setting a tour candidate date to be set as the new tour date.

  The present invention relates to the traveling location information in which the computer used in the traveling schedule generation apparatus associates the predetermined traveling date determined in advance for each traveling location, the identification information of the circulating location, and the location information of the circulating location, A traveling location information storage unit that stores each traveling location, a working time information storage portion that stores a traveling work time for each traveling location for each traveling location, the positional information of the traveling location, and an adjacent relationship between the traveling locations And a map information storage unit that stores map information associated with each other, a set of adjacent tour locations as one area, and based on the map information and the work time information, the tour locations included in the area An in-area traveling work time that is the total of the traveling work times is calculated, adjacent to the expansion target area, and any of the adjacent traveling points that are not included in any area An area dividing unit that divides the cyclic part to be created in the cyclic schedule into a predetermined number of areas obtained by averaging the in-area cyclic work time. As a new tour date common in the area, the travel date change amount between the default tour date and the tour candidate date in the tour location included in the area is calculated, and among all tour candidate dates, A tour schedule generation program that functions as a tour schedule calculation unit that sets a tour candidate date that minimizes a tour day change amount as the new tour date.

According to the present invention, the area dividing unit divides a traveling place into an area that is a set of adjacent traveling places and averages the traveling time in the area, and the traveling schedule calculation unit performs the amount of change of the traveling day for each area. It is decided to set the candidate tour date that minimizes the number as a new tour date common to the area.
Accordingly, there is an effect that it is possible to create a new tour schedule that averages the in-area tour work time of each area and minimizes the visit date change amount from the default tour date.

  Further, according to the present invention, the area dividing unit performs the area expansion process by including a cyclic part having a small weight value for each adjacent type when performing area division. As a result, there is an effect that it is possible to preferentially include a tour location having a small weight value as compared with a tour location having a large weight value.

  In addition, according to the present invention, by setting the weight value according to the difference in the schedule of the tour dates between the adjacent tour locations, it is possible to preferentially include the tour locations where the difference in the schedule of the tour dates is small in the area. There is an effect that it becomes possible.

  In addition, according to the present invention, by using the weight value according to the land type between the adjacent tour locations, it is possible to set the weight value according to the difficulty of movement between the tour locations. is there.

Hereinafter, a traveling schedule generation device 1 according to an embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a schematic block diagram showing a traveling schedule generation device 1 according to this embodiment.
The traveling schedule generation device 1 includes a customer information storage unit 10, a work time storage unit 11, a map information storage unit 12, a required time modeling unit 200, a graph creation unit 300, an area division unit 400, a traveling schedule calculation unit 500, and a block graph. A node information storage unit 20, a block graph adjacency information storage unit 30, a meter reading area information storage unit 40, and a traveling schedule information storage unit 50 are provided.

  The traveling schedule generation device 1 is an efficient traveling in a work that patrols a predetermined area, such as a water meter metering work performed to charge a water bill, an electricity usage metering work, collection of money, and regular delivery. Create a schedule. Hereinafter, in this embodiment, as an example of the patrol work, a meter reading work when a meter reader reads a meter installed for each household in a predetermined area will be described. The meter reading operation is an operation performed on a predetermined meter reading day having a predetermined cycle such as once per month. In addition, different meter reading dates are set in advance for each household, and meter reading workers are usually subject to a certain number of days before and after the default meter reading date, such as when the default meter reading date falls on a legal holiday. The meter reading process is performed in the household.

  The customer information storage unit 10 stores a customer information table 100 in advance as information related to the meter-reading household. FIG. 2 is a diagram illustrating a data configuration example and a data example of the customer information table 100. As shown in the figure, the customer information table 100 is a two-dimensional tabular data composed of rows and columns, and includes a customer ID, which is identification information for identifying a household, address information for each household, and each household. Has a column of items with predetermined meter reading date information set in advance. Each row of the customer information table 100 exists for each customer ID.

  Returning to FIG. 1, the work time storage unit 11 stores in advance a work time table 101 as information on the time required for the meter reading work. FIG. 3 is a diagram illustrating a data configuration example and a data example of the work time table 101. As shown in the figure, the work time table 101 is two-dimensional tabular data composed of rows and columns, and a meter reader ID that is identification information for identifying a meter reader, address information of the meter reading location, and And a column of items of meter reading required time information indicating the time taken for the meter reading work. Each row of the work time table 101 exists for each combination of the meter reader ID and the address of the meter reading place.

Returning to FIG. 1, the map information storage unit 12 stores in advance map information 102 relating to a map, such as a map, a block area, and a land type of an adjacent city section. Here, the block is a unit of a section divided by roads, railways, rivers, and the like. Further, the land type is a type of land indicating a classification according to land use.
The required time modeling unit 200 includes an estimated model formula indicating a correlation between the household density of the block and the required time of the meter reading work per household, and the working time table 101 and the household density stored in the working time storage unit 11. Calculate based on information. Further, the required time modeling unit 200 calculates the total meter reading work time for each block based on the calculated estimated model formula, the household density information of the block, and the number of households in the block for each block. To calculate.

  The required time modeling unit 200 uses the calculated total meter reading work time in the block as the required time in the block, the block ID that is identification information for identifying the block, the address information of the block, and the calculated required time in the block. The block graph node table 201 in which the information is associated with the average default meter reading date information is written in the block graph node information storage unit 20. The average default meter reading date information is an average of the default meter reading date of each household in the block. Note that, as the average default meter reading date information, a default meter reading date having the largest number of households in the block may be used among the predetermined meter reading dates.

  The graph creation unit 300 selects the land type of the city section based on the map information 102 in the map information storage unit 12. Moreover, the weight value corresponding to the land type of the adjacent part and the schedule difference of the predetermined meter reading date is stored in advance in the internal storage area, and corresponds to the combination of the adjacent block and the adjacent type of the adjacent part. The block graph adjacency table 301 associated with the weight value is written in the block graph adjacency information storage unit 30. Here, the adjacent type is a combination of the land type and the difference in the schedule of the predetermined meter reading date. In addition, the weight value becomes a large weight value in proportion to the value of the difference in the schedule of the default meter reading date, which facilitates the movement of the city section such as the land type of the adjacent part of the city section and the difference of the default meter reading date. Depending on the value. Land types include, for example, roads, highways, rivers, cliffs, and fences.

The area dividing unit 400 divides a block in the area for which the traveling schedule is to be created into a plurality of areas. Here, the area is the range of the meter reading target area for one meter allocated to each meter reader, and indicates the range of the meter reading work target including one or a plurality of blocks.
The area dividing unit 400 performs an area dividing process for making the required time in the area, which is the total meter reading work time in each area, substantially uniform in all areas.
The area dividing unit 400 reads the meter reading area table 401 associating the area ID, the block ID, the required time information in the block, and the default meter reading date information, which is identification information for identifying the area, as an area dividing process result. Write to the area information storage unit 40.

  The traveling schedule calculation unit 500 determines a new meter reading date for averaging the number of areas for each meter reading date based on the predetermined meter reading date in the area. The traveling schedule calculation unit 500 assigns a meter reader who is a meter reading operator for each area based on the meter reading area table 401 of the meter reading area information storage unit 40. The traveling schedule calculation unit 500 associates the area ID, the determined meter reading date, the required time in the area indicating the total meter reading work time in the area, and the meter reader ID of the meter reader who is the meter reading operator. The table 501 is written in the traveling schedule information storage unit 50.

Next, the operation of the traveling schedule generation device 1 according to one embodiment of the present invention will be described. FIG. 4 shows a flow of a traveling schedule creation process of the traveling schedule generation device 1.
The required time modeling unit 200 reads the map information 102 in the map information storage unit 12. Based on the read map information, the required time modeling unit 200 uses the address of a household included in the block as a search key for block (node) g, and reads meter reading processing time information t (a) corresponding to the read address. Read from the work time table 101 (step S1).

The required time modeling unit 200 calculates the required time t (g) in the city block obtained by adding up the total meter reading work time of all the households included in the city block g and the total travel time (step S2). The total travel time is, for example, an average value of the time required for movement between households is stored in advance in the internal storage area by the required time modeling unit 200, and the required time modeling unit 200 stores the average value. Calculated by multiplying the number of households in the block.
Furthermore, required time modeling unit 200, the city ward total average duration meter reading time t (g) of the average value of the total meter reading time per household in Quadro g divided by the households Quadro g t (g _a ) Is calculated (step S3).

Further, the required time modeling unit 200 reads the area information of the block g from the map information 102, and reads the customer information table 100 corresponding to the address included in the block g from the customer information storage unit 10 (step S4). The required time modeling unit 200 calculates the number of households included in the block g based on the read customer information table 100, and calculates the household density D (g) (step S5). The household density D (g) is a ratio of the number of households per area in the block g obtained by the required time modeling unit 200 dividing the number of households by the area.
Duration modeling unit 200, when the average of the above-mentioned required time t and (g _a) and Household Density D (g) it is determined whether the city block is not yet calculated, it is determined that the city blocks of uncalculated present, the The above steps S1 to S5 are repeated for the uncalculated block. If the required time modeling unit 200 determines that there is no uncalculated block, the process proceeds to step S7 (step S6).

The required time modeling unit 200 calculates an estimated model formula of a function indicating the correlation between the household density and the total meter reading time per household based on the above-described tendency (step S7). The calculation of the estimated model formula is, for example, a process of calculating by an analysis process based on a function such as single regression, multiple regression, or least square regression.
Next, the required time modeling unit 200 calculates an estimated required time per household corresponding to the household density of the block g based on the calculated estimated model formula. Further, the required time modeling unit 200 multiplies the calculated estimated required time per household by the number of households in the block g, and obtains the calculated required time t _e (g) in the block (step S8). ).

  The required time modeling unit 200 associates the address of the block g with the calculated estimated check-up time t (g) in the block and the average default meter reading date of the household included in the block g read from the customer information table 100. The block graph node table 201 is created and temporarily stored in the internal storage area (step S9).

  The required time modeling unit 200 determines whether or not there is an unprocessed block for which writing to the block graph node table 201 is unprocessed. If it is determined that there is an unprocessed block, the above-described steps are performed for the unprocessed block. The processes of S8 and S9 are repeated. When the required time modeling unit 200 determines that there is no unprocessed city block, the required time modeling unit 200 writes the city block graph node table 201 to the city block graph node information storage unit 20 and outputs a process execution request to the graph creation unit 300. (Step S10).

The graph creating unit 300 displays the address of the first block to be graphed, the address of the second block adjacent to the first block, and the land type of the adjacent portion of the first block and the second block. Read out from 12 pieces of map information 102. Further, the graph creation unit 300 reads the weight value corresponding to the read land type from the internal storage area.
The graph creation unit 300 reads the block ID of the first block and the block ID of the second block from the block graph node table 201 of the block graph node information storage unit 20 using the read address as a search key (step S11).

The graph creating unit 300 creates a block graph adjacency table 301 in which the calculated weight value is associated with the combination of the read first block ID and the second block (step S12).
When the graph creation unit 300 determines whether there is a block that has not yet been written to the block graph adjacent table 301, and determines that there is an unprocessed block, the graph creation unit 300 performs the above-described step S11 for the unprocessed block. The process of S12 is repeated. If the graph creation unit 300 determines that there is no unprocessed city block, the graph creation unit 300 writes the created city block graph adjacency table 301 to the city block graph adjacency information storage unit 30 and outputs a process execution request to the area division unit 400. (Step S13).

The area dividing unit 400 calculates the total value of all the city blocks for the estimated time t _e (g) in the city block. The area dividing unit 400 calculates the average intra-area required time t (a _a ) per area by dividing the calculated total value by the number of areas Na to be divided (step S14).
Here, the number of areas Na is equal to the total number of meter reading work days D obtained by summing up the number of meter reading work days per month for each meter reading person performing the meter reading work. In determining the number of areas Na, in addition to the method described above, an average area required time that can be visited in a day is set in advance, and the total value of the estimated time t _e (g) in the estimated block is calculated as the average area required. The area number Na may be determined by dividing by the time t (a _a ). In addition to calculating the area number Na and the average required time t (a _a ) by the above-described method, the area dividing unit 400 may store in advance, or via the input device included in the traveling schedule generation device 1. It may be input by the user.
Next, the area dividing unit 400 determines that the difference between the calculated average area required time t (a _a ) and the total meter reading work time in the area is within the allowable range Δt, and the change in the meter reading date is minimized. A graph partitioning process is performed to divide into (block groups) (step S15).

  The area dividing unit 400 stores, as a graph partitioning processing result, a block ID of the node, an area ID that is identification information for identifying the divided area, and a block graph node table 201 of the block graph node information storage unit 20. The meter reading area table 401 that associates the estimated time information in the estimated block with the average default meter reading date information is created (step S16).

The area dividing unit 400 writes the created meter reading area table 401 into the meter reading area information storage unit 40 and outputs a process execution request to the traveling schedule calculation unit 500 (step S17).
The traveling schedule calculation unit 500 reads the meter reading area table 401 of the meter reading area information storage unit 40, calculates the reciprocal of the number of blocks for each average default metering date in the area a as the visiting day change amount, and the smallest visiting day change amount is the smallest. The process of setting the average default meter reading date as a meter reading candidate date that is a new meter reading date candidate is repeated for all areas (step S18).

Next, the traveling schedule calculation unit 500 calculates the number of areas for each meter reading candidate day (step S19). Next, the traveling schedule calculation unit 500 changes the new meter reading date so as to average the number of areas for each meter reading candidate date (step S20). Specifically, for example, the number of meter readers for each meter reading date is stored in advance, and the traveling schedule calculation unit 500 compares the number of areas and the number of meter readers for each meter reading candidate date.
Based on the comparison result, the traveling schedule calculation unit 500 changes the meter reading candidate date in the area having the larger number of areas than the number of meter readers to the meter reading candidate date in the area having the smaller number of areas than the number of meter reading members. At this time, an area having a schedule close to the original meter reading candidate date as an meter reading candidate date is selected from areas having a smaller number of areas than the number of meter reading personnel.

  By performing the process of step S18 described above, the traveling schedule calculation unit 500 sets the number of households whose meter reading date is changed in the region for which the traveling schedule is created when setting a new meter reading date in the area divided by the area dividing unit 400. In addition, it is possible to set a meter reading date that averages the number of meter readers for each meter reading date. The number of households whose meter reading date is changed is the number of households where the meter reading date is changed, different from the default meter reading date and the new meter reading date.

  The traveling schedule calculation unit 500 associates the area ID, the set new meter reading date, the estimated in-area required time that is the total value of the required time in the block in the area, and the meter inspector ID. And the created traveling schedule table 501 is written in the traveling schedule information storage unit 50 (step S21).

5 for all city blocks, based on the calculated result, is a plot of data example of the household density D (g) and the average time required per household t (g _a).
Here, when the meter-reading place of each household approaches, movement time will become short with movement distance. Therefore, as the correlation between the average duration and household density per household, the value decreases the average time required t per household (g _a) in accordance with the increase in the value of household density D (g), a predetermined value Tend to converge towards

  FIG. 6 is a diagram illustrating a data configuration example and a data example of the block graph node table 201 created by the required time modeling unit 200 in step S9 of FIG. As shown in the figure, the block graph node table 201 is a two-dimensional tabular data composed of rows and columns. The block ID, the block address information, the calculated estimated time in the block, and the average default It has a column of items with a meter reading date. Each row of the block graph node table 201 exists for each block ID.

  FIG. 7 is a diagram illustrating a data configuration example and a data example of the block graph adjacency table 301 created by the graph creation unit 300 in step S12 of FIG. As shown in the figure, the block graph adjacency table 301 is a two-dimensional tabular data composed of rows and columns, and the weight corresponding to the first block ID, the second block ID, and the land type of the adjacent portion. Has a column of items with values. Each row of the block graph adjacency table 301 exists for each combination of the first block ID and the second block ID.

  Next, a specific example of the graph partitioning process in step S15 of FIG. 4 will be described using the drawings. FIG. 8 is a graph example when the estimated time in the estimated block is displayed on the map for the area to be processed in the graph partitioning process. Here, as an example of a region to be processed, a region where a block of 5 blocks and 5 blocks surrounded by a grid-like boundary such as a road or a river will be described.

  As shown in FIG. 8 (a), the boundary B is, for example, a river, a boundary with a different default meter reading date, or the like, and a boundary having a higher weight value than other boundaries when moving in a city section. Show. In the following description, for the sake of simplicity, the description will be made assuming that the weight value is 0 for the boundary other than the boundary B and the weight value is 60 for the boundary B. In the figure, for example, the node G1 is a block having a low household density, such as a block in which detached houses are concentrated, and is a block having an estimated required time in the block of 60 minutes. In addition, the node G2 is, for example, a district having a high household density including a plurality of apartment houses, and a district having an estimated time in the estimated district of 240 minutes.

FIG. 8B is a diagram showing a circle having a diameter in accordance with the required time in the estimated city block as a node circle on the city block, and showing all adjacent relations between the node circles by straight lines. In the figure, for example, a connection for adding a weight value 60 to exceed the boundary B, such as a connection L, is indicated by a broken line.
Next, the flow of graph partitioning processing will be described with reference to FIGS. Here, a case where the number of divided areas Na = 8 and the allowable range Δt = 60 will be described. Further, the total value obtained by summing the estimated time required in all the blocks in FIG. 8B is 2730 minutes, and the average required time t (a _a ) obtained by dividing this total value by the number of areas 8 is 341.25 minutes.

Any two of the nodes are selected as the central nodes (for example, the central node CG1 and the central node CG2 in FIG. 9A).
Next, the connection range is expanded by connecting to adjacent nodes with the selected center node as the center. At this time, among adjacent nodes, a node having the smallest weight value between connected nodes is preferentially selected. Then, the operation of extending the connection range is repeated until all the nodes are connected to a node group connected from any one of the central nodes. At this time, the connection is made so that the total value of the required time in the block in the node group connected around the center node CG1 and the node group connected around the center node CG2 are almost equal. In the following, the flow of this connection process is shown in FIG. 9 (b) to FIG. 10 (d).

  In FIG. 9B, the central node CG1 and the adjacent node are connected, and the central node CG2 and the adjacent node are connected. As a result, the total value of the required time in the block for both the connection range of the central node CG1 and the connection range of the central node CG2 is 150 minutes. In the figure, since the weight values of the adjacent nodes are both 0 in both of the central nodes CG1 and CG2, the nodes having the same total value of the required time in the block are selected. Similarly, as shown in FIG. 9C, as a result of further selecting an adjacent node, the total value of the required time in the block is 450 minutes for both the connection range of the central node CG1 and the connection range of the central node CG2. Become.

  Here, in the connection range of the central node CG1, there is a node whose connection line exceeds the boundary B among adjacent nodes. Here, since the weight value when the boundary B is exceeded is 60 and the weight value when the other boundary is exceeded is 0, the node having the weight value 0 is preferentially included in the connection range of the central node CG1. . Hereinafter, similarly, a node having a weight value of 0 is preferentially selected, and as shown in FIG. 9D, adjacent nodes are further selected. As a result, the total required time in the block in the connection range of the central node CG1 The value is 630 minutes, and the total value of the required time in the block in the connection range of the central node CG2 is 690 minutes.

  In FIG. 10A, an adjacent node is further selected, and as a result, the total value of the required time in the block is 810 minutes for both the connection range of the central node CG1 and the connection range of the central node CG2. In FIG. 10B, an adjacent node is further selected. As a result, the total value of the required time in the block in the connection range of the central node CG1 is 990 minutes, and the total value of the required time in the block of the connection range of the central node CG2 is 1050 minutes.

  Here, as shown in FIG. 10B, all the adjacent nodes of the central node CG1 are connected beyond the boundary B. For this reason, in the next expansion process, the weight value 60 is added regardless of which of the adjacent nodes is connected. As shown in FIG. 10 (c), the adjacent node is further selected, and as a result, the connection range of the central node CG1 includes the connection Lb exceeding the boundary B. Therefore, the weight value 60 is added, The total value is 1290 minutes. Further, the total value of the required time in the block in the connection range of the central node CG2 is 1350 minutes.

In FIG. 10 (d), an adjacent node is further selected. As a result, the total required time in the block in the connection range of the central node CG1 is 1380 minutes, and the total value of the required time in the block in the connection range of the central node CG2 is 1410 minutes.
In FIG. 10D, all the nodes are connected to either the connection range of the central node CG1 or the connection range of the central node CG2. By doing in this way, it can divide into two block groups of the connection range of center node CG1, and the connection range of center node CG2 as a block group with the sum total required time in a block.

  Next, the processing shown in FIGS. 9 and 10 is performed on the connection range of the central node CG1 and the connection range of the central node CG2. 11A, any two nodes are selected as the central node in the connection range of the central node CG1 and the connection range of the central node CG2 shown in FIG. 10D, respectively (FIG. 11A). Center node CG11 and center node CG12, center node CG21 and center node CG22).

  Thereafter, the connection range is expanded around the selected central node in the same manner as the processing of FIG. 9B to FIG. 10D, and the connection range of the central node CG1 and the connection range of the central node CG2 respectively. Divide into two. FIG. 11B is a diagram in which each of the connection range of the central node CG1 and the connection range of the central node CG2 is divided into two. As shown in the figure, the total value of the required time in the block of the connection range of the central node CG11 is 660 minutes, and the total value of the required time in the block of the connection range of the central node CG12 including the connection Lb is 720 minutes. It is. In addition, the total value of the required time in the block of the connection range of the central node CG21 is 720 minutes, and the total value of the required time in the block of the connection range of the central node CG22 is 690 minutes.

Similarly, two center nodes are selected in the connection range of each of the center nodes CG11, CG12, CG21, and CG22 (the center nodes CG111, CG112, CG121, CG122, CG211, CG212, and CG221 in FIG. 11C). , CG222).
The connection range is expanded around the selected center node, and the connection ranges of the center nodes CG11, CG12, CG21, and CG22 are each divided into two. FIG. 11D is a diagram showing the connection range after the division into two.

  As shown in the figure, in the connection range of the central node CG111, the total value of the required time in the block is 300 minutes, and the total value of the required time in the block of the connection range of the central nodes CG121, CG122, and CG222 is all 330 minutes. Further, the total value of the required time in the block within the connection range of the central nodes CG112, CG211, CG212, and CG221 is 360 minutes.

As described above, since the dividing process is performed by expanding the connection range from the central node so that the total value of the required time in the block in the connection range becomes equal, the total value of the required time in the block is divided into connection ranges that are substantially equal. be able to. The area dividing unit 400 performs the graph partitioning process by repeating this dividing process until the number of connection ranges reaches the number of divided areas Na described above.
The area dividing unit 400 always selects two central nodes in the graph partitioning process to divide into two, but selects three or more central nodes to divide into three or more. Can do.

  FIG. 12 is a diagram showing a data configuration example and a data example of the meter reading area table 401 of the meter reading area information storage unit 40 created by the area dividing unit 400 in step S16 of FIG. As shown in the figure, the meter-reading area table 401 is two-dimensional tabular data composed of rows and columns. The area ID, the block ID of the node, the estimated time information in the estimated block, and the average default meter reading date Has a column of items with information. Each row of the meter reading area table 401 exists for each block ID.

  FIG. 13 is a diagram illustrating a data configuration example and a data example of the traveling schedule table 501 of the traveling schedule information storage unit 50. As shown in the figure, the traveling schedule table 501 is two-dimensional tabular data composed of rows and columns, and includes an area ID, meter-reading date information, estimated in-area required time information, and meter-reader ID. Has a column of items. Each row of the traveling schedule table 501 exists for each area.

As described above, by performing the above-described processing, the number of households whose meter reading date is changed in the area for which the traveling schedule is to be created is small, and the number of meter readers per meter reading date and the meter reading work time per day are averaged. A traveling schedule can be created that can improve efficiency.
In addition, the required time modeling unit 200 calculates an estimated model formula in step S7, and calculates a traveling schedule using the estimated model formula, thereby obtaining an average working time that is not affected by the difference in the skill of the meter reader. Based on the block, it is possible to calculate the required time in the block for each block.

  In step S18, when the traveling schedule calculation unit 500 sets a new meter reading date candidate, the traveling schedule calculation unit 500 calculates the reciprocal of the number of blocks for each average default meter reading date, and uses the calculated result as the traveling date change amount. However, the present invention is not limited to this, and any travel day change amount can be used. For example, the reciprocal of the number of households for each predetermined meter-reading date may be used as the visiting day change amount. In this case, the traveling schedule calculation unit 500 reads address information from the block graph node table 201 using the block ID corresponding to the area a read from the meter reading area table 401 as a search key.

Next, the traveling schedule calculation unit 500 reads out the default meter reading date information of all households included in the area a from the customer information table 100 of the customer information storage unit 10 based on the read address information. The traveling schedule calculation unit 500 calculates the reciprocal of the number of households for each predetermined meter-reading date as the visiting day change amount based on the information on the default meter-reading date of the households included in the read area a. The traveling schedule calculation unit 500 can be realized by selecting a predetermined meter reading day with the largest number of households by selecting a predetermined meter reading date with the smallest calculated amount of visiting day change.
In addition, for each day of meter reading, the difference between the date of meter reading and the default meter reading date set for the households included in the area is calculated as the amount of change in the patrol date, and this difference is calculated for all households included in the area. A total value may be used.

Further, the graph partitioning process by the area dividing unit 400 can be applied by, for example, a method of dividing into brute force areas or area dividing software called METIS.
For example, in the method using the brute force, in the area where the area dividing unit 400 combines the adjacent blocks with the block g as a center, the difference between the total meter reading work time and the average required time t (a _a ) is within an allowable range. A combination of the blocks within Δt is searched by brute force (all combinations of adjacent blocks). Next, the area dividing unit 400 selects, for each combination, the most default meter reading date among the default meter reading dates of the blocks included in the combination. Then, the area dividing unit 400 calculates the number of blocks having a default meter reading date different from the selected default meter reading date as the meter reading date changing block number. The meter-reading area information storage unit 40 calculates the number of meter-reading date change blocks for all combinations, and determines the combination with the smallest number of meter-reading date change blocks as an area. By repeating this operation, area division processing is performed.

  In addition, as the weight value corresponding to the connection of the above-described city sections, a value obtained by adding the weight for each land type and the weight based on the difference between the predetermined meter-reading dates can be applied. In this case, in addition to adding the weight values as they are, adding the weight for each land type and the weight based on the difference between the preset meter reading dates with different weights, the difference between the land type and the difference between the preset meter reading date The priority can be set with.

The traveling schedule generation device 1 described above has a computer system therein. The operation process of the customer information table 100, the required time modeling unit 200, the graph creating unit 300, the area dividing unit 400, and the traveling schedule calculation unit 500 of the traveling schedule generation device 1 is computer-readable in the form of a program. When the computer system reads and executes this program, the above processing is performed. The “computer system” herein includes a CPU, various memories, an OS, and hardware such as peripheral devices.
Further, the “computer system” includes a homepage providing environment (or display environment) if a WWW system is used.

Further, the program for realizing each step shown in FIG. 4 is recorded on a computer-readable recording medium, and the program for realizing the function of the cyclic schedule generating device 1 shown in FIG. 1 is computer-readable. A traveling schedule is recorded that can be recorded on a recording medium, and the program recorded on the recording medium is read and executed by a computer system, thereby making it possible to improve the efficiency of the traveling operation while minimizing changes in the default meter reading date. You may perform the process to create.
The “computer-readable recording medium” means a flexible disk, a magneto-optical disk, a ROM, a writable nonvolatile memory such as a flash memory, a portable medium such as a CD-ROM, a hard disk built in a computer system, etc. This is a storage device.

Further, the “computer-readable recording medium” means a volatile memory (for example, DRAM (Dynamic DRAM) in a computer system that becomes a server or a client when a program is transmitted through a network such as the Internet or a communication line such as a telephone line. Random Access Memory)), etc., which hold programs for a certain period of time.
The program may be transmitted from a computer system storing the program in a storage device or the like to another computer system via a transmission medium or by a transmission wave in the transmission medium. Here, the “transmission medium” for transmitting the program refers to a medium having a function of transmitting information, such as a network (communication network) such as the Internet or a communication line (communication line) such as a telephone line.
The program may be for realizing a part of the functions described above. Furthermore, what can implement | achieve the function mentioned above in combination with the program already recorded on the computer system, and what is called a difference file (difference program) may be sufficient.

It is a block diagram which shows the whole structure of the traveling schedule production | generation apparatus 1 by one Embodiment of this invention. It is a figure which shows the data structural example and data example of the work time table 101 of the customer information storage part 10 in the embodiment. It is a figure which shows the data structural example and data example of the work time table 101 of the work time memory | storage part 11 in the embodiment. It is a figure which shows the operation | movement flow of the cyclic schedule production | generation apparatus 1 in the embodiment. It is the graph which plotted the required time per household and the household density of a block in the embodiment. It is a figure which shows the data structural example and data example of the block graph node table 201 of the block graph node information storage part 20 in the embodiment. It is a figure which shows the data structural example and data example of the block graph adjacency table 301 of the block graph adjacent information storage part 30 in the embodiment. It is an example of the graph of the area of the graph partitioning process target in the embodiment. It is a figure which shows the flow in the specific example of the graph partitioning process in the embodiment. It is a figure which shows the flow in the specific example of the graph partitioning process in the embodiment. It is a figure which shows the flow in the specific example of the graph partitioning process in the embodiment. It is a figure which shows the example of a data structure of the meter-reading area table 401 of the meter-reading area information storage part 40 in the embodiment, and a data example. It is a figure which shows the data structural example and data example of the traveling schedule table 501 of the traveling schedule information storage part 50 in the embodiment.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Travel schedule production | generation apparatus 10 Customer information memory | storage part 11 Work time memory | storage part 12 Map information memory | storage part 20 Town block graph node information memory | storage part 30 Town block graph adjacent information memory | storage part 40 Meter reading area information memory | storage part 50 Travel schedule information memory | storage part 100 Customer information table DESCRIPTION OF SYMBOLS 101 Work time table 102 Map information 200 Time required modeling part 201 Block graph node table 300 Graph creation part 301 Block graph adjacent table 400 Area division part 401 Meter reading area table 500 Travel schedule calculation part 501 Travel schedule table

Claims (6)

A traveling location information storage unit that stores, for each traveling location, traveling location information that associates the predetermined traveling date that is determined in advance for each traveling location, the identification information of the circulating location, and the location information of the circulating location,
A working time information storage unit for storing the traveling work time for each traveling location for each traveling location;
A map information storage unit that stores map information in which the position information of the patrol location and the adjacency relationship between the patrol locations are associated;
Based on the map information and the work time information, a set of adjacent tour places is set as one area, and an in-area tour work time that is the sum of the tour work times of the tour places included in the area is calculated. Selecting any one of the adjacent patrol locations that are adjacent to the expansion target area and are not included in any area, repeat the area expansion process to be included in the expansion target area, An area dividing unit that divides the traveling time in the area into a predetermined number of areas averaged;
As a new tour date common to the divided areas, the travel date change amount between the default tour date and the tour candidate date in the tour location included in the area is calculated, and all tour candidate dates are calculated. A tour schedule calculation unit that sets a tour candidate date that minimizes the travel date change amount as the new tour date. The traveling schedule generation device includes:
Based on the map information stored in the map information storage unit and the tour location information stored in the tour location information storage unit, the adjacent type in the adjacent first tour location and the second tour location is determined in advance. A graph creating unit that creates weight value information in which weight values determined for each of the adjacent types are associated with each combination of the first cyclic location and the second cyclic location;
The area dividing unit is
Based on the weight value information created by the graph creation unit, in the area expansion process, an adjacent tour location having the smallest weight value between the tour location included in the area and the adjacent tour location is newly selected from the adjacent tour locations. The traveling schedule generation device according to claim 1, wherein the cyclic schedule generation device is included in the area. The weight value for each adjacent type is
The tour schedule generation device according to claim 2, wherein the tour schedule generation device has a value corresponding to a difference in schedule between a first predetermined tour date of the first tour location and a second predetermined tour date of the second tour location. The weight value for each adjacent type is
The traveling schedule generation device according to claim 2, wherein the traveling schedule generation device is a value predetermined for each land type between the first traveling portion and the second traveling portion. A traveling location information storage step for storing, for each traveling location, traveling location information in which a predetermined traveling date determined in advance for each traveling location, identification information of the circulating location, and location information of the circulating location are associated with each other,
A working time information storage step for storing the traveling work time for each traveling location for each traveling location;
A map information storage step for storing map information in which the position information of the patrol location and the adjacency relationship between the patrol locations are associated;
Based on the map information and the work time information, a set of adjacent tour places is set as one area, and an in-area tour work time that is the sum of the tour work times of the tour places included in the area is calculated. Selecting any one of the adjacent patrol locations that are adjacent to the expansion target area and are not included in any area, repeat the area expansion process to be included in the expansion target area, An area dividing step of dividing the traveling time in the area into a predetermined number of areas,
As a new tour date common to the divided areas, the travel date change amount between the default tour date and the tour candidate date in the tour location included in the area is calculated, and all tour candidate dates are calculated. A tour schedule calculation step of setting a tour candidate date that minimizes the travel date change amount as the new tour date. A computer used in the traveling schedule generation apparatus is configured to provide, for each traveling location, traveling location information in which a predetermined traveling date determined in advance for each traveling location, identification information of the traveling location, and location information of the traveling location are associated with each other. A traveling location information storage unit for storing,
A working time information storage unit for storing the traveling work time for each traveling location for each traveling location;
A map information storage unit for storing map information in which the position information of the tour location and the adjacency relationship between the tour locations are associated;
Based on the map information and the work time information, a set of adjacent tour places is set as one area, and an in-area tour work time that is the sum of the tour work times of the tour places included in the area is calculated. Selecting any one of the adjacent patrol locations that are adjacent to the expansion target area and are not included in any area, repeat the area expansion process to be included in the expansion target area, An area dividing unit that divides the traveling time in the area into a predetermined number of areas,
As a new tour date common to the divided areas, the travel date change amount between the default tour date and the tour candidate date in the tour location included in the area is calculated, and all tour candidate dates are calculated. Among them, a tour schedule generation program that functions as a tour schedule calculation unit that sets a tour candidate date that minimizes the tour day change amount as the new tour date.

Images