Railway reachability search method based on topological road network

Abstract

The application belongs to the technical field of transportation, and discloses a railway accessibility search method based on a topological road network. The method comprises the following steps: constructing a railway line station topological network; calculating recommended paths and travel time consumption corresponding to all station pairs in the railway line station topological network according to the railway line station topological network; obtaining user demand information of an operation page; and completing accessibility search according to the recommended paths, the travel time consumption and the user demand information to obtain a search result. In the above manner, the paths and time consumption between each node are calculated according to the constructed railway line station topological network, and then the accessibility search is completed according to the user demand, so as to analyze the action ability of different stations and provide a reference basis for city planning and railway planning.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of traffic technology, in particular to a railway accessibility search method based on a topological road network. BACKGROUND

[0002] Accessibility, on the one hand, reflects the mobility of travelers in the regional space, and on the other hand, is also the interaction opportunity of different stations in the transportation network, which has important guiding significance for comprehensive transportation planning. As the lifeline of the country, railway is an indispensable bridge and link in politics, economy and cultural life. When formulating relevant plans, the railway accessibility of the study area needs to be clearly understood and judged, so as to plan based on the present situation.

[0003] However, at present, accessibility analysis is mostly applied to the field of highway, especially urban comprehensive public transportation, and there is a lack of perfect theoretical system and method support for the research of railway accessibility, and there are still a lot of problems to be solved.

[0004] The above content is only used to assist in understanding the technical solutions of the present application, and does not represent the acknowledgement of the above content as prior art. SUMMARY

[0005] The main purpose of the present application is to provide a railway accessibility search method based on a topological road network, which aims to solve the technical problem of how to improve the accessibility search efficiency of the prior art.

[0006] To achieve the above purpose, the present application provides a railway accessibility search method based on a topological road network, which comprises the following steps:

[0007] Constructing a railway line station topological network;

[0008] According to the railway line station topological network, the recommended path and travel time of all station pairs in the railway line station topological network are calculated;

[0009] Obtaining user demand information of the operation page;

[0010] According to the recommended path, travel time and user demand information, the accessibility search is completed, and the search result is obtained.

[0011] Optionally, according to the railway line station topological network, the recommended path and travel time of all station pairs in the railway line station topological network are calculated, which comprises:

[0012] Selecting a pair of stations in the railway line station topological network, the station pair contains a starting node and a terminating node;

[0013] Determining at least one accessible path according to the station pair;

[0014] determine an evaluation value of each reachable path according to the evaluation function, and obtain a recommended path of the station pair;

[0015] calculate a travel time consumption of the station pair according to the start node, the end node and the recommended path;

[0016] return to the step of selecting a station pair in the railway station topology network, the station pair including a start node and an end node, until recommended paths and travel time consumptions corresponding to all station pairs in the railway station topology network are obtained.

[0017] Optionally, the determining at least one reachable path according to the station pair comprises:

[0018] traverse adjacent nodes of the start node, and take the adjacent node corresponding to the start node as a search node;

[0019] determine whether the search node is the end node;

[0020] when the search node is the end node, add a search path of the search node to a reachable path set;

[0021] when the search node is not the end node, determine whether a transfer number from the start node to the search node is less than or equal to a preset transfer threshold;

[0022] when the transfer number from the start node to the current search node is less than or equal to the preset transfer threshold, traverse adjacent nodes of the current search node, replace the adjacent node corresponding to the search node with a search node, and return to the step of determining whether the search node is the end node;

[0023] determine at least one reachable path according to the reachable path set.

[0024] Optionally, the operation page comprises: an accessibility analysis setting area;

[0025] the accessibility analysis setting area comprises: an element selection window, a station setting label and a start point granularity setting label;

[0026] the obtaining of the user demand information of the operation page comprises:

[0027] in response to a start point granularity setting label operation instruction, determining station setting label selection content;

[0028] in response to a station setting label selection instruction, determining start station information from the station setting label selection content;

[0029] in response to an element selection window operation instruction, determining analysis element information;

[0030] The user demand information is determined according to the starting station information and analysis mode information.

[0031] Optionally, the element selection window comprises an isochronal time value setting label, a contrast mode setting label and a railway network setting label, and the analysis element information comprises an isochronal time value, a contrast mode and a line station network.

[0032] The analysis element information is determined in response to the element selection window operation instruction, and the analysis element information comprises:

[0033] The isochronal time value is determined in response to an isochronal time value setting label operation instruction.

[0034] The contrast mode is determined in response to a contrast mode setting label operation instruction.

[0035] The line station network is determined in response to a railway network setting label operation instruction.

[0036] Optionally, the search result is obtained by completing the reachability search according to the recommended path, the travel time consumption and the user demand information, and the search result comprises:

[0037] The starting station information and the analysis element information are determined according to the user demand information.

[0038] The isochronal time value in the analysis content is determined according to the analysis element information.

[0039] The target station set, in which the travel time consumption is less than or equal to the isochronal time value, is determined according to the starting station information.

[0040] The search result is obtained by searching according to the target station set and the recommended path corresponding to the target station set.

[0041] Optionally, the operation page comprises a reachability analysis display area, and the reachability analysis display area comprises a plurality of analysis display windows.

[0042] After the search result is obtained by completing the reachability search according to the recommended path, the travel time consumption and the user demand information, the operation page further comprises:

[0043] The contrast mode is obtained, and the target analysis display window is determined according to the contrast mode.

[0044] The starting station, the target station set, the line station network and the recommended path corresponding to the target station set are determined according to the search result.

[0045] The corresponding position set is determined on the railway line station topological network according to the starting station and the target station set.

[0046] The reachability isochronal area is determined according to the position set.

[0047] According to the line station network, the recommended path is filtered to obtain a display line;

[0048] According to the accessibility isochrone area and the display line, the display line is rendered on the railway line station topological network to complete the accessibility search display.

[0049] Optionally, the railway line station topological network comprises:

[0050] The longitude and latitude of each railway station is obtained through a network crawler;

[0051] The topological network station node is generated according to the longitude and latitude of the railway station;

[0052] The railway line and the railway operation line are obtained;

[0053] The driving speed of each railway line is determined according to the railway operation line;

[0054] The driving time of each railway line is calculated according to the driving speed and the railway operation line;

[0055] The railway line station topological network is generated according to the driving time, the railway operation line and the topological network station node.

[0056] In addition, to achieve the above-mentioned purpose, the present application also provides a railway accessibility search device based on a topological road network, which comprises a memory, a processor and a railway accessibility search program based on a topological road network stored on the memory and executable on the processor, and the railway accessibility search program based on a topological road network is configured to implement the steps of the railway accessibility search method based on a topological road network as described above.

[0057] In addition, to achieve the above-mentioned purpose, the present application also provides a storage medium, which stores a railway accessibility search program based on a topological road network, and the railway accessibility search program based on a topological road network implements the steps of the railway accessibility search method based on a topological road network as described above when executed by a processor.

[0058] The present application constructs a railway line station topological network, calculates the recommended path and the travel time consumption between all stations in the railway line station topological network according to the railway line station topological network, obtains user demand information of an operation page, and completes the accessibility search according to the recommended path, the travel time consumption and the user demand information to obtain a search result. In the above manner, the path and the time consumption between each node are calculated according to the constructed railway line station topological network, and the accessibility search is completed according to the user demand to meet the analysis of the action ability of different stations and provide a reference basis for city planning and railway planning. BRIEF DESCRIPTION OF DRAWINGS

[0059] Figure 1 is a structural schematic diagram of a railway reachability search device based on a topological road network of a hardware running environment related to the embodiment scheme of the present application.

[0060] Figure 2 is a flowchart of a first embodiment of a railway reachability search method based on a topological road network of the present application.

[0061] Figure 3 is a flowchart of a second embodiment of a railway reachability search method based on a topological road network of the present application.

[0062] Figure 4 is a structural block diagram of a first embodiment of a railway reachability search device based on a topological road network of the present application.

[0063] The implementation, functional features and advantages of the present application will be further described with reference to the embodiments and the accompanying drawings. DETAILED DESCRIPTION

[0064] It should be understood that the specific embodiments described herein are intended to be illustrative only and not limiting of the present application.

[0065] Reference Figure 1 , Figure 1 is a structural schematic diagram of a railway reachability search device based on a topological road network of a hardware running environment related to the embodiment scheme of the present application.

[0066] As Figure 1 shown, the railway reachability search device based on a topological road network can include a processor 1001, such as a central processing unit (CPU), a communication bus 1002, a user interface 1003, a network interface 1004, and a memory 1005. The communication bus 1002 is used to realize the connection and communication between these components. The user interface 1003 can include a display, an input unit such as a keyboard, and can also include a standard wired interface, a wireless interface. The network interface 1004 can optionally include a standard wired interface, a wireless interface (such as a wireless fidelity (Wi-Fi) interface). The memory 1005 can be a high-speed random access memory (RAM) memory, or a stable non-volatile memory (NVM), such as a disk memory. The memory 1005 can also be a storage device independent of the aforementioned processor 1001.

[0067] Those skilled in the art can understand that, Figure 1 The structure shown in the figure does not constitute a limitation on the railway reachability search device based on the topological road network, and can include more or fewer components than the figure, or combine certain components, or different component arrangements.

[0068] As Figure 1 As shown, the memory 1005 as a storage medium can include an operating system, a network communication module, a user interface module, and a railway reachability search program based on a topological road network.

[0069] In Figure 1 The network interface 1004 in the railway reachability search device based on the topological road network is mainly used for data communication with the network server; the user interface 1003 is mainly used for data interaction with the user; the processor 1001 and the memory 1005 in the railway reachability search device based on the topological road network can be arranged in the railway reachability search device based on the topological road network, and the railway reachability search device based on the topological road network calls the railway reachability search program based on the topological road network stored in the memory 1005 through the processor 1001, and executes the railway reachability search method based on the topological road network provided by the embodiment of the present application.

[0070] The embodiment of the present application provides a railway reachability search method based on a topological road network, referring to Figure 2 , Figure 2 The flowchart of a railway reachability search method based on a topological road network according to the first embodiment of the present application.

[0071] In this embodiment, the railway reachability search method based on the topological road network includes the following steps:

[0072] Step S10: Construct a railway line station topological network.

[0073] It should be noted that the execution subject of the embodiment is an intelligent terminal, which can be a server, a computer, or other devices with the same or similar functions as the server. The embodiment does not limit this, but only takes the server as an example for illustration.

[0074] It can be understood that the embodiment is applied to the process of analyzing the accessibility of a railway station. The accessibility reflects the movement ability of a traveler in a regional space. Since there are various accessibilities in the accessibility search process, in order to evaluate the movement ability of the traveler in the regional space, the best path and the required time should be calculated and displayed in a visual manner, so as to complete the accessibility search in a digital manner. Through the accessibility search, the accessibility of the research area can be quantitatively analyzed and researched under the network analysis based on the railway-specific operation diagram data and the railway line station attribute data by constructing a railway topological road network, so as to realize the related guidance of the urban railway planning and help the sustainable development of the city. In the traditional accessibility analysis, the accessibility of a region is calculated by setting a cost grid, or the accessibility of a station is analyzed based on a traffic network. However, both methods have some defects. The former can well simulate the overall accessibility of the city, but cannot express the influence of the internal railway operation of the hub; the latter can only analyze the related stations on the line and cannot reflect the diffusion of the accessibility of the city on the network. Therefore, the patent designs an optimized method combining the two methods to obtain more accurate accessibility analysis results. At the same time, based on the related accessibility analysis method of the research, a railway accessibility analysis system is designed by using digital means to explore an analysis system of the urban railway planning based on the accessibility calculation. The system can calculate the accessibility of the city in different network spaces in real time based on the existing road network or the planned road network, can visualize the results of the existing and planned conditions, can make an intuitive evaluation, and can reflect the necessity of the project construction to guide the construction and optimization of the future railway network.

[0075] It should be noted that the construction of the traffic network is the premise and basis of the accessibility calculation, and the purpose is to convert the irrelevant railway line and railway station data into a network that can be quantitatively described and analyzed. The railway line station topological network is a topological structure based on real railway stations and the connection relationship between the stations. Specifically, the construction of the railway topological road network is based on the railway operation diagram data, combined with the related attributes of the railway line and the railway station, and constructs a railway network topological road network describing the relationship between the railway base station and the road chain impedance.

[0076] In the embodiment, the longitude and latitude of each railway station are obtained by a network crawler; the topological network station nodes are generated according to the longitude and latitude of the railway station; the railway line and the railway operation line are obtained; the driving speed of each railway line is determined according to the railway operation line; the driving time of each railway line is calculated according to the driving speed and the railway operation line; and the railway line station topological network is generated according to the driving time, the railway operation line and the topological network station nodes.

[0077] It can be understood that the specific construction process of the railway line station topology network can be: according to the theoretical difference of the construction method, the main traffic network construction method is divided into network construction method based on geographical reality and construction method based on complex network graph theory. Since the railway network is a geographical entity network, the railway line and the railway station are also point and line elements with actual geographical positions. Considering comprehensively, the patent adopts the network construction method based on geographical actual position. In the real geographical space, the geographical position and the mutual connection of the traffic facilities are logically simplified into a geographical space network, which contains point elements and line elements, and through their connection, the structure system of the geographical actual network is formed. After obtaining the railway line and using GIS technology to process the railway line station position relationship table data. First, the point elements are displayed on the geographical space in the form of point elements by the "xy point conversion" function, for example, the stations are displayed on the map through coordinate conversion, and then the stations on the same railway are connected through the "xy line conversion" function to obtain the station network line. The railway line is displayed on the geographical space in the form of line elements.

[0078] Among them, the real travel time between adjacent stations of the existing road network can be obtained through the train operation diagram data. The travel time can be obtained according to the planning road network. Since there is no train timetable time reference for the planning line, the distance between the stations needs to be converted to obtain the calculated travel time between the stations as the travel time consumption between the stations of the planning line through the design speed corresponding to the railway attribute.

[0079] In the specific implementation, in the railway accessibility calculation, the distance network in the physical layer cannot truly and accurately reflect the railway travel time and other accessibility indicators. Therefore, the railway train operation diagram data is introduced. The railway train operation diagram data includes line distance, departure time and arrival time. It can be used to obtain the travel time, railway operation line and the name of the topology network station.

[0080] Step S20: calculating the recommended path and travel time consumption corresponding to all station pairs in the railway line station topology network according to the railway line station topology network.

[0081] It should be noted that after the railway line station topology network is constructed, the recommended path and travel time consumption corresponding to all station pairs in the topology network need to be calculated, wherein the station pair is the pair of starting point and ending point. Any two nodes in the railway line station topology network can be selected as a station pair for calculation until all station pairs in the railway line station topology network are calculated.

[0082] Specifically, the recommended path and the travel time can be calculated by using a multi-objective optimal path algorithm, for example, a DFS algorithm. The algorithm lists all paths between two stations and returns the required path. The principle of the algorithm is to start from any starting point in the graph, visit any adjacent point m1. Then start from m1, visit the unvisited point m2 around m1; then start from m2 and perform similar visits; until a point n is reached, all of whose adjacent points have been visited. Then after the end of this round of visits, the last visited point is returned, and the surrounding unvisited points are searched again, and the above process is repeated until all points have been searched. Thus, all reachable paths are found, and the path with the shortest travel time is selected as the recommended path and the travel time corresponding to the recommended path.

[0083] Step S30: Obtain user demand information of the operation page.

[0084] It should be noted that the reachability search is a search process, and the target of the search and other parameters need to be determined, so an operation page is needed as an entry for user demand. The most important information in the user demand information is the user demand target, i.e., which station the user wants to search for reachability.

[0085] In this embodiment, the operation page includes a reachability analysis setting area, and the reachability analysis setting area includes an element selection window, a station setting label, and a starting point granularity setting label. The operation page obtains user demand information, including: in response to a starting point granularity setting label operation instruction, determining station setting label selection content; in response to a station setting label selection instruction, determining starting station information from the setting label selection content; in response to an element selection window operation instruction, determining analysis element information; and determining user demand information according to the starting station information and analysis mode information.

[0086] In this embodiment, the element selection window includes an isochrone time value setting label, a comparison mode setting label, and a railway network setting label, and the analysis element information includes an isochrone time value, a comparison mode, and a line station network. The operation page obtains user demand information, including: in response to an isochrone time value setting label operation instruction, determining an isochrone time value; in response to a comparison mode setting label operation instruction, determining a comparison mode; and in response to a railway network setting label operation instruction, determining a line station network.

[0087] It should be noted that the specific content of the operation page can be illustrated by the following cases, for example: the starting point granularity setting label, that is, selecting the granularity of the accessibility starting point, supporting county-level, city-level, railway cell, and railway station four granularities, such as selecting a city, because the stations of different granularities in the same area are not the same, the selection range of the station can be further narrowed; in the selection set, the map point selection or the drop-down list selection is selected, and the cities to be compared are selected, such as Shanghai and Wuhan. If only a single city analysis is made, only the elements in the selection set need to be selected, and the element selection is selected through the element selection window; the comparison mode setting label of the comparison mode "different starting point comparison" is selected, and the comparison mode can be, for example: different starting point accessibility comparison and same starting point different network accessibility comparison two modes, wherein the different starting point accessibility comparison is to analyze the accessibility of two different stations to the surrounding area, and the same starting point different network accessibility comparison is to compare the accessibility of the same location in different networks, and the different networks are, for example: high-speed rail network, freight network, and ordinary railway network, which can even be further divided into a specific network line of railway network; the network is selected in the online station network, such as the current network; the railway isochrone three circle layer time value is filled in the isochrone time value setting label, such as 60, 120, and 180 minutes, and then the 60-minute reachable range, 120-minute reachable range, and 180-minute reachable range can be displayed in the accessibility analysis display area; the province boundary and the city group boundary where the starting point element is located can be highlighted; whether to display the three railway isochrone circle lines can be controlled; and whether to display the name label of the passing line can be controlled.

[0088] Step S40: completing the accessibility search according to the recommended path, travel time consumption, and user demand information to obtain a search result.

[0089] It should be noted that the accessibility search can be performed according to the recommended path, travel time consumption, and user demand information. After the starting point and the traffic network that the user needs to perform the accessibility search are obtained according to the user demand, the recommended path and the travel time consumption data are found, the accessibility of the surrounding stations in the traffic network that the user hopes to analyze is found from the current starting point, and the accessibility of the surrounding stations is found. Specifically, the time of reaching different stations through the recommended path is found, and further, the corresponding area (such as the administrative division of county, district, and city) of each station is standardized to obtain the accessibility of the reachable area.

[0090] In this embodiment, the starting station information and the analysis element information are determined according to the user demand information; the isochrone time value in the analysis content is determined according to the analysis element information; the target station set whose travel time consumption is less than or equal to the isochrone time value is determined according to the starting station information; and the search result is obtained by searching according to the target station set and the recommended path corresponding to the target station set.

[0091] It should be noted that the embodiment can be based on B / S architecture, programmed by JavaScript language, and designed railway accessibility system highly consistent with daily business. The planning and design personnel work and mapping efficiency can be greatly improved, and the efficient application of data and algorithms is realized. Three analysis modes of single city single network, single city different line network comparison, and double city same line network comparison can be supported, and the network supports custom line station editing, the railway supports custom accessibility time, and the railway supports three isochrone circle analysis at the same time. Among them, the isochrone line time value is one of the user demand accessibility analysis elements, for example, the user demand isochrone line is 60, 120, 180 minutes, that is, how many areas can be reached within 60, 120, 180 minutes from the starting point, and then the search is completed to show the user the area range that can be reached within 60, 120, 180 minutes. For example: the isochrone line time value is 60 minutes, and the target station set contains A, B, C, and D four stations, then in the accessibility of the starting point, 60 minutes can reach the areas where A, B, C, and D four stations are located, for example, the different isochrone line time values corresponding to the areas are displayed by different colors in the accessibility analysis display area, to reflect the current station accessibility.

[0092] Specifically, after obtaining the target station set, the location corresponding to each target station in the set can be found according to the target station set, to determine the accessible area, for example: if the target station is Shenzhen Luohu District, then it can be known that the starting station belongs to which isochrone line range of Shenzhen Luohu District.

[0093] In the embodiment, the operation page includes: an accessibility analysis display area, which contains a plurality of analysis display windows; after completing the accessibility search according to the recommended path, travel time consumption, and user demand information, obtaining the search result, further including: obtaining a comparison mode, and determining a target analysis display window according to the comparison mode; determining the starting station, target station set, line station network, and target station set corresponding recommended path according to the search result; determining the corresponding position set on the railway line station topology network according to the starting station and target station set; determining the accessibility isochrone line area according to the position set; filtering the recommended path according to the line station network to obtain a display line; rendering the accessibility isochrone line area and the display line on the railway line station topology network to complete the accessibility search display.

[0094] In a specific implementation, the comparison mode can be divided into different starting point reachability comparison, same starting point different network reachability comparison, etc. The present embodiment takes the above two comparison modes as an example in combination, and proposes the following scheme for illustration: the different starting point reachability comparison is as follows: the granularity of the reachability starting point is selected, and four granularities of county-level, city-level, railway cell, and railway station are supported, such as selecting a city-level; through map point selection or drop-down list selection, the cities to be compared are selected, such as Shanghai and Wuhan. If only single-city analysis is made, only the elements to be selected in A are needed; the comparison mode “different starting point comparison” is selected; the network is selected in the online station network, such as the current network; the railway isochrone three-circle layer time value is filled in, such as 60, 120, and 180 minutes; the province boundary and city group boundary where the starting point element is located can be highlighted, for example: the city area where the 60-minute reachable station is located is displayed in red, the city area where the 120-minute reachable station is located is displayed in yellow, and the city area where the 180-minute reachable station is located is displayed in green; it can be known how many coverage areas can be reached at different times from the starting point. Whether to display the route of the three railway isochrone circles can be controlled; whether to display the name label of the route can be controlled. Among them, two starting points need to be selected and displayed in the reachability analysis display area 1 and the reachability analysis display area 2, respectively, and the split-screen display can help the user to compare the reachability of different starting points. The same starting point different network reachability comparison is as follows: first, the planning line (such as the high-speed railway along the river) is added according to the online station editing of the custom network 1 line station; the “different network comparison” is selected in the comparison mode; the starting point A is selected in the selection set A through mouse point selection or drop-down list selection; the current network and the custom network are selected in the online station network at the same time as the two comparison networks; the analysis is executed, and two maps and statistical charts will display the urban railway reachability under the conditions of two railway networks.

[0095] The present embodiment constructs a railway line station topological network; calculates recommended paths and travel time consumption between all stations in the railway line station topological network according to the railway line station topological network; obtains user demand information of an operation page; and completes reachability search according to the recommended paths, travel time consumption, and user demand information to obtain a search result. In this way, the paths and time consumption between each node are calculated according to the constructed railway line station topological network, and the reachability search is completed according to the user demand, so as to analyze the action ability of different stations and provide a reference basis for city planning and railway planning.

[0096] Reference Figure 3 , Figure 3 The present embodiment is a flowchart of a railway reachability search method based on a topological road network.

[0097] Based on the above first embodiment, the railway reachability search method based on a topological road network further includes the following steps in the step S20:

[0098] Step S21: selecting a pair of stations in the railway station topology network, the pair of stations including a starting node and a terminal node.

[0099] It should be noted that, since in the actual process of taking the train, passengers often choose the optimal travel route, therefore, when performing the reachability analysis, the optimal route in all travel routes should be calculated as the basis for the reachability analysis, and therefore, the best reaching route between all stations needs to be quickly calculated, so a pair of stations in the railway station topology network is selected first, and the recommended route is calculated, until the optimal recommended path of all pairs of stations in the railway station topology network is calculated.

[0100] Step S22: determining at least one reachable path according to the pair of stations.

[0101] It should be noted that, since the railway station topology network is complex, each pair of stations may have multiple reachable paths, and the best path needs to be confirmed after the reachable paths are obtained.

[0102] In this embodiment, the adjacent nodes of the starting node are traversed, and the adjacent nodes corresponding to the starting node are taken as search nodes; it is determined whether the search node is the terminal node; when the search node is the terminal node, the search path of the search node is added to the reachable path set; when the search node is not the terminal node, it is determined whether the transfer number from the starting node to the search node is less than or equal to the preset transfer threshold; when the transfer number from the starting node to the current search node is less than or equal to the preset transfer threshold, the adjacent nodes of the current search node are traversed, the adjacent nodes corresponding to the search node are replaced as search nodes, and the step of determining whether the search node is the terminal node is returned; at least one reachable path is determined according to the reachable path set.

[0103] It should be noted that the specific path search method of the embodiment is as follows: starting from any starting point in the figure, any adjacent point ml is accessed. Then ml is started to access the unvisited point m2 around ml; then similar access is performed from m2; until a point n is reached, all adjacent points of which have been visited. Then after the end of this round of access, the last round of visited points are returned, and whether there is an unvisited point around is searched, and the above process is repeated until all points have been searched. The DFS algorithm will not miss the feasible solution. Therefore, the research decides to use the DFS algorithm to solve the established model. For the application of the algorithm in the traffic network, the reasonable state of the pedestrian trip also needs to be considered, and the pedestrian trip also tends to have a small number of transfers, so when the DFS algorithm is used to find the effective path between two stations, the threshold of the number of transfers of the path is set, and when the number of transfers is less than or equal to the threshold, the effective path is recorded. C++ programming is used to realize the above algorithm, and the specific steps are as follows: defining and assigning variables, setting the threshold condition of transfer stations, reading in the national railway topological network, and converting it into a time length topological matrix; defining a pair of starting point and ending point of a trip, the starting point is O and the ending point is D, and one of the adjacent stations of the starting point is selected to start searching; set the search station at this moment as u, and search from the station u to any adjacent station v of u, if the number of transfers along the search path from the starting point O is less than or equal to the threshold condition, then let v be the new starting station, and repeat the above step until the station v is the destination D, otherwise, ignore the station; determine whether the station v is the destination D, if yes, record the path from O to D searched step by step, and record the path meeting the condition; return to the previous departure point, and determine whether the adjacent stations around the station have been searched, if yes, end the search, at this time all paths meeting the condition between the starting point O and the ending point D have been recorded; calculate the value of the evaluation function of each path meeting the condition, obtain the optimal path, and output the time cost of the path. All paths between OD with less than the preset number of transfers can be searched out, and the purpose of setting the threshold of transfer stations is to filter out the paths with less possibility of travel selection, because in the topological network, the number of paths between two points is very large, which will cause waste of computing resources, therefore, the threshold of transfer stations can be set to directly exclude the routes with too many transfer stations, so as to improve the calculation efficiency of reachable paths.

[0104] Step S23: determining the evaluation value of each reachable path according to the evaluation function, and obtaining the recommended path of the station pair.

[0105] It should be noted that the evaluation function is mainly used to evaluate different paths to filter out the recommended path, and the recommended path is generally the path with the least time. The evaluation process of the evaluation function is given as follows in the embodiment: The core of the reachability algorithm is to calculate the optimal path of the network under the time attribute. A network model of the problem to be solved is constructed, and the network G=(N, E) is set, wherein N is a station set in the network, the total number is N, E is a set of road segments in the network, and the total number is m. The time cost of a path k from a station i to a station j in the network G is Evaluation function The optimized mathematical expression is:

[0106]

[0107] Wherein Lij is the path with the lowest time cost, and therefore, the determination of the feasible solution set X, that is, the determination of the effective path set between two stations, is the key to solving the problem. In the research of the optimal path algorithm, the K-shortest path algorithm is often used before, but the K-shortest path algorithm will miss some feasible solutions in the actual application process. And because the network scale is large at the national level, the path data between any two points is numerous, and the calculation problem needs to find the optimal path between all stations, therefore, the K-shortest path algorithm is not selected.

[0108] Further, according to the above steps, the optimal path and the corresponding time cost of all station pairs in the national railway topological road network can be calculated. In the actual railway planning process, the railway reachability of stations is rarely studied, and the railway reachability analysis of cities or larger research areas is usually carried out. Therefore, the reachability of stations needs to be converted into the reachability between cities through the mapping relationship between stations and cities. The calculation logic is as follows: the latitude and longitude of the station are used to map the stations and cities to obtain the mapping relationship between the stations and the cities; for a city C i , the station set S=(S i ) of the city is obtained through spatial mapping. For a station S i , in order to calculate the travel time between the station and the city C j , the reachability algorithm is used to calculate the travel time between the station and all stations of the city, and the minimum value is defined as the travel time between the station and the city; for a city C i , the travel time between all station sets S and the city C j is calculated, and the minimum value is defined as the travel time between the city C i and the city C j .

[0109] Step S24: calculating the travel time of the station pair according to the starting node, the terminal node and the recommended path.

[0110] It should be noted that the recommended path corresponding to the station pair is selected according to the starting node and the ending node, and the travel time of the recommended path is determined in combination with the railway operation data.

[0111] Step S25: returning to the step of selecting a station pair in the railway line station topological network, the station pair including a starting node and an ending node, until the recommended paths and the travel times of all station pairs in the railway line station topological network are obtained.

[0112] It should be understood that, since the number of nodes is very large, the reachability between all station pairs in the railway line station topological network is obtained, and the recommended route of each station pair is recorded in the railway line station topological network, so as to provide a data basis for subsequent reachability search of different stations.

[0113] In the embodiment, a station pair is selected in the railway line station topological network, the station pair including a starting node and an ending node; at least one reachable path is determined according to the station pair; the evaluation value of each reachable path is determined according to an evaluation function, and the recommended path of the station pair is obtained; the travel time of the station pair is calculated according to the starting node, the ending node and the recommended path; the step of selecting a station pair in the railway line station topological network, the station pair including a starting node and an ending node, is returned until the recommended paths and the travel times of all station pairs in the railway line station topological network are obtained. Through the above scheme, the recommended path of each station pair is quickly calculated, and the reachability search efficiency is improved.

[0114] In addition, the embodiment of the present application also provides a storage medium, and the storage medium stores a railway reachability search program based on a topological road network. When the railway reachability search program based on the topological road network is executed by a processor, the steps of the railway reachability search method based on the topological road network are realized.

[0115] Referring to Figure 4 , Figure 4 FIG. 1 is a structural block diagram of a railway reachability search device based on a topological road network according to an embodiment of the present application.

[0116] As shown in Figure 4 , the railway reachability search device based on the topological road network according to the embodiment of the present application includes:

[0117] The processing module 10 is configured to construct a railway line station topological network.

[0118] The processing module 10 is further configured to calculate the recommended paths and the travel times of all station pairs in the railway line station topological network according to the railway line station topological network.

[0119] The acquisition module 20 is configured to acquire user demand information of an operation page.

[0120] The processing module 10 is further configured to complete reachability search according to the recommended path, the travel time consumption and the user demand information, and obtain a search result.

[0121] It should be understood that the above is only an example, and does not constitute any limitation on the technical solutions of the present application. In specific applications, those skilled in the art can set up as needed, and the present application does not limit this.

[0122] The processing module 10 of the embodiment constructs a railway station topology network; the processing module 10 calculates the recommended path and the travel time consumption corresponding to all station pairs in the railway station topology network according to the railway station topology network; the acquisition module 20 acquires user demand information of an operation page; and the processing module 10 completes reachability search according to the recommended path, the travel time consumption and the user demand information, and obtains a search result. In the above manner, the path and the time consumption between each node are calculated according to the constructed railway station topology network, and the reachability search is completed according to the user demand, so as to analyze the action ability of different stations and provide a reference basis for city planning and railway planning.

[0123] A pair of station pairs is selected in the railway station topology network, and the station pairs include a starting node and a terminal node;

[0124] At least one reachable path is determined according to the station pairs;

[0125] The evaluation function is used to determine the evaluation value of each reachable path, and a recommended path of the station pairs is obtained;

[0126] The travel time consumption of the station pairs is calculated according to the starting node, the terminal node and the recommended path;

[0127] The step of selecting a pair of station pairs in the railway station topology network, and the station pairs including a starting node and a terminal node is returned, until the recommended path and the travel time consumption corresponding to all station pairs in the railway station topology network are obtained.

[0128] In an embodiment, the processing module 10 is further configured to traverse the adjacent nodes of the starting node, and the adjacent nodes corresponding to the starting node in the traversal are taken as search nodes;

[0129] It is judged whether the search node is the terminal node;

[0130] When the search node is the terminal node, the search path of the search node is added to the reachable path set;

[0131] When the search node is not a termination node, it is determined whether the number of transfers from the starting node to the search node is less than or equal to a preset transfer threshold value;

[0132] When the number of transfers from the starting node to the current search node is less than or equal to the preset transfer threshold value, adjacent nodes of the current search node are traversed, the adjacent nodes corresponding to the search nodes traversed are replaced with search nodes, and the step of determining whether the search node is a termination node is returned;

[0133] At least one reachable path is determined according to the set of reachable paths.

[0134] In an embodiment, the acquisition module 20 is further configured to determine station setting label selection content in response to a starting point granularity setting label operation instruction.

[0135] In response to a station setting label selection instruction, starting station information is determined from the setting label selection content.

[0136] In response to an element selection window operation instruction, analysis element information is determined.

[0137] User demand information is determined according to the starting station information and analysis mode information.

[0138] In an embodiment, the acquisition module 20 is further configured to determine a time line time value in response to a time line time value setting label operation instruction.

[0139] In response to a comparison mode setting label operation instruction, a comparison mode is determined.

[0140] In response to a railway network setting label operation instruction, a line station network is determined.

[0141] In an embodiment, the processing module 10 is further configured to determine starting station information and analysis element information according to the user demand information.

[0142] In response to the analysis element information, a time line time value in the analysis content is determined.

[0143] According to the starting station information, a target station set in which the travel time consumption is less than or equal to the time line time value is determined.

[0144] According to the target station set and a recommended path corresponding to the target station set, a search is performed to obtain a search result.

[0145] In an embodiment, the processing module 10 is further configured to acquire a comparison mode and determine a sub-target analysis display window according to the comparison mode.

[0146] determine a starting station, a target station set, a line station network and a recommended path corresponding to the target station set according to the search result;

[0147] determine a corresponding position set on the railway line station topology network according to the starting station and the target station set;

[0148] determine an accessibility isochrone area according to the position set;

[0149] screen the recommended path according to the line station network to obtain a display line;

[0150] render the accessibility isochrone area and the display line on the railway line station topology network to complete the accessibility search display.

[0151] In an embodiment, the processing module 10 is further configured to obtain the latitude and longitude of each railway station through a web crawler;

[0152] generate a topology network station node according to the latitude and longitude of the railway station;

[0153] obtain a railway line and a railway operation line;

[0154] determine a driving speed of each section of the railway line according to the railway operation line;

[0155] calculate a driving time of each section of the railway line according to the driving speed and the railway operation line;

[0156] generate a railway line station topology network according to the driving time, the railway operation line and the topology network station node.

[0157] It should be noted that the above-described workflow is merely illustrative and does not limit the scope of protection of the present application. In actual applications, a person skilled in the art can select part or all of the above-described workflow to achieve the purpose of the present embodiment, and the present application is not limited in this regard.

[0158] In addition, technical details not described in detail in the present embodiment can be found in the railway accessibility search method based on a topology road network provided by any embodiment of the present application, and will not be described here again.

[0159] Moreover, it is to be understood that the phraseology and terminology used herein is for the purpose of description and should not be regarded as limiting. The use of "including" "comprising" or "having" and variations thereof herein is intended to encompass the presence of one or more recited elements or steps and not the exclusion of any other integers or steps. The use of "including", "comprising", "having" and "with" and variations thereof herein is intended to encompass the presence of one or more recited elements or steps and not the exclusion of any other integers or steps.

[0160] The above-mentioned embodiment numbers of the present application are only for description, and do not represent the advantages or disadvantages of the embodiments.

[0161] Those skilled in the art can clearly understand the above-mentioned embodiment methods from the description of the above embodiments, which can be realized by software and necessary general hardware platforms, of course, can also be realized by hardware, but in many cases, the former is a better embodiment. Based on such understanding, the technical solutions of the present application can be embodied in the form of a software product, which is stored in a storage medium (such as a read only memory (ROM) / RAM, a magnetic disk, an optical disk), and includes a plurality of instructions for making a terminal device (which can be a mobile phone, a computer, a server, or a network device, etc.) execute the methods described in various embodiments of the present application.

[0162] The above is only the preferred embodiment of the present application, and does not limit the patent scope of the present application, and any equivalent structure or equivalent process transformation, or direct or indirect application in other related technical fields, is also included in the patent protection scope of the present application.

Claims

1. A method for railway reachability search based on topological road network, characterized in that, The method comprises the following steps: constructing a railway station topology network; calculating recommended paths and travel time for all station pairs in the railway station topology network according to the railway station topology network; obtaining user demand information of an operation page; completing reachability search according to the recommended paths, travel time and user demand information to obtain a search result; the method comprises the following steps: selecting a station pair in the railway station topology network, wherein the station pair comprises a starting node and a terminal node; determining at least one reachable path according to the station pair; determining the evaluation value of each reachable path according to the evaluation function to obtain the recommended path of the station pair; calculating the travel time of the station pair according to the starting node, the terminal node and the recommended path; returning to the step of selecting a station pair in the railway station topology network, wherein the station pair comprises a starting node and a terminal node, until the recommended paths and travel time of all station pairs in the railway station topology network are obtained; the method comprises the following steps: traversing the adjacent nodes of the starting node, and taking the adjacent nodes corresponding to the starting node as search nodes; determining whether the search node is the terminal node; when the search node is the terminal node, adding the search path of the search node to the reachable path set; when the search node is not the terminal node, determining whether the transfer number from the starting node to the search node is less than or equal to the preset transfer threshold; when the transfer number from the starting node to the current search node is less than or equal to the preset transfer threshold, traversing the adjacent nodes of the current search node, replacing the adjacent nodes corresponding to the search node with search nodes, and returning to the step of determining whether the search node is the terminal node; determining at least one reachable path according to the reachable path set; the method comprises the following steps: determining starting station information and analysis element information according to the user demand information; determining the isochrone time value in the analysis content according to the analysis element information; determining a target station set in which the travel time is less than or equal to the isochrone time value according to the starting station information; searching according to the target station set and the recommended paths corresponding to the target station set to obtain a search result.

2. The method of claim 1, wherein, The operation page comprises a reachability analysis setting area; the reachability analysis setting area comprises an element selection window, a station setting label and a starting point granularity setting label; the method comprises the following steps: determining station setting label selection content in response to starting point granularity setting label operation instructions; determining starting station information from the station setting label selection content in response to station setting label selection instructions; determining analysis element information in response to element selection window operation instructions; determining user demand information according to the starting station information and analysis mode information.

3. The method of claim 2, wherein, The element selection window comprises an isochronal time value setting label, a contrast mode setting label and a railway network setting label, and the analysis element information comprises isochronal time value, contrast mode and line station network; The step of determining analysis element information in response to the element selection window operation instruction comprises: determining isochronal time value in response to the isochronal time value setting label operation instruction; determining contrast mode in response to the contrast mode setting label operation instruction; determining line station network in response to the railway network setting label operation instruction.

4. The method of any one of claims 1 to 3, wherein, The operation page comprises an accessibility analysis display area, and the accessibility analysis display area comprises a plurality of analysis display windows; After obtaining the search result by completing accessibility search according to the recommended path, travel time consumption and user demand information, the method further comprises: determining a contrast mode, and determining a target analysis display window according to the contrast mode; determining a starting station, a target station set, a line station network and a recommended path corresponding to the target station set according to the search result; determining a corresponding position set on the railway line station topology network according to the starting station and the target station set; determining an accessibility isochronal area according to the position set; screening the recommended path according to the line station network to obtain a display line; completing accessibility search display by rendering the accessibility isochronal area and the display line on the railway line station topology network.

5. The method of claim 1, wherein, The method of constructing a railway line station topology network comprises: obtaining the latitude and longitude of each railway station by using a network crawler; generating a topology network station node according to the latitude and longitude of the railway station; obtaining a railway line and a railway running line; determining the driving speed of each railway line according to the railway running line; calculating the driving time of each railway line according to the driving speed and the railway running line; generating a railway line station topology network according to the driving time, the railway running line and the topology network station node.

6. A topological road network based railway reachability search device, characterized by, The device comprises a memory, a processor and a topology road network-based railway accessibility search program stored on the memory and executable on the processor, and the topology road network-based railway accessibility search program is configured to implement the steps of the topology road network-based railway accessibility search method according to any one of claims 1 to 5.

7. A storage medium, characterized by The storage medium stores a topology road network-based railway accessibility search program, and the topology road network-based railway accessibility search program implements the steps of the topology road network-based railway accessibility search method according to any one of claims 1 to 5 when executed by a processor.

Images