Operation management method, server and system

Abstract

The present invention improves the technology for managing the operation of multiple vehicles. An operation management method is provided, wherein multiple circulating buses (10) are respectively put into a circulating route from a base, travel in a predetermined cycle, and return to the base to alternate with other circulating buses (10). The method includes the following actions performed by a server (20): storing an operation schedule of the multiple circulating buses (10); monitoring the status of the multiple circulating buses (10); and, if a first circulating bus (10) traveling on the circulating route breaks down before the first circulating bus (10) completes its predetermined cycle, revising the operation schedule so that a second circulating bus (10) is put into the circulating route and returns to the base to alternate with a third circulating bus (10) before the second circulating bus (10) completes its predetermined cycle.

Description

Technical Field

[0001] The present invention relates to an operation management method, a server and a system. Background Art

[0002] Conventionally, there is a known technique for managing the operation of multiple vehicles. For example, Patent Document 1 discloses an autonomous driving vehicle that performs a circuitous driving according to a driving route provided by a management center.

[0003] Prior art literature

[0004] Patent Literature

[0005] Patent Document 1: Japanese Patent Application Laid-Open No. 2020-013397. Summary of the Invention

[0006] Problems to be solved by the invention

[0007] When a vehicle is operating on a circular route, for example, to perform tasks such as refueling or maintenance on that vehicle, an operation schedule is established to systematically swap that vehicle with another vehicle on standby. On the other hand, if a vehicle operating on the circular route breaks down, for example, swapping that vehicle with another vehicle on standby is a possibility. However, since failures are difficult to predict, swapping vehicles based on the occurrence of a failure could negatively impact the pre-planned operation schedule. Therefore, there is room for improvement in the technology for managing the operation of multiple vehicles.

[0008] The present invention has been made in view of the above-mentioned circumstances, and an object of the present invention is to improve a technology for managing the operation of a plurality of vehicles.

[0009] Methods used to solve problems

[0010] An operation management method according to one embodiment of the present invention is an operation management method for a plurality of circulating buses, wherein the plurality of circulating buses are respectively put into a circulating route from a base station, travel a predetermined circle, and return to the base station to alternate with other circulating buses.

[0011] The operation management method includes the following actions performed by the server:

[0012] storing an operation schedule of the plurality of circulation buses;

[0013] monitoring the status of the plurality of circulating buses;

[0014] If a first loop bus traveling on the loop route breaks down before completing the predetermined cycle, the operation schedule is modified so that a second loop bus is deployed on the loop route and returns to the base before the second loop bus completes the predetermined cycle to be replaced by a third loop bus.

[0015] A server according to one embodiment of the present invention manages the operation of a plurality of circulation buses, each of which is put into a circulation route from a base station, travels a predetermined circuit, and returns to the base station to alternate with other circulation buses.

[0016] The server has a control unit.

[0017] The control unit performs the following actions:

[0018] storing the operation schedules of the plurality of circulation buses,

[0019] monitoring the status of the plurality of circulating buses,

[0020] If a first circulating bus traveling on the circulating route breaks down before completing the predetermined cycle, a second circulating bus is deployed on the circulating route, and the second circulating bus returns to the base before completing the predetermined cycle to alternate with the third circulating bus, thereby revising the operation schedule.

[0021] A system according to one embodiment of the present invention comprises a plurality of circulation buses, each of which is deployed from a base station, travels along a circulation route in a predetermined cycle, and returns to the base station to alternate with other circulation buses. The server manages the operation of the plurality of circulation buses.

[0022] The server stores the operation schedules of the plurality of circulation buses,

[0023] The plurality of circulation buses operate according to the operation schedule,

[0024] The server performs the following actions:

[0025] monitoring the status of the plurality of circulating buses,

[0026] If a first loop bus traveling on the loop route breaks down before the predetermined cycle is completed, a second loop bus is deployed on the loop route, and the second loop bus returns to the base before the predetermined cycle is completed to alternate with the third loop bus, thereby revising the operation schedule.

