KR102346602B1 - Automatic bus dispatch method - Google Patents

Abstract

The present invention relates to an automatic bus dispatch method, and more particularly, to an automatic bus dispatch method that includes an extracting step and a list generating step. By using the automatic bus dispatch method, it is possible to generate a bus schedule that satisfies the break times of the drivers operating buses.

Description

Automatic bus dispatch method {AUTOMATIC BUS DISPATCH METHOD}

The present invention relates to an automatic bus dispatching method, and more particularly, to an automatic bus dispatching method including an extracting step and a list generating step.

Buses that run regularly along designated routes at regular intervals include regular buses, seat buses, and village buses. If these buses arrive late rather than at regular intervals due to breakdowns or traffic jams during operation, the person waiting for the bus may have to wait for a very long time. This bus interval may be shortened or significantly increased than the originally determined interval according to various circumstances. If this situation repeats itself, ordinary citizens waiting for the bus will inevitably feel uncomfortable.

Korean Patent Application No. 10-2017-0015345 discloses a bus dispatch method in case of a bus failure. However, the problem of not being able to operate the bus at regular intervals even during rush hour, which is a general commute time, or early morning when traffic is low, has not been solved.

Therefore, there is a need for a technique for solving the above-mentioned problems.

On the other hand, the above-mentioned background art is technical information that the inventor possessed for the purpose of derivation of the present invention or acquired in the process of derivation of the present invention, and cannot necessarily be said to be a known technique disclosed to the general public prior to the filing of the present invention.

An embodiment of the present invention aims to provide an automatic bus dispatching method.

In order to solve the above object, an embodiment of the present invention provides bus route information from bus information, including bus stop information, bus terminal information, operation number information, number of operation buses information, and layout driver information, and the time required between stops within the route. An extraction step of extracting bus stop information including information, converting it into necessary information and storing it as stop information, calculating total operation time information using the first train start time and last train end time included in the bus end information, and the total A data calculation step of calculating dispatch interval information using the operation time information and the number of operation information and calculating spare dispatch time information using the number of operation buses information and the stop information, the total operation time information, the dispatch interval information, and It may include an automatic bus dispatching method, including a list creation step of generating a final bus schedule by using the spare dispatch time information and delivering it to a transportation company.

In addition, the extraction step includes a first extraction step of extracting the bus stop information including the bus route information and information on the required time between stops within the route from the bus information, and a stop within the route extracted in the first extraction step Including an outlier removal step of classifying and removing outliers according to N*{Q05-K*(Q95-05)} or higher or N*{Q95+K*(Q95-Q05)} or higher among the time required between information; The method may include an automatic bus dispatching method in which the bus stop information includes the time required for a stop within the route from which the outlier is removed and the bus route information, and re-storing the bus stop information as the stop information.

In addition, the list generation step includes the first list step of generating a bus schedule by using the stop information, the total operation time information, the dispatch interval information, and the spare dispatch time information, and the first list creation step. A condition determination step of confirming whether the established bus schedule is satisfied with a preset condition and regenerating it according to whether or not it is satisfied and a delivery step of delivering to a company, wherein the condition determination step further includes a regenerating step of regenerating the bus schedule after adjusting the number of drivers included in the batch driver information when the preset condition is not met Including, may include an automatic bus dispatch method.

According to an embodiment of the present invention, it is possible to maintain a preset interval between buses by increasing the interval between buses during early morning hours when traffic is low.

In addition, according to an embodiment of the present invention, it is possible to maintain a preset interval between buses by reducing the interval between buses during commuting time with a large amount of traffic.

In addition, an embodiment of the present invention may adjust the bus dispatch interval in consideration of the break time of bus drivers, which may be shortened according to a longer running time due to road congestion or accidents/breakdowns.

The effects obtainable in the present invention are not limited to the above-mentioned effects, and other effects not mentioned will be clearly understood by those of ordinary skill in the art to which the present invention belongs from the following description. .

