Method, system and computer device for intelligent scheduling of public transportation vehicles

Abstract

The application relates to the technical field of intelligent traffic, and discloses a bus vehicle intelligent scheduling method, system and computer equipment, which comprises the following steps: selecting judgment factors for designing scheduling, including a previous bus departure plan time, a current bus arrival time, a scheduling interval time period and a buffer time; taking the judgment factors as judgment conditions alone or combining the judgment factors to form judgment conditions, and determining the scheduling time of the bus according to the judgment conditions; the judgment conditions include: whether the current bus arrival time is within the scheduling interval time period; whether the previous bus departure plan time has a future scheduling interval time period; adding the bus departure interval to the previous bus departure plan time to obtain time A, adding the buffer time to the current bus arrival time to obtain time B, and whether time A is later than time B. The application can automatically generate a scheduling table with relatively uniform bus departure intervals, and realizes uniform-point bus scheduling.

Description

Technical Field

[0001] This invention relates to the field of intelligent transportation technology, specifically to a method, system, and computer equipment for intelligent scheduling of public transportation vehicles. Background Technology

[0002] Traditional bus scheduling plans are pre-arranged based on human experience and are mostly stored at the terminal station. When buses are operating on routes and need to access the terminal station to obtain the schedule, factors such as road conditions, departure intervals, and driver rest time make it difficult to obtain the schedule in a timely manner. Since the scheduling plan must meet the departure frequency requirements of the assessment agency while also focusing on passenger service quality, a relatively evenly distributed departure interval is crucial.

[0003] In recent years, intelligent scheduling technology for bus routes has gradually emerged. This technology comprehensively considers scheduling factors such as initial departure frequency, morning and evening peak hours, bus type, express / regular routes, and average waiting time for passengers at stops, assigning different fitness or weight coefficients to determine the degree of influence of each scheduling factor on the scheduling plan. Finally, a bus route schedule is generated, which is then distributed to the bus dispatching mainframe via a dispatching platform. This type of intelligent scheduling technology has improved the problems existing in bus dispatching to some extent. However, limited by objective factors such as road congestion, vehicle resources, and driver resources, as well as the subjective factors of dispatcher skill, this technology currently struggles to achieve relatively uniform departure intervals. Summary of the Invention

[0004] To address the technical problems existing in the prior art, this invention provides a method, system, and computer equipment for intelligent scheduling of public transport vehicles. Taking into account multiple factors, the system automatically generates a schedule with relatively uniform departure intervals based on the first-in-first-out rule, thereby achieving uniform public transport vehicle dispatching.

[0005] The method of this invention is implemented using the following technical solution: A method for intelligent scheduling of public transport vehicles, comprising the following steps:

[0006] S1. Select the factors for determining the bus schedule, including the planned departure time of the previous bus, the current arrival time of the bus at the station, the schedule interval, and the buffer time. The schedule interval includes the start time, the end time, and the schedule interval itself. The start time is the planned departure time of the first bus in the schedule interval, and the end time is the planned departure time of the last bus in the schedule interval. The buffer time is the shortest rest time after the bus arrives at the terminal station.

[0007] S2. Use the aforementioned judgment factors individually as judgment conditions, or combine them to form judgment conditions, and determine the bus scheduling time based on the judgment conditions.

[0008] The judgment conditions include: whether the current arrival time of the bus is within the scheduling interval; whether there is a future scheduling interval for the previous departure plan time; the previous departure plan time plus the departure interval to get time A, the current arrival time of the bus plus the buffer time to get time B, and whether time A is later than time B.

[0009] The present invention is implemented using the following technical solution: a system for intelligent scheduling of public transport vehicles, comprising the following modules:

[0010] The judgment factor selection module selects the judgment factors for the design scheduling, including the previous departure plan time, the current arrival time of the bus at the station, the scheduling interval time period, and the buffer time. Among them, the scheduling interval time period includes the start time, the end time, and the scheduling interval. The start time is the planned departure time of the first bus in the scheduling interval time period, and the end time is the planned departure time of the last bus in the scheduling interval time period. The buffer time is the shortest rest time after the bus arrives at the departure terminal.

[0011] The scheduling time determination module uses the judgment factors as individual judgment conditions or combines them to form judgment conditions, and determines the scheduling time of buses based on the judgment conditions.

[0012] The judgment conditions include: whether the current arrival time of the bus is within the scheduling interval; whether there is a future scheduling interval for the previous departure plan time; the previous departure plan time plus the departure interval to get time A, the current arrival time of the bus plus the buffer time to get time B, and whether time A is later than time B.

[0013] Furthermore, the computer device of the present invention includes a processor and a memory, the memory being used to store a processor-executable program, and when the processor executes the program stored in the memory, it implements the intelligent scheduling method for public transport vehicles of the present invention.

[0014] Compared with the prior art, the present invention has the following advantages and beneficial effects:

[0015] In situations where public transportation resources are limited, this invention comprehensively considers factors such as the previous departure schedule, the interval between departures, the current arrival time of the vehicle, and buffer time. It comprehensively judges whether the current arrival time of the vehicle is within the interval between departures and whether there is a future interval between departures from the previous departure schedule. Finally, based on the first-in-first-out rule, it intelligently and automatically generates a schedule, resulting in a relatively evenly distributed departure interval. Ultimately, it achieves unmanned, orderly, and uniform vehicle scheduling. Attached Figure Description

[0016] Figure 1This is a flowchart of the intelligent scheduling method for public transport vehicles in an embodiment of the present invention;

[0017] Figure 2 This is one of the specific flowcharts for determining the scheduling time of public transportation vehicles in this embodiment of the invention;

[0018] Figure 3 This is the second specific flowchart for determining the bus scheduling time in an embodiment of the present invention;

[0019] Figure 4 This is the third flowchart in the embodiments of the present invention for determining the scheduling time of public transport vehicles. Detailed Implementation

[0020] The present invention will be further described in detail below with reference to the embodiments and accompanying drawings, but the embodiments of the present invention are not limited thereto.

[0021] Example 1

[0022] This embodiment provides a method for intelligent scheduling of public transport vehicles, such as... Figure 1 As shown, it includes the following steps:

[0023] S1. Select the factors for determining the shift schedule, including the previous shift's departure time, the current arrival time of the bus at the station, the shift interval, and the buffer time.

[0024] The scheduling interval includes a start time, an end time, and a departure interval (i.e., the scheduling interval itself). The start time is the planned departure time of the first bus within that interval, and the end time is the planned departure time of the last bus within that interval. For example, during the morning rush hour from 6:00 AM to 9:00 AM, the start time is 6:00 AM, which is the planned departure time of the first bus, and the end time is 9:00 AM, which is the planned departure time of the last bus. While the start time is generally considered the actual departure time, the end time may not be the actual departure time due to traffic congestion or other factors. In this embodiment, the end time is selected as a specific factor in the scheduling design.

[0025] In practical applications, the dispatching platform pre-plans bus routes, sets departure intervals for different time periods (i.e., scheduling intervals), and configures buffer times globally. The buffer time is the shortest rest period for buses after arriving at the terminal station; the bus will depart again after the driver has rested. After a bus enters the terminal station, the dispatching platform sends the scheduling plan to the bus's dispatching host, and the bus receives its scheduled time. The dispatching platform sends the scheduling plan according to the first-in, first-out (FIFO) principle, meaning that buses that arrive at the terminal first receive the latest scheduled time first.

[0026] S2. Use the judgment factors selected in step S1 as individual judgment conditions, or combine them to form judgment conditions, and determine the departure time of the bus based on the judgment conditions.

[0027] In this embodiment, when designing the bus scheduling, the selected judgment factors can be used individually or in combination to form judgment conditions. The departure time of the bus is determined based on these judgment conditions. The specific judgment conditions designed in this embodiment include: whether the current arrival time of the bus is within the scheduling interval; whether there is a future scheduling interval (i.e., a future scheduling interval) for the previous scheduled departure time; adding the previous scheduled departure time (i.e., the scheduling time of the previous bus) to the set scheduling interval (i.e., the departure interval) to obtain time A, adding the current arrival time of the bus to the set buffer time (i.e., the shortest rest time) to obtain time B; and selecting the later of time A and time B as the bus's scheduling time (i.e., departure time) to ensure the driver's rest time.

[0028] Among these measures, the set shift interval is greater than the set buffer time; if there is no excessive congestion or vehicle malfunction during the bus's journey from the starting station to the terminal station, the bus can arrive at the station in advance, and the driver has enough rest time.

[0029] like Figures 2-4 As shown, where Figure 2 The process section without a previous departure schedule. Figure 3 For the part of the process that has a previous departure plan and the previous plan falls within the scheduling interval. Figure 4 For the part of the process that has a previous departure plan but is not within the scheduling interval, step S2 specifically includes the following steps:

[0030] S201: When a bus enters the station, it checks if there is a previous departure schedule. If not, it proceeds to S202; otherwise, it proceeds to S204.

[0031] S202. Determine whether the current arrival time of the bus is within the preset schedule. If so, add the buffer time (e.g., 3 minutes) to the current arrival time of the bus as the departure time of the bus (result number ③). Otherwise, proceed to S203.

[0032] S203. Determine whether there is a future time period when the bus is currently entering the station. If there is, take the start time of the future time period as the departure time of the bus (result number ①). Otherwise, determine that the bus has no schedule (result number ④).

[0033] In this embodiment, the future time period, or the future scheduling interval, refers to the time period outside the previous scheduling interval, relative to the bus arrival time, and includes the next scheduling interval; that is, it refers to the next scheduling interval after the bus arrives at the station. For example, a bus route has two preset scheduling intervals for morning and evening peak hours, namely 6:00-9:00 and 16:00-19:00. Therefore, if a bus arrives at the station at 10:00, it can only receive the schedule for 16:00.

[0034] S204. Determine whether the departure time of the previous shift is within the shift interval. If yes, proceed to S205; otherwise, proceed to S211.

[0035] S205. Determine whether the sum of the previous departure schedule time and the set shift interval is greater than the sum of the current arrival time of the bus and the buffer time (e.g., 3 minutes). If it is greater, proceed to S206; otherwise, proceed to S208.

[0036] S206. Determine whether the previous departure schedule time plus the set scheduling interval is within the scheduling interval period. If it is within the scheduling interval period, add the previous departure schedule time plus the set scheduling interval to the scheduling time of the bus departure (result number ②). Otherwise, proceed to S207.

[0037] S207. Determine if there is a future time period for the previous scheduled departure time. If so, use the start time of the future time period as the departure time for this bus (result number). Otherwise, proceed to S220.

[0038] S208. Determine whether the current arrival time of the bus is within the scheduled interval. If so, add a buffer time (e.g., 3 minutes) to the current arrival time and use this as the scheduled departure time for the bus (result number). Otherwise, proceed to S209.

[0039] S209. Determine if there is a future time slot for the current arrival time of the bus. If not, there is no scheduling plan (result number). Otherwise, proceed to S210.

[0040] S210. Determine whether the difference between the current arrival time of the bus and the start time of the future time period is greater than the buffer time (e.g., 3 minutes). If it is greater, use the start time of the future time period as the departure time for the bus (result number). Otherwise, the current arrival time of the bus plus a buffer time (e.g., 3 minutes) will be used as the departure time for that bus (result number). ).

[0041] S211. Determine whether the previous departure plan is greater than the current arrival time of the bus plus the buffer time (e.g., 3 minutes). If it is greater, proceed to S212; otherwise, proceed to S214.

[0042] S212. Determine if the previous departure schedule has a future time slot. If not, there is no scheduled shift (result number). If so, proceed to S213.

[0043] S213. Determine if the difference between the previous scheduled departure time and the start time of the future period is greater than the preset buffer time (e.g., 3 minutes). If it is greater, use the start time of the future period as the departure time for this bus (result number ⑩). Otherwise, add the preset buffer time to the previous scheduled departure time as the departure time for this bus (result number ⑩). ).

[0044] S214. Determine if the previous departure time is greater than the current arrival time of the bus. If it is greater, proceed to S215; otherwise, proceed to S217.

[0045] S215. Determine if there is a future time slot for the previous departure schedule. If so, proceed to S216; otherwise, there is no schedule (result number ⑦).

[0046] S216. Determine whether the difference between the current arrival time of the bus and the start time of the future period of the previous departure plan is greater than the buffer time (e.g., 3 minutes). If it is greater, use the start time of the future period of the previous departure plan as the departure time of the bus (result number ⑥). Otherwise, add the buffer time to the arrival time of the bus as the departure time of the bus (result number ⑧).

[0047] S217. Determine whether the current arrival time of the bus is within the scheduled interval. If so, add the buffer time to the current arrival time of the bus as the scheduled departure time for that bus (result number). Otherwise, proceed to S218.

[0048] S218. Determine if there is a future time slot for the current arrival time of the bus. If so, proceed to S219; otherwise, there is no scheduling plan (result number ⑤).

