JP4005466B2 - Route formulation method - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a route formulating method, and more particularly, to a route formulating method for determining the order of users who visit a caregiver to perform home-visit care.
[0002]
The present invention also relates to a program for causing a computer to perform processing in such a route formulation method.
[0003]
[Prior art]
Conventionally, various systems have been developed for a caregiver to visit a home of a user who needs care, and to support care work such as bathing at the visit destination. In particular, when performing such operations, the order in which the caregiver visits, that is, the visit route must be searched and determined, so there is a system for formulating an optimal visit route. In such a formulation system, a method is used in which distances from a predetermined visited place to a plurality of next visited place candidates are calculated, and the visited place having the shortest distance is determined as the next visited place.
[0004]
[Patent Document 1]
JP-A-8-329041
[0005]
[Problems to be solved by the invention]
However, in the formulation system as described above, each time a destination is formulated, the distance between a predetermined destination and a plurality of candidate destinations is calculated, and the destination with the shortest distance is determined by comparing the distances. For this reason, it takes time and effort to decide the destination. Therefore, there is a problem in that it is impossible to visit the destination efficiently and the operation rate is lowered.
[0006]
Moreover, in the above formulating system, since the destination candidate is determined considering only the distance, a user living at a location far from the caregiver at that time may be excluded from the destination candidate. In addition, when a visitor schedules a visit or cannot receive a visit at a desired time according to the season, and the user who needs nursing care has an infection, the order of visits will come to the end. For this reason, there is a problem that the visit destination is biased such that the visit cannot be received at a desired time, and the user's request cannot be met.
[0007]
Accordingly, an object of the present invention is to respond to a user's request without taking time and effort, and to determine a visit destination that can be visited efficiently and to increase the operating rate of the visit. It is to provide a program for causing a computer to perform a formulating method and processing in the method.
[0008]
[Means for Solving the Problems]
In order to solve the above problems, the present invention is a route formulation method for formulating a route for visiting a user, Computer Set the vertical and horizontal units as desired. To the coordinates you visited User information with coordinate values obtained by mapping the location where the user resides Store User information Stored in DB Based on the coordinate values, From one user, spirally follow the grid divided by the predetermined unit of the vertical axis and the horizontal axis A search procedure to find the next user's visit, Said Based on the search results from the search procedure, From the one user A user determination procedure for determining the user of the next destination with the shortest distance. Execute It is supposed to be configured.
[0009]
In such a route formulation method, user information having coordinate values obtained by mapping the position where the user resides to coordinates where the units of the vertical axis and the horizontal axis are arbitrarily set is managed. Based on the coordinate value of the information, the next visit destination is searched in a lattice spiral, and the next visit destination with the shortest distance is determined based on the search result, so that time and effort are not spent. In addition to responding to the user's request, it is possible to determine a destination that can be visited efficiently, and to increase the operating rate of the visit.
[0010]
In order to solve the above problems, the present invention may be a program for causing a computer to perform the processing according to the route formulation method and a recording medium on which the program is recorded.
[0011]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, embodiments of the present invention will be described with reference to the drawings.
[0012]
FIG. 1 shows a system configuration diagram in a route formulation method according to a first embodiment of the present invention. In FIG. 1, a route formulation system 10 in the route formulation method mainly includes an installer 11 that installs a program that executes route formulation processing, a display control processing unit 12 that controls display of data, and communication that controls data communication. A control processing unit 13, an input / output control processing unit 14 for controlling data input / output, a user extraction processing unit 15 for extracting a predetermined user, and a user for determining a user according to a predetermined time zone A decision processing unit 16, a destination search processing unit 17 that searches for a destination to be visited, a user search processing unit 18 that searches for a user at the destination, and a route verification that performs a process for verifying the visited route Processing unit 19, user information DB 100 storing user information, infectious disease information DB 101 storing infectious disease classifications, etc., and vehicles visited daily The operation schedule information DB 102 in which the number of work schedules is stored, the visit time zone information DB 103 in which the visit time zone is stored, the visit request information DB 104 in which information related to the visit is stored, and the schedule in which the visit schedule is stored An information DB 105, an annual hit rate information DB 106 storing the annual visit hit rate at which the user has visited, a usage information DB 107 storing monthly usage information using the visit, and a zip code on the map Map information system plot information DB 108 storing the position information of each user plotted on the coordinate axes arbitrarily set based on the vehicle navigation information DB 109 storing the user information to be displayed on the car navigation system It is a system composed of
[0013]
In FIG. 1, a route development system 10 is a server computer, and each component is controlled by a CPU (Central Processing Unit). The CPU performs processing in the route formulation method according to the program stored in the memory unit. The route formulation system 10 can also be connected to another route formulation system via a network to control processing in the route formulation method.
[0014]
The communication control processing unit 13 is a processing unit that controls transmission / reception data via a network, and includes a communication unit for connecting to a network. The display control processing unit 12 has a display unit such as a display, and controls display data to display on the display unit. The input / output control processing unit 14 controls input / output of data by controlling an input unit such as a mouse and a keyboard and an output unit such as a printer. The installer 11 reads the program from the recording medium 50 on which the program for realizing the route formulation method according to the embodiment of the present invention is recorded, and installs the read program in, for example, an auxiliary storage device or the like To do. Then, when processing in a route formulation method described later is started, the CPU starts the processing according to the program installed in the auxiliary storage device. Note that a computer-readable medium such as a CD-ROM may be used as a medium for storing the program.
[0015]
Based on the user information stored in the user information DB 100, the user extraction processing unit 15 extracts a user reserved at a predetermined date and time. The user determination processing unit 16 determines a user according to a predetermined time zone based on information stored in each of the DBs 100 to 105 and 106. The destination search processing unit 17 searches for a destination to visit based on information stored in each of the DBs 100 to 109. Based on the information stored in each of the DBs 100 to 109, the user search processing unit 18 spirals each grid obtained by dividing the vertical axis and the horizontal axis of preset coordinate axes by a predetermined unit (hereinafter referred to as grid spiral). To search for the next user. The route verification processing unit 19 controls the processing units 15 to 18 based on information stored in the DBs 100 to 109 to perform a visited route verification process. The processing in each of the processing units 15 to 18 will be described in detail with reference to FIGS.
[0016]
Next, information stored in each of the DBs 100 to 109 will be described.
[0017]
FIG. 2 is a diagram showing a table stored in the user information DB. In FIG. 2, the table 110 of the user information DB 100 stores information related to visiting care users. The table 110 includes a user ID for identifying the user, a user name indicating the name of the user, a postal code of the user's residence, and an X of the coordinate axis arbitrarily set for the postal code. Axis and Y-axis values, periodic desired information indicating the period of regular visits, monthly frequency information indicating the number of visits per month, weight information (kg) of the user, and infectious disease that the user is suffering from , The distance information (km) from the company to which the caregiver belongs, and the last visit date indicating the date when the user was last visited are stored.
[0018]
For example, the table 110 includes a user ID “0001”, a user name “Fujitsu Taro”, a postal code “123-1111”, a coordinate axis X axis “1”, a Y axis “1”, a periodic request “weekly”, and a monthly period. The number of times “not specified”, the weight “100”, the infectious disease number “0”, the distance from the company “3”, and the last visit date “2002/04/01” are stored.
[0019]
FIG. 3 is a diagram showing a table stored in the infectious disease information DB. In FIG. 3, the table 111 of the infectious disease information DB 101 stores information on infectious diseases. The table 111 stores an infectious disease No. that identifies an infectious disease, an infectious disease name that indicates the name of the infectious disease, and an infectious disease category that indicates the degree of the infectious disease. In particular, when the value of the infectious disease category is “0”, it indicates that it is not subject to infectious diseases, and when the value of the infectious disease category is “1”, it indicates that the infectious disease is mild. A value of “2” indicates that the infection is severe. For example, in the table 111, the infectious disease name “hepatitis B” and the infectious disease classification “1” are stored for the infectious disease No “1”.
[0020]
FIG. 4 is a diagram illustrating a table stored in the operation schedule information DB. In FIG. 4, the table 112 of the operation schedule information DB 102 stores information related to the scheduled operation number of vehicles that make daily visits. The table 112 stores a visit date indicating a visit date and a scheduled operation number of vehicles operating on the last visit date. For example, the table 112 stores the scheduled operation number “20” for the visit date “2002/04/01”.
[0021]
FIG. 5 is a diagram showing a table stored in the visit time zone information DB. In FIG. 5, the table 113 of the visit time zone information DB 103 stores information related to the time zone during which the visit is performed. The table 113 stores a time zone number for identifying a time zone for the visit and desired time zone information indicating the start time and end time of the time zone desired by the user. For example, the table 113 stores the start time “08:30” to the end time “09: 0” of the desired time zone for the time zone No “1”.
[0022]
FIG. 6 is a diagram illustrating a table stored in the visit request information DB. In FIG. 6, a table 114 of the visit request information DB 104 stores information related to a user's desired visit time. The table 114 stores a user ID for identifying a user, a month, a day of the week indicating a visit date, a desired time zone No, and a priority indicating a priority of a user who visits. In particular, when the priority is “1”, it indicates that a visit is to be made at that time, and when the priority is “2”, if a visit cannot be made at that time, a visit will be made during that time. When the priority is “3”, it indicates that the visit is performed at any time when the visit cannot be performed at that time. For example, the table 114 stores the month “1”, the day of the week “Month”, the desired time zone No “1”, and the priority “1” for the user ID “0001”.
[0023]
FIG. 7 is a diagram showing a table stored in the schedule information DB. In FIG. 7, a table 115 of the schedule information DB 105 stores information related to a schedule for a visit by a caregiver. The table 115 stores a visit date, a day of the week, a desired time zone No indicating a visit date and time, a car No that identifies a car to be visited, and a user ID that identifies a user. For example, the visit date “2002/04/01”, the day of the week “Month”, the desired time zone No “1”, the car No “1”, and the user ID “0001” are stored in the table 115.
[0024]
FIG. 8 is a diagram showing a table stored in the annual hit rate information DB. In FIG. 8, the table 116 of the annual hit rate information DB 106 stores information on the annual visit hit rate at which the user has visited. The table 116 includes a user ID for identifying a user, a desired time hit rate (%), which is a detail of the annual hit rate information, a visit use hit rate (%), a desired use time visit count, and a visit use. The number of times and the desired number of visits are stored. In particular, the desired time hit rate (%) is a value obtained by accumulating the desired number of times of visit use by the desired number of visits, and the visited use hit rate (%) is a value obtained by accumulating the number of visits used by the desired number of visits. For example, in the table 116, for the user ID “0001”, the user ID, the desired time hit rate “100.0”, which is the details of the annual hit rate information, the visit use hit rate “100.0”, The desired time visit use count “100”, the visit use count “100”, and the desired visit count “100” are stored.
[0025]
FIG. 9 is a diagram illustrating a table stored in the usage information DB. In FIG. 9, a table 117 of the visit use information DB 107 stores information on the number of times the user has used visits every month. The table 117 stores a user ID for identifying a user, and the service usage count for each month (April to March). For example, in the table 117, for the user ID “0001”, the service usage count for each month is “April“ 4 ”, May“ 4 ”to December“ 4 ”, January“ 4 ”, 2 Month “4” and March “4” are stored.
[0026]
FIG. 10 is a diagram showing a table stored in the map information system plot information DB. In FIG. 10, a table 118 of the map information system plot information DB 108 stores information on position information plotted for each user on coordinate axes arbitrarily set based on the zip code on the map information. The table 118 includes a car number for identifying a car to be visited, a postal code indicating a user's residence, values of X and Y axes of coordinate axes arbitrarily set for the postal code, Latitude information and longitude information for the X axis and Y axis, and a user ID for identifying the user are stored. For example, the table 115 includes a car number “1”, a postal code “123-1111”, an X axis “1”, a Y axis “1”, latitude information “99”, longitude information “99”, and a user ID “0001”. Is stored.
[0027]
FIG. 11 is a diagram illustrating a table stored in the car navigation cooperation information DB. In FIG. 11, a table 119 of the car navigation linkage information DB 109 stores information on user information to be displayed on the car navigation system. The table 119 includes a vehicle number for identifying a vehicle to be visited, a route indicating a route to be visited, a zip code indicating a user's residence, and an X of a coordinate axis arbitrarily set for the zip code. The values of the axis and Y axis, the user's address, latitude information and longitude information for the X axis and Y axis, and the user ID for identifying the user are stored. For example, the table 119 includes a car No “1”, a route “1”, a postal code “123-1111”, an X axis “1”, a Y axis “1”, an address “Tokyo ...”, and latitude information “ 99 ", longitude information" 99 ", and user ID" 0001 "are stored.
[0028]
Next, the processing procedure of the route formulation method will be described.
[0029]
FIG. 12 is a flowchart for explaining route formulation processing. In FIG. 12, first, in the process of step S <b> 10, the route verification processing unit 19 sets the value of Z indicating the time zone to 1 in order to perform the route verification process. In the process of step S11, the date for the visit by the caregiver is input. In the process of step S12, the route verification processing unit 19 extracts the day of the week for the input date based on the schedule information stored in the schedule information DB 105, and based on the operation schedule information stored in the operation schedule information DB 102, Extract the number of vehicles available on that day.
[0030]
In step S13, the user extraction processing unit 15 performs processing for extracting a user who wants to visit on the input date. The user extraction process in step S13 will be described in detail with reference to FIG. In the process of step S <b> 14, the user determination processing unit 16 determines the user of the time zone No “1” from the extracted users. The user determination process in step S14 will be described in detail with reference to FIG. In step S15, the route verification processing unit 19 adds 1 to the value of Z. In step S16, the route verification processing unit 19 confirms the time frame, that is, the maximum time zone No “10”. In step S17, the route verification processing unit 19 determines whether the value of Z is 11 or less, that is, whether or not processing has been performed for all time zones. When the value of Z is 11 or less in the process of step S17, in the process of step S19, the route verification processing unit 19 determines whether the value of Z is 9 or less, that is, whether it is the final time zone. . When the value of Z is 9 or less in the process of step S19, in the process of step S20, the user determination processing unit 16 selects the time zone No “2” to the time zone No “8” from the extracted users. Determine the users of The user determination process in step S20 will be described in detail with reference to FIG. When the value of Z is not 9 or less in the process of step S19, in the process of step S21, the user determination processing unit 16 selects the time zone No “9” to the time zone No “10” from the extracted users. Determine users. The user determination process in step S21 will be described in detail with reference to FIG.
[0031]
If the value of Z is not 11 or less in the process of step S17, the route test processing unit 19 calculates the desired time hit rate and the visit use hit rate in step S22 and stores it in the annual hit rate information DB 106. To do. In step S23, the route verification processing unit 19 maps the route search result to the location information based on the location information stored in the map information system plot information DB 108. In the process of step S24, the route verification processing unit 19 performs screen display of the position information mapping the route search result based on the information stored in the car navigation cooperation information DB 109.
[0032]
Next, the user extraction process in step S13 shown in FIG. 12 will be described in detail.
[0033]
FIG. 13 is a flowchart for explaining the user extraction process. In FIG. 13, in the process of step S <b> 25, the user extraction processing unit 15 extracts the user desired for the input date based on the user information stored in the user information DB 100, and selects the extracted user. Suppose you want to visit. In the process of step S26, the user extraction processing unit 15 determines the visitor's current month based on the user information stored in the user information DB 100 and the monthly usage information stored in the usage information DB 107. If the number of visits exceeds the number of monthly visits used, the visitor is excluded from the target.
[0034]
In the process of step S27, the user extraction processing unit 15 determines that the user's periodic request is “biweekly 1” based on the user information stored in the user information DB 100 and the schedule information stored in the schedule information DB 105. Or “biweekly 2”, if the visit was received on the same day of the week from the schedule information, the visitor is excluded from the target. In the process of step S28, the user extraction processing unit 15 determines that the user's periodic request is “biweekly 2” based on the user information stored in the user information DB 100 and the schedule information stored in the schedule information DB 105. In the case of "", if the visit was received on the same day of the week from the schedule information, the visitor is excluded from the target.
[0035]
Next, the user determination process in step S14 shown in FIG. 12 will be described in detail.
[0036]
FIG. 14 is a flowchart for explaining the user determination process. In FIG. 14, first, in the process of step S <b> 30, the user determination processing unit 16 extracts the user of the time zone No “Z” based on the user information stored in the user information DB 100, and The extractor of No “Z” is assumed. In step S31, the user determination processing unit 16 excludes users with infectious diseases from extractors of the time zone No “Z” based on the user information stored in the user information DB 100. In the process of step S <b> 32, the user determination processing unit 16 sorts the extractors of the time zone No “Z” in descending order of priority based on the visit request information stored in the visit request information DB 104. In the process of step S <b> 33, the user determination processing unit 16 determines whether the priority sorting result is within the number of scheduled operations on the current day, based on the scheduled operation information stored in the scheduled operation information DB 102. If the priority sort result is within the scheduled number of operations on the current day in the process of step S33, the user determination processing unit 16 sets the schedule information as the user of the time zone No “Z” in the process of step S34. Store in the DB 105. In the process of step S35, the user determination processing unit 16 increments the desired visit number of visits and the visit use number by one, and stores the values in the annual hit rate information DB 106. In the process of step S36, the user determination processing unit 16 increments the desired number of visits by 1 and stores the value in the annual hit rate information DB 106.
[0037]
If the priority sort result is not within the scheduled number of operations on the current day in the process of step S33, the user determination processing unit 16 is stored in the user information DB 100 in order to determine the holder in step S37. It is determined whether the priority of the user information is 1. When the priority is 1 in the process of step S37, the user determination processing unit 16 sets the extractor of the time zone No “Z” as the holder in the process of step S38. When the priority is not 1 in the process of step S37, the user determination processing unit 16 sets the extractor of the time zone No “Z” as the remaining person in the process of step S39.
[0038]
Next, the user determination process in step S20 shown in FIG. 12 will be described in detail.
[0039]
FIG. 15 is a flowchart for explaining the user determination process. In FIG. 15, first, in the process of step S <b> 40, the user determination processing unit 16 calculates the scheduled number of vehicles to be operated (M = 1 / N) on the current day based on the operation schedule information stored in the operation schedule information DB 102. calculate. In step S41, the user determination processing unit 16 extracts the user of the time zone No “Z” based on the user information stored in the user information DB 100, and extracts the time zone No “Z”. I will be a person. In the process of step S <b> 42, the user determination processing unit 16 adds the remaining person of the time zone No “Z-1” to the extractor of the time zone No “Z”. In the process of step S43, the user determination processing unit 16 excludes users with infectious diseases from extractors of the time zone No “Z”. In the process of step S44, the user determination processing unit 16 sorts the extractors of the time zone No “Z-1” in descending order of priority based on the visit request information stored in the visit request information DB 104.
[0040]
In the process of step S45, the destination search processing unit 17 performs a process of searching for the next visit destination. The destination search process in step S45 will be described in detail with reference to FIG. In the process of step S46, the user determination processing unit 16 stores the user information stored in the user information DB 100 in order to determine whether the extractor of the time zone No “Z” that has not been dispatched is a holder. It is determined whether or not the priority of is 1. When the priority is 1 in the process of step S46, the user determination processing unit 16 sets the extractor of the time zone No “Z” as the holder in the process of step S48. In step S49, the user determination processing unit 16 increments the desired number of visits by one and stores the value in the annual hit rate information DB 106. When the priority is not 1 in the process of step S46, the user determination processing unit 16 sets the extractor of the time zone No “Z” as the remaining person in the process of step S47.
[0041]
Next, the user determination process in step S21 shown in FIG. 12 will be described in detail.
[0042]
FIG. 16 is a flowchart for explaining the user determination process. In FIG. 16, first, in the process of step S50, the user determination processing unit 16 calculates the planned number of vehicles to be operated (M = 1 / N) on the current day based on the operation schedule information stored in the operation schedule information DB. calculate. In step S51, the user determination processing unit 16 extracts the user of the time zone No “Z” based on the user information stored in the user information DB 100, and extracts the time zone No “Z”. I will be a person. In the process of step S <b> 52, the user determination processing unit 16 adds the remaining person of the time zone No “Z-1” to the extractor of the time zone No “Z”. In step S53, the user determination processing unit 16 extracts users with infectious diseases from the extractor of the time zone No “Z”. In the process of step S54, the user determination processing unit 16 sets the time zone No “Z” based on the user information stored in the user information DB 100 and the infectious disease information stored in the infectious disease information DB 101. Sort extractors in ascending order of infection category.
[0043]
In the process of step S55, the destination search processing unit 17 performs a process of searching for a next visit destination for a user with an infectious disease. The destination search process in step S55 will be described in detail with reference to FIG. In the process of step S56, the user determination processing unit 16 initializes a value (N = N−M / M = 1) related to the planned number of operations. In the processing of step S58, the user determination processing unit 16 determines whether or not the remaining scheduled operation number N is 0 or more. If the remaining scheduled number of operations N is not 0 or more in the process of step S58, the user determination process is terminated. When the remaining scheduled number N of operations is 0 or more in the process of step S58, the destination search processing unit 17 performs a process of searching for the next visit destination in the process of step S59. The destination search process in step S55 will be described in detail with reference to FIG.
[0044]
In the process of step S60, the user determination processing unit 16 determines the user information stored in the user information DB 100 in order to determine whether the extractor of the time zone No “Z” that has not been dispatched is a holder. It is determined whether or not the priority of is 1. When the priority is 1 in the process of step S46, the user determination processing unit 16 sets the extractor of the time zone No “Z” as the holder in the process of step S62. In step S63, the user determination processing unit 16 increments the desired number of visits by 1 and stores the value in the annual hit rate information DB 106. When the priority is not 1 in the process of step S60, the user determination processing unit 16 sets the extractor of the time zone No “Z” as the remaining person in the process of step S61.
[0045]
Next, the destination search process in steps S45 and S59 shown in FIGS. 15 and 16 will be described in detail.
[0046]
FIG. 17 is a flowchart for explaining the destination search process. In FIG. 17, first, in the process of step S <b> 70, the destination search processing unit 17 searches for the next destination in the order of the extracted users. In step S71, the destination search processing unit 17 determines whether there is a user. If there is no user in step S71, the destination search process is terminated. When there is a user in the process of step S71, the destination search processing unit 17 determines whether or not the remaining scheduled operation number N is equal to or more than the scheduled operation number M of the vehicle of the day in the process of step S72. If the remaining operation schedule number N is not equal to or greater than the scheduled operation number M of the vehicle of the day in the process of step S72, the destination search process is terminated. If the remaining scheduled operation number N is equal to or greater than the scheduled operation number M of the car of the day in the process of step S72, the destination search processing unit 17 determines that the predetermined visit destination is the time zone No “Z-1” in the process of step S73. A user is assumed to be an extractor of the time zone No “Z”. In the process of step S74, the user search processing unit 18 performs a process of searching for a user having the shortest distance as viewed from the predetermined visited location. The user search process in step S74 will be described in detail with reference to FIGS.
[0047]
In the process of step S75, the destination search processing unit 17 sets the extractor of the time zone No “Z” as the user. In the process of step S76, the destination search processing unit 17 sorts the extractors of the time zone No “Z” in descending order of priority. In the process of step S77, the destination search processing unit 17 extracts the user with the highest priority from the extractor of the time zone No “Z”. In the process of step S78, the destination search processing unit 17 stores the schedule information in the schedule information DB 105 as a user of the time zone No “Z”. In the process of step S79, the destination search processing unit 17 increments the desired number of visits by 1 and stores the value in the annual hit rate information DB 106. In the process of step S80, the destination search processing unit 17 determines whether it is a desired usage time. If it is the desired usage time in step S80, in step S81, the destination search processing unit 17 increments the desired time visit usage count by 1, and stores the value in the annual hit rate information DB 106. If it is not the desired usage time in the process of step S80, the destination search processing unit 17 increments the desired number of visits by 1 and stores the value in the annual hit rate information DB 106 in the process of step S82. In the process of step S83, the destination search processing unit 17 searches for the next service user, increments the scheduled number of cars M to be operated on that day, and repeats the process from step S71.
[0048]
FIG. 18 is a flowchart for explaining destination search processing for infectious diseases. The destination search process for infectious diseases shown in FIG. 18 is different from the processes of steps S73, S75, and S76 of the destination search process shown in FIG. Hereinafter, steps different from those in FIG. 17 will be described with reference to FIG. First, in the process of step S85, the destination search processing unit 17 sets the predetermined visit destination as the extractor of the time zone No “Z” and sets the user as the user of the time zone No “Z-1”. In the process of step S86, the destination search processing unit 17 sets the user of the time zone No “Z” as a predetermined user. In the process of step S87, the destination search processing unit 17 sorts the users of the time zone No “Z-1” in descending order of priority.
[0049]
Next, the user search process in step S74 shown in FIG. 17 will be described in detail.
[0050]
19 and 20 are flowcharts for explaining the user search process. In FIG. 19, in the process of step S <b> 90, the user search processing unit 18 confirms the coordinates of a predetermined visit destination based on the user information stored in the user information DB 100. In step S91, the user search processing unit 18 sets X as the X coordinate of the predetermined visit destination, Y as the Y coordinate of the predetermined visit destination, the count value as the initial value 1, and the search direction change count value as 0. The number of repetitions is set to 1, the addition value is set to 0, and the search direction is set to vertical. In the process of step S92, the user search processing unit 18 searches for a user having the X and Y coordinates of the user information. In step S93, the user search processing unit 18 determines whether the X and Y coordinates of the searched user match. If the X and Y coordinates match in the process of step S93, the user search process is terminated. If the X and Y coordinates do not match in the process of step S93, the user search processing unit 18 calculates the added value in the process of step S94.
[0051]
In the process of step S95, the user search processing unit 18 determines whether or not the number of repetitions is an even number. When the number of repetitions is not an even number in the process of step S95, the user search processing unit 18 adds 1 to the added value in the process of step S96. When the number of repetitions is an even number in the process of step S95, the user search processing unit 18 subtracts 1 from the added value in the process of step S95. In step S97, the user search processing unit 18 selects an addition source. In step S99, the user search processing unit 18 determines whether the search direction is vertical. When the search direction is not vertical in the process of step S99, the user search processing unit 18 sets X to the value obtained by adding the added value to X in the process of step S101. When the search direction is vertical in the process of step S99, the user search processing unit 18 sets Y to the value obtained by adding the added value to Y in the process of step S100. In step S102, the user search processing unit 18 searches in the same direction for the number of repetitions. In the process of step S103, the user search processing unit 18 determines whether or not the number of repetitions is a count value. If the number of repetitions is not the count value in the process of step S103, the user search processing unit 18 repeats the process from step S92 with the value obtained by adding 1 to the count value as the count value in the process of step S105.
When the number of repetitions is a count value in the process of step S103, the user search processing unit 18 selects the next search direction in the process of step S104. In step S106, the user search processing unit 18 determines whether the search direction is vertical. When the search direction is vertical in the process of step S106, the user search processing unit 18 sets the search direction to horizontal in the process of step S107 shown in FIG. If the search direction is not vertical in the process of step S106, the user search processing unit 18 sets the search direction to vertical in the process of step S108. In step S109, the user search processing unit 18 sets the count value to 0 and the value obtained by adding 1 to the search direction change count value as the search direction change count value. In step S110, the user search processing unit 18 changes the number of repetitions. In the process of step S111, the user search processing unit 18 determines whether or not the search direction change count value is 2. If the search direction change count value is not 2 in the process of step S111, the process from step S105 is executed. When the search direction change count value is 2 in the process of step S111, in step S112, the user search processing unit 18 sets the value obtained by adding 1 to the repeat count as the repeat count, and sets the search direction change count. The value is set to 0 and the processing from step S105 is executed.
[0052]
Next, setting of position information will be described.
[0053]
FIG. 21 is a diagram illustrating a table for setting position information and a screen display example. FIG. 21A shows a table 200 in which position information for a zip code is stored, and FIG. 21B shows a screen 201 for a caregiver to input user position information. In the table 200 of FIG. 21A, the X-axis and Y-axis values are stored for the zip code. For example, the table 200 stores the X-axis “1” and the Y-axis “1” for the postal code “123-1111”. In the screen 201 of FIG. 21B, a postal code input area 202 and an input area 203 for inputting the X axis and the Y axis are displayed. For example, when the postal codes “123-1111” to “123-1999” are input to the input area 202 of the screen 201 and the X axis “1” and the Y axis “1” are input to the input area 203 and set, the table 200 The zip code, X axis, and Y axis are stored. In this way, the caregiver can arbitrarily set and change the position information for the zip code. In addition, by setting the zip code finely, the accuracy of the route verification process can be improved.
[0054]
FIG. 22 is a diagram illustrating a table of user information extracted by the user extraction processing unit. In FIG. 22, a table 210 is a list of user information desired to be visited on a predetermined date and time extracted by the user extraction processing unit 15 in the order of desired time, priority, and user ID. The table 210 shows the user's desired visit day, the user name, the desired visit time desired by the user, the priority of the user, the user ID for identifying the user, and the residence of the user. The X axis and Y axis of the existing district are displayed. For example, the table 210 includes a desired day of the week “Monday”, a user name “Fujitsu Taro”, a time zone No “1”, a priority “1”, a user ID “100”, an X axis “−3”, and a Y axis “ 4 "user information is extracted.
[0055]
FIG. 23 is a diagram for explaining a route formulation method. In the coordinate 30 shown in FIG. 23, the units of the vertical axis and the horizontal axis are arbitrarily set by the caregiver. Coordinates 30 indicate a procedure for searching for the next destination from the residence A where the user resides in the user search processing by the user search processing unit 18 shown in FIGS. 19 and 20. As indicated by the coordinates 30, the user search processing unit 18 repeatedly searches the lattice divided from the residence A by a predetermined unit of the vertical axis and the horizontal axis in the vertical, horizontal (up, down, left, and right) directions into a lattice spiral. Then, the next user who lives in the residence B is extracted.
[0056]
In the user search process, it is also possible to search for the next user in consideration of the moving distance between users. For example, at the coordinate 30 in FIG. 23, the frames (integer values of the coordinates) advanced when detecting the next user are counted in the vertical and horizontal directions. Counting the number of frames on the top and right, using the top and right as a reference (travel distance) ² = (Moving frame up) ² + (Moving frame to the right) ² To calculate the moving distance. When moving from residence A to residence B, it moves 9 frames to the right, 9 frames to the left, 12 frames to the upper, and 9 frames to the lower. The upward direction is 12-9 = 3 frames, the right direction is 9-9 = 0 frames, and the moving distance is 3. In addition, when moving from residence A to residence C, it moves 12 frames to the right, 16 frames to the left, 12 frames to the top, and 16 frames to the bottom. Then, the upward direction 12-16 = -4 frames, the right direction 12-16 = -4 frames, and the movement distance is 5.66. By comparing the movement distances in this way, it is also possible to determine the next user with the shortest distance.
[0057]
FIG. 24 is a diagram showing a table of route search results. Each of the table 220 in FIG. 24A and the table 221 in FIG. 24B indicates the order of the users who visit one vehicle. Tables 220 and 221 are generated by the route search processing unit 19 based on the user extraction table shown in FIG. 22, and are configured with items of order, user ID, and user name. Referring to FIG. 22, first, the users of the desired time zone No. “1” are arranged in order from priority 1 (Fujitsu Taro, Fujitsu Goro, Fujitsu Saburo, Fujitsu Jiro, Fujitsu Shiro). Two users (Taro Fujitsu and Goro Fujitsu) are selected to make a visit with two cars. Accordingly, the user ID “100” and the user name “Taro Fujitsu” are stored in the order “▲ 1 ▼” of the table 220, and the user ID “130” is stored in the order “▲ 1 ▼” of the table 221. ", The user name" Fujitsu Goro "is stored.
[0058]
Next, the users with the time zone No “2” and the users who have not been selected with the time zone No “1” are arranged in order from priority 1 (Fujitsu Rokuro, Fujitsu Jiro, Fujitsu Shiro, Fujitsu Nanao). Of these, two users (Fujitsu Rokuro and Jiro Fujitsu) are selected. The selected two persons are selected by the procedure shown in FIG. 23 for the users who are close to the location visited in the order of “1” in each car. As a result, the user ID “150” and the user name “Jujiro Fujitsu” are stored in the order “▲ 2 ▼” of the table 220, and the user ID “120” is stored in the order “▲ 2 ▼” of the table 221. ", The user name" Fujitsu Rokuro "is stored.
[0059]
Next, the users whose time zone No “2” and time zone No “1” have not been selected are arranged in order from priority 1 (Fujitsu Hachiro, Fujitsu Shiro, and Fujitsu Nanarou in this order). Similarly, two users (Fujitsu Hachiro and Fujitsu Shiro) are selected. Accordingly, the user ID “190” and the user name “Fujitsu Hachiro” are stored in the order “▲ 3 ▼” of the table 220, and the user ID “140” is stored in the order “▲ 3 ▼” of the table 221. ", The user name" Fujitsu Shiro "is stored.
[0060]
Next, the users of the time zone No “3” and the users who are not selected the time zone No “2” are arranged in order from priority 1 (Fujitsu Shichirou followed by Fujitsu Kuro), of which the above processing Similarly, two users (Fujitsu Shichirou and Fujitsu Kukuro) are selected. Accordingly, the user ID “180” and the user name “Fujitsu Kuro” are stored in the order “{circle around (4)]” of the table 220, and the user ID “110” is stored in the order “{circle around (4)}” of the table 221. ", The user name" Fujitsu Shichirou "is stored.
[0061]
Next, the users of the time zone No. “4” are arranged in order of priority from 1 (Fujitsu Juro, Fujitsu Hanako, Fujitsu Hanayo), and two users (Fujitsu Fujitsu) in the same manner as the above processing. Juro and Fujitsu Hanayo) are selected. Accordingly, the user ID “200” and the user name “Fujitsu Kuro” are stored in the order “(5)” of the table 220, and the user ID “210” is stored in the order “(5)” of the table 221. ", The user name" Fujitsu Hanayo "is stored.
[0062]
FIG. 25 is a diagram illustrating a screen display example in which the route search result is displayed in the position information. A screen 225 in FIG. 25 is a diagram in which the position and route of the user are plotted in the position information based on the tables 220 and 221 shown in FIGS. 24 (A) and 24 (B). As shown in the screen 225, the arrow A indicates the route shown in the table 220 in FIG. 24A, and the arrow B shows the route shown in the table 221 in FIG.
[0063]
In this way, based on the coordinate value obtained by mapping the position where the user resides to the coordinate set arbitrarily on the vertical axis and the horizontal axis, the time zone desired to visit, and the priority, By searching for the next user with the shortest distance in a spiral and verifying the visit route, the user can respond to the user's request and decide where to visit efficiently without taking time and effort. Can increase the availability of visits.
[0064]
Further, by setting the coordinate value based on the zip code where the user resides, it becomes possible to efficiently search for the next user at the shortest distance.
(Supplementary note 1) A route development method for formulating a route for visiting users,
A user information management procedure for managing user information having coordinate values obtained by mapping the position where the user resides to coordinates set arbitrarily on the vertical axis and the horizontal axis;
Based on the coordinate value of the user information, a search procedure for searching the next destination in a lattice spiral,
A route determination method comprising: a user determination procedure for determining a next visited user with the shortest distance based on a search result obtained by the search procedure.
(Supplementary Note 2) The user information includes a reservation date and time reserved by the user and a priority indicating a degree of priority visit.
Furthermore, a user information extraction procedure for extracting user information of the predetermined reservation date and time from the user information,
A sorting procedure for arranging the user information extracted by the user information extraction procedure in order from the user information having a high priority,
The route development method according to appendix 1, wherein the search procedure searches for the next visit destination based on the user information arranged in the order of high priority by the sort procedure.
(Supplementary note 3) The route according to Supplementary note 1 or 2, wherein the coordinate value of the user information managed by the user information management procedure is set based on a zip code where the user resides. Formulation method.
(Supplementary note 4) The route formulation according to Supplementary note 2 or 3, wherein the user information extraction procedure is excluded from the extraction target of the user information when the number of visits exceeds a predetermined number of visits or when the visit period is exceeded. Method.
(Additional remark 5) When the said user is an infectious disease, the said sort procedure excludes the said user information from the object arranged in order, The route formulation method as described in any one of Additional remark 2 thru | or 4 characterized by the above-mentioned.
(Additional remark 6) The said user determination procedure determines the user of the next visited place with the shortest distance with respect to the user excluded from the said object, Route preparation of Additional remark 4 or 5 characterized by the above-mentioned Method.
(Additional remark 7) The said user determination procedure determines the user of the next visited place according to the some vehicle which visits the said user, The additional description 1 thru | or 6 characterized by the above-mentioned Route formulation method.
(Supplementary note 8) Any one of Supplementary notes 2 to 7, further comprising a schedule management procedure for managing, as schedule information, information in which the user information is arranged in order from the user information with the highest priority according to the sorting procedure. Route formulation method described in one item.
(Supplementary note 9) Supplementary notes 1 to 3, characterized by having usage information management procedures for managing, as usage information, the number of visits to the user, the number of visits at the reserved time, and the number of visits desired by the user. 8. The route formulation method according to any one of 8.
(Additional remark 10) It has the display procedure which displays the positional information based on the said coordinate value of the said user information of the said user determined by the said user determination procedure, Additional remark 1 thru | or 9 characterized by the above-mentioned. The route formulation method described in any one of the items.
(Appendix 11) A program for causing a computer to perform processing in a route formulation method for formulating a route for visiting a user,
A user information management procedure for managing user information having coordinate values obtained by mapping the position where the user resides to coordinates set arbitrarily on the vertical axis and the horizontal axis;
Based on the coordinate value of the user information, a search procedure for searching the next destination in a lattice spiral,
And a user determination procedure for determining a next visited user with the shortest distance based on a search result obtained by the search procedure.
(Supplementary note 12) A recording medium storing a program for causing a computer to perform processing in a route formulation method for formulating a route for visiting a user,
A user information management procedure for managing user information having coordinate values obtained by mapping the position where the user resides to coordinates set arbitrarily on the vertical axis and the horizontal axis;
Based on the coordinate value of the user information, a search procedure for searching the next destination in a lattice spiral,
A recording medium storing a program, comprising: a user determination procedure for determining a next visited user with the shortest distance based on a search result obtained by the search procedure.
[0065]
【The invention's effect】
As described above, according to the present invention, the user information having coordinate values obtained by mapping the position where the user resides to the coordinates where the units of the vertical axis and the horizontal axis are arbitrarily set is managed and used. By searching the next visit destination in a lattice spiral based on the coordinate value of the visitor information, and determining the next visit destination with the shortest distance based on the search result, without taking time and effort In addition to responding to the user's request, it is possible to determine a destination that can be visited efficiently, and to increase the operating rate of the visit.
[Brief description of the drawings]
FIG. 1 shows a system configuration diagram in a route formulation method according to a first embodiment of the present invention.
FIG. 2 is a diagram showing a table stored in a user information DB.
FIG. 3 is a diagram showing a table stored in an infectious disease information DB.
FIG. 4 is a diagram showing a table stored in an operation schedule information DB.
FIG. 5 is a diagram showing a table stored in a visit time zone information DB.
FIG. 6 is a diagram showing a table stored in a visit request information DB.
FIG. 7 is a diagram showing a table stored in a schedule information DB.
FIG. 8 is a diagram showing a table stored in an annual hit rate information DB.
FIG. 9 is a diagram showing a table stored in a usage information DB.
FIG. 10 is a diagram showing a table stored in a map information system plot information DB.
FIG. 11 is a diagram showing a table stored in a car navigation linkage information DB.
FIG. 12 is a flowchart for explaining route formulation processing;
FIG. 13 is a flowchart for explaining user extraction processing;
FIG. 14 is a flowchart for explaining user determination processing;
FIG. 15 is a flowchart for explaining user determination processing;
FIG. 16 is a flowchart for explaining user determination processing;
FIG. 17 is a flowchart for explaining destination search processing;
FIG. 18 is a flowchart for explaining destination search processing for infectious diseases.
FIG. 19 is a flowchart for explaining user search processing;
FIG. 20 is a flowchart for explaining user search processing;
FIG. 21 is a diagram illustrating a table for setting position information and a screen display example.
FIG. 22 is a diagram showing a screen display example of schedule information.
FIG. 23 is a diagram for explaining a route formulation method;
FIG. 24 is a diagram illustrating a table of route search results.
FIG. 25 is a diagram illustrating a screen display example in which a route search result is displayed in position information.
[Explanation of symbols]
10 Route development system
11 Installer
12 Display control processing unit
13 Communication control processing unit
14 Input / output control processor
15 User extraction processing section
16 User decision processing section
17 Destination search processing part
18 User Search Processing Department
19 Route verification processing section
100 User information DB
101 Infectious disease information DB
102 Operation schedule information DB
103 Visiting time zone information DB
104 Visit request information DB
105 Schedule information DB
106 Annual Hit Rate Information DB
107 Usage information DB
108 Map information system plot information DB
109 Car navigation linkage information DB