1 is a diagram illustrating an example of operation number information and bus terminal information used in the present invention.
2 is a diagram illustrating an example of bus stop information used in the present invention.
3 is a diagram illustrating an automatic bus dispatch method according to an embodiment of the present invention.
4 is a diagram illustrating an extraction step.
5 is a diagram illustrating a list generation step.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those of ordinary skill in the art can easily carry out the present invention. However, the present invention may be implemented in several different forms and is not limited to the embodiments described herein. And in order to clearly explain the present invention in the drawings, parts irrelevant to the description are omitted, and similar reference numerals are attached to similar parts throughout the specification.

Throughout the specification, when a part is "connected" with another part, it includes not only the case of being "directly connected" but also the case of being "electrically connected" with another element in the middle. In addition, when a part "includes" a certain component, this means that other components may be further included, rather than excluding other components, unless otherwise stated.

In the present invention, the bus is not limited to the size and type, such as a large bus, a semi-large bus, a medium-sized bus, a semi-medium bus, a small bus, a light bus, a buggy, and the like. In addition, it is not limited to energy sources that operate buses, such as diesel, CNG, and electricity. Also, unlike regular buses, it is not limited to low-floor buses that have a low floor and no stairs at the entrance. In addition, each operated bus moves along a set route, stops at designated stops within the route, and then operates again.

In the present invention, dispatch means that, when the bus is running, it moves according to a predetermined route, and at this time, the bus is sent from the starting point according to a predetermined interval on the route. In this case, the starting point and the ending point in the predetermined route may be the same, but may be different.

Hereinafter, definitions used in the present invention will be described based on FIGS. 1 and 2 .

FIG. 1 is a diagram illustrating an example of operation number information and bus terminal information used in the present invention, and FIG. 2 is a diagram illustrating an example of bus stop information used in the present invention.

Bus stop information is data stored in the existing BIS, and includes the total route of one bus and the time required for the bus between each stop.

In addition, the bus end information is information including the starting time and arrival time of the starting point for each cycle of the specific route bus. In this case, the operation number information is information indicating a total operation number of a specific route bus.

Hereinafter, an automatic bus dispatch method will be described in detail based on FIGS. 3 to 5 .

3 is a diagram illustrating an automatic bus dispatching method according to an embodiment of the present invention, FIG. 2 is a diagram illustrating an extraction step, and FIG. 3 is a diagram illustrating a list generation step.

In one embodiment of the present invention, bus stop information including bus route information and required time information between stops within a route in bus information, including bus stop information, bus terminal information, operation number information, number of operation buses information, and arrangement driver information Extraction step of extracting and converting into necessary information and storing it as stop information, calculating total operation time information using the first train start time and last train end time included in the bus end information, and the total operation time information and the number of operation information The final bus schedule is calculated using the data calculation step and stop information, total operation time information, dispatch interval information, and spare time It may include a list generation step of creating and delivering to a transportation company. Hereinafter, the extraction step will be described.

In the extraction step, N*{Q05 - It includes an outlier removal step of classifying and removing the required time data corresponding to a value less than or equal to K*(Q95 - Q05)} or greater than or equal to N{Q95 + K *(Q95 - Q05)} as an outlier, and removing bus stop information from anomalies. It is possible to re-store the bus route information and the time required for a stop within the route from which the value has been removed as stop information.

The bus information may include bus stop information, bus end information, operation number information, number of operation buses information, and arrangement driver information. In this case, the bus stop information may include bus route information and time required between stops within the route. For example, the bus route information of 'Gwangjin 03' may include the names of stops within the bus route, such as Junggok 119 Safety Center, Daewon High School, Gu. Saemaeul Geumgo, and Sinseong Market entrance. Also, if it takes 2 minutes and 30 seconds from the Junggok 119 Safety Center stop to the Daewon High School stop, and 2 minutes from the Daewon High School stop to the old Saemaeul Geumgo stop, the time required between stops on the route is 2 minutes and 30 seconds, 2 minutes, etc. Information that can be included in information.