[0049] S219. Determine whether the difference between the current arrival time of the bus and the start time of the future time period is greater than a preset buffer time (e.g., 3 minutes). If it is greater, use the start time of the future time period as the departure time for the bus (result number 9). Otherwise, add the preset buffer time to the current arrival time of the bus as the departure time for the bus (result number 9). ).

[0050] S220. Determine whether the previous scheduled departure time plus the preset buffer time (e.g., 3 minutes) is greater than the maximum end time of the scheduling interval within which the previous scheduled departure time falls. If it is greater, then there is no scheduling plan (result number). If the result is less than or equal to the previous departure schedule, the maximum end time of the time interval between departures will be used as the departure time for that bus (result number). ).

[0051] S3. According to the first-in, first-out (FIFO) rule, the buses with determined schedules are entered into the bus schedule table to obtain the final schedule plan. To better understand this embodiment, several scheduling examples are given below for specific illustration:

[0052] Case 1: Within the scheduled time frame, buses arrive at the station ahead of time.

[0053] For example, during the 06:00-08:00 shift interval, the departure interval (i.e., the shift interval) is set to 8 minutes, and the buffer time is set to 3 minutes; if a bus arrives at the station at 07:22, and the previous scheduled departure time is 07:20, then steps S201, S204, S205, and S206 above are executed for intelligent scheduling. The specific judgment process for intelligent scheduling is as follows:

[0054] First, when the bus arrived at the station at 07:22, it was determined that there was a previous departure scheduled for 07:20.

[0055] Since the shift interval is from 06:00 to 08:00, it is determined that the previous shift's scheduled departure time of 07:20 falls within the shift interval of 06:00 to 08:00.

[0056] Next, determine whether the previous scheduled departure time plus the departure interval is greater than the current arrival time of the bus plus the preset buffer time. That is, the previous scheduled departure time of 07:20 plus the departure interval of 8 minutes is 07:28, which is greater than the current arrival time of the bus of 07:22 plus the buffer time of 3 minutes is 07:25.

[0057] Since the previous departure time plus the departure interval is 07:28, and the bus is scheduled to depart between 06:00 and 08:00, the departure time for this bus will be set at 07:28.

[0058] Case 2: Within the scheduled work hours, buses arrive at the station later than usual.

[0059] For example, during the 06:00-08:00 shift interval, the departure interval (i.e., the shift interval) is set to 8 minutes, and the buffer time is set to 3 minutes; if a bus arrives at the station at 07:30, and the previous scheduled departure time is 07:20, then steps S201, S204, S205, and S208 above are executed for intelligent scheduling. The specific judgment process for intelligent scheduling is as follows:

[0060] First, when the bus arrives at the station at 07:30, it is determined that there is a previous departure plan with a scheduled departure time of 07:20;

[0061] Since the shift interval is from 06:00 to 08:00, it is determined that the previous shift's scheduled departure time of 07:20 falls within the shift interval of 06:00 to 08:00.

[0062] Next, determine whether the previous scheduled departure time plus the departure interval is greater than the bus's current arrival time plus the preset buffer time. That is, the previous scheduled departure time of 07:20 plus the departure interval of 8 minutes is 07:28, which is less than the bus's current arrival time of 7:30 plus the buffer time of 3 minutes, which is 07:33. Therefore, the result of the bus's current arrival time plus the preset buffer time, 07:33, is taken as the scheduled departure time for this bus.

[0063] Case 3: For the first bus, the bus arrives at the station ahead of schedule.

[0064] For example, during the 06:00-08:00 shift interval, the departure interval (i.e., the shift interval) is set to 8 minutes, and the buffer time is set to 3 minutes; if a bus arrives at the station at 05:50 with no previous departure scheduled, then steps S201, S202, and S203 above are executed for intelligent scheduling. The specific judgment process for intelligent scheduling is as follows:

[0065] First, the bus arrived at the station at 05:50, indicating that there was no previous departure scheduled.

[0066] Further analysis revealed that 05:50 was not within the scheduled interval for the bus's current arrival time at the station.

[0067] Finally, it was determined that the bus had a future time period when it entered the station, which was 06:00-08:00. Therefore, the start time of the future time period, 06:00, was taken as the departure time of the bus.

[0068] Example 2

[0069] Based on the same inventive concept as Embodiment 1, this embodiment provides a system for intelligent scheduling of public transport vehicles, specifically including the following modules:

