Bus express line planning method, device and system and electronic equipment

Abstract

The embodiment of the invention provides a bus express line route planning method, and the method comprises the steps: obtaining the transfer data of each subway station, determining a first subway station with the maximum pull-in passenger flow volume and a second subway station with the maximum pull-out passenger flow volume based on the transfer data of each subway station, and determining a first candidate subway station according to the first subway station and the second subway station, determining a bus station of a bus express line based on the first candidate subway station, and determining a planned route of the bus express line based on the bus station of the bus express line. According to the method, the bus express route is planned, so that the problem that the stations with relatively large passenger flow cannot be accurately planned into the bus express route when the bus express route is planned at present is solved, and the efficiency and rationality of bus express route planning are further improved.

Description

Technical Field

[0001] The present invention relates to the field of smart cities, and in particular to a bus express line planning method, device, system, electronic equipment and storage medium. Background Art

[0002] With the development of society, people have more and more ways to travel, and public transportation has become a common choice for people to travel. As the number of passengers taking subway public transportation increases, there is an urgent need to divert subway public transportation, that is, a bus express line planning method is needed. The existing bus express line planning method analyzes the passenger flow data of bus stations and directly plans bus express lines for bus stations with large passenger flow. However, there is a problem that it is impossible to accurately plan stations with large passenger flow into bus express lines. Therefore, the existing bus express line planning method has the problems of insufficient accuracy and low efficiency. Summary of the invention

[0003] The embodiment of the present invention provides a bus express line planning method, which aims to solve the problems of insufficient accuracy and low efficiency of the existing bus express line planning method. By analyzing each subway station, multiple subway stations with the largest passenger flow are obtained, and the multiple subway stations with the largest passenger flow are divided according to the optimal subway path to obtain path segments, and then the bus stations along the bus express line are determined according to the path segments, and finally the planned route of the bus express is determined according to the bus stations, which solves the problem that the bus express line planning method cannot completely include multiple subway stations with the largest passenger flow within a preset surrounding range, improves the efficiency of bus express line planning, and increases the feasibility of bus express line planning.

[0004] In a first aspect, an embodiment of the present invention provides a bus express line planning method, characterized in that the method comprises the following steps:

[0005] Get transfer data for each subway station;

[0006] Based on the transfer data of each of the subway stations, determine a first subway station with the largest incoming passenger flow and a second subway station with the largest outgoing passenger flow;

[0007] Determine a first candidate subway station according to the first subway station and the second subway station;

[0008] Determine a bus stop for a bus express line based on the first candidate subway station;

[0009] Based on the bus stops of the bus express line, a planned route of the bus express line is determined.

[0010] In a second aspect, an embodiment of the present invention further provides a bus express line planning device, the bus express line planning device comprising:

[0011] Acquisition module, used to obtain transfer data of each subway station;

[0012] A first determination module is used to determine a first subway station with the largest incoming passenger flow and a second subway station with the largest outgoing passenger flow based on the transfer data of each of the subway stations;

[0013] A second determining module, configured to determine a first candidate subway station according to the first subway station and the second subway station;

[0014] A third determination module is used to determine a bus stop for a bus express line based on the first candidate subway station;

[0015] The fourth determining module is used to determine the planned route of the bus express line based on the bus stops of the bus express line.

[0016] In a third aspect, an embodiment of the present invention provides an electronic device, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the bus express line planning method provided in the embodiment of the present invention when executing the computer program.

[0017] In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps in the bus express line planning method provided in the embodiment of the invention are implemented.

[0018] In the embodiment of the present invention, the transfer data of each subway station is obtained, and based on the transfer data of each subway station, the first subway station with the largest incoming passenger flow and the second subway station with the largest outgoing passenger flow are determined, and the first candidate subway station is determined based on the first subway station and the second subway station, and the bus stop of the bus express is determined based on the first candidate subway station, and the planned route of the bus express is determined based on the bus stop of the bus express. By analyzing each subway station, multiple subway stations with the largest passenger flow are obtained, and the first candidate subway station is determined based on the multiple subway stations with the largest passenger flow, and the bus stop of the bus express is determined through the first candidate subway station, which solves the problem that the multiple subway stations with the largest passenger flow in the preset surrounding range cannot be completely included by the bus express line planning method, improves the efficiency of bus express line planning, and increases the feasibility of bus express line planning. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0020] Figure 1 It is a flow chart of a bus express line planning method provided by an embodiment of the present invention;

[0021] Figure 2 It is a subway OD details table provided by an embodiment of the present invention;

[0022] Figure 3 It is a subway OD statistics table provided by an embodiment of the present invention;

[0023] Figure 4 A subway OD transfer statistics table provided by an embodiment of the present invention;

[0024] Figure 5 is a schematic diagram of a map search method provided by an embodiment of the present invention;

[0025] Figure 6 This is a schematic diagram of an optimal subway route provided by an embodiment of the present invention;

[0026] Figure 7 This is a schematic diagram of an optimal bus route provided by an embodiment of the present invention;

[0027] Figure 8 It is a structural schematic diagram of a bus express line planning device provided in an embodiment of the present invention;

[0028] Fig. 9 It is a structural schematic diagram of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0029] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0030] like Figure 1 As shown, Figure 1 : is a flow chart of a bus express line planning method provided by an embodiment of the present invention, including:

[0031] 101. Obtain transfer data for each subway station.

[0032] In an embodiment of the present invention, the above-mentioned bus express line planning method can be deployed in an urban line planning platform, which can be a server or terminal with data processing, data storage and data transmission, and can be used for planning urban transportation lines. The above-mentioned urban line planning platform also stores traffic data of urban public transportation, such as subway station data, line data and transfer data, as well as bus station data, line data, etc.

[0033] The transfer data of the above-mentioned subway stations can be obtained by statistically analyzing the subway OD (origin destination) table of the subway system. The above-mentioned subway OD table records the transfer data obtained through the subway transportation card system, the ride code payment system and other channels. The above-mentioned transfer data may include the number of passengers entering and exiting the subway station. Specifically, by counting the number of passengers entering and exiting each pair of subway ODs in the subway OD details table, and then uploading it to the subway OD statistics table, the transfer data of the corresponding subway OD pair can be obtained by analyzing the data in the subway OD statistics table. For example, Figure 2 Subway OD details table shown and Figure 3 The subway OD statistics table shown in the figure can record the creation time, update time, boarding subway station, alighting subway station and boarding and alighting time data of the subway OD pair, and the subway OD statistics table can record the creation time, boarding and alighting subway station and the number of passengers of the subway OD pair. The above subway OD details table can also update the transfer data obtained by the above subway transportation card system, the ride code payment system and other channels during the preset period according to the change of the number of passengers through the subway system.

[0034] The above preset time period can be set according to holidays or seasonal weather. For example, during holidays, the number of subway passengers will increase, so the preset time period will be adaptively expanded. For another example, when the weather is hot, some residents will go to the subway station to cool off, so the preset time period can also be adaptively expanded. It should be noted that the specific preset time period setting is determined according to the specific implementation plan.

[0035] Furthermore, the transfer data of passengers can be recorded through the exit gates and entry gates of different subway lines, and the number of passengers entering and exiting the subway station can be inferred based on the transfer data.

[0036] In a possible embodiment, the above-mentioned urban route planning platform obtains transfer data of each subway station by analyzing the subway OD table provided by the above-mentioned subway system. The subsequent planning of bus express lines can determine the bus stops of the lines based on the transfer data, and the transfer data can be fed back to urban planners through the terminal feedback results attached to the above-mentioned urban route planning platform, such as a screen.

[0037] 102. Based on the transfer data of each subway station, determine the first subway station with the largest incoming passenger flow and the second subway station with the largest outgoing passenger flow.

[0038] In an embodiment of the present invention, the first subway station with the largest passenger flow entering the station can be obtained by the subway OD table provided by the subway system. Specifically, the number of people entering and leaving the station for each pair of subway ODs in the subway OD transfer statistics table is counted, and the passenger flow data of the corresponding subway OD pair is obtained by analyzing the data in the subway OD transfer statistics table. The number of passengers entering the station in the passenger flow data is calculated to obtain the number of passengers entering the station at each subway station, and the subway station with the largest number of passengers entering the station is taken as the first subway station. The above passenger flow data may include data information such as station information of transfer stations, transfer time distribution, etc. Through the above transfer data, the purpose and direction of travel of passengers can be judged more accurately, which can help subway operators and urban planners understand passenger flow characteristics, optimize subway scheduling and capacity allocation, improve passenger travel experience, and provide a reference for future urban planning.

[0039] Similarly, the second subway station with the largest passenger flow out of the station can also be obtained through the subway OD table provided by the subway system. Specifically, the number of people entering and leaving each pair of subway OD in the subway OD transfer statistics table is counted, and the data is analyzed in the subway OD transfer statistics table to obtain the passenger flow data of the corresponding subway OD pair, and the number of passengers leaving the station in the passenger flow data is calculated to obtain the number of passengers leaving the station at each subway station, and the subway station with the largest number of passengers leaving the station is selected as the second subway station.

[0040] Specifically, in a possible embodiment, the transfer data of each subway station is analyzed and processed through the above-mentioned urban line planning platform to obtain the passenger flow data of each subway station, and the subway station with the largest number of people entering and exiting the station is determined by calculating and counting the number of people entering and exiting the station in the passenger flow data.

[0041] 103. Determine a first candidate subway station according to the first subway station and the second subway station.

[0042] In an embodiment of the present invention, the first candidate subway station can be obtained by searching the first subway station and the second subway station according to the map surrounding search algorithm. The map surrounding search algorithm can be a process in which the staff inputs the search conditions in the search interface, and the corresponding results are output in the search interface. For example, when the urban planning staff inputs the name of the first subway station in the search interface and sets the search conditions as "search range 3.5 kilometers" and "subway station", the search interface using the map surrounding search algorithm can output all subway stations within 3.5 kilometers around the first subway station. Specifically, the position of the first subway station can be located, and then the surrounding subway stations of the first subway station can be searched through a preset search range, and the surrounding subway stations searched can be filtered according to the calculation method of the number of incoming passengers, and a suitable number of subway stations can be selected as the set of incoming subway stations in the first candidate subway station. Similarly, the same map surrounding search algorithm is used for the second subway station, and the obtained surrounding subway stations are filtered by the calculation method of the number of outgoing passengers, and a suitable number of subway stations are selected as the set of outgoing subway stations in the first candidate subway station. Finally, the above-mentioned entry subway station point set and the exit subway station point set are merged to obtain the first candidate subway station point. It should be noted that the above-mentioned first candidate subway station point includes the first subway station point and the second subway station point, and is obtained by performing surrounding search and filtering on the above-mentioned first subway station point and the above-mentioned second subway station point.

[0043] The above-mentioned preset search range can be determined based on the above-mentioned passenger flow data. For example, when the passenger flow data is large, the search range will be expanded to ensure that enough subway stations with large passenger flow data can be obtained. When the passenger flow data is small, the search range will be shortened to reduce the search for unnecessary subway stations and waste resources.

[0044] In another possible embodiment, the surrounding subway stations of the first subway station and the second subway station can be directly determined through the search range. Specifically, according to the required search range, the surrounding subway stations of the first subway station and the surrounding subway stations of the second subway station are searched, and all the subway stations searched are used as the first candidate subway stations. The above search range can be determined according to the above passenger flow data. For example, when the passenger flow data is large, the search range is expanded to ensure that enough subway stations with large passenger flow data can be obtained. When the passenger flow data is small, the search range is reduced to reduce the search of unnecessary subway stations and waste resources.

[0045] Furthermore, in a possible embodiment, the above-mentioned urban planning platform calculates and counts the subway OD table in the subway system, and then searches and filters the surrounding subway stations of the above-mentioned first subway station and the above-mentioned second subway station to obtain the first candidate subway station.

[0046] 104. Determine the bus stop for the bus express line based on the first candidate subway station.

[0047] In an embodiment of the present invention, the bus stops of the bus express line can be obtained by planning the route of the bus express line for the first candidate subway station. Specifically, the bus boarding and alighting stops between the subway stations are obtained by selecting the optimal bus route between the subway stations in the first candidate subway station, and the bus boarding and alighting stops between the subway stations are integrated to obtain the bus stops of the bus express line.

[0048] Specifically, in a possible embodiment, the number of bus stops of the above-mentioned bus express line can be equal to the number of the above-mentioned first candidate subway station when each subway station is attached with a bus stop. However, generally speaking, multiple bus stops are arranged between subway stations, so when determining the path sequence of bus stops, the distance between subway stations should be considered. The distance between subway stations and bus stops can be calculated on the map by the Haversine formula, and the longitude and latitude of the map can be estimated based on the calculated distance to obtain more accurate map positioning information, and the above-mentioned first candidate subway station and bus stop can be reversely positioned.

[0049] 105. Determine the planned route of the bus express line based on the bus stops of the bus express line.

[0050] In an embodiment of the present invention, the planned route of the bus express line can be obtained by planning the bus stops of the bus express line through a preset optimal path algorithm. Specifically, the optimal path can be obtained by calculating the path between the bus stops through an optimal path algorithm such as Dijkstra and Freud.

[0051] In a possible embodiment, the bus stops of the bus express line are analyzed through the above-mentioned urban planning platform to obtain the path information between the bus stops of the bus express line, and the above-mentioned path information is calculated according to the above-mentioned optimal path algorithm to obtain the optimal path between the bus stops of the bus express line, and the specific planned route of the bus express line is determined according to the optimal path.

[0052] It should be noted that in addition to determining the optimal distance based on the algorithm, the above-mentioned optimal path can also be determined by analyzing the passenger flow at the bus stops and dividing the bus stops with larger passenger flow. This allows the bus stops with larger passenger flow to be dispersed in the above-mentioned planned routes. This can buffer the process of passengers getting on and off the bus, and can also buffer the pressure on bus passenger capacity.

[0053] In the embodiment of the present invention, the transfer data of each subway station is obtained, and based on the transfer data of each subway station, the first subway station with the largest incoming passenger flow and the second subway station with the largest outgoing passenger flow are determined, and the first candidate subway station is determined based on the first subway station and the second subway station, and the bus stop of the bus express is determined based on the first candidate subway station, and the planned route of the bus express is determined based on the bus stop of the bus express. By analyzing each subway station, multiple subway stations with the largest passenger flow are obtained, and the first candidate subway station is determined based on the multiple subway stations with the largest passenger flow, and the bus stop of the bus express is determined through the first candidate subway station, which solves the problem that the multiple subway stations with the largest passenger flow in the preset surrounding range cannot be completely included by the bus express line planning method, improves the efficiency of bus express line planning, and increases the feasibility of bus express line planning.

[0054] Optionally, in the step of determining the first subway station with the largest incoming passenger flow and the second subway station with the largest outgoing passenger flow based on the transfer data of each subway station, the passenger flow data of each subway station can also be determined according to the number of subway cross-line transfers and the ride time, and then the first subway station with the largest incoming passenger flow and the second subway station with the largest outgoing passenger flow can be determined through the passenger flow data of each subway station.

[0055] In the embodiment of the present invention, the number of subway cross-line transfers and the riding time can be recorded by analyzing the subway OD statistical table provided by the subway system, and the information is counted in the subway OD transfer statistical table, for example, Figure 4As shown, the above subway OD transfer statistics table can record data including the subway stations for getting on and off, transfer time, number of transfer passengers, transfer stations and the number of transfer stations. By analyzing the data in the subway OD statistics table, the data that needs to be transferred can be obtained. For example, the data that needs to be transferred can be the data in the subway OD table with a transfer number greater than 1 and a ride time greater than 45 minutes, and the above data that needs to be transferred is recorded in the subway OD transfer statistics table, and then according to the subway stations for entering and exiting in the above subway OD transfer statistics table, the subway line is analyzed to obtain the number of transfers and ride time. For example, if the subway OD transfer statistics table shows a pair of subway OD information: the entry station is station A, and the exit station is station B, by analyzing the subway line from station A to station B, it is obtained that station A needs to transfer from line 1 to line 2 to station B, then the number of transfers is recorded as 1, and the ride time required for station A to transfer from line 1 to line 2 to station B is confirmed. It should be noted that the above-mentioned riding time can be estimated based on the current passenger flow between the subway OD stations, and the above-mentioned required riding time can be corrected according to the estimated riding time, and it can be fed back to the subway OD transfer statistics table of the above-mentioned subway system, so as to provide accurate riding time data for analysis of the subway OD transfer statistics table.

[0056] In a possible embodiment, after obtaining the subway cross-line transfer frequency and ride time data of the above-mentioned subway OD, the above-mentioned urban planning platform analyzes and calculates to obtain the entrance station with the largest passenger flow and the exit station with the largest passenger flow, such as entrance station A and exit station B, and sets them as the first subway station A with the largest entrance passenger flow and the second subway station B with the largest exit passenger flow.

[0057] Optionally, in the step of determining the first candidate subway station based on the first subway station and the second subway station, a first target subway station can also be determined within a first preset surrounding range of the first subway station, and then a second target subway station can be determined within a second preset surrounding range of the second subway station, and finally the first candidate subway station can be determined based on the first target subway station and the second target subway station.

[0058] In an embodiment of the present invention, the first preset surrounding range may be a limited search range set when the map surrounding search algorithm is performed on the first subway station. Similarly, the second preset surrounding range may be a limited search range set when the map surrounding search algorithm is performed on the second subway station.

[0059] The first target subway station may be all subway stations within the first preset surrounding range obtained after the map surrounding search algorithm is applied to the first subway station. Similarly, the second target subway station may be all subway stations within the second preset surrounding range obtained after the map surrounding search algorithm is applied to the second subway station. Figure 5 As shown, a search is performed within a preset surrounding range of 3.5 kilometers around the Longhua subway station in the figure, and 10 other subway stations are obtained as shown in the figure, such as Yuanfen, Longsheng and other subway stations.

[0060] All the above-mentioned subway stations within the first preset surrounding range and all the above-mentioned subway stations within the second preset surrounding range are integrated and used as the first candidate stations.

[0061] In a possible embodiment, the preset surrounding range is adjusted according to the passenger flow data of the subway OD table of the subway system. For example, when the incoming passenger flow data is large, the preset first surrounding range can be appropriately expanded to make the selection of the incoming subway station more reasonable. Similarly, when the outgoing passenger flow data is large, the preset second surrounding range can be appropriately expanded to make the selection of the outgoing subway station more reasonable.

[0062] Optionally, in the step of determining the bus stops of the bus express line based on the first candidate subway station, it is also possible to determine the second candidate subway station from the first candidate subway station based on the passenger flow data of the first candidate subway station, and then determine the optimal subway station path between the second candidate subway stations, and finally determine the bus stops of the bus express line based on the optimal subway station path between the second candidate subway stations.

[0063] In an embodiment of the present invention, the second candidate subway station may be a plurality of subway stations with the largest passenger flow data among the first candidate subway stations. Specifically, the second candidate subway station is selected based on the passenger flow data of the first candidate station. For example, assuming that after the above-mentioned map surrounding search algorithm is performed around the first station, five subway stations including A1, A2, A3, and A4 are obtained, including the first station A. Then, based on the above-mentioned passenger flow data, the top three subway stations ranked by the number of people entering these five subway stations can be selected as the second candidate stations. Similarly, assuming that after the above-mentioned map surrounding search algorithm is performed around the second station, five subway stations including B1, B2, B3, and B4 are obtained, including the second station B. Then, based on the above-mentioned passenger flow data, the top three subway stations ranked by the number of people entering these five subway stations can be selected as the second candidate stations.

[0064] The above-mentioned optimal subway station path can be obtained through the path planning interface. Specifically, the path between the above-mentioned second candidate subway stations can be planned through the path planning interface in the map software, such as Amap, to obtain the optimal subway station path. For example, when the second candidate subway station is determined to be A, A1, A2, B, B1, B2, the entrance subway station and the exit subway station are divided into [A, A1, A2] and [B, B1, B2], and the route from [A, A1, A2] to B is arranged in sequence. There are six combinations: [A, A1, A2, B], [A, A2, A1, B], [A1, A, A2, B], [A1, A2, A, B], [A2, A1, A, B] and [A2, A, A1, B]. These 6 combinations are analyzed and the shortest path is taken. Assume that it is [A, A1, A2, B], then take the first three stations [A, A1, A2] as the first three subway stations of the bus express line. Similarly, arrange the route from [B, B1, B2] to A in order, there are six combinations: [B, B1, B2, A], [B, B2, B1, A], [B1, B, B2, A], [B1, B2, B, A], [B2, B1, B, A] and [B2, B, B1, A]. Analyze these 6 combinations and take the shortest path. Assuming it is [B, B1, B2, A], then take the last three stations [B, B1, B2] as the last three subway stations of the bus express line. Finally, the subway stations along the bus express line are determined to be [A, A1, A2, B, B1, B2]. Figure 6 As shown, the starting point of Qinghu (subway station) shown in the figure corresponds to the A subway station in the embodiment, and the ending point of Gaoxinyuan (subway station) shown in the figure is the B2 subway station in the embodiment. The 24.5 kilometers given by the recommended solution in the figure is the optimal path between the above 6 subway stations, that is, the above optimal subway station path.

[0065] The bus stops of the above-mentioned bus express line can be determined based on the bus stops that can be reached between every two subway stations in the above-mentioned optimal subway station path. Specifically, according to the above-mentioned path planning interface, the subway stations along the above-mentioned optimal subway station path are planned to obtain the names of the bus stops that can reach the above-mentioned optimal subway station path. For example, Figure 7As shown, the starting point of the figure is Qinghu (subway station) corresponding to the A subway station in the embodiment, and the ending point of Longhua (subway station) corresponds to the A1 subway station in the embodiment, and according to the selected no subway option, the name of the bus stop that can reach Longhua (subway station) from Qinghu (subway station) is obtained. As shown in the figure, the bus boarding station is Qinghu subway station 2, and the bus alighting station is Longhua subway station. Similarly, the bus stop names of A1 to A2, A2 to B, B to B1, and B1 to B2 are obtained in sequence through the above method, and the obtained bus stop names are used as the bus stops of the above bus express line. The bus stops of the above bus express line can also be determined according to the above second candidate stations after the selection is completed. Specifically, in a possible embodiment, each selected subway station has a corresponding bus stop set, so the selected second candidate station can be directly used as the bus stop of the bus express line. In another possible embodiment, the selected subway station may have multiple subway stations without corresponding bus stops, so the bus stops that can reach each other between the selected second candidate stations are used as the bus stops of the above bus express line.

[0066] Specifically, in a possible embodiment, the above-mentioned urban planning platform is connected to the map software through the network port, and the path planning interface in the map software is called to analyze the subway stations along the path of the above-mentioned optimal subway station to obtain the corresponding bus stations. The above-mentioned urban route planning platform can also be used to analyze the obtained second candidate station, and then the nearest bus station corresponding to the above-mentioned second candidate station is used as the bus station of the bus express line, and the above-mentioned urban route planning platform is used to feedback to the urban planners, so that the urban planners can obtain effective suggestions during the route planning process.

[0067] Optionally, in the step of determining the second candidate subway station from the first candidate subway station based on the passenger flow data of the first candidate subway station, n third candidate subway station points with the largest incoming passenger flow data can be determined in the first target subway station based on the passenger flow data of the first candidate subway station, where n is an integer greater than 1, and m fourth candidate subway station points with the largest outgoing passenger flow data can be determined in the second target subway station based on the passenger flow data of the first candidate subway station, where m is an integer greater than 1; finally, the second candidate subway station is determined based on the n third candidate incoming subway station points with the largest incoming passenger flow data and the m fourth candidate outgoing subway station points with the largest outgoing passenger flow data.

[0068] In an embodiment of the present invention, the above-mentioned inbound passenger flow data is determined according to the passenger flow data when the inbound station is the first target subway station and the outbound station is the second target subway station, and the above-mentioned outbound passenger flow data is determined according to the passenger flow data when the inbound station is the first target subway station and the outbound station is the second target subway station. The above-mentioned n third candidate subway stations with the largest inbound passenger flow data can be a plurality of subway stations with the front inbound passenger flow data in the above-mentioned first target subway station. Specifically, according to the change trend of the passenger flow data of the above-mentioned first candidate station, the subway stations with the front passenger flow data are selected. For example, when the passenger flow data of the first candidate station has a trend of changing from large to small, only the three first target subway stations with the front inbound passenger flow data can be selected as the inbound subway stations in the second candidate station. On the contrary, when the passenger flow data of the first candidate station has a trend of changing from small to large, the inbound subway stations in all the first target subway stations can be selected as the inbound subway stations of the second candidate station. Similarly, the above-mentioned m fourth candidate subway stations with the largest outbound passenger flow data can be a plurality of subway stations with the front outbound passenger flow data in the above-mentioned first target subway station. Specifically, according to the change trend of the passenger flow data of the above-mentioned first candidate stations, the subway stations with the highest passenger flow data are selected. For example, when the passenger flow data of the first candidate stations has a trend of changing from large to small, only the three first target subway stations with the highest outbound passenger flow data can be selected as the outbound subway stations in the second candidate stations. On the contrary, when the passenger flow data of the first candidate stations has a trend of changing from small to large, the outbound subway stations in all the first target subway stations can be selected as the outbound subway stations of the second candidate stations.

[0069] Furthermore, the number of n and m can also be determined according to the preset surrounding search range when selecting the first candidate subway station. Specifically, a balance is determined by the preset surrounding search range and the passenger flow data of the first candidate subway station, and the number of n and m is selected according to the result of the determination to avoid wasting data resources. For example, when the passenger flow data of the first candidate subway station is large, and the preset surrounding search range is small, all subway stations within the range can be directly selected as the second candidate station.

[0070] Optionally, in the step of determining the optimal subway station path between the second candidate subway stations, the optimal subway station path between the second candidate subway stations may also be determined based on the shortest path between the second candidate subway stations.

[0071] In an embodiment of the present invention, the shortest path between the above-mentioned second candidate subway stations can be obtained by using the Dijkstra algorithm. By taking any entry station of the second candidate subway stations as the starting point, other stations are visited, and a distance table is established according to the order of the visits. Finally, the results of the visits are recorded in the distance table. According to the content of the distance table, the shortest distance between the second candidate subway stations can be obtained, and the optimal path of the subway can be determined based on this shortest distance.

[0072] Optionally, in the step of determining the bus stops of the bus express line based on the optimal subway station path, the optimal subway station path can also be divided to obtain path segments, each path segment including two adjacent second candidate subway stations in the optimal subway station path, and then the bus stops of the bus express line are determined based on the path segments.

[0073] In an embodiment of the present invention, the above-mentioned path segmentation can be to divide the above-mentioned optimal subway station path, and form a group of two subway stations passing through the optimal subway station path, analyze and select the stations that can be reached by bus between each group, obtain the names of the bus stations between the above-mentioned optimal subway station path, and use the bus alighting station of the previous station as the bus boarding station of the next station, and so on to confirm the bus stations of the bus express line. For example, assuming that from A to A1, the bus boarding station is C1, and the bus alighting station is C2, C2 to A2, the bus boarding station is C2, and the bus alighting station is C3, C3 to B, the bus boarding station is C3, and the bus alighting station is C4, C4 to B1, the bus boarding station is C4, and the bus alighting station is C5, C5 to B2, the bus boarding station is C5, and the bus alighting station is C6, then finally, the bus stations of the final bus express line are C1, C2, C3, C4, C5, and C6.

[0074] In an embodiment of the present invention, transfer data of each subway station is obtained, and passenger flow data of each subway station is determined according to the number of transfers and the riding time in the transfer data, a first subway station and a second subway station are determined according to the above passenger flow data, and then the above first subway station and the second subway station are determined according to a preset surrounding range, and a first target subway station and a second target subway station are obtained respectively, and a first candidate subway station is determined according to the above first target subway station and the second target subway station, and then the first target subway station and the second target subway station are determined according to the passenger flow data of the first candidate subway station, and the second candidate subway station is determined according to the above first target subway station and the second target subway station, and finally, the optimal subway path between the second candidate subway stations is planned and the optimal subway path is segmented to obtain the final bus stop of the bus express line.

[0075] Specifically, the above-mentioned urban line planning platform obtains the passenger flow data of each subway during a preset time period, and uses this to determine the entry and exit subway stations with the largest passenger flow data, and searches the entry and exit subway stations with the largest passenger flow data according to the above-mentioned map surrounding search method to obtain a series of surrounding subway stations, and then selects passenger flow data for a series of surrounding subway stations to obtain the required n entry subway stations and m exit subway stations, and finally plans the optimal subway route according to the above-mentioned n entry subway stations and m exit subway stations, and divides the subway stations along the optimal subway route into segments to obtain the final bus stop.

[0076] like Figure 8 As shown, the embodiment of the present invention also provides a bus express line planning device, including:

[0077] Acquisition module 801, used to acquire transfer data of each subway station;

[0078] A first determination module 802 is used to determine a first subway station with the largest incoming passenger flow and a second subway station with the largest outgoing passenger flow based on the transfer data of each of the subway stations;

[0079] A second determination module 803, configured to determine a first candidate subway station according to the first subway station and the second subway station;

[0080] A third determination module 804 is used to determine a bus stop for a bus express line based on the first candidate subway station;

[0081] The fourth determining module 805 is used to determine the planned route of the bus express line based on the bus stops of the bus express line.

[0082] Optionally, the above device further comprises:

[0083] The fifth determination module is used to determine the passenger flow data of each subway station according to the number of subway cross-line transfers and the riding time;

[0084] The sixth determination module is used to determine the first subway station with the largest incoming passenger flow and the second subway station with the largest outgoing passenger flow according to the passenger flow data of each of the subway stations.

[0085] Optionally, the second determining module 803 further includes:

[0086] A first determination submodule, configured to determine a first target subway station within a first preset surrounding range of the first subway station;

[0087] A second determination submodule, configured to determine a second target subway station within a second preset surrounding range of the second subway station;

[0088] The third determination submodule is used to determine first candidate subway stations based on the first target subway station and the second target subway station, where the first candidate subway stations include the first target subway station and the second target subway station.

[0089] Optionally, the above device further comprises:

[0090] a seventh determination module, configured to determine a second candidate subway station point from among the first candidate subway station points according to the passenger flow data of the first candidate subway station points;

[0091] an eighth determination module, configured to determine an optimal subway station path between the second candidate subway stations;

[0092] The ninth determination module determines the bus stops of the bus express line based on the optimal subway station path between the second candidate subway stations.

[0093] Optionally, the above device further comprises:

[0094] a tenth determination module, configured to determine, based on the passenger flow data of the first candidate subway station, n third candidate subway stations with the largest inbound passenger flow data in the first target subway station, where n is an integer greater than 1, and the inbound passenger flow data is determined according to passenger flow data where the inbound station is the first target subway station and the outbound station is the second target subway station;

[0095] an eleventh determination module, configured to determine, based on the passenger flow data of the first candidate subway station, m fourth candidate subway stations with the largest exit passenger flow data in the second target subway station, where m is an integer greater than 1, and the exit passenger flow data is determined according to the passenger flow data of the entry station being the first target subway station and the exit station being the second target subway station;

[0096] The twelfth determination module is used to determine the second candidate subway station points based on the n second candidate entry subway station points with the largest entry passenger flow data and the m second candidate exit subway station points with the largest exit passenger flow data.

[0097] Optionally, the above device further comprises:

[0098] A thirteenth determination module is used to determine the optimal subway station path between the second candidate subway stations based on the shortest path between the second candidate subway stations.

[0099] Optionally, the above device further comprises:

[0100] A division module, used for dividing the optimal subway station path to obtain path segments, wherein the path segments include two adjacent second candidate subway stations in the optimal subway station path;

[0101] A fourteenth determination module is used to determine the bus stops of the bus express line based on the path segmentation.

[0102] like Fig. 9 As shown, an embodiment of the present invention further provides an electronic device, characterized in that it includes a processor, and the processor can execute any one of the above-mentioned bus express line planning methods.

[0103] Specifically, it includes a processor 901 and a memory 902, and a computer program for executing a bus express line planning method stored in the memory 902 and capable of running on the processor 901, wherein:

[0104] The processor 901 runs the computer program of the bus express line planning method stored in the memory 902 and performs the following steps:

[0105] Get transfer data for each subway station;

[0106] Based on the transfer data of each of the subway stations, determine a first subway station with the largest incoming passenger flow and a second subway station with the largest outgoing passenger flow;

[0107] Determine a first candidate subway station according to the first subway station and the second subway station;

[0108] Determine a bus stop for a bus express line based on the first candidate subway station;

[0109] Based on the bus stops of the bus express line, a planned route of the bus express line is determined.

[0110] Optionally, the bus express line planning method is characterized in that the first subway station with the largest incoming passenger flow and the second subway station with the largest outgoing passenger flow are determined based on the transfer data of each subway station, and the processor 901 further executes steps including:

[0111] Determine the passenger flow data of each subway station based on the number of subway line transfers and travel time;

[0112] The first subway station with the largest incoming passenger flow and the second subway station with the largest outgoing passenger flow are determined by using the passenger flow data of each of the subway stations.

[0113] Optionally, in the bus express line planning method, it is characterized in that the first candidate subway station is determined according to the first subway station and the second subway station, and the processor 901 further executes steps including:

[0114] Determine a first target subway station within a first preset surrounding range of the first subway station;

[0115] Determine a second target subway station within a second preset surrounding range of the second subway station;

[0116] Based on the first target subway station and the second target subway station, a first candidate subway station is determined, where the first candidate subway station includes the first target subway station and the second target subway station.

[0117] Optionally, the bus express line planning method is characterized in that the processor 901 executes the step of determining the bus stop of the bus express line based on the first candidate subway station, including:

[0118] Determine a second candidate subway station from among the first candidate subway stations based on the passenger flow data of the first candidate subway stations;

[0119] Determining an optimal subway station path between the second candidate subway stations;

[0120] Based on the optimal subway station path between the second candidate subway stations, bus stations for the bus express line are determined.

[0121] Optionally, the bus express line planning method is characterized in that the first target subway station is a boarding station, the second target subway station is an alighting station, and the processor 901 executes the step of determining the second candidate subway station from the first candidate subway station based on the passenger flow data of the first candidate subway station, including:

[0122] Based on the passenger flow data of the first candidate subway station, determine n third candidate subway stations with the largest inbound passenger flow data in the first target subway station, where n is an integer greater than 1, and the inbound passenger flow data is determined according to the passenger flow data of the inbound station being the first target subway station and the outbound station being the second target subway station;

[0123] Based on the passenger flow data of the first candidate subway station, determine m fourth candidate subway stations with the largest exit passenger flow data in the second target subway station, where m is an integer greater than 1, and the exit passenger flow data is determined according to the passenger flow data of the entry station being the first target subway station and the exit station being the second target subway station;

[0124] The second candidate subway station site is determined based on the n second candidate entry subway station sites with the largest entry passenger flow data and the m second candidate exit subway station sites with the largest exit passenger flow data.

[0125] Optionally, the bus express line planning method is characterized in that the processor 901 executes the step of determining the optimal subway station path between the second candidate subway stations, including:

[0126] Based on the shortest path between the second candidate subway stations, an optimal subway station path between the second candidate subway stations is determined.

[0127] Optionally, the bus express line planning method is characterized in that the processor 901 executes the step of determining the bus stops of the bus express line based on the optimal subway station path, including:

[0128] Dividing the optimal subway station path to obtain path segments, wherein the path segments include two adjacent second candidate subway stations in the optimal subway station path;

[0129] Based on the route segments, bus stops of the bus express line are determined.

[0130] An embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the computer program implements the various processes of the bus express line planning method or the application-side bus express line planning method provided in the embodiment of the present invention, and can achieve the same technical effect. To avoid repetition, it will not be repeated here.

[0131] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a computer program, and the program can be stored in a computer-readable storage medium, and when the program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, the storage medium can be a disk, an optical disk, a read-only memory (ROM) or a random access memory (RAM), etc.

[0132] The above disclosure is only the preferred embodiment of the present invention, which certainly cannot be used to limit the scope of the present invention. Therefore, equivalent changes made according to the claims of the present invention are still within the scope of the present invention.

Claims

1. A bus express line planning method, characterized in that: The method comprises the following steps: Get transfer data for each subway station; Based on the transfer data of each of the subway stations, determine a first subway station with the largest incoming passenger flow and a second subway station with the largest outgoing passenger flow; Determine a first candidate subway station according to the first subway station and the second subway station; Determine a bus stop for a bus express line based on the first candidate subway station; Based on the bus stops of the bus express line, a planned route of the bus express line is determined.

2. The bus express line planning method according to claim 1, characterized in that: The determining, based on the transfer data of each of the subway stations, of the first subway station with the largest incoming passenger flow and the second subway station with the largest outgoing passenger flow comprises: Determine the passenger flow data of each subway station based on the number of subway line transfers and travel time; The first subway station with the largest incoming passenger flow and the second subway station with the largest outgoing passenger flow are determined by using the passenger flow data of each of the subway stations.

3. The bus express line planning method according to claim 1 or 2, characterized in that: The determining a first candidate subway station according to the first subway station and the second subway station includes: Determine a first target subway station within a first preset surrounding range of the first subway station; Determine a second target subway station within a second preset surrounding range of the second subway station; Based on the first target subway station and the second target subway station, a first candidate subway station is determined, where the first candidate subway station includes the first target subway station and the second target subway station.

4. The bus express line planning method according to claim 3, characterized in that: The step of determining a bus stop for a bus express line based on the first candidate subway station includes: Determine a second candidate subway station from among the first candidate subway stations based on the passenger flow data of the first candidate subway stations; Determining an optimal subway station path between the second candidate subway stations; Based on the optimal subway station path between the second candidate subway stations, bus stations for the bus express line are determined.

5. The bus express line planning method according to claim 4, characterized in that: The step of determining a second candidate subway station from among the first candidate subway stations according to the passenger flow data of the first candidate subway stations includes: Based on the passenger flow data of the first candidate subway station, determine n third candidate subway stations with the largest inbound passenger flow data in the first target subway station, where n is an integer greater than 1, and the inbound passenger flow data is determined according to the passenger flow data of the inbound station being the first target subway station and the outbound station being the second target subway station; Based on the passenger flow data of the first candidate subway station, m fourth candidate subway stations with the largest exit passenger flow data are determined in the second target subway station, where m is an integer greater than 1, and the exit passenger flow data is determined according to the passenger flow data of the entry station being the first target subway station and the exit station being the second target subway station. The second candidate subway station is determined based on the n third candidate entry subway station points with the largest entry passenger flow data and the m fourth candidate exit subway station points with the largest exit passenger flow data.

6. The bus express line planning method according to claim 4 or 5, characterized in that: The determining the optimal subway station path between the second candidate subway stations includes: Based on the shortest path between the second candidate subway stations, an optimal subway station path between the second candidate subway stations is determined.

7. The bus express line planning method according to claim 4, characterized in that: The step of determining the bus stop of the bus express line based on the optimal subway station path includes: Dividing the optimal subway station path to obtain path segments, wherein the path segments include two adjacent second candidate subway stations in the optimal subway station path; Based on the route segments, bus stops of the bus express line are determined.

8. A bus express line planning device, characterized in that: The bus express line planning device comprises: Acquisition module, used to obtain transfer data of each subway station; A first determination module is used to determine a first subway station with the largest incoming passenger flow and a second subway station with the largest outgoing passenger flow based on the transfer data of each of the subway stations; A second determining module, configured to determine a first candidate subway station according to the first subway station and the second subway station; A third determination module is used to determine a bus stop for a bus express line based on the first candidate subway station; The fourth determining module is used to determine the planned route of the bus express line based on the bus stops of the bus express line.

9. An electronic device, characterized in that: include: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps in the bus express line planning method as described in any one of claims 1 to 7 when executing the computer program.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps in the bus express line planning method according to any one of claims 1 to 7 are implemented.

Images