Specifically, the extraction step includes N*{Q05 - K*(Q95 - Q5) among the information about the time required between stops included in the first extraction step of extracting bus stop information from the bus information and the bus stop information extracted in the first extraction step. } may include an outlier removal step of classifying and removing outliers according to values less than or equal to N{Q95 + K *(Q95 - Q05)} or greater.

The first extraction step extracts bus stop information including required bus route information and required time information between stops within the route from bus information including bus stop information, bus end information, operation count information, number of buses operated information, and information about dispatched drivers is a step to If we explain the Incheon village bus number 557 as an example, the bus route information may include the bus route number 557, name of the stop such as Hope Sports Park Entrance, Shinsung Smile, Saemaul Geumgo, and Bupyeong 2-dong Administrative Welfare Center. In addition, if bus No. 557 takes 1 minute from the Hope Sports Park entrance stop to the Shinseongmisoeum stop, and 3 minutes from the Shinseongmisoeum stop to the Saemaeul Geumgo stop, the information of 1 minute and 3 minutes is included in the information on the time required between stops on the route. may be information. In this case, the time required between stops on the route may be 10 minutes from 2 minutes due to severe traffic congestion during bus operation. Also, a 10-minute drive can become a two-minute drive at dawn when traffic is low. These required times that are shorter or longer than the existing ones should be eliminated because they can become factors that can cause incorrect dispatch when dispatching buses in the list generation step to be described later.

Therefore, it is possible to classify and remove the information included in the information on the time required between stops within the route as an outlier under N(Q05 - k*(Q95 - Q05)) or N(Q95 + k *(Q95 - Q05)) as an outlier. have. Specifically, if it is less than or equal to N(Q05 - k*(Q95 - Q05)) or more than N(Q95 + k*(Q95 - Q05)), the outlier among the values included in the information about the time required between stops within the route This is an expression that expresses the minimum and maximum standards for normal values that are not outliers in order to remove them. More specifically, Q05 means the lower 5% value in the time required between stops within a route, and Q95 means the upper 5% value in the time required between stops in the line. In addition, the range obtained by subtracting the lower 5% value from the upper 5% value is classified as a normal range. And the value of k may be any value between 14 and 16, and N may be any value between 0.95 and 1.05.

[Experimental Example 1]

In the past, 100 samples were extracted from the driving records in a specific section, and the case of arriving at a normal time without dynamic conditions among the extracted samples is considered normal operation, and the case of driving under dynamic conditions and arriving at an unusual time is abnormal operation. to be defined as In addition, a dynamic situation is defined as a situation in which a vehicle cannot smoothly operate due to congestion, accidents, construction, etc. on the road.

Then, it was evaluated whether the degree of agreement between the K value and the abnormal operation was within the standard range.

K One 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 concordance 21 29 39 40 50 53 53 59 63 73 80 82 83 91 97 92 82 76 72 66

As a result of the evaluation, it was confirmed that the highest degree of agreement was achieved when the K value was 14 to 16.

[Experimental Example 2]

In addition, it was evaluated whether the degree of agreement fell within the reference range according to the change of the N value within the range of 14 to 16 of the K obtained in Experimental Example 1.

N 0.65 0.7 0.75 0.8 0.85 0.9 0.95 One 1.05 One 1.15 1.2 1.25 1.3 1.35 concordance 59 67 68 72 85 86 90 97 94 87 78 73 68 69 58

Under the premise that the K value is 14 to 16, it can be confirmed that the degree of agreement is more than 90% only when the N value is between 0.95 and 1.05.

Meanwhile, the data operation step is a step of pre-calculating data to be used in the list generation step, which will be described later. At this time, the information used in the list creation step is stop information, total running time information, dispatch interval information, and spare dispatch time information. The bus end information includes the start time of the first train and the end time of the last train of the bus, and the total total running time information is calculated using these. In addition, using the calculated operation time information and operation frequency information, the vehicle dispatch interval information is calculated. In addition, the spare time information is calculated using information on the number of running buses.

