Operation schedule creation method and operation schedule creation program
The on-demand bus management system efficiently integrates new passengers into existing schedules, ensuring timely arrival at destinations by dynamically adjusting routes and schedules, thus enhancing the efficiency of demand-based transportation systems.
Patent Information
- Application Number
- JP2023081722
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2023-05-17
- Publication Date
- 2024-11-28
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
Existing demand-based transportation systems face challenges in dynamically adjusting routes to ensure all passengers arrive at their destinations on time for scheduled appointments, especially when new boarding requests are made during operation.
An on-demand bus management system that includes a bus control server and medical examination reservation management server to create and modify travel schedules, allowing for the integration of new passengers while ensuring all passengers can reach their destinations within their allowable time limits.
The system efficiently adjusts schedules to accommodate new passengers, reducing waiting times and maintaining adherence to appointment times, thereby optimizing the transportation process.
Smart Images

Figure 2024165481000001_ABST
Abstract
Description
[Technical field]
[0001] The present invention relates to a method and a program for creating an operation schedule. [Background technology]
[0002] Conventionally, route buses (fixed-time, fixed-route buses) that operate on preset routes according to pre-planned times have been used. However, in some areas, the number of users of such fixed-time, fixed-route buses has decreased due to aging, population decline, and the spread of private cars, and some areas have discontinued these services. In recent years, an increasing number of areas and organizations have introduced demand-based transportation (hereinafter "demand-based transportation") instead of fixed-time, fixed-route buses. Demand-based transportation has various operation forms depending on the operation method, operation schedule, departure and arrival points, the status of other transportation in the operation area, road conditions, etc. For example, in areas where depopulation and aging are serious, demand-based transportation (on-demand shuttle buses) have been introduced as a means of transportation to and from hospitals to improve accessibility to medical care.
[0003] In this type of demand-based transportation, when a vehicle is transporting a passenger and there is a boarding request from another passenger, a method is known in which the vehicle route is flexibly changed so that the passenger can arrive at the destination without delaying the service time (see, for example, Patent Document 1, etc.). [Prior art documents] [Patent documents]
[0004] [Patent Document 1] US Patent Application Publication No. 2013 / 0073327 [Patent Document 2] US Patent Application Publication No. 2022 / 0198402 Summary of the Invention [Problem to be solved by the invention]
[0005] However, once the vehicle has begun operation, it is often difficult to change the route so that all passengers can reach their destinations on time, even if other passengers request to board, because there may be passengers already on the vehicle or scheduled to board who will arrive at their destinations just before the service time.
[0006] In one aspect, the present invention aims to provide a vehicle operation schedule creation method and a vehicle operation schedule creation program that can appropriately change the operation schedule for transporting patients to hospitals in response to new patient requests. [Means for solving the problem]
[0007] In one aspect, a method for creating a travel schedule is a method for creating a travel schedule in which a computer executes a process of creating a travel schedule for transporting one or more first patients to a hospital by vehicle so that the first patients arrive at their appointments in time for their appointments, and when a request is received from a new second patient, modifying the created travel schedule so that the first patient and the second patient are transported to the hospital by vehicle, and if the time at which the first patient can be seen in the modified travel schedule is before the appointment start time of the first patient or after the appointment start time of the first patient but does not exceed the allowable time for the first patient, determining the modified travel schedule as the travel schedule for transporting the first patient and the second patient to the hospital by vehicle. Effect of the Invention
[0008] The vehicle operation schedule for transporting patients to hospitals can be appropriately changed in response to new patient requests. [Brief description of the drawings]
[0009] [Figure 1] 1(a) and 1(b) are diagrams (part 1) for explaining an overview of the process of the on-demand bus management system according to the first embodiment. [Diagram 2] FIG. 2 is a diagram (part 2) for explaining an overview of the process of the on-demand bus management system according to the first embodiment. [Diagram 3] 1 is a diagram illustrating an example of a configuration of an on-demand bus management system according to a first embodiment. [Figure 4] FIG. 4(a) is a diagram showing an example of the hardware configuration of a bus control server and a medical appointment management server, and FIG. 4(b) is a diagram showing an example of the hardware configuration of a bus terminal and a terminal. [Diagram 5] 2 is a functional block diagram of a bus control server and a medical appointment management server. FIG. [Figure 6] FIG. 6(a) is a diagram showing an example of a request table, FIG. 6(b) is a diagram showing an example of a service schedule table, and FIG. 6(c) is a diagram showing an example of a bus information table. [Figure 7] FIG. 7(a) is a diagram showing an example of an allowable time table, and FIG. 7(b) is a diagram showing an example of a reservation information table. [Figure 8] 13 is a flowchart showing a series of processes of the bus control server. [Figure 9] 9 is a flowchart showing details of the operation schedule creation process in step S10 of FIG. 8. [Figure 10] 9 is a flowchart showing details of the bus operation process in step S14 of FIG. 8. [Figure 11] 11(a) is a flowchart showing details of the operation schedule change notification process in step S146 of FIG. 10, and FIG. 11(b) is a flowchart showing details of the bus departure process in step S150 of FIG. [Figure 12] 10 is a flowchart showing details of the operation schedule update process in step S24 of FIG. 8. [Figure 13] 13 is a flowchart showing details of the operation schedule re-creation process in step S246 of FIG. 12. [Figure 14] 13 is a flowchart showing details of the process of determining whether or not a bus in operation can be used in step S248 of FIG. 12. [Figure 15] FIG. 15 is a diagram showing an overview of the process in step S2488 in FIG. 14. [Figure 16] 13 is a flowchart showing a process of the examination reservation management server. [Figure 17] 17 is a flowchart showing details of the examination appointment acceptance process in step S34 of FIG. 16. [Figure 18] FIG. 11 is a diagram showing an example of an allowable time table used in the second embodiment. [Figure 19] 13 is a flowchart showing details of the process (S248) for determining whether or not a bus in operation can be used in the second embodiment. [Figure 20] FIG. 20(a) is a diagram showing an example of an allowable time list used in a modified example of the second embodiment, and FIG. 20(b) is a diagram showing an example of an allowable time table created in a modified example of the second embodiment. [Figure 21] FIG. 11 is a diagram for explaining a third embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0010] First Embodiment A first embodiment of an on-demand bus management system will be described below.
[0011] 1(a) to 2 are diagrams for explaining an overview of the processing of the on-demand bus management system according to the first embodiment. FIG. 1(a) is a diagram showing the appointment status of a patient who has booked an appointment with a hospital that operates an on-demand bus and requested transportation. As shown in FIG. 1(a), patient A has booked an appointment with an internal medicine department from 9:00, patient B has booked an appointment with a surgical department from 9:00, and patient C has booked an appointment with a rehabilitation department from 9:00. The on-demand bus management system has created a bus operation schedule (operating diagram) for transporting patients A, B, and C from their homes to the hospital, for example, in the morning of the day.
[0012] An example of a service schedule is shown in FIG. 1(b). The service schedule in FIG. 1(b) is determined by solving a VRP (Vehicle Route Planning Problem) that calculates an optimal routing diagram for a request. In the example in FIG. 1(b), a bus departs from the hospital, passes through the home of patient A, the home of patient B, and the home of patient C, and delivers patients A, B, and C to the hospital. In this embodiment, the bus service schedule is determined so that all patients who have requested transportation will arrive on time for their appointment.
[0013] However, after the bus starts operating according to the operating schedule, a new patient may suddenly request transportation. For example, assume that a new patient S requests transportation when the bus is operating according to the operating schedule shown in FIG. 1(b). In this case, if the patient S can be transported to the hospital by a bus currently in operation, it is efficient and the waiting time of the patient S can be reduced. Therefore, in this embodiment, as shown in FIG. 2, a transportation schedule (provisional transportation schedule) is created by adding the patient S to the patients A, B, and C and solving the VRP again. Then, it is determined whether there is any problem with adopting the provisional transportation schedule, and if there is no problem, the provisional transportation schedule is adopted as the new transportation schedule. Details of the method for determining whether the new transportation schedule is problem-free will be described later.
[0014] The on-demand bus management system 100 according to the first embodiment will be described in detail below with reference to FIGS.
[0015] An example of the configuration of the on-demand bus management system 100 according to the first embodiment is shown in Fig. 3. As shown in Fig. 3, the on-demand bus management system 100 includes a bus control server 10, a medical appointment management server 20, a bus terminal 60, and a terminal 70. The bus control server 10, the medical appointment management server 20, the bus terminal 60, and the terminal 70 are connected to a network 80 such as the Internet or a VPN (Virtual Private Network).
[0016] The bus control server 10 is an information processing device that manages various information related to the on-demand shuttle buses operated by the hospital, creates a daily operation schedule, and manages the buses so that they are operated appropriately.
[0017] FIG. 4(a) shows an example of the hardware configuration of the bus control server 10. As shown in FIG. 4(a), the bus control server 10 includes a central processing unit (CPU) 90, a read only memory (ROM) 92, a random access memory (RAM) 94, a storage (hard disk drive (HDD), solid state drive (SSD)) 96, a network interface 97, and a portable storage medium drive 99. These components of the bus control server 10 are connected to a transmission bus 98. In the bus control server 10, the CPU 90 executes a program (including a traffic schedule creation program) stored in the ROM 92 or the storage 96, or a program read by the portable storage medium drive 99 from the portable storage medium 91, thereby realizing the functions of the components shown in FIG. 5. The functions of the components of the bus control server 10 shown in FIG. 5 may be realized by an integrated circuit such as an application specific integrated circuit (ASIC) or a field programmable gate array (FPGA). The individual components in FIG. 5 will be described in detail later.
[0018] The examination reservation management server 20 is an information processing device that manages information on examination reservations in each medical department of the hospital. The hardware configuration of the examination reservation management server 20 is similar to that of the bus control server 10 (see FIG. 4(a)). In the examination reservation management server 20, the CPU 90 executes a program to realize the function of a reservation reception unit 21 shown in FIG. 5. The function of the reservation reception unit 21 in FIG. 5 may be realized by an integrated circuit such as an ASIC or FPGA. The reservation reception unit 21 acquires reservation information input from a terminal 70 used by a receptionist of the hospital, and stores and manages the information in a reservation information table 42. The details of the reservation information table 42 and the allowable time table 41 held by the examination reservation management server 20 will be described later.
[0019] The bus terminal 60 is a terminal mounted on a bus or held by a bus driver, and has a function of receiving and displaying information on the bus operation schedule from the bus control server 10. In addition, the bus terminal 60 transmits position information of a bus in motion to the bus control server 10.
[0020] Fig. 4(b) shows an example of a hardware configuration of bus terminal 60. As shown in Fig. 4(b), bus terminal 60 includes CPU 190, ROM 192, RAM 194, storage 196, network interface 197, display unit 193, input unit 195, and portable storage medium drive 199. These components of bus terminal 60 are connected to a transmission bus 198.
[0021] The terminal 70 is a terminal used by a hospital receptionist or the like, or a terminal used by a patient. The terminal 70 transmits information about a medical appointment to the medical appointment management server 20, and transmits a request for transportation by bus (boarding request) to the bus control server 10. The terminal 70 has the same hardware configuration as the bus terminal 60 (see FIG. 4(b)).
[0022] (Functions of the bus control server 10) The bus control server 10 functions as a request receiving unit 11, a bus schedule creating unit 12, a determining unit 13, a bus schedule notifying unit 14, and a bus information receiving unit 15, all of which are shown in FIG.
[0023] The request receiving unit 11 receives requests for bus use by patients from a terminal 70 used by a hospital receptionist or the like or a terminal 70 used by a patient, and stores the received requests in the request table 32. Here, the request table 32 is a table that holds requests from patients who have not yet been taken to the hospital, and has a table structure as shown in FIG. 6(a). Specifically, the request table 32 stores information on "patient ID" that is identification information of the patient who uses the bus, "address" that indicates the location of the patient's home, and "appointment date and time" that indicates the date and time when the patient made an appointment for a medical examination (start date and time of the examination). A request that is stored as "unexpected" in the "appointment date and time" column means a request (unexpected request) from a new patient who has not made an appointment for a medical examination and wants to go to the hospital as soon as possible. Note that a request from a patient who has been taken to the hospital by bus is deleted from the request table 32.
[0024] Returning to Fig. 5, the operation schedule creation unit 12 reads out requests for the day from the request table 32 at a predetermined timing every day, for example, and creates a bus operation schedule for the day. The operation schedule creation unit 12 calculates an optimal routing diagram by solving a VRP (Vehicle Route Planning Problem) based on the requests. The operation schedule creation unit 12 stores the created operation schedule in the operation schedule table 31.
[0025] The operation schedule table 31 is a table that holds the operation schedule created by the operation schedule creation unit 12, and has a table structure as shown in FIG. 6(b). As shown in FIG. 6(b), the operation schedule table 31 has the following items: "Schedule ID", "Bus ID", "Operation Schedule", and "Status". The "Schedule ID" field stores the identification information of the operation schedule, and the "Bus ID" field stores the identification information of the bus that operates according to the operation schedule. The "Operation Schedule" field stores the specific contents of the operation schedule (information indicating the order in which the bus will go to each patient's home, the arrival time and departure time at each patient's home, the departure time and arrival time at the hospital, and the available time for consultation). The available time for consultation is the time when the patient on the bus can be examined, and is set to, for example, a predetermined time after the arrival time at the hospital. The "Status" field stores information indicating whether the bus has "run", "is running", or "has not yet departed".
[0026] Furthermore, when there is an unexpected request (when a request with a reservation date and time of "unexpected" is stored in the request table 32), the operation schedule creation unit 12 executes a process of modifying the operation schedule of the bus currently in operation (operating). Specifically, the operation schedule creation unit 12 creates an operation schedule (called a provisional operation schedule) for transporting patients who are currently being transported by a bus currently in operation and patients who have made an unexpected request. The provisional operation schedule can also be said to be a modified operation schedule. The operation schedule creation unit 12 transmits the provisional operation schedule to the determination unit 13.
[0027] The determination unit 13 determines whether the tentative operation schedule received from the operation schedule creation unit 12 is an appropriate operation schedule. Specifically, the determination unit 13 checks whether all patients can be examined even if the bus is operated according to the tentative operation schedule, based on the allowable time table 41 and the appointment information table 42 held by the medical appointment management server 20. Then, if all patients can be examined, the determination unit 13 determines that the tentative operation schedule is appropriate, and notifies the operation schedule creation unit 12 of that effect. The operation schedule creation unit 12 sets the tentative operation schedule determined to be appropriate as a new operation schedule (overwrites the original operation schedule with the tentative operation schedule).
[0028] Here, the allowable time table 41 is a table that defines for each medical department how late a patient can be from the appointment time and still be examined (how much margin is provided for the appointment) when the patient visits each medical department at the hospital. The allowable time table 41 is created in advance within the hospital. FIG. 7(a) shows an example of the allowable time table 41. In the allowable time table 41, as shown in FIG. 7(a), an "allowable time" is defined for each "medical department." In the example of FIG. 7(a), it is defined that an internal medicine department can be examined even if the patient is 10 minutes late, and a surgery department can be examined even if the patient is 15 minutes late. On the other hand, in the case of the radiology department, it is defined that the patient cannot be examined if the patient is late from the appointment time.
[0029] The appointment information table 42 is a table for managing information regarding appointments for each patient. An example of the appointment information table 42 is shown in Fig. 7(b). As shown in Fig. 7(b), the appointment information table 42 stores a "patient ID" which is the patient's identification information, the "department" for the examination, the "appointment date" which is the date and time for the examination, and the "appointment time".
[0030] The method by which the determining unit 13 determines the suitability of the operation schedule using the permissible time table 41 and the reservation information table 42 will be described in detail later.
[0031] Returning to FIG. 5, the operation schedule notification unit 14 notifies the bus terminal 60 of the operation schedule created by the operation schedule creation unit 12 and the tentative operation schedule (new operation schedule) that the determination unit 13 determines to be appropriate.
[0032] The bus information receiving unit 15 receives location information of buses that are in motion and updates the bus information table 33. The bus information table 33 stores information indicating the status of all buses managed by the hospital. FIG. 6(c) shows an example of the bus information table 33. The bus information table 33 has the items "Bus ID" and "Status." The item "Bus ID" stores bus identification information, and the item "Status" stores information on whether the bus is "in motion" or "waiting."
[0033] (Regarding the processing of the bus control server 10) Next, the processing of the bus control server 10 will be described in detail with reference to the flowcharts of FIGS. 8 to 14 and other drawings as appropriate.
[0034] Fig. 8 is a flowchart showing a series of processes of the bus control server 10. The process in Fig. 8 is executed every business day (day when medical treatment is performed) of the hospital. As a prerequisite for starting the process in Fig. 8, it is assumed that the allowable time (margin) for each medical department is stored in the allowable time table 41, and reservation information for the day (and reservation information for the following days and thereafter) is stored in the reservation information table 42. It is also assumed that the operation schedule table 31 has been reset.
[0035] 8 starts, first, in step S10, the operation schedule creation unit 12 executes a subroutine for operation schedule creation processing. Hereinafter, the operation schedule creation processing in step S10 will be described with reference to the flowchart in FIG.
[0036] (Operation schedule processing (S10)) When the process of FIG. 9 starts, first, in step S102, the operation schedule creation unit 12 acquires all requests for the day from the request table 32 (FIG. 6(a)).
[0037] Next, in step S104, the operation schedule creation unit 12 creates an operation schedule for the day from the acquired request. In this case, the operation schedule creation unit 12 calculates an optimal routing diagram by solving a VRP (Vehicle Route Planning Problem) based on the request.
[0038] Next, in step S106, the operation schedule creation unit 12 stores the created operation schedule in the operation schedule table 31. As a result, all operation schedules for the day are stored in the operation schedule table 31.
[0039] When the above processing is completed, the entire processing in FIG. 9 (the processing in step S10 in FIG. 8) is completed.
[0040] Returning to Fig. 8, after step S10, two processes are executed simultaneously in parallel. Specifically, a first process of steps S12, S14, and S16 and a second process of steps S22, S24, and S26 are executed simultaneously in parallel. Each process will be described below.
[0041] (Regarding the first process) In the first process, first, in step S12, the operation schedule notification unit 14 waits until a predetermined time has elapsed. The predetermined time is, for example, one minute.
[0042] When the predetermined time has elapsed, the operation schedule notification unit 14 proceeds to step S14 and executes bus operation processing. The bus operation processing will be described below with reference to the flowchart in FIG.
[0043] 10 starts, in step S142, the operation schedule notification unit 14 acquires an operation schedule currently in operation from the operation schedule table 31. The operation schedule notification unit 14 acquires an operation schedule in which the "status" is "bus in operation" from the operation schedule table 31.
[0044] Next, in step S144, the operation schedule notification unit 14 judges whether or not the currently operating operation schedule has been updated since the previous processing of step S14. Note that the judgment in step S144 is positive when the currently operating operation schedule has been overwritten in step S24 in Fig. 8 (step S252 in Fig. 12) described later. The operation schedule notification unit 14 holds the operation schedule acquired in the previous processing of step S14 and compares it with the newly acquired operation schedule to judge whether or not it has been updated.
[0045] If the determination in step S144 is negative, the process proceeds to step S148. On the other hand, if the determination in step S144 is positive, that is, if any of the operation schedules has been updated, the operation schedule notification unit 14 proceeds to step S146.
[0046] When the process proceeds to step S146, the operation schedule notification unit 14 executes an operation schedule change notification process. In this operation schedule change notification process (S146), the process shown in FIG.
[0047] When the process of FIG. 11(a) is started, first, in step S1462, the operation schedule notification unit 14 identifies the bus ID that is operating according to the updated operation schedule. Next, in step S1464, the operation schedule notification unit 14 notifies the bus terminal 60 mounted on the bus that is running according to the updated operation schedule that the operation schedule has been updated. This allows the notified bus to operate based on the updated operation schedule. The update of the operation schedule may also be notified to the terminal 70 of the patient riding the bus. In addition, when notifying, the updated part may be displayed in a different manner from the rest to make the updated part easier to see. When the process of FIG. 11(a) is completed, the process proceeds to step S148 of FIG. 10.
[0048] In step S148, the operation schedule notification unit 14 judges whether or not there is an operation schedule to be currently executed in the operation schedule. If the judgment in step S148 is negative, the process proceeds to step S152.
[0049] On the other hand, if the determination in step S148 is positive, the process proceeds to step S150, where the operation schedule notification unit 14 executes a bus departure process. In this bus departure process (S150), the process shown in FIG. 11(b) is executed.
[0050] When the process of FIG. 11(b) starts, first, in step S1502, the operation schedule notification unit 14 acquires the operation schedule to be currently executed from the operation schedule table 31. Next, in step S1504, the operation schedule notification unit 14 acquires the bus ID of the bus in charge of the operation schedule to be currently executed, and notifies the bus terminal 60 mounted on the bus of the operation schedule. Next, in step S1506, the operation schedule notification unit 14 changes the bus status of the notified operation schedule to "bus running" in the operation schedule table 31. After that, all the processes of FIG. 11(b) are terminated, and the process proceeds to step S152 of FIG. 10.
[0051] When the process proceeds to step S152, the operation schedule creation unit 12 refers to the bus information table 33 and judges whether the bus that was "in motion" has become "waiting". The bus information table 33 is updated based on information (such as location information) that the bus information receiving unit 15 transmits from the bus terminal 60. If the judgment in step S152 is positive, the process proceeds to step S154, and the operation schedule creation unit 12 deletes the request of the patient who was delivered to the hospital by the bus that has finished traveling, among the requests stored in the request table 32. In addition, the operation schedule creation unit 12 updates the "status" of the operation schedule of the bus that has finished traveling to "run" in the operation schedule table 31. After that, the entire process in FIG. 10 is terminated, and the process proceeds to step S16 in FIG. 8. If the judgment in step S152 is negative, the entire process in FIG. 10 is terminated, and the process proceeds to step S16 in FIG. 8.
[0052] When the process proceeds to step S16 in Fig. 8, it is determined whether the process in Fig. 8 has ended. The process in Fig. 8 ends when the hospital consultations for the day are finished or when all bus operations for the day are completed. If the determination in step S16 is negative, the process returns to step S12, and thereafter, the processes and determinations in steps S12, S14, and S16 are repeatedly executed until the determination in step S16 is positive.
[0053] (Regarding the second process) 8, first, in step S22, the request receiving unit 11 waits until a new request is received. When a new bus transfer request (boarding request) is received from the terminal 70 used by the hospital receptionist or the terminal 70 used by the patient, the process proceeds to step S24. The request receiving unit 11 stores the content of the received request in the request table 32.
[0054] When the process proceeds to step S24, an operation schedule update process is executed. This operation schedule update process (S24) is executed according to the flowchart of FIG.
[0055] When the process of FIG. 12 starts, first, in step S242, the operation schedule creation unit 12 acquires a new request from the request table 32. Next, in step S244, the operation schedule creation unit 12 judges whether the new request needs to be incorporated into the currently operating operation schedule. For example, if the new request is a request for a medical appointment for the next day or a request for a medical appointment for several hours later, the judgment in step S244 is negative. If the judgment in step S244 is negative, the operation schedule creation unit 12 proceeds to step S246 and executes the operation schedule re-creation process.
[0056] In step S246, the operation schedule creation unit 12 executes processing according to the flowchart in Fig. 13. Specifically, in the processing in Fig. 13, the operation schedule creation unit 12 determines in step S2462 whether the new request is a request for transportation on the same day. If the determination in step S2462 is negative (if the request is for transportation on the following day or later), the operation schedule creation unit 12 does not process the request and ends all the processing in Fig. 13.
[0057] On the other hand, if the determination in step S2462 is positive (if the request is for transportation on the same day), the operation schedule creation unit 12 proceeds to step S2464 and acquires all requests corresponding to operation schedules that have not yet operated on the same day from the request table 32. That is, all requests other than requests corresponding to operation schedules in operation for which the reservation date and time stored in the request table 32 is the same day are acquired. Note that whether or not a request corresponds to an operation schedule in operation can be determined by whether or not it is a request for a patient who is to be transported or picked up in an operation schedule in which the "status" in the operation schedule table 31 is "bus running".
[0058] Next, in step S2466, the operation schedule creation unit 12 recreates the operation schedule using the acquired request and the new request. This operation schedule recreation process is the same as step S104 in Fig. 9. Next, in step S2468, the operation schedule creation unit 12 deletes the operation schedules that have not yet been operated for that day stored in the operation schedule table 31, and saves the recreated operation schedule.
[0059] Next, in step S2470, the operation schedule creation unit 12 notifies the bus terminal 60 and the patient's terminal 70 of the newly saved operation schedule. By notifying the bus terminal 60 of the new operation schedule in this way, the bus can operate according to the new operation schedule. In addition, since the patient's terminal 70 is also notified of the new operation schedule, the patient can accurately know the time when the bus will come to pick him up.
[0060] When the processes up to step S2470 have been performed as described above, all the processes in FIG. 13 end, and all the processes in FIG. 12 end.
[0061] On the other hand, if the determination in step S244 is positive, that is, if the new request is an unexpected request (if the "reservation date and time" in FIG. 6(a) is "unexpected"), the process proceeds to step S248. In step S248, a process for determining whether or not a bus in operation can be used is executed. Specifically, the process in FIG. 14 is executed.
[0062] When the process of FIG. 14 starts, first, in step S2481, the bus schedule creation unit 12 acquires, from the bus schedule table 31, the bus schedule of the bus currently in operation (the bus schedule in which the “status” is “bus in operation”).
[0063] Next, in step S2482, the operation schedule creation unit 12 acquires a request corresponding to the acquired operation schedule from the request table 32. That is, the operation schedule creation unit 12 acquires a request of a patient who is a transportation target in the acquired operation schedule.
[0064] Next, in step S2483, the operation schedule creation unit 12 creates a tentative operation schedule using the acquired request and the new request (modifies the operation schedule). The creation process of this tentative operation schedule is the same as step S104 in FIG. 9 and step S2466 in FIG. 13. However, the operation schedule creation unit 12 creates the tentative operation schedule by modifying only the untraveled portion of the operation schedule currently in operation. The untraveled portion of the operation schedule can be identified from the bus position information that can be acquired from the bus terminal 60. The operation schedule creation unit 12 transmits the created tentative operation schedule to the determination unit 13.
[0065] Next, in step S2484, the judgment unit 13 acquires the appointment times of all patients corresponding to the request acquired in step S2482 from the appointment information table 42 (FIG. 7(b)).
[0066] Next, in step S2485, the determination unit 13 acquires the permissible time for each medical department from the permissible time table 41 (FIG. 7(a)).
[0067] Next, in step S2486, the determination unit 13 calculates the delay of the hospital arrival time from the hospital arrival time of the tentative operation schedule and the hospital arrival time of the original operation schedule. For example, in the example of schedule ID=S001 (hospital arrival time=12:50) in FIG. 6(b), if the hospital arrival time of the tentative operation schedule is 13:00, the delay is calculated to be 10 minutes.
[0068] Next, in step S2487, the judgment unit 13 calculates the possible examination start time for each patient from the calculated delay. For example, in the example of schedule ID=S001 (possible examination start time=12:55) in FIG. 6(b), if the delay is 10 minutes, the possible examination start time for each patient is calculated as 13:05.
[0069] Next, in step S2488, the judgment unit 13 calculates the difference between the available consultation start time of each patient and the appointment time of each patient. FIG. 15 is a diagram showing an outline of the processing of step S2488. For example, as shown in the upper diagram of FIG. 15, if the available consultation start time is 13:05 and the appointment time of patient A is 13:00, the difference is calculated as +5 minutes. Furthermore, if the appointment times of patients B and E are 12:55, the difference is calculated as +10 minutes. Furthermore, if the appointment time of patient C is 13:10, the difference is calculated as -5 minutes. Furthermore, if the appointment time of patient D is 13:05, the difference is calculated as 0 minutes.
[0070] Next, in step S2489, the judgment unit 13 identifies the maximum value of the difference calculated for each medical department and compares it with the allowable time for each medical department. For example, if the differences calculated for internal medicine patients are +5 minutes, +10 minutes, and -5 minutes as shown in the upper diagram of Fig. 15, the maximum value of these differences is +10 minutes. Also, for example, if the differences calculated for surgery patients are 0 minutes and +10 minutes, the maximum value of these differences is +10 minutes.
[0071] Next, in step S2490, the judgment unit 13 judges whether the maximum value of the difference in all medical departments is equal to or less than the allowable time (see "Comparison" in FIG. 15). If the judgment in this step S2490 is negative, that is, if the maximum value of the difference in at least one medical department exceeds the allowable time, the process proceeds to step S2491. When proceeding to step S2491, the judgment unit 13 judges that the patient who has made a new request cannot use a bus that is currently in operation. The judgment unit 13 notifies the bus schedule creation unit 12 of this judgment result. After that, all the processes in FIG. 14 are terminated, and the process proceeds to step S250 in FIG. 12.
[0072] On the other hand, if the determination in step S2490 is positive, for example, if the maximum difference between all medical departments is equal to or less than the allowable time as shown in Fig. 15, the process proceeds to step S2492. When the process proceeds to step S2492, the determination unit 13 determines that the patient who has made the new request can use a bus that is in operation. The determination unit 13 notifies the operation schedule creation unit 12 of this determination result. After that, all the processes in Fig. 14 are terminated, and the process proceeds to step S250 in Fig. 12.
[0073] When the process proceeds to step S250 in FIG. 12, the operation schedule creation unit 12 judges whether or not the patient who has made the new request can use a bus that is currently in operation. If the judgment in step S250 is negative, the process proceeds to step S246, and as described above, the process proceeds to re-creating the operation schedule by adding the new request to the request corresponding to the operation schedule that has not yet been operated. On the other hand, if the judgment in step S250 is positive, the process proceeds to step S252, and the operation schedule creation unit 12 overwrites the operation schedule currently in operation with the provisional operation schedule (the modified operation schedule) in the operation schedule table 31. That is, in this embodiment, if the provisional operation schedule is a schedule in which all patients are on time for the start time of the consultation, or if they are late, it is within the allowable time, the original operation schedule is replaced with the provisional operation schedule.
[0074] Next, in step S254, the operation schedule creation unit 12 notifies the bus terminal 60 of the bus currently in operation of the contents of the overwritten operation schedule. This allows the bus to pick up patients who were originally included in the operation schedule and patients who have made new requests. Note that in step S254, the overwritten operation schedule may be notified to the terminal 70 of the patient included in the overwritten operation schedule.
[0075] When all the processes in Fig. 12 (all the processes in step S24) are completed as described above, the process proceeds to step S26 in Fig. 8. When the process proceeds to step S26, it is determined whether the processes in Fig. 8 have been completed. If the determination in step S26 is negative, the process returns to step S22, and thereafter, the processes and determinations in steps S22, S24, and S26 are repeatedly executed until the determination in step S26 is positive.
[0076] If the determinations in steps S16 and S26 are affirmative, the entire process in FIG. 8 ends.
[0077] (Regarding the processing of the medical appointment management server 20) Next, the processing of the examination reservation management server 20 will be described in detail with reference to the flowcharts of FIG. 16 and FIG. 17 and other drawings as appropriate.
[0078] The process in Fig. 16 is started when the hospital starts its daily business. When the process in Fig. 16 is started, first, in step S32, the reservation reception unit 21 waits until it receives a new appointment for a medical examination from the terminal 70 used by the hospital reception staff. When the reservation reception unit 21 receives a new appointment for a medical examination, it proceeds to step S34 and executes the appointment reception process.
[0079] Fig. 17 shows a flowchart of the consultation appointment reception process in step S34. When the process in Fig. 17 starts, first, in step S342, the appointment reception unit 21 acquires information about a new consultation appointment. Next, in step S344, the appointment reception unit 21 stores the acquired information about the new consultation appointment in the appointment information table 42. After these processes are performed, the process proceeds to step S36 in Fig. 16.
[0080] When the process proceeds to step S36 in Fig. 16, it is determined whether the hospital's business is completed. If the determination in step S36 is negative, the process returns to step S32, and the processes and determinations in steps S32, S34, and S36 are repeated until the determination in step S36 is positive. On the other hand, if the determination in step S36 is positive, the entire process in Fig. 16 is terminated.
[0081] In the first embodiment, a patient who is a target of transportation according to the operation schedule created by the operation schedule creating unit 12 corresponds to a first patient, and a patient who makes an unexpected request corresponds to a second patient.
[0082] As described above in detail, according to the first embodiment, the operation schedule creation unit 12 creates an operation schedule for sending each patient to the hospital by bus so that each patient arrives in time for the consultation start time (S10 in FIG. 8, S104 in FIG. 9). In addition, when the operation schedule creation unit 12 receives a new request from a new patient, the operation schedule creation unit 12 adds the new patient and modifies the created operation schedule (creates a provisional operation schedule) (S2483 in FIG. 14). Then, if the consultation start time of all patients in the provisional operation schedule is before the consultation start time of each patient or after the consultation start time of each patient but within the allowable time, the determination unit 13 overwrites the created operation schedule with the provisional operation schedule and uses it (S252 in FIG. 12). Thus, in the first embodiment, if the provisional operation schedule is an appropriate operation schedule that allows all patients to be examined, the provisional operation schedule is used. This makes it possible to efficiently send the patient who made the new request to the hospital, and reduces the waiting time of the patient. In addition, since there is no need to change the appointment time of each patient who is taken to and from the hospital by bus, the processing load of the examination appointment management server 20 can be reduced. When the operating schedule is updated with the tentative operating schedule, the terminal 70 in the hospital may be notified of this. This allows each medical department to know in advance that there is a possibility that a patient will not make it to the appointment time.
[0083] In addition, in the first embodiment, when a sudden request occurs, the patient who made the sudden request is incorporated into the currently running operation schedule. This allows the patient who made the sudden request to be delivered to the hospital as soon as possible, thereby reducing the waiting time of the patient who made the sudden request.
[0084] Furthermore, in the first embodiment, the permissible time is determined for each medical department, so that an appropriate permissible time that takes into consideration the characteristics of the medical department and the like can be used for processing.
[0085] In the above embodiment, the allowable time is set for each medical department, but this is not limiting, and the allowable time may be different for each type of medical treatment (examination, surgery, etc.) even for the same medical department. For example, a shorter allowable time may be set for a type of medical treatment that would have a large impact on other patients or on hospital management if the patient is late for an appointment.
[0086] In the first embodiment, the examination start time of all patients who are delivered to the hospital by one bus is uniformly determined based on the arrival time at the hospital in the operation schedule of FIG. 6(b). However, the present invention is not limited to this, and the examination start time of each patient may be calculated separately based on the arrival time at the hospital. In this case, the examination start time of patients who visit each department may be calculated based on the distance from the bus stop at the hospital to each department. In addition, the examination start time of each patient may be calculated based on the age of each patient. In this case, the older the patient, the longer the time between the arrival time at the hospital and the examination start time may be. In addition, the examination start time may be calculated taking into account factors other than the patient's age.
[0087] Second Embodiment The second embodiment will be described below. In the above first embodiment, the allowable time is set for each medical department in the allowable time table 41 (FIG. 7(a)). In the second embodiment, however, an allowable time table 41' as shown in FIG. 18 is used. In the allowable time table 41' in FIG. 18, an allowable time is set in advance for each patient (each patient ID). Note that the allowable time for each patient may be set by the patient himself / herself when making a request for transportation, or may be set by the hospital receptionist.
[0088] In this case, instead of the process of FIG. 14 in the first embodiment, the process shown in FIG. 19 may be performed. In the first embodiment, in step S2485 in FIG. 14, the judgment unit 13 acquires the allowable time of each medical department from the allowable time table 41. Also, in the first embodiment, in step S2489 in FIG. 14, the judgment unit 13 identifies the maximum value of the difference calculated for each medical department and compares it with the allowable time of each medical department. In contrast, in the second embodiment, in step S2485' in FIG. 19, the judgment unit 13 acquires the allowable time of each patient from the allowable time table 41'. Also, in the second embodiment, in step S2489' in FIG. 19, the judgment unit 13 compares the difference between the examination start time and the examination appointment time of each patient with the allowable time of each patient. Then, in step S2490', the judgment unit 13 judges whether the difference between the examination start time and the examination appointment time of all patients is equal to or less than the allowable time of each patient.
[0089] In this manner, as in the first embodiment described above, if the created tentative operation schedule is a schedule that is capable of properly transporting all patients on the bus, the created tentative operation schedule can actually be used.
[0090] By allowing the allowable time to be set for each patient, it is possible to reflect not only the allowable time of the medical department but also the wishes of each patient. For example, even if the allowable time of the medical department is 30 minutes, if the patient himself wants to be examined earlier, the allowable time of that patient can be set shorter (for example, 0 minutes or 5 minutes).
[0091] When setting the allowable time for each patient, an allowable time list as shown in Fig. 20(a) may be prepared in advance. In this case, when setting the allowable time for each patient, the allowable time can be easily set by referring to an allowable time table 41' as shown in Fig. 20(b).
[0092] Third embodiment The third embodiment will be described below. In the third embodiment, when the operation schedule creation unit 12 creates the operation schedule for the day from the acquired request in step S104 of Fig. 9, the allowable time of the medical department where the patient will be examined is taken into consideration.
[0093] For example, assume that appointments are made for each medical department as shown in FIG. 21. If the allowable time for the radiology department is 0 minutes as shown in FIG. 21, if even one patient who visits the radiology department is included in the operation schedule, there is a high possibility that the patient who made the sudden request cannot be included in the operation schedule. In such a case, for example, when creating an operation schedule for the day, an operation schedule is created only for patients other than the radiology department, and an operation schedule is created only for patients in the radiology department (see the thick frame in FIG. 21). This makes it possible to include new requests with a high probability in the operation schedule created only for patients other than the radiology department.
[0094] In the above embodiments, when an unexpected request occurs, the case where it is determined whether or not the currently operating operation schedule can include the transportation of the patient who made the unexpected request is described, but the present invention is not limited to this. For example, when it is determined whether or not the transportation of the patient who made the request can be included in the operation schedule that has not yet been operated, a tentative operation schedule may be created from the operation schedule that has not yet been operated (the operation schedule that has not yet been operated) as in the above embodiments. Then, it may be determined whether the created tentative operation schedule is appropriate as in the above embodiments.
[0095] In the above embodiments, the bus delivers patients to one hospital, but the bus may deliver patients to multiple hospitals. In this case, the allowable time may be determined for each hospital, or for each medical department in each hospital. In the case where the bus delivers patients to multiple hospitals, the bus control server 10 is managed by, for example, a local government, and multiple medical appointment management servers 20 are connected to the bus control server 10.
[0096] The above processing functions can be realized by a computer. In that case, a program is provided that describes the processing contents of the functions that the processing device should have. The above processing functions are realized on the computer by executing the program. The program that describes the processing contents can be recorded on a computer-readable storage medium (excluding carrier waves).
[0097] When a program is distributed, it is sold in the form of a portable storage medium on which the program is recorded, such as a DVD (Digital Versatile Disc), a CD-ROM (Compact Disc Read Only Memory), etc. The program can also be stored in a storage device of a server computer and transferred from the server computer to other computers via a network.
[0098] A computer that executes a program stores, for example, a program recorded on a portable storage medium or a program transferred from a server computer in its own storage device. The computer then reads the program from its own storage device and executes processing in accordance with the program. The computer can also read the program directly from a portable storage medium and execute processing in accordance with that program. The computer can also execute processing in accordance with the received program each time a program is transferred from the server computer.
[0099] The above-described embodiment is a preferred example of the present invention, but the present invention is not limited to this embodiment and can be modified in various ways without departing from the scope of the present invention.
[0100] In addition, the following supplementary notes are disclosed in relation to the above description of the first to third embodiments. (Appendix 1) Create a driving schedule for transporting one or more first patients to a hospital by vehicle so that the first patients arrive at the hospital in time for the start of consultation, When a request is received from a new second patient, modifying the created operation schedule to transport the first patient and the second patient to a hospital by vehicle; If the time when the first patient can be examined in the modified travel schedule is before the first patient's examination start time or after the first patient's examination start time but within a time period not exceeding the first patient's allowable time, the modified travel schedule is determined to be the travel schedule for transporting the first patient and the second patient to the hospital by vehicle. A method for creating an operation schedule, the processing of which is executed by a computer. (Supplementary Note 2) The method for creating a traffic schedule according to Supplementary Note 1, characterized in that the traffic schedule to be corrected in the correction process is a traffic schedule in which the vehicle has already started operating. (Supplementary Note 3) The operation schedule creation method according to Supplementary Note 1 or 2, characterized in that the permissible time is determined for each hospital or department where the first patient is to be examined. (Supplementary Note 4) The operation schedule creation method according to Supplementary Note 1 or 2, characterized in that the permissible time is determined for each of the first patients. (Appendix 5) The method for creating an operation schedule according to any one of Appendices 1 to 4, characterized in that in the process of creating the operation schedule, the allowable time of patients is referenced, and a plurality of patients whose allowable time falls within a predetermined range are set as the first patients. (Appendix 6) Create a driving schedule for transporting one or more first patients to a hospital by vehicle so that the first patients arrive at the hospital in time for the start of consultation; When a request is received from a new second patient, modifying the created operation schedule to transport the first patient and the second patient to the hospital by vehicle; If the time when the first patient can be examined in the modified travel schedule is before the first patient's examination start time or after the first patient's examination start time but within a time period not exceeding the first patient's allowable time, the modified travel schedule is determined to be the travel schedule for transporting the first patient and the second patient to the hospital by vehicle. An operation schedule creation program that causes a computer to execute a process. [Explanation of symbols]
[0101] 10 Bus control server 11 Request Receiving Unit 12. Operation Schedule Creation Department 13 Judgment section 14. Operation Schedule Notification Section 15 Bus information receiver 21 Reservations Department 31 Operation Schedule Table 32 Request Table 33 Bus Information Table 41 Allowable Time Table 42 Reservation Information Table 20 Medical appointment management server 60 Bus Terminal 70 Terminals
Claims
1. Creating a driving schedule for transporting one or more first patients to a hospital by vehicle so that the first patients arrive at the hospital in time for the start of consultation; When a request is received from a new second patient, modifying the created operation schedule to transport the first patient and the second patient to a hospital by vehicle; If the time when the first patient can be examined in the modified travel schedule is before the examination start time of the first patient or after the examination start time of the first patient but within a time period not exceeding the allowable time of the first patient, the modified travel schedule is determined to be the travel schedule for transporting the first patient and the second patient to a hospital by vehicle. A method for creating an operation schedule, the processing of which is executed by a computer.
2. 2. The operation schedule creating method according to claim 1, wherein the operation schedule to be modified in the modification process is an operation schedule in which vehicles have already started operating.
3. 3. The operation schedule creating method according to claim 1, wherein the permissible time is determined for each hospital or department where the first patient is examined.
4. 3. The operation schedule creation method according to claim 1, wherein the permissible time is determined for each of the first patients.
5. 3. The method for creating an operation schedule according to claim 1, wherein in the process of creating the operation schedule, a patient's allowable time is referenced, and a plurality of patients whose allowable time falls within a predetermined range are set as the first patients.
6. Creating a driving schedule for transporting one or more first patients to a hospital by vehicle so that the first patients arrive at the hospital in time for the start of consultation; When a request is received from a new second patient, modifying the created operation schedule to transport the first patient and the second patient to a hospital by vehicle; If the time when the first patient can be examined in the modified travel schedule is before the examination start time of the first patient or after the examination start time of the first patient but within a time period not exceeding the allowable time of the first patient, the modified travel schedule is determined to be the travel schedule for transporting the first patient and the second patient to a hospital by vehicle. An operation schedule creation program that causes a computer to execute a process.
Citation Information
Patent Citations
Urban transportation system and method
US20130073327A1
System and method for scheduling patient appointments
US20220198402A1
Cited By
Operation plan support device and operation plan creation method
JP2026078379A
