How to create a visit schedule
The visit schedule creation method optimizes caregiver allocation and reassignment based on location and priority, addressing increased complexity and cost issues in creating efficient visit schedules.
Patent Information
- Application Number
- JP2023514304
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2021-04-16
- Publication Date
- 2025-01-17
- Estimated Expiration
- 2041-04-16
AI Technical Summary
The increasing complexity of visit schedules due to a growing number of care recipients and a shortage of caregivers and nurses leads to higher calculation costs in creating efficient visit schedules.
A visit schedule creation method that assigns caregivers based on location information, calculates priority levels for users, and reallocates assignments to resolve conflicts, using a device with an allocation, calculation, and reassignment unit to optimize the schedule.
This approach reduces calculation costs by efficiently allocating caregivers to users while minimizing conflicts, allowing for cost-effective implementation even with limited resources.
Smart Images

Figure 0007616356000004 
Figure 0007616356000005 
Figure 0007616356000006
Abstract
Description
[Technical field]
[0001] The present invention relates to a visiting schedule creating method, a visiting schedule creating device, and a program. [Background technology]
[0002] In recent years, the elderly population has increased, and the number of elderly people who need nursing care has also increased. The need for home nursing care has also increased, and service providers are visiting each home. For this reason, service providers need to create a visiting schedule so that they can visit each home efficiently. For example, in Patent Document 1, a visiting plan is created taking into account the home location of the person to be visited. [Prior art documents] [Patent documents]
[0003] [Patent Document 1] JP 2017-126136 A Summary of the Invention [Problem to be solved by the invention]
[0004] However, in recent years, the population of care recipients has increased, and the number of caregivers and nurses who visit is also insufficient, making visiting schedules more complicated. As a result, the calculation costs for creating visiting schedules have increased.
[0005] Therefore, an object of the present invention is to provide a visiting schedule creating method capable of solving the above-mentioned problem of increased calculation costs when creating a visiting schedule. [Means for solving the problem]
[0006] A method for creating a visiting schedule according to one embodiment of the present invention includes the steps of: creating a visit schedule in which the visitor assigns the visited person to be visited by the visitor based on the location information of the visitor and the visited person; Calculating a priority level representing a priority level assigned to the visitor relative to the visited person based on the location information; creating the visit schedule in which the allocation of the visited persons to the visitors is changed based on the priority; The structure is as follows.
[0007] In addition, a visiting schedule creation device according to one embodiment of the present invention includes: an allocation unit that creates a visit schedule in which the visitor allocates the visited person to be visited by the visitor based on location information of the visitor and the visited person; a calculation unit that calculates a priority level representing a priority level assigned to the visitor with respect to the visited person based on the location information; a reallocation unit that creates the visiting schedule in which the allocation of the visited persons to the visitors is changed based on the priority; Equipped with The structure is as follows.
[0008] In addition, a program according to one aspect of the present invention includes: On the computer, creating a visit schedule in which the visitor assigns the visited person to be visited by the visitor based on the location information of the visitor and the visited person; Calculating a priority level representing a priority level assigned to the visitor relative to the visited person based on the location information; creating the visit schedule in which the allocation of the visited persons to the visitors is changed based on the priority; Execute the process, The structure is as follows. Effect of the Invention
[0009] By being configured as described above, the present invention can reduce the calculation cost required for creating a visiting schedule. [Brief description of the drawings]
[0010] [Figure 1] 1 is a block diagram showing a configuration of a visiting schedule creation device according to a first embodiment of the present invention. [Diagram 2] 2 is a diagram showing an example of data processed by the visiting schedule creation device disclosed in FIG. 1. [Diagram 3] 2 is a diagram showing data processing by the visiting schedule creation device disclosed in FIG. 1. [Figure 4] 2 is a diagram showing data processing by the visiting schedule creation device disclosed in FIG. 1. [Diagram 5] 2 is a diagram showing data processing by the visiting schedule creation device disclosed in FIG. 1. [Figure 6] 2 is a diagram showing data processing by the visiting schedule creation device disclosed in FIG. 1. [Figure 7] 4 is a flowchart showing the operation of the visiting schedule creation device disclosed in FIG. 1. [Figure 8] FIG. 11 is a block diagram showing a hardware configuration of a visiting schedule creation device according to a second embodiment of the present invention. [Figure 9] FIG. 11 is a block diagram showing the configuration of a visiting schedule creation device according to a second embodiment of the present invention. [Figure 10] 10 is a flowchart showing the operation of the visiting schedule creation device in the second embodiment of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0011] <Embodiment 1> A first embodiment of the present invention will be described with reference to Fig. 1 to Fig. 7. Fig. 1 and Fig. 2 are diagrams for explaining the configuration of a visiting schedule creation device, and Fig. 3 to Fig. 7 are diagrams for explaining the processing operation of the visiting schedule creation device.
[0012] [composition] The visit schedule creation device 10 of the present invention is a system for creating a schedule for caregivers to visit each home of a care recipient when a business operator provides a home care service. In particular, the visit schedule creation device 10 is configured to create a visit schedule that allows each of a plurality of caregivers to efficiently visit a plurality of care recipients. Note that the visit schedule created by the visit schedule creation device 10 of the present invention is not necessarily limited to a schedule for a caregiver to visit a care recipient. For example, the visit schedule created by the visit schedule creation device 10 may be any visit schedule, such as a schedule for a doctor or nurse (visitor) to visit a patient (visited), a schedule for a worker (visitor) who repairs and maintains office equipment to visit an equipment manager (visited) in each office, or a schedule for a delivery person (visitor) to visit the home of a person (visited) to whom a package is to be delivered.
[0013] The visiting schedule creation device 10 is composed of one or more information processing devices each having a calculation device and a storage device. As shown in FIG. 1, the visiting schedule creation device 10 is equipped with an allocation unit 11, a calculation unit 12, and a reallocation unit 13. The functions of the allocation unit 11, the calculation unit 12, and the reallocation unit 13 can be realized by the calculation device executing a program for realizing each function stored in the storage device. The visiting schedule creation device 10 is also equipped with a visit data storage unit 14. The visit data storage unit 14 is composed of a storage device. Each component will be described in detail below.
[0014] The visit data storage unit 14 stores visit data, which is information on the caregiver who is the visitor, and the user who is the visited person who receives the visit and care from the caregiver by using the home care service. The visit data will be described in detail below, but the contents of the visit data are set in advance by the business operator, the caregiver, the user, and even the user's family. The visit data is input and stored in the visit schedule creation device 10 by an operator of the business operator, for example, or input and stored in the visit schedule creation device 10 by the caregiver, the user, or the user's family via a network.
[0015] The visit data includes an initial area (location information) representing the location where the caregiver starts the visit as data of the caregiver. For example, the initial area of the caregiver may be the business office to which the caregiver belongs or the caregiver's home, but may be any location. The initial area may be calculated and set by the visit schedule creation device 10 according to the addresses of multiple users, as described later. In this embodiment, for the sake of simplicity, the initial area is represented by two-dimensional coordinates as shown in FIG. 2(1). As an example, the example in FIG. 2(1) shows a case where the initial area of caregiver A is (2,4) and the initial area of caregiver B is (4,2). When the initial areas of caregivers A and B are illustrated on a map, they are represented, for example, as shown in FIG. 2(3).
[0016] The visit data also includes, as data of the user, an address (location information) indicating the location where the caregiver will visit. For example, the address of the user may be the user's home or the facility where the user resides, but may be any location. In this embodiment, for the sake of simplicity, the addresses are represented by two-dimensional coordinates as shown in FIG. 2(2). As an example, the example of FIG. 2(2) shows a case where the address of user 1 is (1,4), the address of user 2 is (3,5), the address of user 3 is (2,3), the address of user 4 is (4,1), and the address of user 5 is (5,2). If the addresses of users 1 to 5 are illustrated on a map, they will be represented, for example, as shown in FIG. 2(3).
[0017] The visit data also includes, as data of the users, a start time (scheduled visit time) indicating the scheduled time when the caregiver visits the user and starts home care, and a work time (scheduled stay time) indicating the scheduled time when the caregiver visits the user and stays at the visit location to perform care work. As an example, the example in FIG. 2(2) shows a case where the start time of user 1 is 9:00, the work time is 30 minutes, the start time of user 2 is 10:15, the work time is 60 minutes, the start time of user 3 is 11:00, the work time is 30 minutes, the start time of user 4 is 9:00, the work time is 60 minutes, and the start time of user 5 is 9:45, the work time is 30 minutes.
[0018] Although not shown, the visit data may include attribute information that indicates the attributes of the caregiver and the user, and association information that indicates the association between the caregiver and the user. For example, the attribute information for the caregiver is information such as the nursing qualifications and specialty fields held by the caregiver, and the care status of the user that the caregiver can handle, and for the user, the attribute information is information such as the qualifications and specialty fields of the caregiver who can handle the care of the user, and the care status. In addition, for example, the association information is information that associates the caregiver with the user, and includes, for example, association information between the caregiver and the user that the caregiver is scheduled to take care of, association information between the caregiver and the user that the caregiver has cared for in the past, association information between the caregiver and the user who wishes to be cared for by the caregiver, and the like.
[0019] The allocation unit 11 first creates a visit schedule in which each caregiver is assigned a user to be visited by the caregiver based on the visit data stored in the visit data storage unit 14. Specifically, the allocation unit 11 calculates the distance to the address of each user for each caregiver's initial area, and assigns each user to the caregiver who is closest in distance. That is, in the example of FIG. 2, by assigning each user 1 to 5 to the caregiver A or B who is closest in distance, users 1, 2, and 3 are assigned to caregiver A, and users 4 and 5 are assigned to caregiver B, as shown in FIG. 3(1). At this time, the visit schedule illustrated including the start time and work time of each user is shown in FIG. 3(2). In FIG. 3(2), caregiver A is shown in the upper row, caregiver B is shown in the lower row, time is shown on the horizontal axis, and the work time of each user assigned to each caregiver is illustrated by a solid line along the time direction. Note that the allocation unit 11 may assign users using the initial areas of caregivers A and B included in the visit data in advance. The allocation unit 11 may also set initial areas for caregivers A and B based on the addresses of users included in advance in the visit data, and allocate users using the initial areas. For example, the allocation unit 11 may set the center of addresses of multiple users who are close to each other as the initial area for the caregivers.
[0020] The calculation unit 12 checks whether there is a conflict between users assigned to a caregiver in the visit schedule created by the allocation unit 11 as described above. For example, the calculation unit 12 determines that there is a conflict when multiple users are assigned to the same caregiver at the same time, that is, when at least a part of the time from the start time to the end of the work of multiple users assigned to one caregiver overlaps. As an example, in the visit schedule created as shown in FIG. 3(2), for caregiver A, a part of the work time of user 2 and user 3 overlaps at the same time, so it is determined that there is a conflict between user 2 and user 3. In addition, for caregiver B, a part of the work time of user 4 and user 5 overlaps at the same time, so it is determined that there is a conflict between user 4 and user 5.
[0021] When the calculation unit 12 determines that there is a competition between users for the same caregiver, it calculates a priority indicating the priority of visits to each of the users assigned to the caregiver with whom there is a competition. For example, the calculation unit 12 calculates a higher priority as the travel time when the caregiver visits the user and the free time until the caregiver starts care for the user are shorter.
[0022] Specifically, the calculation unit 12 first calculates a score that is the basis of the priority. Here, if the score of user b for caregiver a is represented as s(a,b), s(a,b) is calculated by adding the "travel distance from the location of caregiver a to the location of user b" and the "travelable distance from the end time of caregiver a's home care of the previous user to the start time of caregiver a's home care of user b." At this time, the above-mentioned "travelable distance" can be calculated by multiplying a preset travel speed by the free time calculated by subtracting the end time, which is the time obtained by adding the work time to the start time of the other user visited earlier by caregiver a, from the start time of user b. As described above, the "travel distance from the location of caregiver a to the location of user b" and the "travel distance until the start time of home care by caregiver a for user b" calculated when calculating the score are divided by the preset travel speed of caregiver a, which represent the "travel time" and "free time" of caregiver a, respectively, and the score s(a,b) is equal to the sum of the "travel time" and "free time." Specifically, the score s(a,b) is calculated using the following formula 1.
[0023]
number
[0024] When calculating the scores for user 2 and user 3 for caregiver A using the above formula 1, caregiver A moves to user 2 or user 3 after completing the home care visit for user 1, so the location and end time of caregiver A can be expressed as the location and end time of user 1. Therefore, the scores for user 2 and user 3 for caregiver A are represented by s(user 1, user 2) and s(user 1, user 3), respectively, and are the values calculated using the following formulas 2 and 3. As an example, the travel time of caregiver A is assumed to be 30 km / h.
[0025]
number
[0026]
number
[0027] The calculation unit 12 may treat the smaller the score value as the higher the priority, and may set the score value as the priority as it is, or may further calculate the priority from the score. For example, the calculation unit 12 may calculate the ranking of the scores of users for the same caregiver from the smallest value as the priority value. In other words, in this case, the lower the priority value, the higher the priority.
[0028] In the above example, since the score of user 2 is smaller than the score of user 3, the priority of user 2 is calculated to be a higher value than the priority of user 3. Similarly, when the scores of users 4 and 5 for caregiver B are calculated using the above formula 1, the score of user 4 is smaller than the score of user 5, so the priority of user 4 is calculated to be a higher value than the priority of user 5.
[0029] The calculation unit 12 is not necessarily limited to calculating the priority as described above. For example, the calculation unit 12 may calculate the priority of the user relative to the caregiver based on attribute information representing the attributes of the caregiver and the user, and association information representing the association between the caregiver and the user, which are stored as visit data. As an example, the attribute information is assumed to be information such as the qualifications and specialty fields possessed by the caregiver, the care state of the user that the caregiver can handle, and the care state of the user. In this case, if the qualifications and specialty fields included in the attribute information of the caregiver and the care state that is the attribute information of the user have a preset correspondence relationship, for example, if it is preset that the care state of the user should be handled by a caregiver with a specific qualification or specialty field, the calculation unit 12 may calculate the score calculated as described above by weighting it to a lower value. In addition, as an example, the association information is assumed to be information corresponding to the caregiver and the user for whom the caregiver is decided to be in charge, information corresponding to the caregiver and the user who the caregiver has cared for in the past, information corresponding to the caregiver and the user who wishes to be cared for by the caregiver, and the like. In this case, when a user is associated with a caregiver, the calculation unit 12 may weight the score calculated as described above to a lower value. As a result, when a caregiver and a user are associated with each other by attribute information, association information, or the like, the score of the user is calculated to be low, and the priority is calculated to be high.
[0030] The reallocation unit 13 changes the allocation of users 1 to 5 to each of the caregivers A and B based on the priority calculated as described above, and creates a visiting schedule again. Specifically, the reallocation unit 13 first allocates the highest priority user among the competing users to each of the caregivers A and B, and rejects the allocation of the other users, thereby resolving the conflict. For example, as shown by the solid and dotted lines in FIG. 3(3), for the caregiver A, first, the allocation of user 1 is left as is, and among the competing users 2 and 3, the user 2 with the higher priority is allocated, and the allocation of user 3 with the lower priority is released. Also, for the caregiver B, as shown by the solid and dotted lines in FIG. 3(3), the allocation of user 4 with the higher priority is allocated among the competing users 4 and 5, and the allocation of user 5 with the lower priority is released.
[0031] Then, the reallocation unit 13 leaves the allocation of the users 1, 2, and 4 assigned to each of the caregivers A and B as is, and reassigns the users 3 and 5 whose allocation to the caregivers has been released to the caregivers. At this time, the reallocation unit 13 first changes the initial area of each of the caregivers A and B according to the location of the users who remain assigned. For example, as shown in FIG. 4(1), the reallocation unit 13 changes the initial area of the caregiver A to the midpoint between the addresses of the users 1 and 2 who remain assigned, and changes the initial area of the caregiver B to the address of the user 4 who remains assigned. Then, the reallocation unit 13 calculates the distance to the addresses of the users 3 and 5 whose allocation has been released from the initial area of each of the caregivers A and B, and reassigns the users 3 and 5 to the caregivers A and B based on the distance. At this time, the reallocation unit 13 may assign the users 3 and 5 whose allocation has been released to a caregiver different from the caregiver before the release, regardless of the distance between the caregiver and the user. For example, in the example of FIG. 4(1), user 5 is newly assigned to caregiver A, and user 3 is newly assigned to caregiver B. In this way, the reallocation unit 13 assigns users 1, 5, and 2 to caregiver A, and users 4 and 3 to caregiver B, as shown in FIG. 4(2). Note that FIG. 4(2) shows a visiting schedule that takes into account the start time and working time of each user. Note that in FIG. 4(1), the solid arrows indicate the movement of caregiver A, and the dotted arrows indicate the movement of caregiver B.
[0032] Here, the calculation unit 12 described above will be further explained. The calculation unit 12 checks whether there is a conflict between the users assigned to the caregiver for the visit schedule created by the reallocation unit 13 described above, in the same manner as described above, and calculates the priority of the user with the conflict. Specifically, in the case of the visit schedule of FIG. 4(2), since the user 5 and the user 2 are assigned to the caregiver A at the same time, it is determined that there is a conflict between the user 5 and the user 2, while it is determined that there is no conflict for the caregiver B. Therefore, the calculation unit 12 calculates the priority of each of the users 5 and 2 who compete for the caregiver A. Note that the calculation unit 12 checks again whether there is a conflict for the users whose allocation was not released by the reallocation unit 13 described above, and calculates the priority of the user with the conflict.
[0033] Then, the reallocation unit 13 changes the allocation of users 1 to 5 to each of caregivers A and B based on the recalculated priorities in the same manner as described above, and creates a new visit schedule. Specifically, in the visit schedule of FIG. 4(2), the reallocation unit 13 allocates user 5, who has a higher priority, among users 5 and 2 competing for caregiver A, as shown by the solid and dotted lines in FIG. 4(3), and releases the allocation of user 2, who has a lower priority. Then, the reallocation unit 13 allocates user 2, whose allocation has been released, to another caregiver B. At this time, the reallocation unit 13 may change the initial area of the caregiver and perform reallocation based on the initial area, as described above.
[0034] As described above, the calculation unit 12 and the reallocation unit 13 repeat the above-mentioned process until there is no longer any contention between the users allocated to all the caregivers.
[0035] [Operation] Next, the operation of the above-mentioned visiting schedule creation device 10 will be described mainly with reference to the location information and visiting schedules shown in FIGS. 2 to 6, and the flowchart in FIG.
[0036] First, the visit schedule creation device 10 sets the initial area of each caregiver based on the visit data stored in the visit data storage unit 14 (step S1). For example, the visit schedule creation device 10 may directly use the initial area of each caregiver pre-stored in the visit data as shown in Fig. 2, or may set the center of the addresses of any multiple users as the initial area of a given caregiver.
[0037] Next, the visit schedule creation device 10 calculates the distance to the address of each user for each caregiver's initial area, and assigns each user to the caregiver who is closest in distance (step S2). For example, in the case of the visit data shown in Fig. 2, the visit schedule creation device 10 assigns each user 1 to 5 to the caregiver A or B who is closest in distance, thereby assigning users 1, 2, and 3 to caregiver A, and users 4 and 5 to caregiver B, as shown in Fig. 3(1). Then, the visit schedule creation device 10 creates a visit schedule in which the start time and work time of each user are set, as shown in Fig. 3(2).
[0038] Next, the visit schedule creation device 10 checks whether there is a conflict between users assigned to caregivers in the visit schedule created as described above (step S3). For example, the visit schedule creation device 10 determines that there is a conflict when multiple users are assigned to the same caregiver at the same time, that is, when the work times of multiple users assigned to one caregiver overlap from the start time. For example, in the visit schedule shown in FIG. 3(2), the visit schedule creation device 10 determines that there is a conflict between users 2 and 3 because users 2 and 3 are assigned to caregiver A at the same time, and determines that there is a conflict between users 4 and 5 because users 4 and 5 are assigned to caregiver B at the same time.
[0039] Then, when the visit schedule creation device 10 determines that there is a competition between users for the same caregiver (Yes in step S3), it calculates a priority indicating the priority of visits to each of the users with whom there is a competition assigned to the caregiver (step S4). At this time, the visit schedule creation device 10 calculates the priority so that the shorter the sum of the travel time when the caregiver visits the user and the free time until the caregiver starts caring for the user, the higher the priority. Note that the visit schedule creation device 10 may calculate the priority of users who correspond to the caregiver by weighting it higher based on attribute information indicating the attributes of the caregiver and the user and association information indicating the association between the caregiver and the user.
[0040] In the visiting schedule shown in FIG. 3(2), the visiting schedule creation device 10 assigns user 2 as a priority to caregiver A, as shown by the solid line in FIG. 3(3), because the priority of user 2 is higher than that of user 3, and releases the assignment of user 3, as shown by the dotted line in FIG. 3(3). Note that user 1, who does not conflict with caregiver A, is left assigned as is. Similarly, in the visiting schedule shown in FIG. 3(2), the visiting schedule creation device 10 assigns user 4 as a priority to caregiver B, as shown by the solid line in FIG. 3(3), because the priority of user 4 is higher than that of user 5, and releases the assignment of user 5, as shown by the dotted line in FIG. 3(3). In this way, the visiting schedule creation device 10 resolves the conflict between users in the visiting schedule (step S5).
[0041] Next, when there is a user who is not assigned to a caregiver due to the release of the assignment as described above, the visit schedule creation device 10 leaves the assignments of users 1, 2, and 4 assigned to each of caregivers A and B in the initially created visit schedule as they are, and reassigns users 3 and 5 whose assignment to a caregiver has been released to a caregiver (Yes in step S6). At this time, the visit schedule creation device 10 changes the initial area of each of caregivers A and B according to the positions of the users who remain assigned (step S7). For example, as shown in FIG. 4(1), the visit schedule creation device 10 changes the initial area for caregiver A to a midpoint between the positions of users 1 and 2 who remain assigned, and changes the initial area for caregiver B to the position of user 4 who remains assigned. It is not necessary to change the initial area.
[0042] Then, the visit schedule creation device 10 calculates the distance to the address of each of the released users 3 and 5 for the initial area of each of the caregivers A and B, and reassigns each of the users 3 and 5 to the caregivers A and B based on the distance (step S2). At this time, the visit schedule creation device 10 may assign the released users 3 and 5 to a caregiver different from the caregiver before the assignment was canceled, regardless of the distance between the caregiver and the user. For example, in the example of FIG. 4(1), the visit schedule creation device 10 newly assigns user 5 to caregiver A and newly assigns user 3 to caregiver B. In this way, the visit schedule creation device 10 creates a visit schedule in which users 1, 5, and 2 are assigned to caregiver A, and users 4 and 3 are assigned to caregiver B, as shown in FIG. 4(2).
[0043] Next, the visit schedule creation device 10 checks whether there is a conflict between the users assigned to the caregiver in the visit schedule created again as described above (step S3). For example, in the visit schedule shown in Fig. 4(2), the visit schedule creation device 10 determines that there is a conflict between the users 5 and 2 because the users 5 and 2 are assigned to the caregiver A at the same time.
[0044] Then, when the visiting schedule creation device 10 determines that a user conflict has occurred for the same caregiver (Yes in step S3), it calculates a priority indicating the priority of visits for each of the users with whom the conflict has occurred and which have been assigned to that caregiver (step S4). Then, in the visiting schedule shown in FIG. 4(2), the visiting schedule creation device 10 assigns user 5 with priority as shown by the solid line in FIG. 4(3) for caregiver A, since the priority of user 5 is higher than the priority of user 2, and releases the assignment of user 2 as shown by the dotted line in FIG. 4(3). In this way, the visiting schedule creation device 10 resolves the user conflict in the visiting schedule (step S5).
[0045] Next, if there is a user who is not assigned to a caregiver due to the release of the assignment as described above, the visit schedule creation device 10 reassigns the user 2 whose assignment to the caregiver has been released to a caregiver (Yes in step S6). At this time, the visit schedule creation device 10 may change the initial areas of each of the caregivers A and B according to the location of the user who remains assigned (step S7), but it is not necessary to change them.
[0046] Then, the visit schedule creation device 10 reallocates the user 2 whose allocation has been released as described above (step S2). In this case, the visit schedule creation device 10 assigns the released user 2 to caregiver B, who is different from caregiver A before the release, as shown in Fig. 5 (1). In this way, the visit schedule creation device 10 creates a visit schedule in which users 1 and 5 are assigned to caregiver A, and users 4, 2, and 3 are assigned to caregiver B, as shown in Fig. 5 (2).
[0047] Next, the visit schedule creation device 10 checks whether or not there is a conflict between the users assigned to the caregiver in the visit schedule created again as described above (step S3). For example, in the visit schedule shown in Fig. 5(2), the visit schedule creation device 10 determines that there is a conflict between the users 2 and 3 because the users 2 and 3 are assigned to the caregiver B at the same time.
[0048] Then, when the visiting schedule creation device 10 determines that a user conflict has occurred for the same caregiver (Yes in step S3), it calculates a priority indicating the priority of visits for each of the users with whom the conflict has occurred and which have been assigned to that caregiver (step S4). Then, since the priority of user 2 for caregiver B in the visiting schedule shown in Fig. 5(2) is higher than the priority of user 3, the visiting schedule creation device 10 preferentially assigns user 2 as shown by the solid line in Fig. 5(3) and cancels the assignment of user 3 as shown by the dotted line in Fig. 5(3). In this way, the visiting schedule creation device 10 resolves the user conflict in the visiting schedule (step S5).
[0049] Next, if there is a user who is not assigned to a caregiver due to the release of the assignment as described above, the visit schedule creation device 10 reassigns the user 3 whose assignment to the caregiver has been released to a caregiver (Yes in step S6). At this time, the visit schedule creation device 10 may change the initial area of each of the caregivers A and B according to the location of the user who remains assigned (step S7), or may not change it.
[0050] Then, the visit schedule creation device 10 reallocates the user 3 whose allocation has been released as described above (step S2). In this case, the visit schedule creation device 10 assigns the released user 3 to caregiver A, who is different from caregiver B before the release, as shown in FIG. 6(1). In this way, the visit schedule creation device 10 creates a visit schedule in which users 1, 5, and 3 are assigned to caregiver A, and users 4 and 2 are assigned to caregiver B, as shown in FIG. 6(2). Then, in the created visit schedule, all users are assigned to all caregivers, and the conflict between the users is resolved (No in step S3), and the visit schedule creation device 10 ends the creation of the visit schedule.
[0051] As described above, in this embodiment, the visit schedule creation device 10 first creates a visit schedule by simultaneously assigning all users to one of the caregivers using the location information of the caregiver who will be a visitor and the user who will be a visitee. After that, when there is a conflict in that multiple users are assigned to the same caregiver at the same time, the visit schedule creation device 10 calculates the priority of the competing users and creates a visit schedule in which the users are reallocated based on the priority. In this way, the visit schedule creation device 10 first assigns all users at once, and then calculates and reallocates the priority of only the competing users, thereby reducing calculation costs. In other words, the visit schedule creation device 10 can create a visit schedule even on a computer with small resources, so the introduction cost of the system can be reduced.
[0052] After that, the visit schedule creation device 10 may output the created visit schedule to be notified to the operator of the business, the caregivers A and B, the users 1 to 5 receiving care, and their families. For example, the visit schedule creation device 10 may transmit information on the visit schedule as shown in FIG. 6(2) to the addresses of the information processing terminals (smartphones, tablet terminals, personal computers, etc.) operated by the operator of the business, the caregivers A and B, the users 1 to 5, and their families that are registered in advance. At this time, the contents of the visit schedule to be transmitted may include the schedules of all caregivers for the operator of the business, may include only their own schedule for the caregivers A and B, and may include only their own schedule (visiting caregivers and time) for the users 1 to 5 and their families. In this way, the operator, the caregivers A and B, the users 1 to 5, and their families can check their own care plans by displaying the visit schedule on the display device of the information processing terminal.
[0053] In addition, the caregivers A and B and the users 1 to 5 may then notify the business operator of information that they wish to change the visiting schedule. In this case, the visiting schedule creation device 10 receives the change request information transmitted from the information processing terminals of the caregivers A and B and the users 1 to 5, and notifies the operator by transmitting the information to the operator's information processing terminal or displaying it on a display device. Then, the visiting schedule creation device 10 may perform a process to further change the visiting schedule in response to the operator's operation based on the change request information, and output the changed visiting schedule to the caregivers A and B and the users 1 to 5, etc. Note that the visiting schedule creation device 10 may automatically perform a process to change the visiting schedule in response to the change request information, regardless of the operator's operation. For example, the visiting schedule creation device 10 may assign the user who has requested the change from the caregiver before the change to another caregiver, while assigning the remaining users to each caregiver in the same manner as described above, and then perform conflict resolution in the same manner as described above to create a final visiting schedule.
[0054] <Embodiment 2> Next, a second embodiment of the present invention will be described with reference to Fig. 8 to Fig. 10. Fig. 8 to Fig. 9 are block diagrams showing the configuration of a visiting schedule creation device in the second embodiment, and Fig. 10 is a flowchart showing the operation of the visiting schedule creation device. Note that this embodiment shows an outline of the configuration of the visiting schedule creation device and visiting schedule creation method explained in the above-mentioned embodiments.
[0055] First, the hardware configuration of the visiting schedule creation device 100 in this embodiment will be described with reference to Fig. 8. The visiting schedule creation device 100 is configured as a general information processing device, and is equipped with the following hardware configuration, as an example. ·CPU(Central Processing Unit)101(Arithmetic unit) ROM (Read Only Memory) 102 (storage device) RAM (Random Access Memory) 103 (storage device) · Programs 104 loaded into RAM 103 A storage device 105 for storing a program group 104 A drive device 106 that reads and writes data from a storage medium 110 external to the information processing device A communication interface 107 for connecting to a communication network 111 outside the information processing device Input / output interface 108 for inputting and outputting data Bus 109 connecting each component
[0056] The visit schedule creation device 100 can be equipped with the allocation unit 121, the calculation unit 122, and the reallocation unit 123 shown in FIG. 9 by the CPU 101 acquiring the program group 104 and executing it. The program group 104 and the visit data used to create the visit schedule are stored in the storage device 105 or the ROM 102 in advance, for example, and the CPU 101 loads the program group 104 into the RAM 103 and executes it as necessary. The program group 104 and the visit data may be supplied to the CPU 101 via the communication network 111, or may be stored in the storage medium 110 in advance, and the drive device 106 reads out the program and supplies it to the CPU 101. Only a part of the already stored visit data may be supplied via the communication network 111 and modified. However, the above-mentioned allocation unit 121, calculation unit 122, and reallocation unit 123 may be constructed with dedicated electronic circuits for realizing such means.
[0057] 8 shows an example of the hardware configuration of the information processing device that is the visiting schedule creation device 100, and the hardware configuration of the information processing device is not limited to the above-mentioned case. For example, the information processing device may be configured with a part of the above-mentioned configuration, such as not having the drive device 106.
[0058] The visiting schedule creation device 100 executes the visiting schedule creation method shown in the flowchart of FIG. 10 by the functions of the allocation unit 121, the calculation unit 122, and the reallocation unit 123, which are constructed by the program as described above.
[0059] As shown in FIG. 10, the visiting schedule creation device 100 A visit schedule is created in which the visitor and the visited person to be visited by the visitor are assigned to the visitor based on the location information of the visitor and the visited person (step S101); A priority level indicating a priority level assigned to the visitor relative to the visited person is calculated based on the location information (step S102); creating the visiting schedule in which the allocation of the visited persons to the visitors is changed based on the priority (step S103); The following process is executed.
[0060] The visit schedule creation device 100, configured as described above, first creates a visit schedule by simultaneously assigning all visited visitors to one of the visitors using the location information of the visitor and visited visitors. After that, the visit schedule creation device 100 calculates the priority of the visited visitors assigned to the visitors, and creates a visit schedule in which the visited visitors are reallocated based on the priority. In this way, the visit schedule creation device 100 simultaneously assigns visited visitors, then calculates the priority of the visited visitors and reallocates them, thereby reducing calculation costs. In other words, the visit schedule creation device 100 can be run on a computer with small resources, and therefore the introduction costs of the system can also be reduced.
[0061] The above-mentioned program can be stored and supplied to a computer using various types of non-transitory computer readable media. The non-transitory computer readable medium includes various types of tangible storage media. Examples of the non-transitory computer readable medium include magnetic recording media (e.g., flexible disks, magnetic tapes, hard disk drives), magneto-optical recording media (e.g., magneto-optical disks), CD-ROM (Read Only Memory), CD-R, CD-R / W, and semiconductor memory (e.g., mask ROM, PROM (Programmable ROM), EPROM (Erasable PROM), flash ROM, RAM (Random Access Memory)). The program may also be supplied to a computer by various types of transitory computer readable media. Examples of the transitory computer readable medium include electric signals, optical signals, and electromagnetic waves. The transitory computer readable medium can supply the program to a computer via a wired communication path such as an electric wire and an optical fiber, or via a wireless communication path.
[0062] Although the present invention has been described above with reference to the above-mentioned embodiment, the present invention is not limited to the above-mentioned embodiment. Various modifications that can be understood by a person skilled in the art can be made to the configuration and details of the present invention within the scope of the present invention. In addition, at least one or more functions of the above-mentioned allocation unit 121, calculation unit 122, and reallocation unit 123 may be executed by an information processing device installed and connected anywhere on a network, that is, they may be executed by so-called cloud computing.
[0063] <Additional Notes> A part or all of the above-described embodiments can be described as follows: Below, an outline of the configuration of the visiting schedule creation method, visiting schedule creation device, and program according to the present invention will be described. However, the present invention is not limited to the following configuration. (Appendix 1) creating a visit schedule in which the visitor assigns the visited person to be visited by the visitor based on the location information of the visitor and the visited person; Calculating a priority level representing a priority level assigned to the visitor relative to the visited person based on the location information; creating the visit schedule in which the allocation of the visited persons to the visitors is changed based on the priority; How to schedule a visit. (Appendix 2) A visiting schedule creation method according to claim 1, comprising: When a plurality of visited persons are assigned to the same visitor at the same time in the created visiting schedule, the priority of the visited persons assigned at the same time is calculated. How to schedule a visit. (Appendix 3) The visiting schedule creation method according to claim 1 or 2, calculating a travel distance between the visitors by the visitor based on the location information, and calculating the priority based on the travel distance; How to schedule a visit. (Appendix 4) A visiting schedule creation method according to claim 3, comprising: calculating the priority based on the travel distance and a scheduled visiting time indicating a scheduled time for visiting the visited person that is set in advance; How to schedule a visit. (Appendix 5) A visiting schedule creation method according to claim 4, comprising: calculating the priority based on the travel distance, the planned visiting time, and a planned stay time representing a stay time when visiting the visited person that is set in advance; How to schedule a visit. (Appendix 6) A visiting schedule creation method according to claim 5, comprising: calculating an available time until the visitor next visits the visited person based on the planned visiting time and the planned staying time, and calculating the priority based on the moving distance and the available time; How to schedule a visit. (Appendix 7) A visiting schedule creation method according to any one of Supplementary Note 1 to 6, calculating the priority assigned to the visitor for the visited person based on attribute information representing attributes of the visitor and the visited person; How to schedule a visit. (Appendix 8) A visiting schedule creation method according to any one of Supplementary Notes 1 to 7, calculating the priority assigned to the visitor for the visited person based on relevance information representing a relevance between the visitor and the visited person; How to schedule a visit. (Appendix 9) A visiting schedule creation method according to any one of Supplementary Note 1 to 8, creating the visit schedule in which the visited person is assigned to the visitor based on the initial value of the location information of the visitor and the location information of the visited person; When creating the visiting schedule based on the priority, the location information of the visitors is changed according to the location information of the visited persons identified based on the priority, and the visiting schedule is created in which the allocation of the visited persons to the visitors is changed based on the changed location information. How to schedule a visit. (Appendix 10) an allocation unit that creates a visit schedule in which the visitor allocates the visited person to be visited by the visitor based on location information of the visitor and the visited person; a calculation unit that calculates a priority level representing a priority level assigned to the visitor with respect to the visited person based on the location information; a reallocation unit that creates the visiting schedule in which the allocation of the visited persons to the visitors is changed based on the priority; A visit schedule creation device comprising: (Appendix 11) 11. A visit schedule creation device according to claim 10, the calculation unit, when a plurality of visited persons are assigned to the same visitor at the same time in the created visiting schedule, calculates the priority of the visited persons assigned to the same visitor at the same time; Visit schedule creation device. (Appendix 12) A visiting schedule creation device according to claim 10 or 11, The calculation unit calculates a moving distance between the visitors by the visitor based on the position information, and calculates the priority based on the moving distance. Visit schedule creation device. (Appendix 13) 13. The visiting schedule creation device according to claim 12, the calculation unit calculates the priority based on the travel distance and a scheduled visiting time indicating a scheduled time for visiting the visited person that is set in advance; Visit schedule creation device. (Appendix 14) A visit schedule creation device according to claim 13, the calculation unit calculates the priority based on the travel distance, the planned visiting time, and a planned stay time representing a stay time when visiting the visited person that is set in advance; Visit schedule creation device. (Appendix 15) 15. A visiting schedule creation device according to claim 14, the calculation unit calculates an available time until the visitor next visits the visited person based on the planned visiting time and the planned staying time, and calculates the priority based on the moving distance and the available time. Visit schedule creation device. (Appendix 16) A visiting schedule creation device according to any one of Supplementary Notes 10 to 15, the calculation unit calculates the priority assigned to the visitor for the visited person based on attribute information representing attributes of the visitor and the visited person; Visit schedule creation device. (Appendix 17) A visiting schedule creation device according to any one of Supplementary Note 10 to 16, the calculation unit calculates the priority assigned to the visitor for the visited person based on relevance information representing a relevance between the visitor and the visited person; Visit schedule creation device. (Appendix 18) A visiting schedule creation device according to any one of Supplementary Note 10 to 17, the allocation unit creates the visit schedule in which the visited person is allocated to the visitor based on an initial value of the location information of the visitor and the location information of the visited person; the reallocation unit, when creating the visiting schedule based on the priority, changes the location information of the visitor in accordance with the location information of the visited person identified based on the priority, and creates the visiting schedule in which an allocation of the visited person to the visitor is changed based on the changed location information. Visit schedule creation device. (Appendix 19) On the computer, creating a visit schedule in which the visitor assigns the visited person to be visited by the visitor based on the location information of the visitor and the visited person; Calculating a priority level representing a priority level assigned to the visitor relative to the visited person based on the location information; creating the visit schedule in which the allocation of the visited persons to the visitors is changed based on the priority; A computer-readable storage medium that stores a program for executing processing. [Explanation of symbols]
[0064] 10. Visit Schedule Creation Device 11 Allocation Section 12 Calculation section 13 Reassignment Department 14 Visit data storage unit 100 Visiting schedule creation device 101 CPU 102 ROM 103 RAM 104 Programs 105 Storage device 106 Drive device 107 Communication Interface 108 Input / Output Interface 109 Bus 110 Storage medium 111 Communication Network 121 Allocation Section 122 Calculation section 123 Reassignment Department
Claims
1. An information processing device comprising: creating a visit schedule for each of the plurality of visitors, in which the visitor assigns the visited persons to be visited by the visitor, based on the location information of the visitor and the visited persons; Calculating a priority level representing a priority level assigned to each of the visitors with respect to each of the visited people based on the location information; creating the visit schedule in which the allocation of the visited persons to the visitors is changed based on the priority, creating the visit schedule in which the allocation of a specific visited person to a specific visitor is changed so as to be allocated to another visitor based on the visit schedule; How to schedule a visit.
2. The method for creating a visiting schedule according to claim 1, The information processing device, when a plurality of visited persons are assigned to the same visitor at the same time in the created visiting schedule, the priority of the visited persons assigned at the same time is calculated, and the assignment of the specific visited person to the specific visitor is released based on the priority and the visiting schedule, and the visiting schedule is modified so that the assignment of the released specific visited person is assigned to the other visitor. How to schedule a visit.
3. A method for creating a visit schedule as described in claim 2, comprising: The information processing device, cancelling the allocation of the specific visited person having a low priority among the visited persons who have been assigned to the specific visitor at the same time, and creating the visit schedule in which the allocation of the cancelled specific visited person is changed to be assigned to the other visitor. How to schedule a visit.
4. A visiting schedule creation method according to any one of claims 1 to 3, The information processing device, calculating a travel distance between the visitors by the visitor based on the location information, and calculating the priority based on the travel distance; How to schedule a visit.
5. The visiting schedule creation method according to claim 4, The information processing device, calculating the priority based on the travel distance and a scheduled visiting time indicating a scheduled time for visiting the visited person that is set in advance; How to schedule a visit.
6. The visiting schedule creation method according to claim 5, The information processing device, calculating the priority based on the travel distance, the planned visiting time, and a planned stay time representing a stay time when visiting the visited person that is set in advance; How to schedule a visit.
7. The visiting schedule creation method according to claim 6, The information processing device, calculating an available time until the visitor next visits the visited person based on the planned visiting time and the planned staying time, and calculating the priority based on the moving distance and the available time; How to schedule a visit.
8. A visiting schedule creation method according to any one of claims 1 to 7, comprising: The information processing device, calculating the priority assigned to the visitor for the visited person based on attribute information representing attributes of the visitor and the visited person; How to schedule a visit.
9. A visiting schedule creation method according to any one of claims 1 to 8, comprising: The information processing device, calculating the priority assigned to the visitor for the visited person based on relevance information representing a relevance between the visitor and the visited person; How to schedule a visit.
10. A visiting schedule creation method according to any one of claims 1 to 9, The information processing device, creating the visit schedule in which the visited person is assigned to the visitor based on the initial value of the location information of the visitor and the location information of the visited person; When creating the visiting schedule based on the priority, the location information of the visitors is changed according to the location information of the visited persons identified based on the priority, and the visiting schedule is created in which the allocation of the visited persons to the visitors is changed based on the changed location information. How to schedule a visit.
11. an allocation unit that creates a visit schedule for each of a plurality of visitors, in which the visitor allocates the visited persons to be visited by the visitor based on location information of the visitor and the visited persons; a calculation unit that calculates a priority level that indicates a priority level assigned to each of the visitors with respect to each of the visited people based on the location information; a reallocation unit that, when creating the visit schedule in which the allocation of the visited persons to the visitors is changed based on the priority, creates the visit schedule in which the allocation of a specific visited person to a specific visitor is changed so as to be allocated to another visitor based on the visit schedule; A visit schedule creation device comprising:
12. The visiting schedule creation device according to claim 11, the calculation unit calculates the priority of the visited persons assigned at the same time when a plurality of visited persons are assigned to the same visitor at the same time in the created visiting schedule; the reallocation unit releases the allocation of the specific visited person to the specific visitor based on the priority and the visiting schedule, and creates the visiting schedule in which the allocation of the released specific visited person is allocated to the other visitor. Visit schedule creation device.
13. The visit schedule creation device according to claim 12, the reallocation unit releases an allocation of the specific visited person having a low priority among the visited people allocated to the specific visitor at the same time, and creates the visit schedule in which the allocation of the released specific visited person is changed to be allocated to the other visitor. Visit schedule creation device.
14. A visiting schedule creation device according to any one of claims 11 to 13, The calculation unit calculates a moving distance between the visitors by the visitor based on the position information, and calculates the priority based on the moving distance. Visit schedule creation device.
15. A visiting schedule creation device according to any one of claims 11 to 14, the calculation unit calculates the priority assigned to the visitor for the visited person based on attribute information representing attributes of the visitor and the visited person; Visit schedule creation device.
16. A visiting schedule creation device according to any one of claims 11 to 15, the calculation unit calculates the priority assigned to the visitor for the visited person based on relevance information representing a relevance between the visitor and the visited person; Visit schedule creation device.
17. On the computer, creating a visit schedule for each of the plurality of visitors, in which the visitor assigns the visited persons to be visited by the visitor, based on the location information of the visitor and the visited persons; Calculating a priority level representing a priority level assigned to each of the visitors with respect to each of the visited people based on the location information; creating the visit schedule in which the allocation of the visited persons to the visitors is changed based on the priority, creating the visit schedule in which the allocation of a specific visited person to a specific visitor is changed so as to be allocated to another visitor based on the visit schedule; A program for executing a process.
18. The program according to claim 17, The computer further comprises: when a plurality of visited persons are assigned to the same visitor at the same time in the created visiting schedule, the priority of the visited persons assigned at the same time is calculated, and the assignment of the specific visited person to the specific visitor is released based on the priority and the visiting schedule, and the visiting schedule is modified so that the assignment of the released specific visited person is assigned to the other visitor. A program for executing a process.
19. The program of claim 18, The computer further comprises: cancelling the allocation of the specific visited person having a low priority among the visited persons who have been assigned to the specific visitor at the same time, and creating the visit schedule in which the allocation of the cancelled specific visited person is changed to be assigned to the other visitor. A program for executing a process.
Citation Information
Patent Citations
Visiting nurse scheduling system
JP1998143565A
System and method for supporting business operation, and computer program
JP2010040000A
Visit plan creation device, visit plan creation method, and program
JP2017126136A
Schedule proposal device, schedule proposal method and schedule proposal system
JP2019219815A
Visit route management system, mobile apparatus, visit route generation method, display control method, and program
JP2020149582A