More specifically, as for the total running time information, the total running time is calculated by subtracting the start time of the first bus from the end time of the last bus of the bus. If this is changed to the information used in the list creation step later, it becomes the total driving time information. The dispatch interval information is calculated by dividing the previously calculated total operation time information by the operation number information.

For example, if the total operating time of Gwangjin 03 is 17 hours and a total of 100 trips are performed, it is necessary to divide the information on the number of trips from the total running time and operate at an interval of 10.2 minutes for each run. At this time, if 10.2 minutes is changed to the information used in the list creation step later, it becomes the dispatch interval information. The dispatch interval can be considered equal to the waiting time at the bus stop.

If congestion on the road is severe, such as during commuting time, the waiting time at the bus stop is not the same as the dispatch interval, and may be longer than the dispatch interval. In addition, there are not many vehicles on the road at dawn and late at night, so the bus runs quickly, so the waiting time at the bus stop may be shorter than the interval between trains. Such irregular waiting may cause inconvenience to users using the bus.

Therefore, at dawn or late at night when vehicle movement is less, the bus should be operated with a slightly longer interval than the basic interval, and during the same time as commuting time, the bus should be operated with a slightly shorter interval than the basic interval. Accordingly, a dispatch interval that is increased or decreased based on a predetermined dispatch interval is referred to as a spare interval.

In the early morning or late at night, the train operates at an interval that is increased by the extra interval from the existing dispatch interval, and operates at an interval that is reduced by the spare interval from the existing dispatch interval during commuting time. In addition, if the departure time is changed using the calculated spare interval, the bus may arrive at the bus stop at regular intervals. The spare interval is calculated using information on the number of buses, and the information on the number of buses means the number of running buses.

If there are 10 bus drivers, 10 buses may be operated, and fewer buses may be operated than the bus drivers. Spacing is calculated using the formula X/(number of buses + Y). At this time, X and Y are constants that can be changed. For example, if X = 50, Y = 30 and the number of buses is 10, X/(number of buses + Y) = 1.25, 1 minute and 15 seconds of spare time this will be Also, depending on the number of buses, X and Y can be specified differently. If X and Y are fixed values regardless of the number of buses, the route with a small number of buses will have a very large slack time value, and for a route with a large number of buses, the surplus time value will be very large. Since the time value may come out too small, X and Y may change depending on the number of buses running.

However, it is common for each bus operated by a general bus company to operate between 3 and 20 buses per route. In general, the spare interval should be set between 1 minute and 1 minute and 30 seconds to ensure that the interval between trains is large. Stable operation is possible without change. Accordingly, in an embodiment of the present invention, X=50 and Y=30 are set and the margin is calculated.

On the other hand, the list generation step includes the first list generation step of generating a bus schedule using stop information, total operation time information, and dispatch interval information, and whether the bus schedule generated in the first list creation step meets the preset conditions. It includes a condition determination step of verifying and regenerating the bus schedule according to whether or not it is satisfied, and a delivery step of regenerating the bus schedule that meets the preset conditions as a final bus schedule and delivering it to the transportation company operating the bus, The condition determination step may include a regeneration step of regenerating the bus schedule after adjusting the number of input drivers included in the batch driver information when a preset condition is not met. Specifically, the first list generation step is an extraction step It is possible to generate a bus schedule by using the stop information extracted from , from which outliers are removed, the total operation time information calculated in the data calculation step, the dispatch interval information, and the spare dispatch time information.

The bus schedule may include information on how many times the total operation time of the bus consists of operation, and information on a starting time and arrival time for each rotation. In addition, it is possible to generate a bus schedule by changing the departure time by using the calculated spare time information.