Claims (3)

A route development method for developing a route for visiting users,
Stored in a user information DB that stores user information having coordinate values obtained by mapping the location where the visiting user resides to coordinates where the units of the vertical axis and horizontal axis are arbitrarily set. Based on the coordinate values thus obtained, a search procedure for searching for the next user's visit destination from one user by tracing the lattice divided in predetermined units of the vertical axis and the horizontal axis spirally ;
Based on the search result by the search procedure, the root development method and executes the user determination procedure for determining the shortest distance next visited user from the one user. The computer stores the user information stored in the user information DB, as well as the user's visit request stored in the visit request information DB in which the user's desired visit date and time and visit priority information are stored. Further executing a user information extraction procedure for extracting user information of a predetermined date and time based on the date and time and visit priority information ;
2. The route formulation method according to claim 1, wherein the search procedure searches for a next visit destination based on the user information extracted by the user information extraction procedure . A route development program that develops a route for visiting users,
Stored in a user information DB that stores user information having coordinate values obtained by mapping the location of the visiting user to the coordinates where the units of the vertical axis and the horizontal axis are arbitrarily set on the computer. Based on the coordinate values thus obtained, a search procedure for searching for the next user's visit destination from one user by tracing the lattice divided in predetermined units of the vertical axis and the horizontal axis spirally;
A route planning program for executing a user determination procedure for determining a user at a next visit destination having the shortest distance from the one user based on a search result obtained by the search procedure .

Images