Bus route generation method and device and storage medium

Abstract

The application discloses a bus route generation method and device and a storage medium, relates to the technical field of computers, and comprises the following steps: acquiring candidate OD data pairs, each candidate OD data pair comprising two stations; generating candidate bus routes according to the stations in the candidate OD data pairs; and screening final bus routes from the candidate bus routes according to screening factors. The application solves the problem that the bus routes designed by designers are possibly unreasonable due to the influence of the experience of the designers in the prior art, and achieves the effect that the bus routes can be automatically generated, thereby avoiding the influence of the designers. Meanwhile, the application automatically generates the bus routes, and improves the generation efficiency of the bus routes.

Description

TECHNICAL FIELD

[0001] The present application relates to a bus route generation method and device and storage medium, and belongs to the technical field of computers. BACKGROUND

[0002] Buses have become one of the important means of transportation for citizens to travel within the city, and the rationality of bus routes directly affects the travel of the general public.

[0003] In the prior art, bus route designers collect site requirements from citizens and set bus routes based on personal experience and collected site requirements. However, due to the experience of the designers, the designed bus routes may be too long, causing the driver to be too tired to drive the entire journey, or the designed routes may not meet the actual needs of the citizens, resulting in detours, i.e. the problem of unreasonable bus routes designed in the prior art. SUMMARY

[0004] The present application aims to provide a bus route generation method and device and storage medium to solve the problems in the prior art.

[0005] To achieve the above-mentioned purpose, the present application provides the following technical solutions:

[0006] According to a first aspect, the present application provides a bus route generation method, which comprises:

[0007] Obtaining candidate OD data pairs, each candidate OD data pair comprising two sites;

[0008] Generating candidate bus routes according to each site in the candidate OD data pairs;

[0009] Selecting a final bus route from the candidate bus routes according to a screening factor.

[0010] Optionally, the generating candidate bus routes according to each site in the candidate OD data pairs comprises:

[0011] Generating at least two candidate bus routes according to the candidate OD data pairs;

[0012] For each candidate bus route, obtaining existing bus sites along the candidate bus route and inserting the obtained bus sites into the candidate bus route;

[0013] Updating the candidate bus routes according to the distance between adjacent sites in the candidate bus routes and the passenger flow of each site.

[0014] Optionally, the generating at least two candidate bus routes according to the candidate OD data pairs comprises:

[0015] ordering each station in the candidate OD data pair according to at least two sequences;

[0016] determining a shortest path between two adjacent stations for each sequence;

[0017] connecting the stations according to the determined shortest path to obtain a bus route.

[0018] Optionally, the updating the candidate bus route according to the distance between two adjacent stations in the candidate bus route and the passenger flow of each station comprises:

[0019] if the distance between two adjacent stations in the candidate bus route is less than the minimum distance, calculating the passenger flow of the two adjacent stations;

[0020] updating the stations in the candidate bus route according to the calculated passenger flow of the two adjacent stations.

[0021] Optionally, the screening factor comprises at least one of the total length of the bus route, the total flow of the bus route, the connectivity tortuosity of the bus route and the objective function value of the bus route, and the objective function value is a value determined according to the passenger flow per 100 kilometers of the bus route and the number of the candidate OD data pairs passing through the bus route.

[0022] Optionally, the screening the final bus route from the candidate bus routes according to the screening factor comprises:

[0023] if the screening factor comprises the total length of the bus route, screening the bus route whose total length is within a preset range from the candidate bus routes;

[0024] if the screening factor comprises the total flow of the bus route, obtaining the total flow of the candidate bus route, and screening the bus route whose total flow exceeds a minimum flow;

[0025] if the screening factor comprises the connectivity tortuosity of the bus route, screening the bus route whose connectivity tortuosity is lower than a preset tortuosity;

[0026] if the screening factor comprises the objective function value of the bus route, obtaining the objective function value of each candidate bus route, and screening the bus route whose objective function value is the largest.

[0027] Optionally, before the screening the final bus route from the candidate bus routes according to the screening factor, the method further comprises:

[0028] editing the candidate bus routes to obtain edited candidate bus routes, and the editing comprises at least one of adding a station, deleting a station and modifying a station.

[0029] Optionally, the method further comprises:

[0030] acquiring a bus parking lot closest to a starting station and / or an ending station in the candidate bus line;

[0031] modifying the starting station and / or the ending station of the candidate bus line according to the acquired bus parking lot.

[0032] In a second aspect, a bus line generation device is provided, the device comprising a memory and a processor, the memory storing at least one program instruction, and the processor loading and executing the at least one program instruction to implement the method of the first aspect.

[0033] In a third aspect, a computer storage medium is provided, the computer storage medium storing at least one program instruction, and the at least one program instruction being loaded and executed by a processor to implement the method of the first aspect.