Specifically, each bus departure time included in the spare dispatch time information is determined as the first departure time + the section variable corresponding to the corresponding round * spare interval + dispatch interval * (run -1), and the spare interval is the above-mentioned As shown, it can be determined based on 50/(number of buses + 30). In addition, the section variable can be determined by subtracting 1 from the section variable of the previous round in the reduced section and adding 1 to the section variable of the previous round in the extended section.

For example, when a bus with an interval of 10 minutes and a spare interval of 3 minutes advances the bus interval from 06:00 to 07:00, the new departure time is the 1st departure time + the section variable corresponding to the interval * spare interval + dispatch interval It can be calculated as * (time-1).

For example, the new departure time of Round 1 = 6:00 - 03 minutes * Round 1 = 5:57, and the new departure time of Round 2 = 6:10 - 03 minutes * 2nd round = 6:04. can The departure time is changed using the calculated spare time information, but the interval between the new departure time of the first round and the new departure time of the second round is 7 minutes, which is the time obtained by subtracting the spare interval from the original dispatch interval. In addition, if the number of rounds is increased after 7 o'clock, which is the 7th round, the departure time can be calculated in the reverse order of the run. 7:00 - 3 minutes * 7 = 6:42, 7:10 - 3 minutes * 6 = 6:55, the existing dispatch interval of 10 + 3 minutes of spare time becomes the dispatch interval at this time. In this way, the bus schedule is generated in the first list creation step by using the spare time information, the total operation time information, and the dispatch interval information calculated in the data operation step above.

departure time section interval variable dispatch interval round 1 5:57 p.m. reduction section -One 10 minutes round 2 6:04 reduction section -2 round 3 6:11 p.m. reduction section -3 round 4 6:18 p.m. reduction section -4 round 5 6:25 p.m. reduction section -5 round 6 6:32 p.m. reduction section -6 round 7 6:39 p.m. extended section -7 round 8 6:52 p.m. extended section -6 round 9 7:05 extended section -5 round 10 7:18 p.m. extended section -4 Episode 11 7:31 p.m. extended section -3 12th round 7:44 p.m. extended section -2 Episode 13 7:57 p.m. extended section -One round 14 8:10 general section 0 round 15 8:20 general section 0 round 16 8:30 general section 0

For example, the first departure time of Gwangjin 03 is 05:55, and the interval is 7 minutes. Therefore, the departure time of the first starting point may be 05:55 and the departure time of the second starting point may be 06:02. In this way, the departure times of all buses up to the last round are included, and the arrival times of all buses departing and returning can also be included in the bus schedule.

At this time, if the number of bus drivers operating the Gwangjin 03 bus is 10, the bus drivers operate in order from the 1st round, and 10 bus drivers operate in order from the 11th round. The table that includes all these information is the bus schedule. In this case, it may be determined whether the bus allocation table satisfies the condition according to a preset condition in the condition determination step. The preset condition is whether each driver's break time is satisfied when operating according to the generated bus schedule.

For example, 10 drivers who drive a total of 200 rounds of Gwangjin 03 operate the bus sequentially, and the driver who operated the first bus may drive 11 times after operating the first bus. In this case, the time from the first operation to the eleventh operation may be a rest time. The break time can be spent doing other things than eating, cleaning, inspecting the bus, and inspecting the bus. It should be checked whether all of the rest time, including all time from the previous round of operation until the departure time of the next round, is satisfied within the preset time. In this case, the working hours, which is the time for operating the bus, are 8 hours a day excluding overtime, and the break time must be satisfied as long as it does not exceed this. Therefore, when there are a total of 10 drivers driving the Gwangjin 03 bus, if the break time of 9 out of 10 drivers is satisfied and the break time of the remaining one is not met, it is determined that the condition is not met.

For bus schedules that do not meet the break time, bus schedules may be regenerated after adjustment by the driver. For example, if there is a bus route that operates 200 times, and there are 10 drivers in all, each driver needs to make 20 trips. If the break time is not satisfied when each driver runs 20 times, the number of drivers is readjusted from 10 drivers to 11, and a new bus schedule is created. If so, 9 drivers out of 11 run 18 times and 2 drivers run 19 times. Unlike before, the number of trips was reduced by one or two, and the time until the next trip after running was longer. However, if the break time is not satisfied even if the number of drivers is increased to 11, the number is increased to 12. Then, 8 out of 12 people run 17 times, and 4 people run 16 times. The break time was longer when 12 drivers operated 200 times than when 10 drivers operated 200 times, and 11 drivers operated 200 times. If the break time is not met in this way, the number of drivers must be adjusted to regenerate the bus schedule, and check whether the regenerated bus schedule meets the preset conditions. It is possible to regenerate the bus allocation table created in the first list creation step or the bus allocation table regenerated through the re-creation step as the final bus allocation table. The final bus schedule includes information on the number of drivers that have been adjusted to satisfy all drivers' break times, and is a bus schedule that can satisfy all drivers' break times as well. The bus schedule is delivered to the transportation company so that the driver can see the final bus schedule and observe the start, end, and break times.

The description of the present invention described above is for illustration, and those of ordinary skill in the art to which the present invention pertains can understand that it can be easily modified into other specific forms without changing the technical spirit or essential features of the present invention. will be. Therefore, it should be understood that the embodiments described above are illustrative in all respects and not restrictive. For example, each component described as a single type may be implemented in a distributed manner, and likewise components described as distributed may be implemented in a combined form.

The scope of the present invention is indicated by the following claims rather than the above detailed description, and all changes or modifications derived from the meaning and scope of the claims and their equivalent concepts should be interpreted as being included in the scope of the present invention. do.

.

Claims (4)

Extracts bus stop information, including bus route information and time required between stops within the route, from bus information, including bus stop information, bus end information, operation count information, number of buses operated, and layout driver information, and converts it into necessary information an extraction step of storing it as stop information;
The total operation time information is calculated using the first train start time and the last train end time included in the bus end information, and the dispatch interval information is calculated using the total operation time information and the operation number information, and the number of operating buses is used. a data calculation step of calculating spare time information by doing so; and
a list creation step of generating a final bus schedule using the stop information, the total operation time information, the dispatch interval information, and the spare dispatch time information and delivering it to a transportation company;
The extraction step is
A first extraction step of extracting the bus stop information including the bus route information and the required time information between stops within the route from the bus information; and
Among the information on the time required between stops within the route extracted in the first extraction step, it is an outlier according to the value below N*{Q05-K*(Q95-05)} or above N*{Q95+K*(Q95-Q05)} Including an outlier removal step of classifying and removing;
Restoring the bus stop information as the stop information, including information on the time required for a stop within the route from which the outlier is removed, and the bus route information,
The K is determined within the range of 14 to 16, and the N is determined to be an arbitrary value of 0.95 to 1.05, automatic bus dispatching method delete According to claim 1,
The list creation step is
A first list step of generating a bus schedule using the stop information, the total operation time information, the dispatch interval information, and the spare dispatch time information;
A condition determination step of confirming whether the bus schedule generated in the first list generation step meets a preset condition, and regenerating it according to whether it is satisfied;
and a delivery step of regenerating the bus schedule that satisfies the preset condition as the final bus schedule and delivering it to a transportation company operating a bus,
The condition determination step is
When the preset condition is not satisfied, the automatic bus dispatching method further comprising a re-creating step of regenerating the bus schedule after adjusting the number of drivers included in the batched article information 4. The method of claim 3,
Each bus departure time included in the spare time information is,
It is determined by the departure time of the 1st round + the section variable corresponding to the corresponding round * the spare interval + the dispatch interval * (run -1),
The free interval is
It is decided based on 50/ (number of buses + 30)
The interval variable is
Automatic bus dispatch method in which 1 is subtracted from the section variable of the previous round in the reduced section, and 1 is added to the section variable of the previous round in the extended section

Images