[0070] The judgment factor selection module selects the judgment factors for the design scheduling, including the previous departure plan time, the current arrival time of the bus at the station, the scheduling interval time period, and the buffer time. Among them, the scheduling interval time period includes the start time, the end time, and the scheduling interval. The start time is the planned departure time of the first bus in the scheduling interval time period, and the end time is the planned departure time of the last bus in the scheduling interval time period. The buffer time is the shortest rest time after the bus arrives at the departure terminal.

[0071] The scheduling time determination module uses the judgment factors as individual judgment conditions or combines them to form judgment conditions, and determines the scheduling time of buses based on the judgment conditions.

[0072] The judgment conditions include: whether the current arrival time of the bus is within the scheduling interval; whether the planned departure time of the previous bus has a future scheduling interval; the previous planned departure time plus the departure interval to get time A, the current arrival time of the bus plus the buffer time to get time B, and whether time A is later than time B.

[0073] The scheduling plan generation module, based on the first-in-first-out rule, fills the bus schedule table with the buses whose scheduled times are determined, and obtains the final scheduling plan.

[0074] The principles followed in determining the bus scheduling time include: the driver's rest time after arriving at the terminal station is greater than or equal to the buffer time; and buses that arrive at the station first have priority in obtaining scheduling time. The modules in this embodiment correspond to the steps in Embodiment 1, and their specific implementation processes are described in Embodiment 1. For example, the scheduling time determination module refers to steps S201-S220 of Embodiment 1 for determining the scheduling time.

[0075] This embodiment also provides a computer device, including a processor and a memory, wherein the memory is used to store a processor-executable program, and when the processor executes the program stored in the memory, it implements the intelligent scheduling method in Embodiment 1.

[0076] The above embodiments are preferred embodiments of the present invention, but the embodiments of the present invention are not limited to the above embodiments. Any changes, modifications, substitutions, combinations, or simplifications made without departing from the spirit and principle of the present invention shall be considered equivalent substitutions and shall be included within the protection scope of the present invention.

Claims

1. A method for intelligent scheduling of public transport vehicles, characterized in that, Includes the following steps: S1. Select the factors for determining the bus schedule, including the planned departure time of the previous bus, the current arrival time of the bus at the station, the schedule interval, and the buffer time. The schedule interval includes the start time, the end time, and the schedule interval itself. The start time is the planned departure time of the first bus in the schedule interval, and the end time is the planned departure time of the last bus in the schedule interval. The buffer time is the shortest rest time after the bus arrives at the terminal station. S2. Use the aforementioned judgment factors individually as judgment conditions, or combine them to form judgment conditions, and determine the bus scheduling time based on the judgment conditions. The judgment conditions include: whether the current arrival time of the bus is within the scheduling interval; whether the planned departure time of the previous bus has a future scheduling interval; the previous planned departure time plus the departure interval to get time A, the current arrival time of the bus plus the buffer time to get time B, and whether time A is later than time B. Step S2 includes the following steps: S201: When a bus enters the station, it is checked whether there is a previous departure schedule. If not, it proceeds to S202; otherwise, it proceeds to S204. S202. Determine whether the current arrival time of the bus is within the preset schedule. If so, add the buffer time to the current arrival time of the bus as the departure time of the bus. Otherwise, proceed to S203. S203. Determine whether there is a future scheduling interval when the bus is currently entering the station. If there is, take the start time of the future scheduling interval as the departure time of the bus. Otherwise, determine that the bus has no scheduling plan. S204. Determine whether the departure time of the previous shift is within the shift interval. If yes, proceed to S205; otherwise, proceed to S211. S205. Determine whether the sum of the previous departure schedule time and the shift interval is greater than the sum of the current arrival time of the bus and the buffer time. If it is greater, proceed to S206; otherwise, proceed to S208. S206. Determine whether the previous scheduled departure time plus the shift interval is within the shift interval period. If it is within the shift interval period, use the previous scheduled departure time plus the shift interval as the departure time of the bus. Otherwise, proceed to S207. S207. Determine if there is a future schedule interval for the previous departure time. If so, use the start time of the future schedule interval as the departure time of the bus. Otherwise, proceed to S220. S208. Determine whether the current arrival time of the bus is within the scheduling interval. If it is, add the buffer time to the current arrival time of the bus and use it as the departure time of the bus. Otherwise, proceed to S209. S209. Determine if there is a future scheduling interval for the current arrival time of the bus. If not, there is no scheduling plan; otherwise, proceed to S210. S210. Determine whether the difference between the current arrival time of the bus and the start time of the future scheduling interval is greater than the buffer time. If it is greater, take the start time of the future scheduling interval as the departure time of the bus. Otherwise, add the buffer time to the current arrival time of the bus as the departure time of the bus. S211. Determine whether the previous departure plan is greater than the current arrival time of the bus plus the buffer time. If it is greater, proceed to S212; otherwise, proceed to S214. S212. Determine if there is a future scheduling interval for the departure time of the previous shift. If not, there is no scheduling plan. If so, proceed to S213. S213. Determine whether the difference between the planned departure time of the previous bus and the start time of the future bus schedule interval is greater than the buffer time. If it is greater, take the start time of the future bus schedule interval as the departure time of the bus. Otherwise, take the planned departure time of the previous bus plus the buffer time as the departure time of the bus. S214. Determine whether the planned departure time of the previous bus is greater than the current arrival time of the bus. If it is greater, proceed to S215; otherwise, proceed to S217. S215. Determine if there is a future scheduling interval between the previous departure schedule. If so, proceed to S216; otherwise, there is no scheduling plan. S216. Determine whether the difference between the current arrival time of the bus and the start time of the future schedule interval of the previous departure plan is greater than the buffer time. If it is greater, take the start time of the future schedule interval of the previous departure plan as the departure time of the bus. Otherwise, add the buffer time to the arrival time of the bus as the departure time of the bus. S217. Determine whether the current arrival time of the bus is within the scheduling interval. If it is, add the buffer time to the current arrival time of the bus as the scheduling time for the bus to leave the station. Otherwise, proceed to S218. S218. Determine if there is a future scheduling interval for the current arrival time of the bus. If so, proceed to S219; otherwise, there is no scheduling plan. S219. Determine whether the difference between the current arrival time of the bus and the start time of the future scheduling interval is greater than the buffer time. If it is greater, take the start time of the future scheduling interval as the departure time of the bus. Otherwise, add the buffer time to the current arrival time of the bus as the departure time of the bus. S220. Determine whether the previous departure schedule time plus the buffer time is greater than the maximum end time of the scheduling interval in which the previous departure schedule time is located. If it is greater, there is no scheduling plan. If it is less than or equal to, the maximum end time of the scheduling interval in which the previous departure schedule time is located is used as the departure schedule time of the bus.

2. The method for intelligent scheduling of public transport vehicles according to claim 1, characterized in that, Step S2 determines the bus scheduling time, following the principles that: the driver's rest time after arriving at the terminal is greater than or equal to the buffer time; and buses that arrive at the terminal first are given priority in obtaining scheduling time.

3. The method for intelligent scheduling of public transport vehicles according to claim 1, characterized in that, The future shift interval will be the next shift interval after the bus arrives at the station.

4. The method for intelligent scheduling of public transport vehicles according to claim 1, characterized in that, The method further includes the following steps: S3. According to the first-in, first-out rule, fill in the bus schedule table with the buses whose scheduled times are determined to obtain the final schedule plan.

5. The method for intelligent scheduling of public transport vehicles according to claim 1, characterized in that, The shift interval is greater than the buffer time.

6. A system for intelligent scheduling of public transport vehicles, characterized in that, Based on the method described in claim 1, the system includes the following modules: The judgment factor selection module selects the judgment factors for the design scheduling, including the previous departure plan time, the current arrival time of the bus at the station, the scheduling interval time period, and the buffer time. Among them, the scheduling interval time period includes the start time, the end time, and the scheduling interval. The start time is the planned departure time of the first bus in the scheduling interval time period, and the end time is the planned departure time of the last bus in the scheduling interval time period. The buffer time is the shortest rest time after the bus arrives at the departure terminal. The scheduling time determination module uses the judgment factors as individual judgment conditions or combines them to form judgment conditions, and determines the scheduling time of buses based on the judgment conditions. The judgment conditions include: whether the current arrival time of the bus is within the scheduling interval; whether there is a future scheduling interval for the previous departure plan time; the previous departure plan time plus the departure interval to get time A, the current arrival time of the bus plus the buffer time to get time B, and whether time A is later than time B.

7. The intelligent scheduling system for public transport vehicles according to claim 6, characterized in that, The system also includes the following modules: The scheduling plan generation module, based on the first-in-first-out rule, fills the bus schedule table with the buses whose scheduled times are determined, and obtains the final scheduling plan.

8. A computer device comprising a processor and a memory, the memory being used to store a processor-executable program, characterized in that, When the processor executes the program stored in the memory, it implements the method of any one of claims 1-5.

Images