[0034] By acquiring candidate OD data pairs, each candidate OD data pair comprising two stations; generating candidate bus lines according to the stations in the candidate OD data pairs; and screening a final bus line from the candidate bus lines according to a screening factor, the problem that a bus line designed by a designer may be unreasonable due to the experience of the designer is solved, and the bus line can be automatically generated, thereby avoiding the influence of the designer. Meanwhile, the bus line is automatically generated, and the generation efficiency of the bus line is improved.

[0035] The above description is only a summary of the technical solutions of the present application. In order to more clearly understand the technical means of the present application and to be able to implement according to the content of the description, the following will be described in detail with the preferred embodiments of the present application and with the help of the accompanying drawings. BRIEF DESCRIPTION OF DRAWINGS

[0036] Figure 1 A method flowchart of a bus line generation method provided by an embodiment of the present application. DETAILED DESCRIPTION

[0037] The technical solutions of the present application will be described in detail below with the help of the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work fall within the scope of protection of the present application.

[0038] In the description of the present application, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer" and the like indicate the orientation or positional relationship shown in the drawings, and are only for the convenience of describing the present application and simplifying the description, and do not indicate or imply that the device or element referred to must have a particular orientation, be constructed and operated in a particular orientation, and therefore cannot be understood as a limitation on the present application. In addition, the terms "first", "second", "third" are only for descriptive purposes and cannot be understood as indicating or implying relative importance.

[0039] In the description of the present application, it should be noted that unless otherwise explicitly specified and limited, the terms "mounting", "connecting", "connecting" should be understood broadly, for example, it can be fixedly connected, or it can be detachably connected, or integrally connected; it can be mechanically connected, or it can be electrically connected; it can be directly connected, or it can be indirectly connected through an intermediate medium, or it can be the communication inside two elements. For those skilled in the art, the specific meaning of the above terms in the present application can be understood according to the specific circumstances.

[0040] In addition, the technical features involved in the different embodiments of the application described below can be combined with each other as long as there is no conflict between them.

[0041] Please refer to Figure 1 , which shows the method flowchart of the bus route generation method provided by an embodiment of the present application, as Figure 1 , the method comprises:

[0042] Step 101, obtaining a candidate OD data pair, each candidate OD data pair comprising two stations;

[0043] Each candidate OD data pair comprises two stations, which are used to indicate that the two stations are included in the bus route at the same time, or the two stations are not included at the same time. The present application obtains the high-demand candidate OD data pair through public opinion survey and feedback.

[0044] Step 102, generating a candidate bus route according to each station in the candidate OD data pair;

[0045] Optionally, the present step comprises:

[0046] First, generating at least two candidate bus routes according to the candidate OD data pair;

[0047] (1) sorting each station in the candidate OD data pair according to at least two sequences;

[0048] n OD pairs are generated For example, for a candidate OD data pair, there are 26 schemes: ((O1, D1), (O2, D2), (O1, O2, D1, D2), (O1, O2, D2, D1), (O1, D1, O2, D2), (O1, D1, D2, O2), (O1, D2, O2, D1), (O1, D2, D1, O2), (O2, O1, D1, D2), (O2, O1, D2, D1), (O2, D1, O1, D2), (O2, D1, D2, O1), (O2, D2, O1, D1), (O2, D2, D1, O1), (D1, O2, O1, D2), (D1, O2, D2, O1), (D1, O1, O2, D2), (D1, O1, D2, O2), (D1, D2, O2, O1), (D1, D2, O1, O2), (D2, O2, D1, O1), (D2, O2, O1, D1), (D2, D1, O2, O1), (D2, D1, O1, O2), (D2, O1, O2, D1), (D2, O1, D1, O2)).

[0049] (2) For each order, determine the shortest path between the adjacent two stations;

[0050] In actual implementation, for each order, the shortest path between the adjacent nodes is found by Dijkstra algorithm.

[0051] (3) The route obtained after connecting the stations according to the determined shortest path is taken as a candidate bus route.

[0052] The corresponding candidate bus route p is obtained after connecting the stations according to the obtained shortest path.

[0053] Secondly, for each candidate bus route, the existing bus stations along the line in the candidate bus route are obtained, and the obtained bus stations are inserted into the candidate bus route.

[0054] In order to facilitate the citizens along the line and improve the use efficiency in the process of bus operation, other stations along the line can be inserted into the candidate bus route. The existing bus stations along the line in the embodiment refer to the stations along the candidate bus route except the candidate OD data pair.

[0055] Thirdly, the candidate bus route is updated according to the distance between the adjacent stations in the candidate bus route and the passenger flow of each station.

[0056] In actual implementation, the distance between two adjacent stations in each candidate bus route can be calculated, and if the distance between the two adjacent stations is less than the minimum distance, the passenger flow of the two stations can be calculated, and the stations in the candidate bus route are updated according to the calculated passenger flow of the two adjacent stations.

[0057] Suppose that all OD data pairs od i,j on the candidate bus route are i,j calculated

[0058]

[0059] where f i,j is the passenger flow between stations i and j, which is obtained according to historical data; L represents the set of bus routes passing through stations i and j at the same time; K represents the number of bus routes passing through stations i and j at the same time; represents the distance from station i to station j on route l; represents the distance from station i to station j on connection path p; and a is a parameter representing the travel habits of residents, which is related to the economy, transportation, culture and the like of the city.

[0060] According to the passenger flow of station i on path p is calculated as where S is the set of existing stations in the candidate bus route.

[0061] For example, the path length d i,j between i and adjacent station j is calculated, and if d i,j <500 m, the passenger flows of stations i and j are compared, and if station j is deleted from set S, and vice versa.

[0062] If the distance between the two adjacent stations is greater than the minimum distance, both stations are retained.

[0063] In step 103, the final bus route is selected from the candidate bus route according to the screening factor.

[0064] The screening factor includes at least one of the total length of the bus route, the total flow of the bus route, the connectivity tortuosity of the bus route and the target function value of the bus route, and the target function value is a value determined according to the passenger flow per 100 kilometers of the bus route and the logarithm of the candidate OD data pairs.

[0065] Specifically,

[0066] If the screening factor includes the total length of the bus route, the bus route with a total length in a preset range is selected from the candidate bus route.

[0067] Route length

[0068]

[0069] Total length of the route; D min : Minimum length limit, D max : Maximum length limit. Wherein, D min and D max is a custom value, or a system default value. Generally, D min and D max The total time of the entire route of the bus route and the time of fatigue when the driver normally drives are not limited in the embodiment.

[0070] If the screening factor includes the passenger flow of each station in the bus route, the total flow of the candidate bus route is obtained, and the bus route with a total flow exceeding the minimum flow is screened.

[0071] The passenger flow of the ith station

[0072]

[0073] F min represents the acceptable minimum route passenger flow, and in actual implementation, F min may be a custom value or a default value, which is not limited herein. The calculation method of the passenger flow of each station is similar to that in step 102, which is not limited herein. In addition, the passenger flow of each station is the average passenger flow at the station per day obtained according to big data statistics, rather than the data of the morning and evening peak or other time period, so as to ensure the accuracy of the data.

[0074] If the screening factor includes the connectivity tortuosity of the bus route, the bus route with a connectivity tortuosity lower than a preset tortuosity is screened.

[0075] The connectivity tortuosity of the bus route k:

[0076]

[0077] Wherein, represents the candidate bus route l p The straight-line distance between the starting point and the ending point.

[0078] If the screening factor includes the objective function value of the bus route, the objective function value of each candidate bus route is obtained, and the bus route with the maximum objective function value is screened.

[0079] The objective function is:

[0080]

[0081] wherein is the candidate bus route l p the number of high demand OD pairs, represents the passenger flow per kilometer of the candidate bus route l p , β and γ are weight coefficients, the greater β indicates that the profit is more important, and the greater γ indicates that the demand of residents is more important. In actual implementation, the candidate bus route with the maximum target function value can be selected as the final bus route.

[0082] In addition, the above only takes one screening factor as an example, and in actual implementation, the screening factor can include at least two, and when including at least two, the bus routes that meet the corresponding conditions can be screened out according to the corresponding screening mode, and when the screening factor includes the target function value and other screening factors, the candidate bus routes screened out by the other screening factors can be further screened according to the target function value, which is not limited herein.

[0083] When at least two bus routes are screened out by the screening factor, the above method further includes: displaying the at least two candidate bus routes screened out, receiving a selection signal of selecting one bus route from the at least two candidate bus routes, and determining the bus route selected by the selection signal as the final bus route. Of course, one of the bus routes can also be directly determined as the final bus route, which is not limited herein.

[0084] It should be noted that before the above step, the method further includes:

[0085] editing the candidate bus route to obtain an edited candidate bus route, and the editing includes at least one of adding a station, deleting a station and modifying a station.

[0086] For example, after the candidate bus route is generated, after the designer checks, it is found that the distance between two stations is long, then in order to avoid waste of resources and facilitate more citizens along the way, a station can be added between the two stations; for another example, the distance between two stations in the generated candidate bus route is less than the minimum distance, that is, the two adjacent stations are very close, then in order to avoid the bus frequently stopping and thus wasting the time of the general public, the two stations can be merged into one station, and when merging, the station with larger passenger flow can be selected as the merged station, or a certain position between the two stations can be selected as the merged station, which is not limited herein.

[0087] It needs to be explained that the above method can further include the following steps:

[0088] (1) obtaining a bus parking lot closest to the starting station and / or the ending station in the candidate bus line;

[0089] Since the bus usually needs to stop at the station for rest after running a full journey, in order to avoid the bus running a full journey and then needing to continue to travel a long distance to return to the field and thus causing resource waste, in the embodiment, the bus parking lot closest to the starting station and / or the ending station can be obtained.

[0090] (2) modifying the starting station and / or the ending station of the candidate bus line according to the obtained bus parking lot.

[0091] Of course, after modifying the starting station and / or the ending station, a station can be added between the parking lot and the first station, and the embodiment does not limit this.

[0092] In summary, by obtaining candidate OD data pairs, each candidate OD data pair includes two stations; each station in the candidate OD data pair is traversed to generate a candidate bus line; and the final bus line is obtained from the candidate bus line according to a screening factor. The problem that the designed bus line can be unreasonable due to the experience of the designer when the bus line is designed artificially in the prior art is solved, and the effect that the bus line can be automatically generated and thus the human influence of the designer is avoided is achieved. Meanwhile, the bus line is automatically generated by the application, and the generation efficiency of the bus line is improved.

[0093] The application further provides a bus line generation device, the device including a memory and a processor, at least one program instruction is stored in the memory, and the processor realizes the method as described above by loading and executing the at least one program instruction.

[0094] The application further provides a computer storage medium, at least one program instruction is stored in the computer storage medium, and the at least one program instruction is loaded and executed by the processor to realize the method as described above.

[0095] Each technical feature of the above-described embodiments can be combined arbitrarily, and in order to make the description concise, each technical feature in the above-described embodiments is not described in all possible combinations, however, as long as the combination of the technical features does not exist contradictory, it should be considered as the scope of the description.

[0096] The above embodiments only express several implementation manners of the present application, and the description is more specific and detailed, but it should not be understood as a limitation on the scope of the patent. It should be noted that for ordinary skilled persons in the art, without departing from the concept of the present application, several modifications and improvements can be made, which are within the scope of protection of the present application. Therefore, the protection scope of the patent of the present application should be subject to the appended claims.

Claims

1. A bus route generation method characterized by comprising: The method comprises: obtaining candidate OD data pairs, each candidate OD data pair comprising two stations; sorting the stations in each candidate OD data pair according to at least two sequences; for each sequence, determining a shortest path between two adjacent stations; connecting the stations in each candidate OD data pair according to the determined shortest path to obtain a candidate bus route; for each candidate bus route, obtaining existing bus stations along the candidate bus route, and inserting the obtained bus stations into the candidate bus route; calculating the distance between adjacent stations in the candidate bus route, and if the distance between two adjacent stations in the candidate bus route is less than a minimum distance, calculating the passenger flow of the two adjacent stations; updating the stations in the candidate bus route according to the calculated passenger flow of the two adjacent stations; screening the final bus route from the candidate bus route according to a screening factor.

2. The method of claim 1, wherein, The screening factor comprises at least one of the total length of the bus route, the total flow of the bus route, the connectivity tortuosity of the bus route, and the objective function value of the bus route, wherein the objective function value is a value determined according to the passenger flow per 100 kilometers of the bus route and the logarithm of the number of candidate OD data pairs passing through.

3. The method of claim 2, wherein, The screening of the final bus route from the candidate bus route according to the screening factor comprises: if the screening factor comprises the total length of the bus route, screening the bus route whose total length is within a preset range from the candidate bus route; if the screening factor comprises the total flow of the bus route, obtaining the total flow of the candidate bus route, and screening the bus route whose total flow exceeds a minimum flow; if the screening factor comprises the connectivity tortuosity of the bus route, screening the bus route whose connectivity tortuosity is lower than a preset tortuosity; if the screening factor comprises the objective function value of the bus route, obtaining the objective function value of each candidate bus route, and screening the bus route with the largest objective function value.

4. The method according to any one of claims 1 to 3, characterized in that, Before the screening of the final bus route from the candidate bus route according to the screening factor, the method further comprises: editing the candidate bus route to obtain an edited candidate bus route, wherein the editing comprises at least one of adding stations, deleting stations, and modifying stations.

5. The method according to any one of claims 1 to 3, characterized in that, The method further comprises: obtaining a bus parking lot closest to the starting station and / or the ending station in the candidate bus route; modifying the starting station and / or the ending station of the candidate bus route according to the obtained bus parking lot.

6. A bus route generating apparatus characterized by comprising: The device comprises a memory and a processor, wherein the memory stores at least one program instruction, and the processor loads and executes the at least one program instruction to implement the method according to any one of claims 1 to 5.

7. A computer storage medium, characterized in that The computer storage medium stores at least one program instruction, and the at least one program instruction is loaded and executed by the processor to implement the method according to any one of claims 1 to 5.

Images