[0027] The second circulation bus and the third circulation bus operate according to the revised operation schedule.

[0028] Effects of the Invention

[0029] According to one embodiment of the present invention, a technique for managing the operation of a plurality of vehicles is improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] Figure 1 This is a block diagram showing a schematic configuration of a system according to one embodiment of the present invention.

[0031] Figure 2 This is a diagram showing an overview of a transportation service according to one embodiment of the present invention.

[0032] Figure 3 FIG. 1 is a diagram showing an example of an operation schedule before correction.

[0033] Figure 4 1 is a diagram showing an example of a revised operation schedule.

[0034] Figure 5 This is a block diagram showing a schematic configuration of a vehicle.

[0035] Figure 6 This is a block diagram showing the schematic structure of a server.

[0036] Figure 7 This is a flowchart showing the operation of the server. DETAILED DESCRIPTION

[0037] Hereinafter, embodiments of the present invention will be described.

[0038] (Overview of Embodiments)

[0039] refer to Figure 1 , an overview of system 1 according to an embodiment of the present invention is described. System 1 includes a plurality of vehicles 10 and a server 20. The plurality of vehicles 10 and the server 20 can communicate with each other via a network 30 including, for example, the Internet and a mobile communication network. Vehicle 10 is, for example, a passenger vehicle such as a bus, but is not limited thereto and may be any vehicle in which people can ride. Vehicle 10 may also be, for example, autonomous driving at levels 1 to 5 as defined by the SAE (Society of Automotive Engineers). Server 20 is, for example, an information processing device such as a computer.

[0040] In this embodiment, multiple vehicles 10 are used as a loop bus traveling along a loop route. A server 20 manages the operation of the multiple vehicles 10 by notifying the multiple vehicles 10 of an operation schedule. The multiple vehicles 10 operate according to the operation schedule notified from the server 20. Furthermore, if a vehicle 10 traveling along the loop route experiences a malfunction, the server 20 can modify the operation schedule as described below.

[0041] Reference Figure 2 , the outline of the operation of each vehicle 10 operating according to the operation schedule before the revision is described. When a plurality of vehicles 10 are put into the circulation route from the base, they can get on and off passengers at each bus stop X to Z on the circulation route while traveling clockwise on the circulation route. Figure 2 In the figure, three vehicles 10a to 10c are traveling on the circulation path. After entering the circulation path, the multiple vehicles 10 travel a specified number of weeks n (in this embodiment, n=4 weeks), and then return to the base to alternate with other vehicles 10 on standby. Here, "alternation" means that the vehicle 10 returns to the base from the circulation path, and the other vehicles 10 on standby enter the circulation path from the base. Hereinafter, alternating between a vehicle 10 and other vehicles 10 on standby is referred to as "normal replacement". Figure 2 When the plurality of vehicles 10 return to the base from the circulation route, they wait at the base after receiving work such as refueling or maintenance, for example.

[0042] Furthermore, the operation schedule before the revision is defined so that the number of vehicles 10 traveling on the circulation route is, in principle, a predetermined number a (in this embodiment, a=3). Furthermore, the operation schedule before the revision is defined so that the above-mentioned normal replacement occurs once every predetermined period P.

[0043] Reference Figure 3 , specifying the operating schedule before the amendment. Figure 3 It shows the operation schedule assigned to seven vehicles 10a to 10g respectively. The horizontal axis in the figure represents time. Time = 0 is the start time of business for the transportation service using multiple vehicles 10. The period indicated by the rightward arrow indicates that the vehicle 10 is traveling on the circulation path. The length of the arrow represents the time required for the vehicle 10 to rotate around the circulation path (3t in this embodiment). The value inside the arrow indicates the number of laps the vehicle 10 is traveling after being put into the circulation path. The time corresponding to the left end of the arrow with the value "1" inside represents the time when the vehicle 10 is put into the circulation path from the base. In addition, when there is no next arrow to the right of the arrow, the time corresponding to the right end of the arrow represents the time when the vehicle 10 returns to the base from the circulation path.

[0044] In application Figure 3 In the pre-correction operation schedule shown, for example, vehicle 10a enters the loop route from the base at time 0 and returns to the base at time 12t after completing a predetermined number of cycles n (here, n = 4), alternating with vehicle 10d, which is waiting. Vehicle 10d enters the loop route from the base at time 12t and returns to the base at time 24t after completing a predetermined number of cycles n (here, n = 4), alternating with vehicle 10a, which is waiting. In this way, vehicles 10a and 10g operate alternately. Similarly, vehicles 10b and 10e operate alternately, and vehicles 10c and 10f operate alternately. Here, vehicle 10b enters the loop route at time 4t, and vehicle 10c enters the loop route at time 8t, so that multiple vehicles 10 traveling the same cycle do not exist simultaneously. As a result, after time 8t, the number of vehicles 10 traveling the loop route is maintained at a predetermined number (here, 3). Furthermore, the above-mentioned normal replacement occurs once every predetermined period P (here, P = 4t) after time = 12t. Furthermore, since there are no multiple vehicles 10 simultaneously making the same rotation, the predetermined period P can be made longer than the time required for a vehicle 10 to complete one rotation around the circulation route (here, 3t). By extending the predetermined period P during which normal replacement occurs, the frequency of vehicles 10 returning from the circulation route to the base is reduced, thereby increasing the time margin for performing operations such as refueling and maintenance on vehicles 10 returning to the base.

[0045] Furthermore, vehicle 10e is exceptionally added to the circulation route at time t and alternates with vehicle 10b at time 4t. Furthermore, vehicle 10f is exceptionally added to the circulation route at time 2t and alternates with vehicle 10c at time 8t. As a result, after time 2t, the number of vehicles 10 traveling on the circulation route is maintained at a predetermined number (here, 3). Furthermore, the normal replacement described above occurs once every predetermined period P (here, P = 4t) after time 4t. Furthermore, during a fixed period from the start of the transportation service (here, from time 0 to time 8t), multiple vehicles 10 may exist simultaneously in the same cycle. However, to maintain the regular replacement cycle at the predetermined period P (here, P = 4t), vehicles 10e and 10f, which are exceptionally added during this fixed period, alternate with vehicle 10b and vehicle 10c, respectively, until the end of a predetermined cycle n (here, n = 4 cycles).

[0046] Reference Figure 4 , specifying the revised operating schedule. Figure 4 The following describes the operation schedule modified by the server 20 when a vehicle 10b traveling on the loop route breaks down before completing a predetermined number of weeks n (here, n=4 weeks). Figure 3 The difference between the pre-corrected schedule and the schedule is shown. The "×" in the figure indicates that vehicle 10b, which was traveling on the mth cycle (here, m = 2) of the loop, experienced a breakdown at time = 9t and could not travel after time = 9t. Furthermore, the rightward dashed arrow corresponding to vehicle 10b in the figure indicates that the travel of vehicle 10a after time = 10t, which was scheduled in the pre-corrected schedule, has been canceled.

[0047] In this embodiment, if vehicle 10b breaks down during the mth cycle (where m is a natural number greater than 1 and less than n), vehicle 10g is deployed from the base station to the circulation route as a replacement for vehicle 10b. Therefore, the number of vehicles 10 traveling on the circulation route is maintained at a predetermined number (here, three). Specifically, vehicle 10g is deployed to the circulation route at a first timing (here, time = 10t) predetermined based on vehicle 10b's travel during the m+1th cycle (here, m+1 = 3) in the pre-corrected operation schedule. Therefore, except for the period from time = 9t when vehicle 10b breaks down to time = 10t when vehicle 10g is deployed to the circulation route, the number of vehicles 10 traveling on the circulation route is maintained at the predetermined number (here, three). Hereinafter, the situation in which another vehicle 10 is deployed when a vehicle 10 traveling on the circulation route breaks down before completing a predetermined number of cycles n (here, n = 4) will also be referred to as "breakdown replacement."

[0048] Vehicle 10g then returns to the base before completing a predetermined number of cycles n (here, n = 4 cycles) and alternates with vehicle 10e, which was scheduled to alternate with vehicle 10b in the pre-corrected operation schedule. Specifically, vehicle 10g completes its second cycle of travel at a second timing (here, time = 16t) predetermined based on the completion of vehicle 10b's predetermined number of cycles n (here, n = 4 cycles) in the pre-corrected operation schedule, and alternates with vehicle 10e. With this configuration, even in the event of a faulty replacement, the regular replacement cycle remains at the predetermined period P (here, P = 4t). Furthermore, with this configuration, since the regular replacement timing does not need to be adjusted for vehicle 10e, the load on the server 20 that modifies the operation schedule can be reduced compared to the comparative example described below.

[0049] As a comparative example, consider a modified operation schedule in which vehicle 10g, deployed for breakdown replacement, completes its travel for a predetermined number of cycles n (here, n = 4) at time 22t and is replaced by vehicle 10e. In this case, the normal replacement of vehicle 10g with vehicle 10e occurs at time 22t, but the normal replacement of vehicle 10c with vehicle 10f occurs at time 20t, and the normal replacement of vehicle 10d with vehicle 10a occurs at time 24t. Therefore, the normal replacement cycle from time 20t to time 24t is 2t. Therefore, the normal replacement cycle cannot be maintained at the predetermined period P (here, P = 4t). Furthermore, in this case, the timing of vehicle 10e's deployment to the circulation route through normal replacement must be delayed from time 16t to time 22t. Therefore, the timing of normal replacement for vehicle 10e must be adjusted throughout the period after the breakdown of vehicle 10b. Therefore, according to the above-described configuration of the present embodiment, the load on the server 20 that corrects the operation schedule can be reduced in comparison with the comparative example.

[0050] Furthermore, the operation schedule assigned to the broken-down vehicle 10b is reassigned to vehicle 10g after the time when vehicle 10g, deployed on the circulation route for breakdown replacement, returns to the base (here, time = 16t, corresponding to the second time). Specifically, the pre-corrected operation schedule for vehicle 10b is scheduled such that, for example, refueling and maintenance work, etc., are performed on vehicle 10b from time = 16t to time = 28t, and at time = 28t, vehicle 10b alternates with vehicle 10e. Furthermore, reassigning this operation schedule for vehicle 10b to vehicle 10g results in a revised operation schedule for vehicle 10g, such that, for example, refueling and maintenance work, etc. are performed on vehicle 10g from time = 16t to time = 28t, and at time = 28t, vehicle 10g alternates with vehicle 10e. Furthermore, the operation schedule reassigned to vehicle 10b may also be for vehicles other than vehicles 10a to 10g.

[0051] Hereinafter, each structure of the system 1 will be described in detail.

[0052] (Vehicle Structure)

[0053] like Figure 5 As shown, the vehicle 10 includes a communication unit 11 , a positioning unit 12 , an imaging unit 13 , a storage unit 14 , and a control unit 15 .

[0054] The communication unit 11 includes one or more communication interfaces connected to the network 30. These communication interfaces may correspond to, but are not limited to, mobile communication standards such as 4G (4th Generation) or 5G (5th Generation). In this embodiment, the vehicle 10 communicates with the server 20 via the communication unit 11 and the network 30.

[0055] The positioning unit 12 includes one or more devices that acquire position information of the vehicle 10. Specifically, the positioning unit 12 includes, for example, a receiver compatible with GPS, but is not limited thereto and may include a receiver compatible with any satellite positioning system.

[0056] The imaging unit 13 includes one or more cameras. Each camera included in the imaging unit 13 can be installed on the vehicle 10 so as to be able to capture objects outside or inside the vehicle. The images generated by the imaging unit 13 can be used, for example, for autonomous driving control of the vehicle 10.

[0057] The storage unit 14 includes one or more memories. Examples of such memories include, but are not limited to, semiconductor memories, magnetic memories, or optical memories. Each memory included in the storage unit 14 may function as, for example, a main storage device, an auxiliary storage device, or a cache memory. The storage unit 14 stores arbitrary information used for the operation of the vehicle 10. For example, the storage unit 14 may store system programs, application programs, embedded software, and the like. The information stored in the storage unit 14 can be updated using information obtained from the network 30 via the communication unit 11, for example.

[0058] The control unit 15 includes one or more processors, one or more programmable circuits, one or more dedicated circuits, or a combination thereof. The processor may be a general-purpose processor, such as a CPU (Central Processing Unit) or a GPU (Graphics Processing Unit), or a dedicated processor dedicated to a specific process, but is not limited thereto. The programmable circuit may be, for example, an FPGA (Field-Programmable Gate Array), but is not limited thereto. The dedicated circuit may be, for example, an ASIC (Application Specific Integrated Circuit), but is not limited thereto. The control unit 15 controls the overall operation of the vehicle 10. For example, the control unit 15 controls the operation of the vehicle 10 according to an operation schedule notified from the server 20.

[0059] (Server Structure)

[0060] like Figure 6 As shown, the server 20 includes a communication unit 21 , a storage unit 22 , and a control unit 23 .

[0061] The communication unit 21 includes one or more communication interfaces connected to the network 30. These communication interfaces may correspond to, for example, a mobile communication standard, a wired LAN (Local Area Network) standard, or a wireless LAN standard, but are not limited thereto and may correspond to any communication standard. In this embodiment, the server 20 communicates with the vehicle 10 via the communication unit 21.

[0062] The storage unit 22 includes one or more memories. Each memory included in the storage unit 22 can function as, for example, a main storage device, an auxiliary storage device, or a cache memory. The storage unit 22 stores arbitrary information used for the operation of the server 20. For example, the storage unit 22 can store system programs, application programs, databases, map information, and operation schedules for multiple vehicles 10. The information stored in the storage unit 22 can be updated using information obtained from the network 30 via the communication unit 21, for example.

[0063] The control unit 23 includes one or more processors, one or more programmable circuits, one or more dedicated circuits, or a combination thereof. The control unit 23 controls the entire operation of the server 20. The operation of the server 20 controlled by the control unit 23 is described in detail below.

[0064] (Server operation flow)

[0065] Reference Figure 7 , describing the operation of the server 20 of this embodiment.

[0066] Step S100: The control unit 23 of the server 20 stores the operation schedules of the plurality of vehicles 10 in the storage unit 22. The operation schedules may be automatically generated by the control unit 23, input by an operator, or acquired from an external device via the communication unit 21 and the network 30.

[0067] Here, combined Figure 3 The example shown will be described in detail. The operation schedule stored in step S100 is defined so that, from the start time of the transportation service using multiple vehicles 10, multiple vehicles 10 are not present simultaneously during the same week, except for a fixed period (here, from time = 0 to time = 8t). Furthermore, the operation schedule is defined so that a vehicle 10 that has completed a specified week n (here, n = 4 weeks) alternates with another vehicle 10 once every specified period P (here, P = 4t).

[0068] Step S101: The control unit 23 begins monitoring the status of the plurality of vehicles 10. Specifically, the control unit 23 is communicatively connected to each of the plurality of vehicles 10 via the communication unit 21 and the network 30. The control unit 23 notifies the plurality of vehicles 10 of the operation schedule of step S100. The plurality of vehicles 10 each operate according to the operation schedule notified from the server 20. The control unit 23 then receives vehicle information from each vehicle 10, for example, periodically or at arbitrary timings, thereby monitoring the status of each vehicle 10. The vehicle information includes information indicating whether a vehicle 10 has malfunctioned, but is not limited thereto. For example, it may also include arbitrary information related to the vehicle 10, such as the vehicle's location information, vehicle speed, and information indicating deviations from the operation schedule.

[0069] Step S102: The control unit 23 determines whether a malfunction has occurred before the vehicle 10 traveling on the loop route completes a predetermined cycle n. If the vehicle 10 is determined to have a malfunction (Step S102: Yes), the process proceeds to Step S103. On the other hand, if the vehicle 10 is determined to have not a malfunction (Step S102: No), the process repeats Step S102.

[0070] Step S103 : When it is determined in step S102 that a failure has occurred in the vehicle 10 (step S102 —Yes), the control unit 23 corrects the operation schedule stored in step S100 .

[0071] Here, combined Figure 4 Specific examples will be described. If a vehicle 10b traveling on the looping route breaks down before completing a predetermined number of cycles n (here, n = 4), the control unit 23 modifies the operation schedule so that vehicle 10g is added to the looping route and vehicle 10g returns to the base before completing a predetermined number of cycles n (here, n = 4) to alternate with vehicle 10e. Here, if a vehicle 10b breaks down before completing a predetermined number of cycles n (here, n = 4), the operation schedule is modified so that vehicle 10g is added to the looping route. This allows the control unit 23 to maintain the number of vehicles 10 traveling on the looping route at a predetermined number a (here, a = 3).

[0072] Specifically, if vehicle 10b fails during the mth cycle (m is a natural number greater than or equal to 1 and less than n; here, m=2), the operation schedule is modified so that vehicle 10g is placed on the circulation route at a first timing (here, time=10t) scheduled to begin travel by vehicle 10b's m+1th cycle. Furthermore, the operation schedule is modified so that vehicle 10g alternates with vehicle 10e at a second timing (here, time=16t) scheduled to end travel by vehicle 10b's predetermined cycle n (here, n=4).

[0073] Step S104: The control unit 23 reallocates part of the operation schedule allocated to the broken-down vehicle 10 to other vehicles 10. The control unit 23 notifies the multiple vehicles 10 of the operation schedule corrected in steps S103 and S104. Thereafter, the process returns to step 102.

[0074] Here, combined Figure 4 The example of is specifically described. The control unit 23 reassigns the operation schedule assigned to the broken-down vehicle 10b after the time when vehicle 10g returns to the base (here, time = 16t, corresponding to the second time) to vehicle 10g. However, as described above, the target of the operation schedule assignment may also be vehicles other than vehicles 10a to 10g.

[0075] While the present invention has been described with reference to the accompanying drawings and embodiments, it should be noted that those skilled in the art may make various modifications and variations based on the present invention. Therefore, it should be noted that such modifications and variations are encompassed within the scope of the present invention. For example, the functions included in each component or step may be reconfigured without logical inconsistency, and multiple components or steps may be combined into one or divided.

[0076] For example, in the above embodiment, the configuration and operation of the server 20 may be distributed among a plurality of information processing devices that can communicate with each other. Alternatively, for example, some or all of the components of the server 20 may be installed on the vehicle 10.

[0077] Furthermore, in the above-described embodiment, for example, if multiple vehicles 10 traveling on a loop path malfunction within a relatively short period of time, it is not necessary to deploy additional replacement vehicles 10 to the loop path for each of these multiple vehicles 10. For example, an upper limit may be set for the number of replacement vehicles 10 that can be deployed to the loop path within a fixed period starting from the current moment (for example, if the time required for a vehicle 10 to travel one circle on the loop path is set to 3t, the period from the current moment to 3t). Assuming that multiple vehicles 10 traveling on the loop path malfunction within a relatively short period of time, when replacements are implemented for each of these multiple vehicles 10, the number of vehicles 10 waiting at the base may be less than the predetermined number, or even zero. In this case, there is a possibility that a situation may arise where the planned normal replacement cannot be implemented. In contrast, as described above, by setting an upper limit on the number of replacement vehicles 10 that can be deployed to the loop path, the possibility of such a situation occurring can be reduced.

[0078] Furthermore, in the above-described embodiment, when the deviation of a vehicle 10 traveling on the circulation route from the operation schedule (e.g., delay time) becomes larger, the time distance between the vehicle 10 and other vehicles 10 traveling on the circulation route may become shorter than a predetermined value. Figure 3 In the illustrated operation schedule, the time distance between vehicles 10 traveling on the loop route is scheduled to be t. However, if a vehicle 10 is delayed relative to the scheduled operation, this time distance may be shortened by the delay. When a replacement vehicle 10 is deployed to the loop route, for example, through normal replacement or breakdown replacement, the control unit 23 determines whether any of the vehicles 10 traveling on the loop route have a time distance to a destination less than a reference value (e.g., t). The control unit 23 may then withhold deployment of the replacement vehicle 10 until no more vehicles 10 have a time distance to the destination less than the reference value.

[0079] Alternatively, for example, a general-purpose computer may function as the server 20 of the above-described embodiment. Specifically, a program describing the processing details for implementing the various functions of the server 20 of the above-described embodiment is stored in the memory of the general-purpose computer, and the program is read and executed by a processor. Therefore, the present invention may also be implemented as a program executable by a processor or as a non-transitory computer-readable medium storing the program.

[0080] Description of Reference Signs

[0081] 1 system;

[0082] 10, 10a-10g vehicles;

[0083] 11 Ministry of Communications;

[0084] 12 positioning unit;

[0085] 13. Filming Department;

[0086] 14. Storage Department;

[0087] 15. Control Department;

[0088] 20 servers;

[0089] 21 Ministry of Communications;

[0090] 22 Storage Department;

[0091] 23 Control Department;

[0092] 30 network.

Claims

1. A method for managing the operation of a plurality of circulating buses, wherein the plurality of circulating buses are respectively put into a circulating route from a base station, travel a predetermined circuit, and return to the base station to alternate with other circulating buses. The operation management method includes the following actions performed by the server: storing an operation schedule of the plurality of circulation buses, in which a first circulation bus traveling on the circulation route is alternately replaced with a third circulation bus at a second timing predetermined for completion of the travel of the predetermined cycle; monitoring the status of the plurality of circulating buses; If a breakdown occurs before the first loop bus completes the predetermined cycle, the operation schedule is revised so that the second loop bus is deployed on the loop route, and before the second loop bus completes the predetermined cycle, the second loop bus returns to the base station at the second timing in the pre-revised operation schedule to alternate with the third loop bus.

2. The operation management method according to claim 1, wherein: If the first circulation bus breaks down before the predetermined cycle is completed, the server modifies the operation schedule so that the second circulation bus is deployed on the circulation route, thereby maintaining the number of circulation buses traveling on the circulation route.

3. The operation management method according to claim 1, wherein: The predetermined number is set to n, and m is set to a natural number greater than or equal to 1 and less than n. If the first circulation bus breaks down in the mth cycle, the operation schedule is modified so that the second circulation bus is put into the circulation route at the first timing when the first circulation bus is scheduled to start traveling in the (m+1)th cycle.

4. The operation management method according to claim 1, wherein: The operation schedule before the revision is defined so that, from the business start time of the transportation service using the plurality of loop buses, excluding a fixed period, a plurality of loop buses do not exist simultaneously in the same week.

5. The operation management method according to claim 1, wherein: The operation schedule before the revision was defined so that the alternation between the loop bus that ended its travel in a predetermined week and another loop bus occurred once in each predetermined period.

6. The operation management method according to any one of claims 1 to 5, wherein: It also includes the following actions performed by the server: The operation schedule after the timing when the second circulation bus returns to the base point among the operation schedules assigned to the first circulation bus is newly assigned to the second circulation bus or the fourth circulation bus.

7. A server for managing the operation of a plurality of circulation buses, each of which is put into a circulation route from a base station, travels along a predetermined circuit, and returns to the base station to alternate with other circulation buses. The server has a control unit. The control unit performs the following actions: storing an operation schedule of the plurality of loop buses, in which a first loop bus traveling on the loop route is alternately replaced with a third loop bus at a second timing predetermined for completion of the travel of the predetermined cycle; monitoring the status of the plurality of circulating buses, If a breakdown occurs before the first loop bus completes the predetermined cycle, the operation schedule is revised so that the second loop bus is deployed on the loop route, and before the second loop bus completes the predetermined cycle, the second loop bus returns to the base station at the second timing in the pre-revised operation schedule to alternate with the third loop bus.

8. The server according to claim 7, wherein: If the first circulation bus breaks down before the predetermined cycle is completed, the control unit modifies the operation schedule so that the second circulation bus is added to the circulation route, thereby maintaining the number of circulation buses traveling on the circulation route.

9. The server according to claim 7, wherein: The predetermined number is set to n, and m is set to a natural number greater than or equal to 1 and less than n. When the first circulation bus breaks down in the mth cycle, the control unit corrects the operation schedule so that the second circulation bus is put into the circulation route at a first timing when the first circulation bus is scheduled to start traveling in the (m+1)th cycle.

10. The server according to claim 7, wherein: The operation schedule before the revision is defined so that, from the business start time of the transportation service using the plurality of loop buses, excluding a fixed period, a plurality of loop buses do not exist simultaneously in the same week.

11. The server according to claim 7, wherein: The operation schedule before the revision was defined so that the alternation between the loop bus that ended its travel in a predetermined week and another loop bus occurred once in each predetermined period.

12. The server according to any one of claims 7 to 11, wherein: The control unit reassigns the operation schedule after the timing when the second circulation bus returns to the base point, among the operation schedules assigned to the first circulation bus, to the second circulation bus or the fourth circulation bus.

13. A system comprising a plurality of circulation buses and a server, wherein the plurality of circulation buses are respectively put into a circulation route from a base, travel a predetermined circuit, and return to the base to alternate with other circulation buses, and the server manages the operation of the plurality of circulation buses. The server stores an operation schedule of the plurality of loop buses, in which a first loop bus traveling on the loop route is alternately replaced with a third loop bus at a second timing predetermined for completion of the predetermined cycle of travel. The plurality of circulation buses operate according to the operation schedule, The server performs the following actions: monitoring the status of the plurality of circulating buses, If the first loop bus breaks down before the first loop bus completes the predetermined cycle, the operation schedule is revised so that the second loop bus is deployed on the loop route, and before the second loop bus completes the predetermined cycle, at the second timing in the pre-revised operation schedule, the second loop bus returns to the base station and alternates with the third loop bus. The second circulation bus and the third circulation bus operate according to the revised operation schedule.

14. The system according to claim 13, wherein: The predetermined number is set to n, and m is set to a natural number greater than or equal to 1 and less than n. When the first circulation bus breaks down in the mth week, the server modifies the operation schedule so that the second circulation bus is put into the circulation route at a first timing when the first circulation bus is scheduled to start traveling in the m+1th week.

15. The system according to claim 13, wherein: The operation schedule before the revision is defined so that, from the business start time of the transportation service using the plurality of loop buses, excluding a fixed period, a plurality of loop buses do not exist simultaneously in the same week.

16. The system of claim 13, wherein: The operation schedule before the revision was defined so that the alternation between the loop bus that ended its travel in a predetermined week and another loop bus occurred once in each predetermined period.

17. A system according to any one of claims 13 to 16, wherein: The server reallocates the operation schedule assigned to the first circulation bus, which is after the timing when the second circulation bus returns to the base, to the second circulation bus or the fourth circulation bus. The second circulation bus or the fourth circulation bus operates according to the operation schedule that is newly assigned after the timing when the second circulation bus returns to the base.

Images