CN101982735B - Method for calculating real-time dynamic travel time of key path - Google Patents
Method for calculating real-time dynamic travel time of key path Download PDFInfo
- Publication number
- CN101982735B CN101982735B CN2010102900976A CN201010290097A CN101982735B CN 101982735 B CN101982735 B CN 101982735B CN 2010102900976 A CN2010102900976 A CN 2010102900976A CN 201010290097 A CN201010290097 A CN 201010290097A CN 101982735 B CN101982735 B CN 101982735B
- Authority
- CN
- China
- Prior art keywords
- path
- key point
- road
- hourage
- bar
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Navigation (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention provides a method for calculating the real-time dynamic travel time of a key path. The method is characterized by comprising the following steps: 1) selecting key points; 2) determining key point pairs; 3) generating alternative paths, namely generating N-numbered paths to be used as the alternative paths which are formed by the key points obtained in the step 2 according to the path-connected principle and the path effectiveness principle; 4) selecting a key path; and 5) calculating the travel time of the key path, namely summarizing the travel times of the sections of the k-th calculation key path. The invention has the following advantage: the set of the selected directed path sections which load the important traffic flows of a city, are continuous and have end points, is used as the key path, more accurate travel time of the key path can be obtained through the dynamic calculation of the real-time key path, and the release of a small amount of high-quality resource information can be realized, thus the demands of most travelers on the individualized traffic information service can be satisfied.
Description
Technical field
The present invention relates to a kind of critical path Real-time and Dynamic Calculation Method hourage, be used for personalized traffic-information service, belong to the technical field of intelligent transportation Real-time Traffic Information service.
Background technology
Traffic-information service is the important component part of intelligent transportation system; It simultaneously also is the important content of urban information service; Under the environment particularly outstanding at the urban highway traffic demand contradictory, that traffic problems are serious and requirement improves to the traffic comfortableness, the Traffic Information service seems extremely important.Multiple mode, personalized Traffic Information service has very urgent growth requirement.
Be one of standard of weighing a Urban Transportation system effectiveness hourage, also is the important information ingredient of Real-time Traffic Information service.The complicacy of city road network, growing transport need, and large-scale, continuation high strength activity brought bigger challenge to urban transportation, also brought out the public simultaneously for the active demand that is the Real-time Traffic Information service of representative hourage.
At present; Domestic research and application in the traffic-information service field also is in the ground zero stage; Traffic Information Service Pattern and service content are all more single; The real-time traffic that normally on the map of website, dynamically shows main roads, and information hourage that traveler more is concerned about can not be obtained.Therefore to traveler the Real-time and Dynamic in path being provided is variation and the developing direction of personalized traffic-information service hourage.
Summary of the invention
The purpose of this invention is to provide a kind of method that can be provided the hourage of critical path to traveler.Wherein, so-called critical path is exactly to carry the set that the important traffic flow in city has the oriented highway section of end points continuously, and it is primarily aimed at the road train of thought born than large passenger flow as critical path.The terminus of critical path is generally important transport hub, hot spot region or point of interest, for example the critical path of the Xujiahui in Shanghai City to People's Square.
In order to achieve the above object, technical scheme of the present invention has provided a kind of critical path Real-time and Dynamic Calculation Method hourage, it is characterized in that step is:
Step 1, select key point: key point is meant in the city road network in the operating important node of urban transportation;
Step 2, confirm that key point is right: choose a pair of key point to the Origin And Destination as k bar actual critical path in the city road network, wherein, actual critical path is meant the in esse road train of thought of bearing than large passenger flow in the city road network;
Step 3, generation alternative path: be communicated with principle and route availability principle according to the path, generate the N paths of key point to forming described in the step 2, this N paths is as alternative path;
Step 4, select critical path: carry out analysis and evaluation in the face of the N bar alternative path that generates the step 3 from road link grade, highway section, path quantity, path length overall are tripartite; Pick out at least one path as k bar actual critical path, called after k bar calculates critical path;
Step 5, the hourage of calculating critical path: the k bar that adds up calculates the hourage in each highway section of critical path.
With respect to the whole road network in city, critical path is the crucial lifeblood of urban transportation, and the present invention is guided out passerby and rationally utilizes the main roads resource through the issue of critical path transport information, gives full play to the effect of main roads in urban transportation.Simultaneously, the issue of the transport information of critical path is a kind of issue of a small amount of high-quality resource information, not only can satisfy most users' demand, can also reach and utilize information resources to greatest extent, thereby provide degree of accuracy higher transport information.
Advantage of the present invention is: select and carry the set in oriented highway section that the important traffic flow in city has end points continuously as critical path; Dynamic calculation through critical path real-time hourage obtains more accurately critical path hourage; Realize the issue of a small amount of high-quality resource information, thereby satisfy the demand of most travelers personalized traffic-information service.
Description of drawings
Fig. 1 is the process flow diagram of critical path Real-time and Dynamic computing method hourage;
Fig. 2 selects the process flow diagram of step for key point;
Fig. 3 selects the process flow diagram of step for critical path;
Fig. 4 is the process flow diagram of critical path Real-time and Dynamic calculation procedure hourage.
Embodiment
Specify the present invention below in conjunction with embodiment.
Embodiment
As shown in Figure 1, the invention provides a kind of critical path Real-time and Dynamic Calculation Method hourage, step is:
Step 1, select key point: key point is meant in the city road network in the operating important node of urban transportation.Key point is the basis that critical path forms.City road network is carried out abstract, reject in the city road network, form an abstract road network of forming by key point of urban transportation at urban transportation unessential node in service.As shown in Figure 2, the selecting and be divided into following three steps of key point:
Step 1.1, select the one-level key point: the one-level key point refers to important transport hub, hot spot region and the great collecting and distributing centre in city.The one-level key point comprises like comprehensive transportation hubs such as airport, railway station point, and hot spot region such as square, shopping centre.The one-level key point has attracted important traffic passenger flow usually, and traffic loading is very big.
Step 1.2, select the secondary key point: the secondary key point is the key point of being derived by the one-level key point, is radiated the important traffic point that important arterial traffic (for example city expressway, city intersection, urban transportation corridor etc.) forms on every side by the one-level key point;
Step 1.3, select three grades of key points: three grades of key points are major trunk roads and the crossings of major trunk roads in the city road network.These important crossings are the arterial highway nodes that delivered a large amount of passenger flows.
Step 2, confirm that key point is right: choose a pair of key point to the Origin And Destination as k bar actual critical path in the city road network, wherein, actual critical path is meant the in esse road train of thought of bearing than large passenger flow in the city road network.
A pair of key point is right to being exactly the point that forms of actual critical path Origin And Destination.Confirming that key point is right is the prerequisite that generates a critical path.Choose can representative of consumer the key point of trip tendency right, i.e. the strong Origin And Destination of user's trip requirements.Key point to the principle of confirming can be:
(1) to form key point in twos right for the one-level key point;
(2) can derive the one-level key point of secondary key point and the secondary key point of deriving between to form key point right.
Step 3, generation alternative path: be communicated with principle and route availability principle according to the path, generate the N paths of key point to forming described in the step 2, this N paths is as alternative path;
The path connectivity principle: the most basic requirement of alternative path is that this path must be to be communicated with, and when alternative path generates, need consider the forbidden information and the one way information of road network.
The route availability principle: the path that promptly generates is made up of effective highway section.
This step can be divided into:
Step 3.1, obtain geographical location information respectively as the key point of the starting point of k bar actual critical path in the city road network and terminal point;
Step 3.2, geographical location information is combined with city road network Back ground Information, road network connectivity information, the forbidden information of road network, three grades of key point information, search out critical path starting point all communication paths to terminal;
Step 3.3, in all communication paths, pick out N bar active path as alternative path, every alternative path is made up of many highway sections, is every highway section numbering according to city road network highway section cryptoprinciple;
So-called active path is meant t (i)＜t (j) and s (i)＞s (j); I and j are respectively communication path and choose latter two key point earlier arbitrarily from starting point direction to terminal; T represented from the hourage of starting point to key point; S representes that from key point hourage to terminal promptly key point i is less than the hourage of key point j from starting point from the hourage of starting point, and key point i is greater than the hourage of key point j from terminal point from the hourage of terminal point;
Step 4, select critical path: carry out analysis and evaluation in the face of the N bar alternative path that generates the step 3 from road link grade, highway section, path quantity, path length overall are tripartite; Pick out at least one path as k bar actual critical path, called after k bar calculates critical path.This step is followed following three principles:
The advanced road principle: critical path is the crucial lifeblood of urban transportation, mainly with the high highway section of category of roads as first-selected object.The road link grade is exactly the scoring index of this principle.
The long highway section principle that occupies the majority: the surface road highway section of critical path is long as far as possible, and promptly the length in continuous stream highway section is long as far as possible, thereby reduces the number of times that the critical path traffic flow is interrupted.Also long as far as possible for its length of highway section, through street in addition, thus the influence of the turbulent region that the minimizing Ramp terminal forms.Highway section, path quantity is exactly the scoring index of this principle.
The succinct principle in path: critical path should keep succinctly avoid occurring the situation of detouring, so the length overall of critical path being short as far as possible.The path length overall is exactly the scoring index of this principle.
Above-mentioned three scoring indexs obtain the competition total points of alternative path through the weighted mean mode, and the total points of each alternative path is sorted to differing from by excellent, and the alternative path that ranks the first promptly is picked as critical path.If the total points of other alternative paths and primary total points are very approaching; The difference of calculating total points and first total points of the alternative path number percent of score value that holds pride of place; If within 5%, satisfy the outstanding condition of competition total points, these alternative paths also are picked as critical path.Therefore the right critical path of identical key point can be not unique, as shown in Figure 3, and its concrete steps are:
Step 4.1, calculate the road link grade of each bar alternative path, the road link grade of i bar alternative path
Step 4.2, calculate the highway section sum of each bar alternative path, the highway section sum Link_Num of i bar alternative path
Ri=COUNT (Link_ID), Link_ID are the numbering in every highway section, and COUNT is the counting computing;
Step 4.3, calculate the path length overall of each alternative path, the path length overall of i bar alternative path
Step 4.4, calculate the competition total points of each alternative path, the competition total points Route_Note of i bar alternative path
Ri=a * Route_Class
Ri+ b * Link_Num
Ri+ c * Route_length
Ri, wherein, a, b, c are respectively Route_Class
Ri, Link_Num
RiAnd Route_length
RiWeight;
Step 4.5, with N bar alternative path with the competition total points arrange from small to large; The alternative path that makes number one is as k bar actual critical path; Called after k bar calculates critical path; Also calculate the competition total points of other each bar alternative paths except that the alternative path that makes number one and the difference of the competition total points of the alternative path that makes number one; Calculate the number percent of this difference and the competition total points of the alternative path that makes number one, if this number percent in 5%, then this alternative path is chosen as critical path.
Step 5, the hourage of calculating critical path: the k bar that adds up calculates the hourage in each highway section of critical path.Get the hourage of the hourage of critical path through each highway section of critical path of adding up.The hourage in each highway section, every fixed time period upgraded once, 2-5 minute usually.Therefore also can realize that every fixed time period upgrades once, reaches the critical path real-time of hourage the hourage of critical path warp.
Real-time calculating hourage of critical path can be divided into static calculation and dynamic calculation.Static calculation be add up each highway section at one time the section highway section hourage.Dynamic calculation is the passage of time of advancing along with the path, the highway section hourage of time period under each highway section of dynamically adding up.The difference of dynamic calculation and static calculation is that each highway section affiliated time period of hourage is dynamic change, rather than adopts the section at the same time of static calculation, thereby the path that obtains is more accurate hourage.Time period refers to one day 24 hours each time cycles of dividing by the update cycle, and the time interval of time period equals the update cycle.
Further specify the present invention below in conjunction with concrete data:
The process flow diagram of a kind of critical path Real-time and Dynamic computing method hourage provided by the invention comprises following a few step:
The first step, key point are selected, and be as shown in Figure 2:
Step 1.1, one-level key point are selected:
The one-level key point refers to important transport hub, hot spot region and the great collecting and distributing centre in city, comprises like comprehensive transportation hubs such as airport, railway station point, and hot spot region such as square, shopping centre.The one-level key point has attracted important traffic passenger flow usually, and traffic loading is very big.The one-level key point is used KN I
1, KN I
2... KN I
NExpression.
Step 1.2, secondary key point are selected:
The secondary key point is the key point of being derived by the one-level key point, is radiated the important traffic point that important arterial traffic (for example city expressway, city intersection, urban transportation corridor etc.) forms on every side by the one-level key point.The secondary key point is used KNII
1, KNII
2... KNII
NExpression.
Step 1.3, three grades of key points are selected:
Three grades of key points are the important master/main road crossings (major trunk roads and major trunk roads) in the city road network, and these important crossings are the arterial highway nodes that delivered a large amount of passenger flows.Three grades of key points are used KNIII
1, KNIII
2... KNIII
NExpression.
Step 2, key point are to confirming:
(1) to form key point in twos right for the one-level key point, for example KN I
1With KN I
2The key point that forms is right;
(2) can derive the one-level key point of secondary key point and the secondary key point of deriving between to form key point right, KN I for example
1With KN II
1And KN I
1With KNII
2The key point that forms is right;
The generation of step 3, critical path alternative path:
Step 3.1, with key point to splitting, confirm the terminal point of the starting point and the critical path of critical path, obtain critical path terminus geographical location information;
Step 3.2, critical path terminus geographical location information combine with city road network Back ground Information, road network connectivity information, the forbidden information of road network, three grades of key point information, search out critical path starting point all communication paths to terminal;
Step 3.3, route availability are judged: so-called effectively highway section is meant t (i)＜t (j) and s (i)＞s (j).Be that key point i is less than the hourage of key point j from starting point from the hourage of starting point, and key point i was greater than the hourage of key point j from terminal point from the hourage of terminal point.
Step 3.4, output critical path alternative path, alternative path with R1, R2 ..., RN representes.Each alternative path comprises some highway sections of forming, and highway section numbering (Link_ID) is confirmed according to city road network highway section cryptoprinciple, represented with 5 figure places, from 00001～99999.
For example the key point in Shanghai, city splits into critical path starting point Xujiahui and critical path terminal point People's Square to Xujiahui-People's Square.Obtain critical path terminus geographical location information: Xujiahui location Hua Shanlu, Hongqiao road, Cao Xi North Road, the crossing of starting Jia Bang road, these 5 roads of Heng Shan road obtain the latitude and longitude coordinates of this point; People's Square can't accurately navigate to a point, obtains the latitude and longitude coordinates that People's Square should the zone.
According to three grades of key points in Shanghai City city road network Back ground Information, Shanghai road network connectivity information, the forbidden information of Shanghai road network and Shanghai City, search all communication paths from the Xujiahui to the People's Square.Communication path to search carries out validity judgement t (i)＜t (j) and s (i)＞s (j); Be that key point i is less than the hourage of key point j from starting point from the hourage of starting point, and key point i was greater than the hourage of key point j from terminal point from the hourage of terminal point.
Through above-mentioned steps, finally can obtain 5 alternative paths from the Xujiahui to People's Square:
R1: Jia Bang road → road → north and south, Xujiahui, Xujiahui → start is overhead → Wusheng road → People's Square, the highway section that comprises numbering Link_ID set is (91148,85156,85146,85124,85103; 88711,85058,88705,85020,87082,88734; 88737,86280,87458,87095,87012,64573; 85998,85997,85981,86362,85722);
R2: Xujiahui → Heng Shanlu → Bao Qinglu → Huai-Hai Zhong Lu → Huang Po South Road → People's Square, the highway section that comprises numbering Link_ID set is for (85167,56278,56046,56030,56013,55993,55956; 55937,55925,55910,55863,55849,55798,88760,87589; 87588,87587,87631,87633,87586,87585,87583; 87582,87581,87599,86843,86842,86840,86839);
R3: Xujiahui → Hua Shanlu → Nanjing West Road → People's Square, the highway section that comprises numbering Link_ID set is for (86250,90344,85074,86246,90258,85454,89978; 84840,86148,84834,84823,84745,84705,84588,90655; 86917,90002,55630,86928,55580,55543,55535; 55527,55518,55499,55485,55482,56376,89538);
R4: Xujiahui → Hua Shanlu → Jiang Sulu → Yan'an road is overhead → Tibet Zhong Lu → People's Square, and the highway section that comprises numbering Link ID set is (86250,90344,85074,86246; 90258,85454,89978,84841,84766; 64561,85395,64562,85392,85603; 86674,87475,87673,85849,87161);
R5: Xujiahui → start the Jia Bang road → Xujiahui road → creek road → Xi Zangnan of land man/middle road → People's Square, the highway section that comprises numbering Link ID set is for (91148,85156,85146,85124,85103,88711,85058; 88705,85020,87082,88734,88737,84965,86280,87458; 87095,87013,87010,86037,86480,85817,84830,84816; 84805,84778,84697,84670,84627,87188,91104,86927; 85798,84415,87185,84357,84329,84296,87161).
Step 4, critical path are selected, and be as shown in Figure 3:
Step 4.1, calculate the road link grade Route_Class of each alternative path
Ri
Link_length representes the road section length in each highway section, and Link_Class representes the highway section category of roads in each highway section.The through street category of roads is 1, and important corridor, city category of roads is 2, and city main trunk road category of roads is 3, and less important arterial highway, city category of roads is 4, and city branch road category of roads is 5.
Route_Class
RiNumerical value is more little to satisfy the critical path condition more.
Step 4.2, calculate the highway section sum Link_Num of each alternative path
Ri
Link_Num
Ri＝COUNT(Link_ID)
Link_Num
RiNumerical value is more little to satisfy the critical path condition more.
Step 4.3, calculate the path length overall Route_Length of each alternative path
Ri
Route_Length
RiNumerical value is more little to satisfy the critical path condition more.
Step 4.4, calculate the competition total points Route_Note of each alternative path
Ri
Route_Note
Ri＝a×Route_Class
Ri+b×Link_Num
Ri+c×Route_length
Ri
Wherein a, b, c are respectively Route_Class
Ri, Link_Num
RiAnd Route_Length
RiWeight, through the competition total points of each alternative path of calculated with weighted average method.
Because above-mentioned three scoring indexs all are to satisfy the critical path condition more more for a short time, so Route_Note
RiNumerical value also is the more little critical path condition that satisfies more.
Step 4.5, choose competition total points Route_Note
RiOutstanding alternative path is a critical path
Competition total points Route_Note
RiMore for a short time, satisfy the critical path condition more.With Route_Note
RiTo big ordering, the alternative path that ranks the first can be picked as critical path certainly by little.
The difference of calculating total points and first total points of the alternative path number percent of score value that holds pride of place; If within 5%; The total points that these alternative paths are described is very approaching with the total points that ranks the first, and meets the outstanding condition of competition total points, and these alternative paths also are picked as critical path.
By the critical path selected with KR1, KR2 ..., KRN representes.
For example 5 alternative paths of Xujiahui to People's Square are selected.
Table 1 to table 5 is respectively the road section information table in 5 highway sections that alternative path comprises, and comprises the product of highway section numbering, road section length (rice), highway section category of roads and this road section length and highway section category of roads.
Table 1: the road section information table in alternative path highway section that R1 comprises
| ?Link_ID | Link_Length(m) | Road_Name | Link_Class | Link_Length?×Link_Class |
| 91148 | 202.4 | Start the Jia Bang road | 2 | 404.8 |
| 85156 | 122.5 | Start the Jia Bang road | 2 | 245 |
| 85146 | 378.9 | Start the Jia Bang road | 2 | 757.8 |
| 85124 | 327.7 | Start the Jia Bang road | 2 | 655.4 |
| 85103 | 226.7 | Start the Jia Bang road | 2 | 453.4 |
| 88711 | 299.7 | Start the Jia Bang road | 2 | 599.4 |
| 85058 | 239.3 | Start the Jia Bang road | 2 | 478.6 |
| 88705 | 239.9 | Start the Jia Bang road | 2 | 479.8 |
| 85020 | 207.4 | Start the Jia Bang road | 2 | 414.8 |
| 87082 | 126.4 | Start the Jia Bang road | 2 | 252.8 |
| 88734 | 193.5 | Start the Jia Bang road | 2 | 387 |
| 88737 | 312.4 | Start the Jia Bang road | 2 | 624.8 |
| 86280 | 256.2 | The Xujiahui road | 2 | 512.4 |
| 87458 | 104.6 | The Xujiahui road | 2 | 209.2 |
| 87095 | 112.7 | The Xujiahui road | 2 | 225.4 |
| 87012 | 284.8 | The Xujiahui road | 2 | 569.6 |
| 64573 | 403.6 | The viaduct, north and south | 1 | 403.6 |
| 85998 | 829.2 | The viaduct, north and south | 1 | 829.2 |
| 85997 | 237.1 | The viaduct, north and south | 1 | 237.1 |
| 85981 | 864.9 | The viaduct, north and south | 1 | 864.9 |
| 86362 | 207.4 | Wei Hailu | 3 | 622.2 |
| 85722 | 224.5 | The Wusheng road | 3 | 673.5 |
Table 2: the road section information table in alternative path highway section that R2 comprises
| Link_ID | Link_Length(m) | Road_Name | Link_Class | ?Link_Length×Link_Class |
| 85167 | 515.2 | Heng Shanlu | 3 | 1545.6 |
| 56278 | 204.5 | Heng Shanlu | 3 | 613.5 |
| 56046 | 302.5 | Heng Shanlu | 3 | 907.5 |
| 56030 | 250.2 | Heng Shanlu | 3 | 750.6 |
| 56013 | 179.6 | Heng Shanlu | 3 | 538.8 |
| 55993 | 489.1 | Heng Shanlu | 3 | 1467.3 |
| 55956 | 212.3 | Heng Shanlu | 3 | 636.9 |
| 55937 | 107.5 | Heng Shanlu | 3 | 322.5 |
| 55925 | 125.2 | Bao Qinglu | 3 | 375.6 |
| 55910 | 214.2 | Bao Qinglu | 3 | 642.6 |
| 55863 | 116.4 | Huai-Hai Zhong Lu | 3 | 349.2 |
| 55849 | 552.4 | Huai-Hai Zhong Lu | 3 | 1657.2 |
| 55798 | 59.4 | Huai-Hai Zhong Lu | 3 | 178.2 |
| 88760 | 251.1 | Huai-Hai Zhong Lu | 3 | 753.3 |
| 87589 | 237.8 | Huai-Hai Zhong Lu | 3 | 713.4 |
| 87588 | 283.2 | Huai-Hai Zhong Lu | 3 | 849.6 |
| 87587 | 203.1 | Huai-Hai Zhong Lu | 3 | 609.3 |
| 87631 | 253 | Huai-Hai Zhong Lu | 3 | 759 |
| 87633 | 191.2 | Huai-Hai Zhong Lu | 3 | 573.6 |
| 87586 | 72.3 | Huai-Hai Zhong Lu | 3 | 216.9 |
| 87585 | 53.7 | Huai-Hai Zhong Lu | 3 | 161.1 |
| 87583 | 79.7 | Huai-Hai Zhong Lu | 3 | 239.1 |
| 87582 | 111.2 | Huai-Hai Zhong Lu | 3 | 333.6 |
| 87581 | 117.5 | Huai-Hai Zhong Lu | 3 | 352.5 |
| 87599 | 112.3 | The Huang Po South Road | 3 | 336.9 |
| 86843 | 81.1 | The Huang Po South Road | 3 | 243.3 |
| 86842 | 104.3 | The Huang Po South Road | 3 | 312.9 |
| 86840 | 86.9 | The Huang Po North Road | 3 | 260.7 |
| 86839 | 95.6 | The Huang Po North Road | 3 | 286.8 |
Table 3: the road section information table in alternative path highway section that R3 comprises
| Link_ID | Link_Length(m) | Road_Name | Link_Class | ?Link_Length×Link_Class |
| 86250 | 515.3 | Hua Shanlu | 2 | 1030.6 |
| 90344 | 165.2 | Hua Shanlu | 2 | 330.4 |
| 85074 | 309.9 | Hua Shanlu | 2 | 619.8 |
| 86246 | 329.2 | Hua Shanlu | 2 | 658.4 |
| 90258 | 335.5 | Hua Shanlu | 2 | 671 |
| 85454 | 78.9 | Hua Shanlu | 2 | 157.8 |
| 89978 | 307 | Hua Shanlu | 2 | 614 |
| 84840 | 82.1 | Hua Shanlu | 3 | 246.3 |
| 86148 | 140.1 | Hua Shanlu | 3 | 420.3 |
| 84834 | 83 | Hua Shanlu | 3 | 249 |
| 84823 | 265.2 | Hua Shanlu | 3 | 795.6 |
| 84745 | 105.3 | Hua Shanlu | 3 | 315.9 |
| 84705 | 619.4 | Hua Shanlu | 3 | 1858.2 |
| 84588 | 294.7 | Hua Shanlu | 3 | 884.1 |
| 90655 | 287.1 | Hua Shanlu | 3 | 861.3 |
| 86917 | 171.7 | Hua Shanlu | 3 | 515.1 |
| 90002 | 322.4 | The West Road, Nanjing | 3 | 967.2 |
| 55630 | 246.6 | The West Road, Nanjing | 3 | 739.8 |
| 86928 | 310.8 | The West Road, Nanjing | 3 | 932.4 |
| 55580 | 205.2 | The West Road, Nanjing | 3 | 615.6 |
| 55543 | 183.5 | The West Road, Nanjing | 3 | 550.5 |
| 55535 | 128.1 | The West Road, Nanjing | 3 | 384.3 |
| 55527 | 90.8 | The West Road, Nanjing | 3 | 272.4 |
| 55518 | 112.8 | The West Road, Nanjing | 3 | 338.4 |
| 55499 | 220 | The West Road, Nanjing | 3 | 660 |
| 55485 | 69 | The West Road, Nanjing | 3 | 207 |
| 55482 | 183.1 | The West Road, Nanjing | 3 | 549.3 |
| 56376 | 270 | The West Road, Nanjing | 3 | 810 |
| 89538 | 272.2 | The West Road, Nanjing | 3 | 816.6 |
Table 4: the road section information table in alternative path highway section that R4 comprises
| Link_ID | Link_Length(m) | Road_Name | Link_Class | Link_Length×Link_Class |
| 86250 | 515.3 | Hua Shanlu | 2 | 1030.6 |
| 90344 | 165.2 | Hua Shanlu | 2 | 330.4 |
| 85074 | 309.9 | Hua Shanlu | 2 | 619.8 |
| 86246 | 329.2 | Hua Shanlu | 2 | 658.4 |
| 90258 | 335.5 | Hua Shanlu | 2 | 671 |
| 85454 | 78.9 | Hua Shanlu | 2 | 157.8 |
| 89978 | 307 | Hua Shanlu | 2 | 614 |
| 84841 | 224.6 | Jiang Sulu | 2 | 449.2 |
| 84766 | 133 | Jiang Sulu | 2 | 266 |
| 64561 | 687.5 | The viaduct, Yan'an | 1 | 687.5 |
| 85395 | 698.4 | The viaduct, Yan'an | 1 | 698.4 |
| 64562 | 785.7 | The viaduct, Yan'an | 1 | 785.7 |
| 85392 | 517.6 | The viaduct, Yan'an | 1 | 517.6 |
| 85603 | 714.8 | The viaduct, Yan'an | 1 | 714.8 |
| 86674 | 379.2 | The viaduct, Yan'an | 1 | 379.2 |
| 87475 | 503.9 | The viaduct, Yan'an | 1 | 503.9 |
| 87673 | 215.3 | The viaduct, Yan'an | 1 | 215.3 |
| 85849 | 676.2 | The viaduct, Yan'an | 1 | 676.2 |
| 87161 | 212.7 | Tibet Zhong Lu | 3 | 638.1 |
Table 5: the road section information table in alternative path highway section that R5 comprises
| Link_ID | Link_Length(m) | Road_Name | Link_Class | ?Link_Length×Link_Class |
| 91148 | 202.4 | Start the Jia Bang road | 2 | 404.8 |
| 85156 | 122.5 | Start the Jia Bang road | 2 | 245 |
| 85146 | 378.9 | Start the Jia Bang road | 2 | 757.8 |
| 85124 | 327.7 | Start the Jia Bang road | 2 | 655.4 |
| 85103 | 226.7 | Start the Jia Bang road | 2 | 453.4 |
| 88711 | 299.7 | Start the Jia Bang road | 2 | 599.4 |
| 85058 | 239.3 | Start the Jia Bang road | 2 | 478.6 |
| 88705 | 239.9 | Start the Jia Bang road | 2 | 479.8 |
| 85020 | 207.4 | Start the Jia Bang road | 2 | 414.8 |
| 87082 | 126.4 | Start the Jia Bang road | 2 | 252.8 |
| 88734 | 193.5 | Start the Jia Bang road | 2 | 387 |
| 88737 | 258.3 | Start the Jia Bang road | 2 | 516.6 |
| 84965 | 54.1 | Start the Jia Bang road | 2 | 108.2 |
| 86280 | 256.2 | The Xujiahui road | 2 | 512.4 |
| 87458 | 104.6 | The Xujiahui road | 2 | 209.2 |
| 87095 | 112.7 | The Xujiahui road | 2 | 225.4 |
| 87013 | 514.9 | The Xujiahui road | 2 | 1029.8 |
| 87010 | 125.3 | The Xujiahui road | 2 | 250.6 |
| 86037 | 277.9 | The Xujiahui road | 2 | 555.8 |
| 86480 | 126.5 | The Xujiahui road | 2 | 253 |
| 85817 | 177.3 | The Xujiahui road | 2 | 354.6 |
| 84830 | 254 | Land man creek road | 2 | 508 |
| 84816 | 140.8 | Land man creek road | 2 | 281.6 |
| 84805 | 84.5 | The South Road, Tibet | 3 | 253.5 |
| 84778 | 222 | The South Road, Tibet | 3 | 666 |
| 84697 | 69.5 | The South Road, Tibet | 3 | 208.5 |
| 84670 | 111.7 | The South Road, Tibet | 3 | 335.1 |
| 84627 | 178.1 | The South Road, Tibet | 3 | 534.3 |
| 87188 | 176.2 | The South Road, Tibet | 3 | 528.6 |
| 91104 | 218.8 | The South Road, Tibet | 3 | 656.4 |
| 86927 | 170.2 | The South Road, Tibet | 3 | 510.6 |
| 85798 | 128.1 | The South Road, Tibet | 3 | 384.3 |
| 84415 | 146.4 | The South Road, Tibet | 3 | 439.2 |
| 87185 | 93.7 | The South Road, Tibet | 3 | 281.1 |
| 84357 | 112.2 | The South Road, Tibet | 3 | 336.6 |
| 84329 | 125.3 | The South Road, Tibet | 3 | 375.9 |
| 84296 | 127.6 | The South Road, Tibet | 3 | 382.8 |
| 87161 | 212.7 | Tibet Zhong Lu | 3 | 638.1 |
Road section information according to alternative path; Calculate road link grade, the highway section sum and path length overall of 5 alternative paths respectively; Competition total points through 5 alternative paths of weighted mean statistics; Then by sorting from small to large, the difference of calculating total points and first total points of the alternative path again number percent of score value that holds pride of place.Table 6 is alternative path R1 to R5 each item result of calculation.
Table 6: alternative path R1 to R5 each item result of calculation
Choosing difference number percent is critical path 5% with interior alternative path, and R4 and R1 satisfy the critical path condition respectively, simultaneously by total points rank order called after KR1 and KR2.
Therefore there are 2 from the Xujiahui to the critical path of People's Square, are respectively:
KR1: Xujiahui → Hua Shanlu → Jiang Sulu → Yan'an road is overhead → Tibet Zhong Lu → People's Square
KR2: Jia Bang road → road → north and south, Xujiahui, Xujiahui → start is overhead → Wusheng road → People's Square
Step 5, critical path Real-time and Dynamic are calculated hourage, and be as shown in Figure 4:
The input data of step 5.1, this step are that hourage (hourage in following some time each highway section of section) is estimated in real-time hourage of road section information, highway section (hourage in each highway section of current slot) and the highway section that critical path KRi comprises.KR_TT hourage of dynamic calculation critical path KRi
KRi, the highway section hourage of time period under each highway section of the critical path that dynamically adds up KRi.
Step 5.2, output critical path KRi Real-time and Dynamic KR_TT hourage
KRi, promptly export KR_TT hourage of the critical path KRi of current slot
KRi
For example calculate the hourage of Xujiahui to People's Square critical path KR1 in the 10:00 time period.Xujiahui to People's Square critical path KR1 comprises 19 highway sections, and the road section information in this path is as shown in table 5.These 19 highway sections are as shown in table 7 in the highway section hourage of 10:00 time period and the highway section hourage of following 8 time periods (upgraded once in per 2 minutes, a time period was 2 minutes) simultaneously:
Table 7: highway section hourage in each highway section of critical path R1 with estimate hourage
The hourage of dynamic calculation critical path KR1:
The 1st the highway section Link_ID=86250 in path selects hourage of 10:00 time period for use, needs 85 seconds through this highway section, and promptly 10:01:25 can get into the 2nd highway section Link_ID=90344.Because the update cycle is 2 minutes (120 seconds); Promptly a time period also is 2 minutes; 10:01:25 does not stride across a time period, still uses the hourage of 10:00 time period, and promptly Link_ID=90344 hourage of selecting for use is corresponding 50 seconds of 10:00 time period.Getting into the 3rd highway section Link_ID=85074 time is 10:02:15, at this moment crossed over entering 10:02 time period time period, so Link_ID=85074 selects 10:02 to divide 49 seconds hourages estimating for use.Getting into the 4th highway section Link_ID=86246 time is 10:03:04, still belongs to the 10:02 time period, selects for use 10:02 to divide 65 seconds hourages estimating.Getting into the 5th highway section Link_ID=90258 time is 10:04:09, has at this moment crossed over entering 10:04 time period time period, selects for use 10:04 to divide 55 seconds hourages estimating.And the like, calculate the affiliated time period of 14 highway sections of residue, choose corresponding hourage.Add up hourage that is critical path KR1 hourage (grey is put forward bright value in the table 7) of time period under these 19 highway sections:
KR_TT
KR1=85+50+49+65+55+8+52+54+47+177+100+80+40+48+25+48+13+53+3 5=1084 second
Therefore critical path KR1 is 1084 seconds in the hourage of 10:00 time period, promptly 18.1 minutes.
Claims (4)
1. critical path Real-time and Dynamic Calculation Method hourage is characterized in that step is:
Step 1, select key point: key point is meant in the city road network in the operating important node of urban transportation;
Step 2, confirm that key point is right: choose a pair of key point to the Origin And Destination as k bar actual critical path in the city road network, wherein, actual critical path is meant the in esse road train of thought of bearing than large passenger flow in the city road network;
Step 3, generation alternative path: be communicated with principle and route availability principle according to the path, generate the N paths of key point to forming described in the step 2, this N paths is as alternative path, and this step is divided into:
Step 3.1, obtain geographical location information respectively as the key point of the starting point of k bar actual critical path in the city road network and terminal point;
Step 3.2, geographical location information is combined with city road network Back ground Information, road network connectivity information, the forbidden information of road network, three grades of key point information, search out critical path starting point all communication paths to terminal;
Step 3.2, in all communication paths, pick out N bar active path as alternative path; Every alternative path is made up of many highway sections; According to city road network highway section cryptoprinciple is every highway section numbering, and so-called active path is meant t (i)＜t (j) and s (i)＞s (j), and i and j are respectively communication path and choose latter two key point earlier arbitrarily from starting point direction to terminal; T represented from the hourage of starting point to key point; S representes that from key point hourage to terminal promptly key point i is less than the hourage of key point j from starting point from the hourage of starting point, and key point i is greater than the hourage of key point j from terminal point from the hourage of terminal point;
Step 4, select critical path: carry out analysis and evaluation in the face of the N bar alternative path that generates the step 3 from road link grade, highway section, path quantity, path length overall are tripartite; Pick out at least one path as k bar actual critical path; Called after k bar calculates critical path, and this step is divided into:
Step 4.1, calculate the road link grade of each bar alternative path, the road link grade of i bar alternative path
Wherein, Link_length
jBe the road section length in j bar highway section in the i bar alternative path, Link_Class
jThe category of roads of representing this j bar highway section, through street category of roads are 1, and important corridor, city category of roads is 2; City main trunk road category of roads is 3; Less important arterial highway, city category of roads is 4, and city branch road category of roads is 5, and n representes the highway section sum of i bar alternative path;
Step 4.2, calculate the highway section sum of each bar alternative path, the highway section sum Link_Num of i bar alternative path
Ri=COUNT (Link_ID), Link_ID are the numbering in every highway section, and COUNT is the counting computing;
Step 4.3, calculate the path length overall of each alternative path, the path length overall of i bar alternative path
Step 4.4, calculate the competition total points of each alternative path, the competition total points Route_Note of i bar alternative path
Ri=a * Route_Class
Ri+ b * Link_Num
Ri+ c * Route_length
Ri, wherein, a, b, c are respectively Route_Class
Ri, Link_Num
RiAnd Route_length
RiWeight;
Step 4.5, N bar alternative path is arranged with the competition total points from small to large, the alternative path that makes number one is as k bar actual critical path, and called after k bar calculates critical path;
Step 5, the hourage of calculating critical path: the k bar that adds up calculates the hourage in each highway section of critical path.
2. a kind of critical path Real-time and Dynamic Calculation Method hourage as claimed in claim 1 is characterized in that said step 1 is divided into:
Step 1.1, select the one-level key point: the one-level key point refers to important transport hub, hot spot region and the great collecting and distributing centre in city;
Step 1.2, select the secondary key point: the secondary key point is the key point of being derived by the one-level key point, is radiated the important traffic point that important arterial traffic forms on every side by the one-level key point;
Step 1.3, select three grades of key points: three grades of key points are major trunk roads and the crossings of major trunk roads in the city road network.
3. a kind of critical path Real-time and Dynamic Calculation Method hourage as claimed in claim 1; It is characterized in that; In said step 4.5, calculate the competition total points of other each bar alternative paths except that the alternative path that makes number one and the difference of the competition total points of the alternative path that makes number one, calculate this difference and the number percent of the competition total points of the alternative path that makes number one; If this number percent is in 5%, then this alternative path is chosen as critical path.
4. a kind of critical path Real-time and Dynamic Calculation Method hourage as claimed in claim 1; It is characterized in that; In said step 5; Add up each highway section highway section hourage of section or the passage of time of advancing along with the path at one time, the highway section hourage of time period under each highway section of dynamically adding up.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102900976A CN101982735B (en) | 2010-09-25 | 2010-09-25 | Method for calculating real-time dynamic travel time of key path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102900976A CN101982735B (en) | 2010-09-25 | 2010-09-25 | Method for calculating real-time dynamic travel time of key path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101982735A CN101982735A (en) | 2011-03-02 |
| CN101982735B true CN101982735B (en) | 2012-07-04 |
Family
ID=43619637
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102900976A Active CN101982735B (en) | 2010-09-25 | 2010-09-25 | Method for calculating real-time dynamic travel time of key path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101982735B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102682076A (en) * | 2012-03-13 | 2012-09-19 | 百度在线网络技术（北京）有限公司 | Method and equipment for providing path information |
| CN102809384B (en) * | 2012-08-22 | 2015-11-11 | 北京世纪高通科技有限公司 | A kind of road chain extracting method and device |
| CN103900572A (en) * | 2012-12-25 | 2014-07-02 | 上海博泰悦臻电子设备制造有限公司 | Diversiform path navigation algorithm and device for short paths |
| CN104215254B (en) * | 2013-05-31 | 2017-08-04 | 国际商业机器公司 | The method and apparatus of path navigation |
| CN103323018B (en) * | 2013-06-21 | 2016-01-27 | 广州市香港科大***研究院 | Based on feature identification and the method for fast searching of the hotspot path of period |
| CN107782323B (en) * | 2017-10-12 | 2021-07-16 | 湖北工业大学 | High-grade navigation network generation method based on inter-city optimal path |
| CN107729478B (en) * | 2017-10-16 | 2021-03-02 | 天津微迪加科技有限公司 | Data analysis method and device |
| CN110968659B (en) * | 2019-12-05 | 2023-07-25 | 湖北工业大学 | High-level navigation road network redundancy removing method based on continuous road chain |
| CN112526988B (en) * | 2020-10-30 | 2022-04-22 | 西安交通大学 | Autonomous mobile robot and path navigation and path planning method and system thereof |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1550756A (en) * | 2003-04-11 | 2004-12-01 | ��ʽ�������λ��Ѷ�鱨 | Process time counting method for navigation equipment and traffic information displaying method |
| CN101149268A (en) * | 2007-10-30 | 2008-03-26 | 上海上大鼎正软件有限公司 | Road topology data model for navigation and calculation method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9448081B2 (en) * | 2008-06-24 | 2016-09-20 | Tomtom North America, Inc. | Methods and systems for dynamically adaptive road network hierarchy and routing |
-
2010
- 2010-09-25 CN CN2010102900976A patent/CN101982735B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1550756A (en) * | 2003-04-11 | 2004-12-01 | ��ʽ�������λ��Ѷ�鱨 | Process time counting method for navigation equipment and traffic information displaying method |
| CN101149268A (en) * | 2007-10-30 | 2008-03-26 | 上海上大鼎正软件有限公司 | Road topology data model for navigation and calculation method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101982735A (en) | 2011-03-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101982735B (en) | Method for calculating real-time dynamic travel time of key path | |
| Wang et al. | High-speed rail network development and winner and loser cities in megaregions: The case study of Yangtze River Delta, China | |
| Sun et al. | Air Transport versus High‐Speed Rail: An Overview and Research Agenda | |
| Ali et al. | Travel behavior analysis using smart card data | |
| Ton et al. | How do people cycle in amsterdam, netherlands?: Estimating cyclists’ route choice determinants with gps data from an urban area | |
| Krykewycz et al. | Defining a primary market and estimating demand for major bicycle-sharing program in Philadelphia, Pennsylvania | |
| Renne et al. | Transit commuting, the network accessibility effect, and the built environment in station areas across the United States | |
| Lowry et al. | Quantifying bicycle network connectivity | |
| CN102169524A (en) | Staged multi-path model algorithm of urban rail transit network passenger flow distribution | |
| CN104809112B (en) | A kind of city bus development level integrated evaluating method based on multi-source data | |
| CN103017780B (en) | The planing method of public bus network, system and device under mobile status | |
| CN104217129A (en) | Passenger flow estimation method for urban rail road network | |
| CN102700576B (en) | Urban Rail Transit passenger flow monitoring method | |
| CN107545320A (en) | A kind of urban track traffic passenger paths planning method and system based on graph theory | |
| Wu et al. | The impacts of the built environment on bicycle-metro transfer trips: A new method to delineate metro catchment area based on people's actual cycling space | |
| CN109686091A (en) | A kind of magnitude of traffic flow based on multisource data fusion fills up algorithm | |
| Gahlot et al. | User oriented planning of bus rapid transit corridor in GIS environment | |
| Turner et al. | Bicycle and pedestrian travel demand forecasting: Literature review | |
| Prabhakar et al. | Impacts of level of traffic stress on bikeshare ridership in the case of Capital Bikeshare in Montgomery County, Maryland | |
| Sisiopiku | Travel patterns and preferences of urban university students | |
| Casello et al. | An analysis of empirical evidence of cyclists’ route choice and their implications for planning | |
| Marshall et al. | Travel demand modeling for regional visioning and scenario analysis | |
| Sarkar et al. | Benchmarking of personal rapid transit system (dynamic model) | |
| Mendiate | A spatial application of an opportunity costing methodology for the assessment of the climate value of cycling | |
| Meloni et al. | Improving regional accessibility through planning a comprehensive cycle network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |