Traffic system geographic layout extraction method and system

Abstract

The invention belongs to the related technical field of traffic system topology modeling, and discloses a traffic system geographic layout extraction method and system, and the method comprises the steps: constructing an initial network G1; removing redundant edges of the initial network to obtain the geographic layout of the traffic system; the method specifically comprises the following steps: removing all first-class edges in an initial network G1 to obtain an optimized network G2; the conditions met by the first type of edges include that the connectivity of the network is not changed after the first type of edges are removed; the stations at the two ends of the first type of edges are not in a relative neighborhood relationship; at least one running route of the vehicle can stop at the two end stations of the first type of edge and a plurality of intermediate stations between the two end stations, and the travel time of the vehicle between the two end stations of the first type of edge does not exceed a time threshold value. Through the method, redundant road sections can be deleted, so that the precision of the geographic layout data of the traffic system is improved.

Description

Technical Field

[0001] The present invention belongs to the technical field related to traffic system topology modeling, and more specifically, relates to a method and system for extracting the geographical layout of a traffic system. Background Art

[0002] Transportation system geographic layout data refers to detailed information about the basic physical structure and components of the transportation system. These data include the geographical location of transportation routes, the location and attributes of stations, the number and type of routes, etc.

[0003] Taking the railway system as an example, the geographical layout data of the railway system provides a static, physical description of the physical existence of the railway system and is the basis for building any railway network model. Usually, foreign scholars download the geographical layout data of the railway system from open access maps, such as Open Street Map. Open Street Map is an open source project that contains detailed information on streets, railways, rivers, woodlands, buildings, etc. around the world. The data of Open Street Map is collected by volunteers using global positioning system equipment, aerial photography, other free sources, or directly editing maps on the website, and is widely used in many fields. However, since Open Street Map is maintained by volunteers, the data resolution and accuracy of different countries or regions are not the same. In addition to using open source data similar to Open Street Map, some scholars obtain the geographical layout data of the railway system through train timetable information. However, the geographical layout data of the railway system obtained by the space-of-stops method based on the train timetable will have a large number of redundant railway sections.

[0004] In summary, providing an accurate method for extracting the geographical layout of the transportation system is an urgent problem to be solved. Summary of the invention

[0005] In view of the above defects or improvement needs of the prior art, the present invention provides a method and system for extracting the geographical layout of a transportation system, which aims to improve the accuracy of the geographical layout data of the transportation system.

[0006] The present invention provides a method for extracting geographical layout of a transportation system, which comprises:

[0007] Step S1: Construct the initial network G 1 , the nodes of the initial network are the stop sites of the transportation system. If there is at least one transportation route that stops at two stops consecutively, the two stops that stop consecutively are connected by an edge in the initial network;

[0008] Step S2: removing redundant edges of the initial network to obtain a geographical layout of the transportation system;

[0009] The removing redundant edges of the initial network includes:

[0010] Step S21: Remove the initial network G 1 All the first-class edges in the network are obtained, and the optimized network G is obtained. 2 ; The conditions satisfied by the first type of edge include:

[0011] Condition 1: The connectivity of the network does not change after the first type of edge is removed;

[0012] Condition 2: The sites at both ends of the first type of edge are not in a relative neighborhood relationship; if two circles with two sites as centers and the distance between the two sites as radii do not contain any other sites in their intersection area, then the two sites are in a relative neighborhood relationship;

[0013] Condition three: there is at least one vehicle whose route stops at the two end stations of the first type of edge and several intermediate stations between the two end stations, and the travel time of this vehicle between the two end stations of the first type of edge does not exceed a time threshold, and the time threshold is less than or equal to γ ​​times the theoretical travel time of this vehicle along the first type of edge, where γ is the ratio of the fastest speed to the slowest speed of all vehicles passing the first type of edge.

[0014] Optionally, removing redundant edges of the initial network further includes:

[0015] Step S22: Remove network G 2 All the second-type edges in the network are obtained, and the optimized network G is obtained. 3 ; The conditions satisfied by the second type of edges include:

[0016] Condition 4: After removing the second type of edge, all vehicles that stop at the two end stations of the second type of edge continuously will not stop at any intermediate station on the new shortest path between the two end stations of the second type of edge;

[0017] Condition 5: After removing the second-type edge, the length of the new shortest path between the stations at both ends of the second-type edge does not exceed a length threshold, and the length threshold is less than or equal to the minimum value of the maximum operating distances of all vehicles passing through the new shortest path, and the maximum operating distance is the product of the travel time of the vehicle between the stations at both ends of the new shortest path and the maximum speed of the corresponding vehicle.

[0018] Optionally, in step S1, constructing an initial network includes:

[0019] The transportation system station data, transportation tool schedule data and transportation tool type data are collected, and the initial network is constructed based on the collected data.

[0020] Optionally, the traffic system site data includes: site number, site name, site longitude, and site latitude;

[0021] The transportation timetable data includes: transportation number, transportation name, transportation stop site set, transportation departure time set at each stop site, and transportation arrival time set at each stop site;

[0022] The vehicle type data includes: vehicle number and vehicle name.

[0023] Optionally, in step S21, before removing the first type of edges, an N*N dimensional relative neighborhood matrix is ​​constructed, where N is the number of sites, and the element in the i-th row and j-th column of the matrix indicates whether the i-th site and the j-th site are in a relative neighborhood relationship.

[0024] Optionally, the transportation system is a railway system and the transportation vehicle is a train.

[0025] The present invention also provides a transportation system geographical layout extraction system, which includes:

[0026] Initial network construction unit, used to construct the initial network G 1 , the nodes of the initial network are the stop sites of the transportation system. If there is at least one transportation route that stops at two stops consecutively, the two stops that stop consecutively are connected by an edge in the initial network;

[0027] An extraction unit, used to remove redundant edges of the initial network to obtain a geographical layout of the transportation system; the extraction unit includes a first removal subunit, or includes both the first removal subunit and the second removal subunit;

[0028] The first removal subunit is used to remove the initial network G 1 All the first-class edges in the network are obtained, and the optimized network G is obtained. 2 ; The conditions satisfied by the first type of edge include:

[0029] Condition 1: The connectivity of the network does not change after the first type of edge is removed;

[0030] Condition 2: The sites at both ends of the first type of edge are not in a relative neighborhood relationship; if two circles with two sites as centers and the distance between the two sites as radii do not contain any other sites in their intersection area, then the two sites are in a relative neighborhood relationship;

[0031] Condition 3: There is at least one vehicle whose route stops at the two end stations of the first type of edge and several intermediate stations between the two end stations, and the travel time of this vehicle between the two end stations of the first type of edge does not exceed a time threshold, and the time threshold is less than or equal to γ ​​times the theoretical travel time of this vehicle along the first type of edge, where γ is the ratio of the fastest speed to the slowest speed of all vehicles passing through the first type of edge;

[0032] The second removal subunit is used to remove the network G 2 All the second-type edges in the network are obtained, and the optimized network G is obtained. 3 ; The conditions satisfied by the second type of edges include:

[0033] Condition 4: After removing the second type of edge, all vehicles that stop at the two end stations of the second type of edge continuously will not stop at any intermediate station on the new shortest path between the two end stations of the second type of edge;

[0034] Condition 5: After removing the second-type edge, the length of the new shortest path between the stations at both ends of the second-type edge does not exceed a length threshold, and the length threshold is less than or equal to the minimum value of the maximum operating distances of all vehicles passing through the new shortest path, and the maximum operating distance is the product of the travel time of the vehicle between the stations at both ends of the new shortest path and the maximum speed of the corresponding vehicle.

[0035] The present invention also provides an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of any of the above methods when executing the computer program.

[0036] The present invention also provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of any of the methods described above.

[0037] The present invention also provides a computer program product, comprising a computer program or instructions, characterized in that when the computer program or instructions are executed by a processor, the steps of any of the methods described above are implemented.

[0038] In general, compared with the prior art, the above technical solutions conceived by the present invention mainly have the following beneficial effects:

[0039] 1. The method for extracting the geographical layout of a transportation system provided by the present invention first constructs an initial network based on information about transportation vehicles and their travel routes. As long as the stations are continuous stops, they are connected to form edges. The initial network thus constructed often contains redundant sections of geographical layout. In order to reduce redundant routes, the present invention immediately removes the redundant edges in the initial network. When identifying redundant edges, the present invention removes the first type of edges that simultaneously meet three specific conditions as redundant edges. Among them, condition one ensures that the edges that affect the connectivity of the network will not be deleted, and conditions two and three require that the removed edges have other paths to the stations at both ends within their proximity. That is to say, if there is an edge and other routes adjacent to this edge between two stations at the same time, it can be considered that this edge and its adjacent routes actually share a track, that is, this edge belongs to a redundant section and is deleted, thereby improving the accuracy of the geographical layout data of the transportation system.

[0040] 2. Furthermore, after removing the first type of edges, the second type of edges that meet two specific conditions at the same time are further removed as redundant edges. Among them, condition four ensures that removing this edge will not affect the normal stopping path of the vehicle, that is, deleting it will not affect the actual traffic. Condition five ensures that the deleted edge will not lead to an excessively long or impractical alternative path. The combination of these two conditions ensures that the number of vehicle stops will not increase when deleting these redundant edges, maintaining travel efficiency, and the deleted edges will not lead to an excessively long detour path, maintaining the rationality of travel. Therefore, the edges that meet both conditions four and five are considered to be redundant edges and are deleted to further improve the accuracy of the geographical layout data of the transportation system. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] Figure 1 is a flow chart of steps of a method for extracting geographical layout of a transportation system in one embodiment of the present invention;

[0042] Figure 2 is a flow chart of steps of a method for extracting geographical layout of a transportation system in another embodiment of the present invention;

[0043] Figure 3 This is the data information table of the G81 train collected;

[0044] Figure 4 is the initial network G in one embodiment of the present invention 1 Schematic diagram of

[0045] Figure 5 It is the removal of the initial network G in one embodiment of the present invention. 1 The network G obtained after the first type of edge 2 Schematic diagram of

[0046] Figure 6 is removed in one embodiment of the present invention Figure 5 China Network G 2 The network G obtained after the second type of edge 3 Schematic diagram of

[0047] Figure 7 It is the data content of the railway system geographical layout extraction method extracted in one embodiment of the present invention. DETAILED DESCRIPTION

[0048] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0049] Example 1

[0050] The present invention provides a method for extracting the geographical layout of a transportation system. Figure 1 The figure is a flow chart of the steps of a method for extracting the geographical layout of a transportation system in one embodiment of the present invention, and the steps are described in detail below.

[0051] Step S1: Construct the initial network G 1 The nodes of the initial network are the stops of the transportation system. If there is at least one transportation route that stops at two stops consecutively, the two stops are connected by an edge in the initial network.

[0052] Specifically, the transportation system station data, transportation tool timetable data and transportation tool type data are collected, and the initial network is constructed based on the collected data. These data can be obtained from the Internet. For example, when the railway series is used as the research object, the above data can be obtained from the China Railway 12306 website. In actual operation, the data can be filtered according to actual needs. For example, only 13,160 trains starting with G, C, and D are studied, and the stations, train timetables and train type data of the 13,160 trains are collected.

[0053] The traffic system station data includes: station number, station name, station longitude, and station latitude;

[0054] The transportation timetable data includes: transportation number, transportation name, transportation stop site set, transportation departure time set at each stop site, and transportation arrival time set at each stop site;

[0055] Vehicle type data includes: vehicle number, vehicle name

[0056] like Figure 3 Shown is a data information table of the collected G81 train, which includes the train stop sites, train schedule and train type data of the G81 train.

[0057] Specifically, after collecting the above data, the space-of-stops method is used to construct the initial network. The space-of-stops method regards stations as network nodes. If there is at least one train that stops at two stations in succession on its route, then these two stations are connected by an edge in the network. Finally, the initial network G is obtained. 1 ,like Figure 4 The initial network G in one embodiment is shown 1 Schematic diagram of a train, where the edge set is the set of all railroad tracks E 1 , set E 1 Contains 1284 sites and 9538 edges.

[0058] Step S2: Remove redundant edges of the initial network to obtain the geographical layout of the transportation system.

[0059] Since the initial network G 1 It is constructed based on the operation data of transportation vehicles. Generally, there will be redundant sections. For example, there are four stations A, B, C, and D arranged in sequence on a track. A train runs on the track and stops at the four stations A, B, C, and D in sequence. Another train also runs on the track but only stops at the two stations A and D. Then, in the initial network, an edge will be formed between the two stations A and D, and this edge is actually a redundant section. The actual geographical layout is A→B→C→D, and there is no additional section A→D. The work done by the present invention is to remove the initial network G as much as possible. 1 redundant routes to obtain a transportation system geographical layout that is as close to the actual situation as possible.

[0060] Among them, the redundant edges of the initial network are removed, specifically including:

[0061] Step S21: Remove the initial network G 1 All the first-class edges in the network are obtained, and the optimized network G is obtained. 2 ;

[0062] The conditions satisfied by the first type of edge include:

[0063] Condition 1: The connectivity of the network does not change after the first type of edge is removed;

[0064] Condition 2: The sites at both ends of the first type of edge are not in a relative neighborhood relationship;

[0065] Condition three: there is at least one vehicle whose route stops at the two end stations of the first type of edge and several intermediate stations between the two end stations, and the travel time of this vehicle between the two end stations of the first type of edge does not exceed the time threshold, and the time threshold is less than or equal to γ ​​times the theoretical travel time of this vehicle along the first type of edge, where γ is the ratio of the fastest speed to the slowest speed of all vehicles passing through the first type of edge.

[0066] For condition 1, the first type of edge does not change the connectivity of the network after it is removed, which means that even if this edge is deleted, there will still be a path connecting the sites at both ends of this edge. For example, site n i and site n j There is an edge e between ij If you delete e ij After that, site n i and site n j If it is no longer connected, it means that e has been deleted. ij After changing the network connectivity, if you delete e ij After that, site n i and site n j If there are other connected paths between them, it means that edge e is deleted. ij The connectivity of the network is not changed. Edges that change the connectivity of the network are necessary layout sections that need to be retained and cannot be deleted.

[0067] For condition 2, the sites at both ends of the first type of edge are not in a relative neighborhood relationship. If two circles with two sites as the center and the distance between the two sites as the radius do not contain any other sites in their intersection area, then the two sites are in a relative neighborhood relationship. i and site n j Is it a relative neighborhood relationship? Then determine whether the site n i As the center of the circle, with station n i and site n j The distance between the circle with radius n j As the center of the circle, with station n i and site n j Is there any other site in the intersection area of ​​the circle with the radius of the distance between them? If there is other site in the intersection area, then site n i and site n j It is not a relative neighborhood relationship. If there is no other site in the intersection area, then site n i and site n j In the present invention, by judging the relative neighborhood relationship, it is ensured that there are other sites in the vicinity of the deleted edge.

[0068] In one embodiment, an N*N dimensional relative neighborhood matrix can be created, where N is the number of sites. The element in the i-th row and j-th column in the matrix indicates whether the i-th site and the j-th site are in a relative neighborhood relationship. For example, "1" is used to indicate that the two sites are in a relative neighborhood relationship, and "0" is used to indicate that the two sites are not in a relative neighborhood relationship. The relative neighborhood matrix can be used to intuitively determine which sites are in a relative neighborhood relationship.

[0069] For condition three, there is at least one vehicle whose route stops at the two end stations of the first type of edge and several intermediate stations between the two end stations, and the travel time of this vehicle between the two end stations of the first type of edge does not exceed the time threshold, and the time threshold is less than or equal to γ ​​times the theoretical travel time of this vehicle along the first type of edge, where γ is the ratio of the fastest speed to the slowest speed of all vehicles passing through the first type of edge. In other words, if there are other alternative paths between the two stations and their time consumption is also within a reasonable range, then this edge can be considered redundant. Taking the train as an example, the edge e ij The two end sites are site n i and site n j , if there is a train running on a route with station n i →Other sites→Site n j , and this train is at station n i →Other sites→Site n j The travel time does not exceed that of this train along the edge ij γ times the theoretical travel time, where the ij The theoretical travel time of edge e ij The length of the train divided by the design speed of the train, γ is the distance passing through the edge e ij The speed ratio of the fastest design speed train and the slowest design speed train among all trains. For example, taking China's high-speed rail as an example, assuming that the edge e ij The fastest train is designed to run at a speed of 250 km / h. ij The slowest train design running speed is 160 km / h. If the edge ij If the above conditions are met, it means that condition 3 is met. In the present invention, through condition 3, it is limited that there are other connected paths between the two end sites of the deleted edge, and the positions of other connected paths are relatively close to the deleted edge, which means that other connected paths and the edge are actually likely to share the same track, that is, the edge can be considered as a redundant edge and removed.

[0070] If the edge e ij If the above conditions 1, 2, and 3 are met at the same time, it means that edge e ij is the first type of edge, which is taken as a redundant edge from the initial network G 1It is deleted in the , thereby improving the accuracy of the transportation system geographical layout data.

[0071] Remove the initial network G 1 After all the first-class edges in the network are obtained, the optimized network G is obtained. 2 , the corresponding edge set is set E 2 ,like Figure 5 Shown is removal Figure 4 Initial network G 1 The network G obtained after the first type of edge 2 , which contains 1284 sites and 3056 edges. It can be seen that compared with the initial network G 1 , the number of edges is reduced from 9538 to 3056, removing a large number of redundant sections.

[0072] In one embodiment, if Figure 2 The flowchart of the method for extracting the geographical layout of a transportation system in another embodiment is shown. In order to further remove redundant edges and further improve the extraction accuracy, the network G can be 2 Further processing, that is, removing redundant edges of the initial network also includes:

[0073] Step S22: Remove network G 2 All the second-type edges in the network are obtained, and the optimized network G is obtained. 3 ;

[0074] The conditions satisfied by the second type of edges include:

[0075] Condition 4: After removing the second-type edge, all vehicles that stop at the two end stations of the second-type edge will not stop at any intermediate station on the new shortest path between the two end stations of the second-type edge;

[0076] Condition 5: After removing the second-type edges, the length of the new shortest path between the stations at both ends of the second-type edges does not exceed the length threshold, and the length threshold is less than or equal to the minimum value of the maximum operating distances of all vehicles passing through the new shortest path. The maximum operating distance is the product of the travel time of the vehicle between the stations at both ends of the new shortest path and the maximum speed of the corresponding vehicle.

[0077] For condition 4, after removing the second-class edge, all vehicles that stop at the two end stations of the second-class edge will not stop at any intermediate station on the new shortest path between the two end stations of the second-class edge. ij The two end sites are site n i and site n j , remove the edge e ij After that, site n i To site n j The shortest path to site n i→Intermediate site A→Intermediate site B→Site n j If the stop is n i and site n j All trains in the same station do not stop at the intermediate station A and the intermediate station B, which means that the edge e ij Condition 4 is met, as long as there is a train stop n i and site n j and also stops at intermediate station A or intermediate station B or station A and station B, then it means that edge e ij Condition 4 is not met.

[0078] For condition 5, after removing the second type of edge, the length of the new shortest path between the two end stations of the second type of edge does not exceed the length threshold, and the length threshold is less than or equal to the minimum value of the maximum running distance of all vehicles passing through the new shortest path. The maximum running distance is the product of the travel time of the vehicle between the two end stations of the new shortest path and the maximum speed of the corresponding vehicle. ij The two end sites are site n i and site n j , remove the edge e ij After that, site n i and site n j The new shortest path between sites is site n i →Intermediate site A→Intermediate site B→Site n j , get the consecutive stop sites n i and site n j For each train, calculate its maximum possible speed and its speed at station n. i and site n j The product of the travel time between stations can be selected as the minimum value of all products as the length threshold, where the maximum speed can be estimated based on the time of the train schedule and the straight-line distance between stations. If station n i →Intermediate site A→Intermediate site B→Site n j The path length does not exceed the length threshold, indicating that edge e ij Condition 5 is met, if site n i →Intermediate site A→Intermediate site B→Site n j The path length of edge e exceeds the length threshold, indicating that edge e ij Condition 5 is not met. The length of each edge is described by the straight-line distance between its two end stations.

[0079] If the edge e ij At the same time, the above conditions 4 and 5 are met. When these redundant edges are deleted, the number of vehicle stops will not increase, and the travel efficiency will be maintained. In addition, the deleted edges will not lead to excessively long detours, and the rationality of the travel will be maintained. This shows that the edge eij For the second type of edge, it can be used as a redundant edge from the network G 2 It is deleted in order to further improve the accuracy of the transportation system geographic layout data.

[0080] Remove the initial network G 2 After all the second-type edges in the network are obtained, the optimized network G is obtained. 3 , the corresponding edge set is set E 3 ,like Figure 6 Shown is removal Figure 5 China Network G 2 The network G obtained after the second type of edge 3 , which contains 1284 sites and 2780 edges. It can be seen that compared with network G 2 , the number of edges is reduced from 3056 to 2780, and redundant sections are removed again.

[0081] The optimized network is the extracted transportation system geographical layout, which can be expressed as G = (N, E), where N is the station of the extracted transportation system geographical layout, and E is the set of edges of the extracted transportation system geographical layout. After the transportation system geographical layout is extracted, the data content of the transportation system geographical layout can be obtained by combining the station, train schedule and train type data, such as Figure 7 Shown is the data content of the railway system geographical layout extraction method extracted in one embodiment.

[0082] Example 2

[0083] The present invention also relates to a transportation system geographic layout extraction system, which includes an initial network construction unit and an extraction unit, wherein:

[0084] Initial network construction unit, used to construct the initial network G 1 , the nodes of the initial network are the stops of the transportation system. If there is at least one transportation route that stops at two stops consecutively, the two stops are connected by an edge in the initial network;

[0085] The extraction unit is used to remove redundant edges of the initial network and obtain the geographical layout of the transportation system.

[0086] The extraction unit includes a first removal subunit, or includes both the first removal subunit and the second removal subunit.

[0087] The first removal subunit is used to remove the initial network G 1 All the first-class edges in the network are obtained, and the optimized network G is obtained. 2 ; The conditions satisfied by the first type of edge include:

[0088] Condition 1: The connectivity of the network does not change after the first type of edge is removed;

[0089] Condition 2: The sites at both ends of the first type of edge are not in a relative neighborhood relationship; if two circles with two sites as centers and the distance between the two sites as radii do not contain any other sites in their intersection area, then the two sites are in a relative neighborhood relationship;

[0090] Condition 3: There is at least one vehicle whose route stops at the two end stations of the first type edge and at several intermediate stations between the two end stations, and the travel time of this vehicle between the two end stations of the first type edge does not exceed the time threshold, which is less than or equal to γ ​​times the theoretical travel time of this vehicle along the first type edge, where γ is the ratio of the fastest speed to the slowest speed of all vehicles passing through the first type edge;

[0091] The second removal subunit is used to remove the network G 2 All the second-type edges in the network are obtained, and the optimized network G is obtained. 3 ; The conditions satisfied by the second type of edges include:

[0092] Condition 4: After removing the second-type edge, all vehicles that stop at the two end stations of the second-type edge will not stop at any intermediate station on the new shortest path between the two end stations of the second-type edge;

[0093] Condition 5: After removing the second-type edges, the length of the new shortest path between the stations at both ends of the second-type edges does not exceed the length threshold, and the length threshold is less than or equal to the minimum value of the maximum operating distances of all vehicles passing through the new shortest path. The maximum operating distance is the product of the travel time of the vehicle between the stations at both ends of the new shortest path and the maximum speed of the corresponding vehicle.

[0094] It can be understood that the above system can be used to execute the method introduced in Example 1. For specific details, please refer to the introduction of Example 1 and will not be repeated here.

[0095] Example 3

[0096] The present invention also relates to an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the above method when executing the computer program.

[0097] The electronic device may be a computing device such as a desktop computer, a notebook, a PDA, a cloud server, etc. The processor may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA), or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The memory may be used to store computer programs and / or modules, and the processor may perform various functions of the electronic device by running or executing computer programs and / or modules stored in the memory, and calling data stored in the memory.

[0098] Example 4

[0099] The present invention also relates to a computer-readable storage medium having a computer program stored thereon, and the computer program implements the steps of the above method when executed by a processor.

[0100] Specifically, the memory may include a high-speed random access memory, and may also include a non-volatile memory, such as a hard disk, an internal memory, a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card (Flash Card), at least one disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0101] Example 5

[0102] The embodiment of the present invention provides a computer program product or a computer program, which includes computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device performs the steps of the method of the above embodiment of the present invention.

[0103] The technical features of the above embodiments can be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification. It should be noted that "in one embodiment", "for example", "for example", etc. of the present invention are intended to illustrate the present invention, rather than to limit the present invention.

[0104] The above embodiments only express several implementation methods of the present invention, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the patent application. It should be pointed out that, for ordinary technicians in this field, several variations and improvements can be made without departing from the concept of the present invention, and these all belong to the protection scope of the present invention.

Claims

1. A method for extracting the geographical layout of a transportation system, characterized in that: include: Step S1: Construct the initial network G 1 , the nodes of the initial network are the stop sites of the transportation system. If there is at least one transportation route that stops at two stops consecutively, the two stops that stop consecutively are connected by an edge in the initial network; Step S2: removing redundant edges of the initial network to obtain a geographical layout of the transportation system; The removing redundant edges of the initial network includes: Step S21: Remove the initial network G 1 All the first-class edges in the network are obtained, and the optimized network G is obtained. 2 ; The conditions satisfied by the first type of edge include: Condition 1: The connectivity of the network does not change after the first type of edge is removed; Condition 2: The sites at both ends of the first type of edge are not in a relative neighborhood relationship; if two circles with two sites as centers and the distance between the two sites as radii do not contain any other sites in their intersection area, then the two sites are in a relative neighborhood relationship; Condition three: there is at least one vehicle whose route stops at the two end stations of the first type of edge and several intermediate stations between the two end stations, and the travel time of this vehicle between the two end stations of the first type of edge does not exceed a time threshold, and the time threshold is less than or equal to γ ​​times the theoretical travel time of this vehicle along the first type of edge, where γ is the ratio of the fastest speed to the slowest speed of all vehicles passing the first type of edge.

2. The method for extracting the geographical layout of a transportation system according to claim 1, characterized in that: The removing redundant edges of the initial network further includes: Step S22: Remove network G 2 All the second-type edges in the network are obtained, and the optimized network G is obtained. 3 ; The conditions satisfied by the second type of edges include: Condition 4: After removing the second type of edge, all vehicles that stop at the two end stations of the second type of edge continuously will not stop at any intermediate station on the new shortest path between the two end stations of the second type of edge; Condition 5: After removing the second-type edge, the length of the new shortest path between the stations at both ends of the second-type edge does not exceed a length threshold, and the length threshold is less than or equal to the minimum value of the maximum operating distances of all vehicles passing through the new shortest path, and the maximum operating distance is the product of the travel time of the vehicle between the stations at both ends of the new shortest path and the maximum speed of the corresponding vehicle.

3. The method for extracting the geographical layout of a transportation system according to claim 1, characterized in that: In step S1, the initial network is constructed, including: The transportation system station data, transportation tool schedule data and transportation tool type data are collected, and the initial network is constructed based on the collected data.

4. The method for extracting the geographical layout of a railway system according to claim 3, characterized in that: The traffic system station data includes: station number, station name, station longitude, and station latitude; The transportation timetable data includes: transportation number, transportation name, transportation stop site set, transportation departure time set at each stop site, and transportation arrival time set at each stop site; The vehicle type data includes: vehicle number and vehicle name.

5. The method for extracting the geographical layout of a transportation system according to claim 1, characterized in that: In step S21, before removing the first type of edges, an N*N dimensional relative neighborhood matrix is ​​constructed, where N is the number of sites, and the element in the i-th row and j-th column of the matrix indicates whether the i-th site and the j-th site are in a relative neighborhood relationship.

6. The method for extracting the geographical layout of a transportation system according to any one of claims 1 to 5, characterized in that: The transportation system is a railway system, and the transportation tool is a train.

7. A transportation system geographical layout extraction system, characterized in that: include: Initial network construction unit, used to construct the initial network G 1 , the nodes of the initial network are the stop sites of the transportation system. If there is at least one transportation route that stops at two stops consecutively, the two stops that stop consecutively are connected by an edge in the initial network; An extraction unit, used to remove redundant edges of the initial network to obtain a geographical layout of the transportation system; The extraction unit comprises a first removal subunit, or comprises both a first removal subunit and a second removal subunit; The first removal subunit is used to remove the initial network G 1 All the first-class edges in the network are obtained, and the optimized network G is obtained. 2 ; The conditions satisfied by the first type of edge include: Condition 1: The connectivity of the network does not change after the first type of edge is removed; Condition 2: The sites at both ends of the first type of edge are not in a relative neighborhood relationship; if two circles with two sites as centers and the distance between the two sites as radii do not contain any other sites in their intersection area, then the two sites are in a relative neighborhood relationship; Condition 3: There is at least one vehicle whose route stops at the two end stations of the first type of edge and several intermediate stations between the two end stations, and the travel time of this vehicle between the two end stations of the first type of edge does not exceed a time threshold, and the time threshold is less than or equal to γ ​​times the theoretical travel time of this vehicle along the first type of edge, where γ is the ratio of the fastest speed to the slowest speed of all vehicles passing through the first type of edge; The second removal subunit is used to remove the network G 2 All the second-type edges in the network are obtained, and the optimized network G is obtained. 3 ; The conditions satisfied by the second type of edges include: Condition 4: After removing the second type of edge, all vehicles that stop at the two end stations of the second type of edge continuously will not stop at any intermediate station on the new shortest path between the two end stations of the second type of edge; Condition 5: After removing the second-type edge, the length of the new shortest path between the stations at both ends of the second-type edge does not exceed a length threshold, and the length threshold is less than or equal to the minimum value of the maximum operating distances of all vehicles passing through the new shortest path, and the maximum operating distance is the product of the travel time of the vehicle between the stations at both ends of the new shortest path and the maximum speed of the corresponding vehicle.

8. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 7 are implemented.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

10. A computer program product comprising a computer program or instructions, characterized in that When the computer program or instruction is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

Images