WO2022219811A1 - 訪問スケジュール作成方法 - Google Patents
訪問スケジュール作成方法 Download PDFInfo
- Publication number
- WO2022219811A1 WO2022219811A1 PCT/JP2021/015733 JP2021015733W WO2022219811A1 WO 2022219811 A1 WO2022219811 A1 WO 2022219811A1 JP 2021015733 W JP2021015733 W JP 2021015733W WO 2022219811 A1 WO2022219811 A1 WO 2022219811A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- visit
- visitor
- priority
- visit schedule
- schedule
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims description 25
- 238000004364 calculation method Methods 0.000 claims abstract description 45
- 230000010365 information processing Effects 0.000 description 12
- 238000010586 diagram Methods 0.000 description 11
- 230000000474 nursing effect Effects 0.000 description 10
- 238000004891 communication Methods 0.000 description 6
- 238000013500 data storage Methods 0.000 description 6
- 238000012797 qualification Methods 0.000 description 5
- 238000004519 manufacturing process Methods 0.000 description 4
- 238000012508 change request Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 239000007787 solid Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
- G06Q10/063114—Status monitoring or status determination for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
- G06Q10/063116—Schedule adjustment for a person or group
Definitions
- the present invention relates to a visit schedule creation method, a visit schedule creation device, and a program.
- an object of the present invention is to provide a visit schedule creation method that can solve the above-mentioned problem of increased calculation costs when creating a visit schedule.
- a visit schedule creation method which is one embodiment of the present invention, comprises: creating a visit schedule in which the visitor to be visited by the visitor is assigned to the visitor based on the location information of the visitor and the visitee; calculating, based on the location information, a priority representing a priority assigned to the visitor for the visited person; creating the visit schedule that changes the allocation of the visitee to the visitor based on the priority; take the configuration.
- a visit schedule creation device which is one embodiment of the present invention, an allocation unit that creates a visit schedule in which the visitor is allocated the visitee to be visited by the visitor based on the position information of the visitor and the visitee; a calculation unit that calculates a priority indicating the priority of the visited person assigned to the visitor based on the position information; a reallocation unit that creates the visit schedule in which the allocation of the visited person to the visitor is changed based on the priority; with take the configuration.
- a program that is one embodiment of the present invention is to the computer, creating a visit schedule in which the visitor to be visited by the visitor is assigned to the visitor based on the location information of the visitor and the visitee; calculating, based on the location information, a priority representing a priority assigned to the visitor for the visited person; creating the visit schedule that changes the allocation of the visitee to the visitor based on the priority; to carry out the process, take the configuration.
- the present invention can reduce the calculation cost when creating a visit schedule.
- FIG. 2 is a diagram showing an example of data processed by the visit schedule creation device disclosed in FIG. 1;
- FIG. 2 is a diagram showing how data is processed by the visit schedule creation device disclosed in FIG. 1;
- FIG. 2 is a diagram showing how data is processed by the visit schedule creation device disclosed in FIG. 1;
- FIG. 2 is a diagram showing how data is processed by the visit schedule creation device disclosed in FIG. 1;
- FIG. 2 is a diagram showing how data is processed by the visit schedule creation device disclosed in FIG. 1;
- FIG. 2 is a diagram showing how data is processed by the visit schedule creation device disclosed in FIG. 1;
- FIG. 2 is a flow chart showing the operation of the visit schedule creation device disclosed in FIG.
- FIG. 1 to 2 are diagrams for explaining the configuration of the visit schedule creation device
- FIGS. 3 to 7 are diagrams for explaining the processing operations of the visit schedule creation device.
- the visit schedule creation device 10 in the present invention is a system for creating a schedule for a caregiver to visit each home of a care recipient when a business operator provides a care visit service.
- 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.
- the visit schedule created by the visit schedule creation device 10 of the present invention is not necessarily limited to a schedule in which a caregiver visits a cared person.
- the visit schedule created by the visit schedule creation device 10 may be a schedule in which a doctor or nurse (visitor) visits a patient (visited person), and a worker ( A schedule for a visitor) to visit the person in charge of equipment (visited person) in each office, a schedule for a delivery person (visitor) to visit the home of the person to whom the delivery is to be delivered (visited person), etc. , any visit schedule.
- the visit schedule creation device 10 is composed of one or a plurality of information processing devices each having an arithmetic device and a storage device.
- the visit schedule creation device 10 includes an allocation unit 11, a calculation unit 12, and a reallocation unit 13, as shown in FIG. Each function of the allocation unit 11, the calculation unit 12, and the reallocation unit 13 can be realized by executing a program for realizing each function stored in the storage device by the arithmetic unit.
- the visit schedule creation device 10 also includes a visit data storage unit 14 .
- the visit data storage unit 14 is configured by a storage device. Each configuration will be described in detail below.
- the visit data storage unit 14 stores visit data, which is information about a caregiver who is a visitor and a user who is a visitee who receives a visit and care from the caregiver by using the home care service. ing.
- the details of the visit data will be described below, but the contents of the visit data are set in advance by the business operator, the caregiver, the user, and the user's family.
- the visit data is input and stored in the visit schedule creation device 10 by the operator of the business, or input and stored in the visit schedule creation device 10 by the caregiver, the user, or the user's family via the network, for example. .
- the visit data includes the initial area (position information) representing the position where the caregiver starts the visit as caregiver data.
- the caregiver's initial area may be the office to which the caregiver belongs or the caregiver's home, but it may be any place.
- the initial area may be calculated and set by the visit schedule creation device 10 according to the addresses of a plurality of users, as will be described later.
- the initial area is represented by two-dimensional coordinates, as shown in FIG. 2(1), in order to simplify the explanation.
- caregiver A's initial area is (2, 4)
- caregiver B's initial area is (4, 2).
- the visit data includes, as user data, an address (location information) representing the location visited by the caregiver.
- the user's address may be the user's residence or the facility where the user resides, but it may be any place.
- the address is represented by two-dimensional coordinates. As an example, in the example of FIG. 2(2), the address of user 1 is (1, 4), the address of user 2 is (3, 5), and the address of user 3 is (2, 3 ), the address of the user 4 is (4, 1), and the address of the user 5 is (5, 2). If the positions of the addresses of the users 1 to 5 are illustrated on the map, they are represented, for example, as shown in FIG. 2(3).
- the visit data includes, as user data, a start time (scheduled visit time) representing the scheduled time at which the caregiver visits the user and starts home-visit care, and working time (scheduled stay time), which represents the scheduled time to stay at the visited location to perform the work;
- a start time (scheduled visit time) representing the scheduled time at which the caregiver visits the user and starts home-visit care
- working time (scheduled stay time), which represents the scheduled time to stay at the visited location to perform the work
- the start time of user 1 is 9:00 and the work time is 30 minutes
- the start time of user 2 is 10:15 and the work time is 60 minutes
- User 3 starts at 11:00 and works for 30 minutes
- User 4 starts at 9:00 and works for 60 minutes
- User 5 starts at 9:45 and works It shows the case where the time is 30 minutes.
- the visit data may include attribute information representing the attributes of the caregiver and the user, and relationship information representing the relationship between the caregiver and the user.
- the attribute information for caregivers is information such as the qualifications and fields of expertise related to nursing that the caregivers possess, and the nursing care status of users who can handle it. This includes information such as the caregiver's qualifications, specialty, and nursing care status.
- the relevance information consists of information in which a caregiver and a user are associated with each other. It consists of correspondence information between a person and a user who was cared for by the caregiver in the past, correspondence information between the caregiver and a user who wishes to be cared by the caregiver, and the like.
- the allocation unit 11 Based on the visit data stored in the visit data storage unit 14, the allocation unit 11 first creates a visit schedule in which users to be visited by each caregiver are allocated to each caregiver. Specifically, the allocation unit 11 calculates the distance to each user's address for each caregiver's initial area, and allocates each user to the nearest caregiver. That is, in the example of FIG. 2, by assigning each of the users 1 to 5 to the caregivers A and B who are closer to each other, as shown in FIG. 2 and 3 are assigned, and users 4 and 5 are assigned to caregiver B. At this time, FIG. 3(2) shows a visiting schedule including the starting time and working hours of each user. In FIG.
- the allocation unit 11 may allocate the users using the initial areas of the caregivers A and B included in the visit data in advance. Alternatively, the allocation unit 11 may set the initial areas of the caregivers A and B in advance based on the addresses of the users included in the visit data, and allocate the users using the initial areas. For example, the allocation unit 11 may set the center of the addresses of multiple users that are close to each other as the caregiver's initial area.
- the calculation unit 12 checks whether or not there is competition among users assigned to caregivers in the visit schedule created by the assignment unit 11 as described above. For example, when a plurality of users are assigned to the same caregiver at the same time, the calculation unit 12 calculates If at least a portion of the times of As an example, in the visit schedule created as shown in FIG. It is determined that there is a conflict between person 2 and user 3. In addition, since part of the working hours of the users 4 and 5 overlap with the caregiver B, it is determined that there is a conflict between the users 4 and 5 .
- the calculation unit 12 determines the priority level of each user assigned to the caregiver who is in conflict with each other. Calculate degrees. For example, the calculation unit 12 calculates that the shorter 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. do.
- the calculation unit 12 first calculates the score that is the basis of the priority.
- the score of user b to caregiver a is represented by s (a, b)
- s (a, b) is "the moving distance from the position of caregiver a to the position of user b".
- the sum of "the movable distance from the end time of the home-visit care of the previous user by the caregiver a to the start time of the home-visit care of the user b" is calculated.
- the above “movable distance” is 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 the caregiver a, from the start time of the user b.
- the score s (a, b) is A value equivalent to the sum of "moving time” and "free time”. Specifically, the score s(a, b) is calculated by the following equation (1).
- the caregiver A moves to the user 2 or the user 3 after the home care of the user 1 ends Therefore, the position and end time of caregiver A can be represented by the position and end time of user 1 . Therefore, the scores of user 2 and user 3 for caregiver A are represented by s (user 1, user 2) and s (user 1, user 3), respectively, and the following equations 2, It is the value calculated by Equation 3. In addition, it is assumed that the travel time of the caregiver A is 30 km/h as an example.
- the calculation unit 12 may treat the smaller score value as described above as having a higher priority, set the score value as it is as the priority, or may further calculate the priority from the score. For example, the calculation unit 12 may calculate, as a value of priority, an order from the smallest value among the scores of the users for the same caregiver. That is, in this case, the lower the priority, the higher the priority.
- the priority of user 2 is calculated as a higher value than the priority of user 3. becomes.
- the scores of the user 4 and the user 5 for the caregiver B are calculated from the above equation 1, the score of the user 4 is smaller than the score of the user 5, so the score of the user 4 is calculated as a value higher than the priority of user 5 .
- the calculation unit 12 is not necessarily limited to calculating the priority as described above.
- the calculation unit 12 stores the attribute information representing the attributes of the caregiver and the user, and the relationship information representing the relationship between the caregiver and the user, which are stored as visit data. You may calculate the priority of the person.
- the attribute information is assumed to be information such as the qualifications and fields of expertise possessed by the caregiver, information such as the nursing care status of the user who can respond, and information such as the user's nursing care status. At this time, if there is a preset correspondence relationship between the qualifications and fields of expertise included in the attribute information of the caregiver and the state of nursing care, which is the attribute information of the user, for example, the state of care of the user may correspond to a specific qualification.
- the calculation unit 12 may weight the score calculated as described above so that it becomes a lower value.
- the relationship information includes correspondence information between a caregiver and a user whom the caregiver is supposed to be in charge of, and correspondence information between the caregiver and a user who has been cared for by the caregiver in the past. information, and correspondence information between a caregiver and a user who wishes to be cared by the caregiver.
- the calculation unit 12 may weight the score calculated as described above so as to have a lower value.
- the user's score is calculated to be low, and the priority is calculated to be high.
- the Rukoto is a user's score is calculated to be low, and the priority is calculated to be high.
- the reallocation unit 13 changes the allocation of users 1 to 5 to caregivers A and B based on the priority calculated as described above, and creates a visit schedule again. Specifically, the reallocation unit 13 first allocates the user with the highest priority among the competing users to each of the caregivers A and B, and refuses the allocation of the other users. and resolve the conflict. For example, as shown by the solid and dotted lines in FIG. Assign user 2 and unassign user 3, which has a lower priority. Further, as shown by the solid and dotted lines in FIG. User 5 is unassigned.
- the reallocation unit 13 leaves the allocation of the users 1, 2, and 4 allocated to the caregivers A and B as they are, and reassigns the users 3 and 5 whose allocation to the caregivers has been canceled to the caregivers. .
- the reassignment unit 13 first changes the initial areas of the caregivers A and B according to the positions of the users left to be assigned. For example, as shown in FIG. 4(1), the reassignment unit 13 changes the initial area for the caregiver A to an intermediate position between the addresses of the users 1 and 2 that remain assigned, and for the caregiver B changes the initial area to the address of user 4, which remains assigned.
- the reassignment unit 13 calculates the distance to the address of each of the users 3 and 5 whose assignment has been released from the initial area of each of the caregivers A and B, and based on this distance, each user 3 , 5 to caregivers A and B. At this time, the reassignment unit 13 allocates the deallocated users 3 and 5 to caregivers different from the caregivers before being deallocated, regardless of the distance between the caregivers and the users. good. For example, in the example of FIG. 4(1), the user 5 is newly assigned to the caregiver A, and the user 3 is newly assigned to the caregiver B. In this way, the reallocation unit 13 allocates users 1, 5, and 2 to caregiver A, and allocates users 4 and 3 to caregiver B, as shown in FIG. will be assigned.
- FIG. 4(2) shows a visiting schedule that is illustrated in consideration of the start time and work time of each user.
- the solid line arrow indicates the movement of the caregiver A
- the dotted line arrow indicates the movement of the caregiver B.
- the calculation unit 12 also checks the visiting schedule created by the reallocation unit 13 as described above to determine whether or not there is competition among the users assigned to the caregivers. to calculate the priority of the Specifically, in the case of the visiting schedule of FIG. 4(2), since the users 5 and 2 are assigned to the caregiver A at the same time, there is no conflict between the users 5 and 2. On the other hand, it determines that there is no competition for Caregiver B. Therefore, the calculation unit 12 calculates the priorities of the competing users 5 and 2 for the caregiver A, respectively. Note that the calculation unit 12 also investigates again whether or not there is competition for users whose allocation has not been canceled in the reallocation unit 13 described above, and calculates the priority of the user with conflict. do.
- the reallocation unit 13 changes the allocation of the users 1 to 5 to the caregivers A and B based on the recalculated priorities, and creates a visit schedule again. Specifically, in the visit schedule of FIG. Among them, the user 5 with high priority is assigned and the user 2 with low priority is unassigned. Then, the reallocation unit 13 allocates the deallocated user 2 to another caregiver B. FIG. At this time, the reallocation unit 13 may change the caregiver's initial area and perform reallocation based on the initial area, as described above.
- the calculation unit 12 and the reallocation unit 13 repeat the above-described processing until there is no conflict of users allocated to all caregivers.
- the visit schedule creation device 10 sets the initial area for 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 use the initial area of each caregiver pre-stored in the visit data as shown in FIG. You may set it as an initial area of a person.
- the visit schedule creation device 10 calculates the distance to each user's address for each caregiver's initial area, and assigns each user to the nearest caregiver (step S2). For example, in the case of the visit data shown in FIG. 2, the visit schedule creation device 10 assigns each of the users 1 to 5 to caregivers A and B who are closer to each other, as shown in FIG. , users 1, 2 and 3 are assigned to caregiver A, and users 4 and 5 are assigned to caregiver B. Then, the visit schedule creation device 10 creates a visit schedule in which the start time and working hours of each user are set, as shown in FIG. 3(2).
- the visit schedule creation device 10 checks whether or not there is conflict in the user assigned to the caregiver in the visit schedule created as described above (step S3). For example, when a plurality of users are assigned to the same caregiver at the same time, the visit schedule creation device 10 starts working from the start time of a plurality of users assigned to one caregiver. If the times overlap, it is determined that there is a conflict. For example, in the visit schedule shown in FIG. 3, and since users 4 and 5 are assigned to caregiver B at the same time, it is determined that there is conflict between users 4 and 5.
- step S4 when the visit schedule creation device 10 determines that there is conflict among users for the same caregiver (Yes in step S3), each conflicting user assigned to the caregiver A priority indicating the priority of the visit to is calculated (step S4).
- the visit schedule creation device 10 assigns priority to 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. calculated so that Note that the visit schedule creation device 10 prioritizes users who have a correspondence relationship with the caregiver based on attribute information representing the attributes of the caregiver and the user and relationship information representing the relationship between the caregiver and the user. The degree may be calculated with a higher weight.
- the visit schedule creation device 10 adds each caregiver in the first created visit schedule.
- the users 1, 2 and 4 assigned to A and B are left as they are, and the users 3 and 5 whose assignment to the caregiver has been released are assigned again to the caregiver (Yes in step S6).
- the visit schedule creation device 10 changes the initial areas of each of the caregivers A and B according to the user's position, which remains assigned (step S7). For example, as shown in FIG.
- the visit schedule creation device 10 changes the initial area for the caregiver A to an intermediate position between the positions of the users 1 and 2, which remain assigned, and the caregiver B , the initial area is changed to the position of user 4, which remains assigned. Note that it is not always necessary to change the initial area.
- the visit schedule creation device 10 calculates the distance from the initial area of each caregiver A, B to the address of each user 3, 5 whose allocation has been canceled, and based on this distance, each user 3 and 5 are reassigned to caregivers A and B (step S2). At this time, the visit schedule creation device 10 may assign the unassigned users 3 and 5 to caregivers different from the caregivers before the cancellation, regardless of the distance between the caregivers and the users. good. For example, the visit schedule creation device 10 newly allocates the user 5 to the caregiver A and newly allocates the user 3 to the caregiver B in the example of FIG. 4(1). In this manner, the visit schedule creation device 10 assigns users 1, 5, and 2 to caregiver A, and assigns users 4 and 3 to caregiver B, as shown in FIG. Create an assigned visit schedule.
- the visit schedule creation device 10 checks whether or not there is conflict in the user assigned to the caregiver in the same manner as described above, even in the visit schedule created again as described above (step S3). For example, in the visit schedule shown in FIG. It is determined that there is competition for Person 2.
- step S3 when the visit schedule creation device 10 determines that there is conflict among users for the same caregiver (Yes in step S3), each conflicting user assigned to the caregiver A priority indicating the priority of the visit to is calculated (step S4). Then, in the visit schedule shown in FIG. As indicated by the solid line in 4(3), user 5 is preferentially assigned, and as indicated by the dotted line in FIG. 4(3), user 2 is unassigned. In this way, the visit schedule creation device 10 resolves user conflicts in the visit schedule (step S5).
- the visit schedule creation device 10 may change the initial areas of the caregivers A and B according to the positions of the users left as assigned (step S7), but it does not have to be changed. .
- the visit schedule creation device 10 reassigns the user 2 whose assignment has been canceled as described above (step S2).
- the visit schedule creation device 10 assigns the user 2 whose assignment has been released to a caregiver B different from the caregiver A before the assignment was released.
- the visit schedule creation device 10 assigns users 1 and 5 to caregiver A, and assigns users 4, 2, and 3 to caregiver B, as shown in FIG. Create an assigned visit schedule.
- the visit schedule creation device 10 checks whether or not there is conflict in the user assigned to the caregiver in the same manner as described above, even in the visit schedule created again as described above (step S3). For example, in the visit schedule shown in FIG. Determine that there are 3 conflicts.
- step S3 when the visit schedule creation device 10 determines that there is conflict among users for the same caregiver (Yes in step S3), each conflicting user assigned to the caregiver A priority indicating the priority of the visit to is calculated (step S4). Then, in the visit schedule shown in FIG. (3) User 2 is preferentially assigned as indicated by the solid line, and user 3 is unassigned as indicated by the dotted line in FIG. 5(3). In this way, the visit schedule creation device 10 resolves user conflicts in the visit schedule (step S5).
- the visit schedule creation device 10 may change the initial areas of the caregivers A and B according to the positions of the users left as assigned (step S7), or may not change them.
- the visit schedule creation device 10 reassigns the user 3 whose assignment has been canceled as described above (step S2).
- the visit schedule creation device 10 assigns the user 3 whose assignment has been released to a caregiver A different from the caregiver B before the assignment was released.
- the visit schedule creation device 10 assigns users 1, 5, and 3 to caregiver A, and assigns users 4 and 2 to caregiver B, as shown in FIG. Create an assigned visit schedule.
- all users are assigned to all caregivers, and the conflict between the users is resolved (No in step S3). Finish creating the visit schedule.
- the visit schedule creation device 10 first uses the location information of the caregiver who is a visitor and the user who is a visitee to classify all users as one of the caregivers. Create a visit schedule by assigning people all at once. After that, when there is a conflict that there are multiple users assigned to the same caregiver at the same time, the visit schedule creation device 10 calculates the priority of the conflicting users, Create visit schedules that reassign patrons based on priority. In this manner, the visit schedule creation device 10 first allocates all users at once, calculates the priority of only competing users, and reassigns them, so that the calculation cost can be reduced. That is, the visit schedule creation device 10 can create a visit schedule even with a computer with a small resource, so that the introduction cost of the system can be reduced.
- the visit schedule creation device 10 may output the created visit schedule so as to notify the operator of the business operator, caregivers A and B, users 1 to 5 receiving care, and their families. good.
- the visit schedule creation device 10 is an information processing terminal (smartphone, tablet terminal, personal computer, etc.) operated by an operator of a pre-registered operator, caregivers A and B, users 1 to 5, and their families.
- Information on the visiting schedule as shown in FIG. 6(2) may be transmitted to the address.
- the contents of the visiting schedule to be transmitted include the schedules of all caregivers for the operator of the operator, only their own schedules for caregivers A and B, and users 1 to 5 and others.
- the family member it may contain only their own schedule (visiting caregivers and times).
- the operator, caregivers A and B, users 1 to 5, and their families in particular, can confirm their care plans by displaying the visit schedule on the display device of the information processing terminal.
- caregivers A and B and users 1 to 5 may notify the business operator that they wish to change the visit schedule.
- the visit schedule creation device 10 receives change request information transmitted from the information processing terminals of caregivers A and B and users 1 to 5, and transmits such information to the information processing terminal of the operator or displays it. to notify the operator by displaying Then, the visit schedule creation device 10 performs processing for further changing the visit schedule according to the operator's operation based on the change request information, and sends the changed visit schedule to caregivers A and B, users 1 to 5, etc. You can output to Note that the visit schedule creation device 10 may automatically change the visit schedule according to change request information without depending on the operator's operation.
- the visit schedule creation device 10 assigns the user who wishes to change from the caregiver before the change to another caregiver, assigns the remaining users to each caregiver in the same manner as described above, and then, further in the same manner as described above.
- Conflict resolution may be performed to create a final schedule of visits.
- FIG. 8 and 9 are block diagrams showing the configuration of the visit schedule creation device according to the second embodiment
- FIG. 10 is a flowchart showing the operation of the visit schedule creation device.
- an outline of the configuration of the visit schedule creation device and the visit schedule creation method described in the above-described embodiment is shown.
- the visit schedule creation device 100 is configured by a general information processing device, and is equipped with the following hardware configuration as an example.
- - CPU Central Processing Unit
- ROM Read Only Memory
- RAM Random Access Memory
- Program group 104 loaded into RAM 103 - Storage device 105 for storing program group 104
- a drive device 106 that reads and writes from/to a storage medium 110 external to the information processing device
- Communication interface 107 connected to communication network 111 outside the information processing apparatus
- Input/output interface 108 for inputting/outputting data
- a bus 109 connecting each component
- the visit schedule creation device 100 acquires the program group 104 and executes it by the CPU 101, thereby constructing and equipping the allocation unit 121, the calculation unit 122, and the reallocation unit 123 shown in FIG. can be done.
- the program group 104 and visit data which is data used to create the visit schedule, are stored in advance in the storage device 105 or the ROM 102, for example, and are loaded into the RAM 103 and executed by the CPU 101 as necessary.
- the program group 104 and visit data may be supplied to the CPU 101 via the communication network 111, or may be stored in advance in the storage medium 110, and the drive device 106 may read the program and supply it to the CPU 101. good.
- the visit data may also be modified by supplying only a portion of the data already stored via the communication network 111 .
- the allocating unit 121, the calculating unit 122, and the reallocating unit 123 described above may be configured by dedicated electronic circuits for realizing such means.
- FIG. 8 shows an example of the hardware configuration of the information processing device that is the visit schedule creation device 100, and the hardware configuration of the information processing device is not limited to the case described above.
- the information processing apparatus may be composed of part of the above-described configuration, such as not having the drive device 106 .
- the visit schedule creation device 100 executes the visit schedule creation method shown in the flowchart of FIG.
- the visit schedule creation device 100 creating a visit schedule in which the visitor to be visited by the visitor is assigned to the visitor based on position information of the visitor and the visitee (step S101); calculating, based on the position information, a priority indicating the priority of the visited person assigned to the visitor (step S102); creating the visit schedule in which the allocation of the visited person to the visitor is changed based on the priority (step S103); Execute the process.
- the visit schedule creation device 100 first uses the position information of the visitor and the visited person to simultaneously assign all the visited persons to one of the visitors to make a visit. create a schedule; After that, the visit schedule creation device 100 calculates the priority of the visitee assigned to the visitor, and creates a visit schedule in which the visitee is reassigned based on the priority. In this way, the visit schedule creation device 100 allocates all the users to be visited all at once, and then calculates the priority of the users and reassigns the users. Therefore, the calculation cost can be reduced. That is, since the visit schedule creation device 100 can be used with a computer with a small resource, it is possible to reduce the introduction cost of the system.
- Non-transitory computer readable media include various types of tangible storage media.
- Examples of non-transitory computer-readable media include magnetic recording media (e.g., flexible discs, magnetic tapes, hard disk drives), magneto-optical recording media (e.g., magneto-optical discs), CD-ROMs (Read Only Memory), CD-Rs, CD-R/W, semiconductor memory (eg mask ROM, PROM (Programmable ROM), EPROM (Erasable PROM), flash ROM, RAM (Random Access Memory)).
- the program may also be delivered to the computer on various types of transitory computer readable medium. Examples of transitory computer-readable media include electrical signals, optical signals, and electromagnetic waves. Transitory computer-readable media can deliver the program to the computer via wired channels, such as wires and optical fibers, or wireless channels.
- At least one of the functions of the allocation unit 121, the calculation unit 122, and the reallocation unit 123 described above may be executed by an information processing device installed and connected at any location on the network, That is, it may be executed by so-called cloud computing.
- an allocation unit that creates a visit schedule in which the visitor is allocated the visitee to be visited by the visitor based on the position information of the visitor and the visitee; a calculation unit that calculates a priority indicating the priority of the visited person assigned to the visitor based on the position information; a reallocation unit that creates the visit schedule in which the allocation of the visited person to the visitor is changed based on the priority; visit scheduling device.
- the visit schedule creation device according to Supplementary Note 10, When a plurality of the visited persons are assigned to the same visitor at the same time in the created visit schedule, the calculation unit calculates the priority of the visited persons assigned to the same time. calculate degrees, Visit scheduling device.
- (Appendix 12) The visit schedule creation device according to Appendix 10 or 11, The calculation unit calculates a travel distance between the visited persons by the visitor based on the position information, and calculates the priority based on the travel distance.
- Visit scheduling device. (Appendix 13) The visit schedule creation device according to Supplementary Note 12, The calculation unit calculates the priority based on the movement distance and a scheduled visit time representing a preset scheduled time to visit the visited person.
- Visit scheduling device. (Appendix 14) The visit schedule creation device according to Supplementary Note 13, The calculation unit calculates the priority based on the travel distance, the scheduled visit time, and a preset scheduled stay time representing the stay time when visiting the visited person. Visit scheduling device.
- (Appendix 15) The visit schedule creation device according to appendix 14, The calculation unit calculates a free time until the visitor visits the next visited person based on the scheduled visit time and the scheduled stay time, and calculates the free time based on the travel distance and the free time. calculating the priority; Visit scheduling device. (Appendix 16) The visit schedule creation device according to any one of appendices 10 to 15, The calculation unit calculates the priority for the visited person assigned to the visitor based on attribute information representing attributes of the visitor and the visited person. Visit scheduling device. (Appendix 17) The visit schedule creation device according to any one of appendices 10 to 16, The calculation unit calculates the priority for the visited person assigned to the visitor based on relationship information representing the relationship between the visitor and the visited person. Visit scheduling device.
- the visit schedule creation device according to any one of appendices 10 to 17,
- the allocation unit creates the visit schedule in which the visited person is allocated to the visitor based on the initial value of the location information of the visitor and the location information of the visited person.
- the reallocation unit changes the location information of the visitor according to the location information of the visitee identified based on the priority when creating the visit schedule based on the priority. and creating the visit schedule in which the assignment of the visitee to the visitor is changed based on the changed location information; Visit scheduling device.
- visit schedule creation device 11 allocation unit 12 calculation unit 13 reallocation unit 14 visit data storage unit 100 visit schedule creation device 101 CPU 102 ROMs 103 RAM 104 program group 105 storage device 106 drive device 107 communication interface 108 input/output interface 109 bus 110 storage medium 111 communication network 121 allocation unit 122 calculation unit 123 reallocation unit
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
訪問者と被訪問者との位置情報に基づいて、前記訪問者に対して当該訪問者が訪問する前記被訪問者を割り当てた訪問スケジュールを作成し、
前記位置情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する優先度合いを表す優先度を算出し、
前記優先度に基づいて、前記訪問者に対する前記被訪問者の割り当てを変更した前記訪問スケジュールを作成する、
という構成をとる。
訪問者と被訪問者との位置情報に基づいて、前記訪問者に対して当該訪問者が訪問する前記被訪問者を割り当てた訪問スケジュールを作成する割当部と、
前記位置情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する優先度合いを表す優先度を算出する算出部と、
前記優先度に基づいて、前記訪問者に対する前記被訪問者の割り当てを変更した前記訪問スケジュールを作成する再割当部と、
を備えた、
という構成をとる。
コンピュータに、
訪問者と被訪問者との位置情報に基づいて、前記訪問者に対して当該訪問者が訪問する前記被訪問者を割り当てた訪問スケジュールを作成し、
前記位置情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する優先度合いを表す優先度を算出し、
前記優先度に基づいて、前記訪問者に対する前記被訪問者の割り当てを変更した前記訪問スケジュールを作成する、
処理を実行させる、
という構成をとる。
本発明の第1の実施形態を、図1乃至図7を参照して説明する。図1乃至図2は、訪問スケジュール作成装置の構成を説明するための図であり、図3乃至図7は、訪問スケジュール作成装置の処理動作を説明するための図である。
本発明における訪問スケジュール作成装置10は、事業者が訪問介護サービスを提供するにあたり、介護者が被介護者の各居宅を訪問するスケジュールを作成するためのシステムである。特に、訪問スケジュール作成装置10は、複数の介護者のそれぞれが、複数の被介護者を効率よく訪問できるような訪問スケジュールを作成するよう構成されている。なお、本発明における訪問スケジュール作成装置10が作成する訪問スケジュールは、必ずしも介護者が被介護者を訪問するスケジュールであることに限定されない。例えば、訪問スケジュール作成装置10が作成する訪問スケジュールは、医師や看護師(訪問者)が患者(被訪問者)を訪問するスケジュールであってもよく、オフィス機器の修理・保守を行う作業者(訪問者)が各オフィスの機器担当者(被訪問者)を訪問するスケジュール、さらには、宅配者(訪問者)が配送物の配送先となる人物(被訪問者)の居宅を訪問するスケジュールなど、いかなる訪問スケジュールであってもよい。
次に、上述した訪問スケジュール作成装置10の動作を、主に図2乃至図6に示す位置情報及び訪問スケジュールと、図7のフローチャートを参照して説明する。
次に、本発明の第2の実施形態を、図8乃至図10を参照して説明する。図8乃至図9は、実施形態2における訪問スケジュール作成装置の構成を示すブロック図であり、図10は、訪問スケジュール作成装置の動作を示すフローチャートである。なお、本実施形態では、上述した実施形態で説明した訪問スケジュール作成装置及び訪問スケジュール作成方法の構成の概略を示している。
・CPU(Central Processing Unit)101(演算装置)
・ROM(Read Only Memory)102(記憶装置)
・RAM(Random Access Memory)103(記憶装置)
・RAM103にロードされるプログラム群104
・プログラム群104を格納する記憶装置105
・情報処理装置外部の記憶媒体110の読み書きを行うドライブ装置106
・情報処理装置外部の通信ネットワーク111と接続する通信インタフェース107
・データの入出力を行う入出力インタフェース108
・各構成要素を接続するバス109
訪問者と被訪問者との位置情報に基づいて、前記訪問者に対して当該訪問者が訪問する前記被訪問者を割り当てた訪問スケジュールを作成し(ステップS101)、
前記位置情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する優先度合いを表す優先度を算出し(ステップS102)、
前記優先度に基づいて、前記訪問者に対する前記被訪問者の割り当てを変更した前記訪問スケジュールを作成する(ステップS103)、
という処理を実行する。
上記実施形態の一部又は全部は、以下の付記のようにも記載されうる。以下、本発明における訪問スケジュール作成方法、訪問スケジュール作成装置、プログラムの構成の概略を説明する。但し、本発明は、以下の構成に限定されない。
(付記1)
訪問者と被訪問者との位置情報に基づいて、前記訪問者に対して当該訪問者が訪問する前記被訪問者を割り当てた訪問スケジュールを作成し、
前記位置情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する優先度合いを表す優先度を算出し、
前記優先度に基づいて、前記訪問者に対する前記被訪問者の割り当てを変更した前記訪問スケジュールを作成する、
訪問スケジュール作成方法。
(付記2)
付記1に記載の訪問スケジュール作成方法であって、
作成した前記訪問スケジュールにおいて同一の前記訪問者に対して同一時刻に複数の前記被訪問者が割り当てられている場合に、当該同一時刻に割り当てられた前記被訪問者の前記優先度を算出する、
訪問スケジュール作成方法。
(付記3)
付記1又は2に記載の訪問スケジュール作成方法であって、
前記位置情報に基づいて前記訪問者による前記被訪問者間の移動距離を算出し、前記移動距離に基づいて前記優先度を算出する、
訪問スケジュール作成方法。
(付記4)
付記3に記載の訪問スケジュール作成方法であって、
前記移動距離と、予め設定されている前記被訪問者を訪問する予定時刻を表す予定訪問時刻と、に基づいて前記優先度を算出する、
訪問スケジュール作成方法。
(付記5)
付記4に記載の訪問スケジュール作成方法であって、
前記移動距離と、前記予定訪問時刻と、予め設定されている前記被訪問者を訪問したときの滞在時間を表す予定滞在時間と、に基づいて前記優先度を算出する、
訪問スケジュール作成方法。
(付記6)
付記5に記載の訪問スケジュール作成方法であって、
前記予定訪問時刻と前記予定滞在時間とに基づいて前記訪問者が次の前記被訪問者を訪問するまでの空き時間を算出し、前記移動距離と前記空き時間とに基づいて前記優先度を算出する、
訪問スケジュール作成方法。
(付記7)
付記1乃至6のいずれかに記載の訪問スケジュール作成方法であって、
前記訪問者と前記被訪問者との属性を表す属性情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する前記優先度を算出する、
訪問スケジュール作成方法。
(付記8)
付記1乃至7のいずれかに記載の訪問スケジュール作成方法であって、
前記訪問者と前記被訪問者との関連性を表す関連性情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する前記優先度を算出する、
訪問スケジュール作成方法。
(付記9)
付記1乃至8のいずれかに記載の訪問スケジュール作成方法であって、
前記訪問者の前記位置情報の初期値と、前記被訪問者の前記位置情報と、に基づいて、前記訪問者に対して前記被訪問者を割り当てた前記訪問スケジュールを作成し、
前記優先度に基づいて前記訪問スケジュールを作成する際に、前記優先度に基づいて特定された前記被訪問者の前記位置情報に応じて前記訪問者の前記位置情報を変更し、変更された前記位置情報に基づいて前記訪問者に対する前記被訪問者の割り当てを変更した前記訪問スケジュールを作成する、
訪問スケジュール作成方法。
(付記10)
訪問者と被訪問者との位置情報に基づいて、前記訪問者に対して当該訪問者が訪問する前記被訪問者を割り当てた訪問スケジュールを作成する割当部と、
前記位置情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する優先度合いを表す優先度を算出する算出部と、
前記優先度に基づいて、前記訪問者に対する前記被訪問者の割り当てを変更した前記訪問スケジュールを作成する再割当部と、
を備えた訪問スケジュール作成装置。
(付記11)
付記10に記載の訪問スケジュール作成装置であって、
前記算出部は、作成した前記訪問スケジュールにおいて同一の前記訪問者に対して同一時刻に複数の前記被訪問者が割り当てられている場合に、当該同一時刻に割り当てられた前記被訪問者の前記優先度を算出する、
訪問スケジュール作成装置。
(付記12)
付記10又は11に記載の訪問スケジュール作成装置であって、
前記算出部は、前記位置情報に基づいて前記訪問者による前記被訪問者間の移動距離を算出し、前記移動距離に基づいて前記優先度を算出する、
訪問スケジュール作成装置。
(付記13)
付記12に記載の訪問スケジュール作成装置であって、
前記算出部は、前記移動距離と、予め設定されている前記被訪問者を訪問する予定時刻を表す予定訪問時刻と、に基づいて前記優先度を算出する、
訪問スケジュール作成装置。
(付記14)
付記13に記載の訪問スケジュール作成装置であって、
前記算出部は、前記移動距離と、前記予定訪問時刻と、予め設定されている前記被訪問者を訪問したときの滞在時間を表す予定滞在時間と、に基づいて前記優先度を算出する、
訪問スケジュール作成装置。
(付記15)
付記14に記載の訪問スケジュール作成装置であって、
前記算出部は、前記予定訪問時刻と前記予定滞在時間とに基づいて前記訪問者が次の前記被訪問者を訪問するまでの空き時間を算出し、前記移動距離と前記空き時間とに基づいて前記優先度を算出する、
訪問スケジュール作成装置。
(付記16)
付記10乃至15のいずれかに記載の訪問スケジュール作成装置であって、
前記算出部は、前記訪問者と前記被訪問者との属性を表す属性情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する前記優先度を算出する、
訪問スケジュール作成装置。
(付記17)
付記10乃至16のいずれかに記載の訪問スケジュール作成装置であって、
前記算出部は、前記訪問者と前記被訪問者との関連性を表す関連性情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する前記優先度を算出する、
訪問スケジュール作成装置。
(付記18)
付記10乃至17のいずれかに記載の訪問スケジュール作成装置であって、
前記割当部は、前記訪問者の前記位置情報の初期値と、前記被訪問者の前記位置情報と、に基づいて、前記訪問者に対して前記被訪問者を割り当てた前記訪問スケジュールを作成し、
前記再割当部は、前記優先度に基づいて前記訪問スケジュールを作成する際に、前記優先度に基づいて特定された前記被訪問者の前記位置情報に応じて前記訪問者の前記位置情報を変更し、変更された前記位置情報に基づいて前記訪問者に対する前記被訪問者の割り当てを変更した前記訪問スケジュールを作成する、
訪問スケジュール作成装置。
(付記19)
コンピュータに、
訪問者と被訪問者との位置情報に基づいて、前記訪問者に対して当該訪問者が訪問する前記被訪問者を割り当てた訪問スケジュールを作成し、
前記位置情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する優先度合いを表す優先度を算出し、
前記優先度に基づいて、前記訪問者に対する前記被訪問者の割り当てを変更した前記訪問スケジュールを作成する、
処理を実行させるためのプログラムを記憶したコンピュータにて読み取り可能な記憶媒体。
11 割当部
12 算出部
13 再割当部
14 訪問データ記憶部
100 訪問スケジュール作成装置
101 CPU
102 ROM
103 RAM
104 プログラム群
105 記憶装置
106 ドライブ装置
107 通信インタフェース
108 入出力インタフェース
109 バス
110 記憶媒体
111 通信ネットワーク
121 割当部
122 算出部
123 再割当部
Claims (19)
- 訪問者と被訪問者との位置情報に基づいて、前記訪問者に対して当該訪問者が訪問する前記被訪問者を割り当てた訪問スケジュールを作成し、
前記位置情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する優先度合いを表す優先度を算出し、
前記優先度に基づいて、前記訪問者に対する前記被訪問者の割り当てを変更した前記訪問スケジュールを作成する、
訪問スケジュール作成方法。 - 請求項1に記載の訪問スケジュール作成方法であって、
作成した前記訪問スケジュールにおいて同一の前記訪問者に対して同一時刻に複数の前記被訪問者が割り当てられている場合に、当該同一時刻に割り当てられた前記被訪問者の前記優先度を算出する、
訪問スケジュール作成方法。 - 請求項1又は2に記載の訪問スケジュール作成方法であって、
前記位置情報に基づいて前記訪問者による前記被訪問者間の移動距離を算出し、前記移動距離に基づいて前記優先度を算出する、
訪問スケジュール作成方法。 - 請求項3に記載の訪問スケジュール作成方法であって、
前記移動距離と、予め設定されている前記被訪問者を訪問する予定時刻を表す予定訪問時刻と、に基づいて前記優先度を算出する、
訪問スケジュール作成方法。 - 請求項4に記載の訪問スケジュール作成方法であって、
前記移動距離と、前記予定訪問時刻と、予め設定されている前記被訪問者を訪問したときの滞在時間を表す予定滞在時間と、に基づいて前記優先度を算出する、
訪問スケジュール作成方法。 - 請求項5に記載の訪問スケジュール作成方法であって、
前記予定訪問時刻と前記予定滞在時間とに基づいて前記訪問者が次の前記被訪問者を訪問するまでの空き時間を算出し、前記移動距離と前記空き時間とに基づいて前記優先度を算出する、
訪問スケジュール作成方法。 - 請求項1乃至6のいずれかに記載の訪問スケジュール作成方法であって、
前記訪問者と前記被訪問者との属性を表す属性情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する前記優先度を算出する、
訪問スケジュール作成方法。 - 請求項1乃至7のいずれかに記載の訪問スケジュール作成方法であって、
前記訪問者と前記被訪問者との関連性を表す関連性情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する前記優先度を算出する、
訪問スケジュール作成方法。 - 請求項1乃至8のいずれかに記載の訪問スケジュール作成方法であって、
前記訪問者の前記位置情報の初期値と、前記被訪問者の前記位置情報と、に基づいて、前記訪問者に対して前記被訪問者を割り当てた前記訪問スケジュールを作成し、
前記優先度に基づいて前記訪問スケジュールを作成する際に、前記優先度に基づいて特定された前記被訪問者の前記位置情報に応じて前記訪問者の前記位置情報を変更し、変更された前記位置情報に基づいて前記訪問者に対する前記被訪問者の割り当てを変更した前記訪問スケジュールを作成する、
訪問スケジュール作成方法。 - 訪問者と被訪問者との位置情報に基づいて、前記訪問者に対して当該訪問者が訪問する前記被訪問者を割り当てた訪問スケジュールを作成する割当部と、
前記位置情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する優先度合いを表す優先度を算出する算出部と、
前記優先度に基づいて、前記訪問者に対する前記被訪問者の割り当てを変更した前記訪問スケジュールを作成する再割当部と、
を備えた訪問スケジュール作成装置。 - 請求項10に記載の訪問スケジュール作成装置であって、
前記算出部は、作成した前記訪問スケジュールにおいて同一の前記訪問者に対して同一時刻に複数の前記被訪問者が割り当てられている場合に、当該同一時刻に割り当てられた前記被訪問者の前記優先度を算出する、
訪問スケジュール作成装置。 - 請求項10又は11に記載の訪問スケジュール作成装置であって、
前記算出部は、前記位置情報に基づいて前記訪問者による前記被訪問者間の移動距離を算出し、前記移動距離に基づいて前記優先度を算出する、
訪問スケジュール作成装置。 - 請求項12に記載の訪問スケジュール作成装置であって、
前記算出部は、前記移動距離と、予め設定されている前記被訪問者を訪問する予定時刻を表す予定訪問時刻と、に基づいて前記優先度を算出する、
訪問スケジュール作成装置。 - 請求項13に記載の訪問スケジュール作成装置であって、
前記算出部は、前記移動距離と、前記予定訪問時刻と、予め設定されている前記被訪問者を訪問したときの滞在時間を表す予定滞在時間と、に基づいて前記優先度を算出する、
訪問スケジュール作成装置。 - 請求項14に記載の訪問スケジュール作成装置であって、
前記算出部は、前記予定訪問時刻と前記予定滞在時間とに基づいて前記訪問者が次の前記被訪問者を訪問するまでの空き時間を算出し、前記移動距離と前記空き時間とに基づいて前記優先度を算出する、
訪問スケジュール作成装置。 - 請求項10乃至15のいずれかに記載の訪問スケジュール作成装置であって、
前記算出部は、前記訪問者と前記被訪問者との属性を表す属性情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する前記優先度を算出する、
訪問スケジュール作成装置。 - 請求項10乃至16のいずれかに記載の訪問スケジュール作成装置であって、
前記算出部は、前記訪問者と前記被訪問者との関連性を表す関連性情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する前記優先度を算出する、
訪問スケジュール作成装置。 - 請求項10乃至17のいずれかに記載の訪問スケジュール作成装置であって、
前記割当部は、前記訪問者の前記位置情報の初期値と、前記被訪問者の前記位置情報と、に基づいて、前記訪問者に対して前記被訪問者を割り当てた前記訪問スケジュールを作成し、
前記再割当部は、前記優先度に基づいて前記訪問スケジュールを作成する際に、前記優先度に基づいて特定された前記被訪問者の前記位置情報に応じて前記訪問者の前記位置情報を変更し、変更された前記位置情報に基づいて前記訪問者に対する前記被訪問者の割り当てを変更した前記訪問スケジュールを作成する、
訪問スケジュール作成装置。 - コンピュータに、
訪問者と被訪問者との位置情報に基づいて、前記訪問者に対して当該訪問者が訪問する前記被訪問者を割り当てた訪問スケジュールを作成し、
前記位置情報に基づいて、前記訪問者に割り当てた前記被訪問者に対する優先度合いを表す優先度を算出し、
前記優先度に基づいて、前記訪問者に対する前記被訪問者の割り当てを変更した前記訪問スケジュールを作成する、
処理を実行させるためのプログラムを記憶したコンピュータにて読み取り可能な記憶媒体。
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2021/015733 WO2022219811A1 (ja) | 2021-04-16 | 2021-04-16 | 訪問スケジュール作成方法 |
US18/285,727 US20240119375A1 (en) | 2021-04-16 | 2021-04-16 | Visit schedule creation method |
JP2023514304A JPWO2022219811A1 (ja) | 2021-04-16 | 2021-04-16 |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2021/015733 WO2022219811A1 (ja) | 2021-04-16 | 2021-04-16 | 訪問スケジュール作成方法 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2022219811A1 true WO2022219811A1 (ja) | 2022-10-20 |
Family
ID=83640307
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2021/015733 WO2022219811A1 (ja) | 2021-04-16 | 2021-04-16 | 訪問スケジュール作成方法 |
Country Status (3)
Country | Link |
---|---|
US (1) | US20240119375A1 (ja) |
JP (1) | JPWO2022219811A1 (ja) |
WO (1) | WO2022219811A1 (ja) |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2010040000A (ja) * | 2008-08-08 | 2010-02-18 | Nomura Research Institute Ltd | 営業活動支援システム、営業活動支援方法及びコンピュータプログラム |
JP2019219815A (ja) * | 2018-06-18 | 2019-12-26 | 大和ハウス工業株式会社 | スケジュール提案装置、スケジュール提案方法、及びスケジュール提案システム |
JP2020149582A (ja) * | 2019-03-15 | 2020-09-17 | 株式会社三井住友銀行 | 訪問ルート管理システム、モバイル機器、訪問ルート生成方法、表示制御方法、及びプログラム |
-
2021
- 2021-04-16 US US18/285,727 patent/US20240119375A1/en active Pending
- 2021-04-16 JP JP2023514304A patent/JPWO2022219811A1/ja active Pending
- 2021-04-16 WO PCT/JP2021/015733 patent/WO2022219811A1/ja active Application Filing
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2010040000A (ja) * | 2008-08-08 | 2010-02-18 | Nomura Research Institute Ltd | 営業活動支援システム、営業活動支援方法及びコンピュータプログラム |
JP2019219815A (ja) * | 2018-06-18 | 2019-12-26 | 大和ハウス工業株式会社 | スケジュール提案装置、スケジュール提案方法、及びスケジュール提案システム |
JP2020149582A (ja) * | 2019-03-15 | 2020-09-17 | 株式会社三井住友銀行 | 訪問ルート管理システム、モバイル機器、訪問ルート生成方法、表示制御方法、及びプログラム |
Also Published As
Publication number | Publication date |
---|---|
JPWO2022219811A1 (ja) | 2022-10-20 |
US20240119375A1 (en) | 2024-04-11 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP2020013596A (ja) | 情報処理装置、その制御方法及びプログラム | |
González et al. | A proactive transfer policy for critical patient flow management | |
CN101382972A (zh) | 医疗资源信息共享方法及系统 | |
US20160004824A1 (en) | Method, Apparatus, And Computer Program Product For Providing Prioritization Of Subunits In A Geospatial Arrangement | |
Siqueira et al. | Long-term integrated surgery room optimization and recovery ward planning, with a case study in the Brazilian National Institute of Traumatology and Orthopedics (INTO) | |
EP3048578A1 (en) | Server for home-visit-service management assistance system, control method for said server, and control program for said server | |
JP2022013938A (ja) | 電子装置およびその動作方法 | |
CN111776896B (zh) | 电梯调度方法和装置 | |
WO2022219811A1 (ja) | 訪問スケジュール作成方法 | |
JP6333493B2 (ja) | 情報処理装置、情報処理方法、および情報処理プログラム | |
WO2016092687A1 (ja) | 座席指定システム、座席指定方法 | |
JP6501090B1 (ja) | 人員配置決定装置、人員配置決定システムおよび人員配置決定プログラム | |
JP2015060434A (ja) | 会議室割り当てシステム、サーバ、会議室割り当て方法およびプログラム | |
Prabhu et al. | Physician shift scheduling to improve patient safety and patient flow in the emergency department | |
JP3978501B2 (ja) | 予約処理方法および分散型予約システム | |
KR102260092B1 (ko) | 병원 내 병상 배정 방법, 서버 및 컴퓨터프로그램 | |
Valizadeh et al. | A robust mathematical model for blood supply chain network using game theory | |
Geng et al. | Implementation strategies of a contract-based MRI examination reservation process for stroke patients | |
JP2011044041A (ja) | 医療運用評価システム及び医療運用評価プログラム | |
CN112365153B (zh) | 视力障碍者旅游计划制定方法及相关装置 | |
JP2019057220A (ja) | 入院部屋決定プログラム、入院部屋決定方法及び入院部屋決定装置 | |
Xie et al. | A game theory based resource scheduling model for cost reduction in home health care | |
Hasannia-Kolagar et al. | Robust bi-objective operating rooms scheduling problem regarding the shared resources | |
JP4469767B2 (ja) | 配置シミュレーションプログラム、配置シミュレーション方法および配置シミュレーション装置 | |
Al-Mudahka et al. | On a timetabling problem in the health care system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 21937005 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2023514304 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 18285727 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 21937005 Country of ref document: EP Kind code of ref document: A1 |