CN104217579B - Transportation network key road segment searching method based on section sub-network redundancy - Google Patents
Transportation network key road segment searching method based on section sub-network redundancy Download PDFInfo
- Publication number
- CN104217579B CN104217579B CN201310312172.8A CN201310312172A CN104217579B CN 104217579 B CN104217579 B CN 104217579B CN 201310312172 A CN201310312172 A CN 201310312172A CN 104217579 B CN104217579 B CN 104217579B
- Authority
- CN
- China
- Prior art keywords
- section
- network
- sub
- road segment
- key
- 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.)
- Expired - Fee Related
Links
Landscapes
- Traffic Control Systems (AREA)
Abstract
The present invention " transportation network key road segment searching method based on section sub-network redundancy ", chooses the section redundancy index index for selection as candidate key section of reflection section sub-network topological property.By constructing the sub-network in every oriented section, add up nodes and the Oriented Path from Its Maximal Subtrees hop count of sub-network simultaneously, calculate corresponding redundancy index.Choosing candidate key section in advance with the preferential selection principle in the less section of redundancy index, calculate every the candidate key section influence degree to transportation network, the section therefrom choosing influence degree maximum is key road segment.Make to search for transportation network key road segment and there is higher search accuracy rate and search efficiency and stronger operability, solve the more difficult problem determining candidate road section index for selection that search effect is good and workable.
Description
Technical field
The present invention relates to technical field of intelligent traffic, relate generally to transportation network key road segment identification and search aspect, more
Specifically, be a kind of meet certain search accuracy rate under the conditions of there is the key road segment searching method of higher searching efficiency.
Background technology
Transportation network is the important component part of City Traffic Transport System, is spatially connected in city, is city
The basis that the every function in city is run well.And the key road segment of transportation network refers to damage over a period to come, degradation
Or meeting of losing efficacy produces the section of great negative effect to whole transportation network.Accurately the key road segment of Fast Identification transportation network exists
Strategical planning aspect, tactical planning aspect and traffic operation and control plane are respectively provided with significance, the most quickly location
The fragile position of transportation network, takes traffic correcting measure pointedly, is favorably improved the capacity of resisting disturbance of network, has relatively
High ratio for input and output.
The more important in transportation network key road segment identification process is to search for the critical path of transportation network efficiently and accurately
Section, conventional key road segment searching method can be divided into force search method and candidate road section method two class.
Traditional force search method is key road segment searching algorithm more common in theoretical research, by disconnecting traffic successively
All sections of network calculate every the section influence degree to transportation network performance, can accurately search out the network of communication lines with this
The key road segment that network performance impact degree is maximum, is simplest searching method.The advantage of force search method is to compare friendship
The open network all sections influence degree to network performance, therefore can accurately search for the key road segment of network, search accuracy rate
It is 100%.But owing to needing every the section disconnecting network successively to carry out a traffic assignation, amount of calculation is relatively big, search efficiency
Relatively low, feasible poor in Large-scale Traffic Network is applied.Such as, for Chicago local traffic of 39018 section compositions
Network, carries out a traffic assignation about 0.5 hour (reaching 0.0001 precision)[1], force search method can be calculated at traffic assignation
Stage is the most more than 2 years.
Candidate road section method first chooses the section most possibly becoming key road segment as candidate road in advance according to certain rule
Section, disconnects candidate road section the most successively and obtains every the candidate road section influence degree to transportation network performance, with this from candidate road
The section to transportation network performance impact degree maximum is searched for as key road segment in Duan.General candidate road section number is much smaller than traffic
Total section number of network, therefore the traffic assignation execution number of times of candidate road section method is significantly less than force search method, and search efficiency is relatively
Height, applies more in actual Large-scale Traffic Network.It it is critical only that determine candidate road section chooses rule, can be OD pair
Between the composition section of water channel principium, or Stochastic Traffic Assignment has the section of higher select probability.
There is searching method[2]Have chosen 10 kinds of candidate road section index for selection based on section (such as V/C than), but result table
These indexs bright can not relatively accurately search for the key road segment of transportation network.Also there is searching method[3]Introduce a kind of based on
The candidate road section of influence area, section chooses rule, and its basic thought is to generate the fixed step size radius centered by certain section
Section sub-network, by the OD matrix of sub-network each road section traffic volume flow anti-hairclipper network, subnet before and after this section disconnects
The traffic assignation of network, after finally disconnecting using section, the increase degree of sub-network journey time is as the index for selection of candidate road section,
The section that preferentially index for selection value is big is as the candidate road section of key road segment.Result shows, under suitable Parameter Conditions, based on
The key road segment searching method of influence area, section has preferable search accuracy rate and searches element efficiency.But the choosing of this candidate road section
Follow the example of, need counter to push away OD matrix, it is clear that OD Backstepping choose the search accuracy rate to key road segment and search efficiency has weight
Affect, and operate complex.
To sum up, existing transportation network key road segment searching method is difficult to accomplish higher search accuracy rate and search simultaneously
Efficiency and stronger operability.
Reference material
[1]Dial R B.A path-based user-equilibrium traffic assignment
algorithm that obviates path storage and enumeration[J].Transportation
Research Part B:Methodological,2006,40(10):917-936.
[2]Knoop V L,Snelder M,Van Zuylen H J.Comparison of link-level
robustness indicators[C]//3rd International Symposium on Transportation
Network Reliability,Delft.2007.
[3]Chen B Y,Lam W H K,Sumalee A,et al.Vulnerability analysis for
large-scale and congested road networks with demand uncertainty[J]
.Transportation Research Part A:Policy and Practice,2012,46(3):501-516.
Summary of the invention
Present invention aim to address defect and deficiency that prior art exists, choose reflection section sub-network topological property
Section redundancy index as the index for selection in candidate key section, it is proposed that the network of communication lines based on section sub-network redundancy
Network key road segment searching method, has higher search accuracy rate and a search efficiency, and owing to being not related to the anti-complexity side such as push away of OD
Method is operable stronger.
The technical scheme that the present invention is given come for:
A kind of transportation network key road segment searching method based on section sub-network redundancy, it is characterised in that include as
Lower step:
(1), set up the topological model of transportation network by original method, construct the sub-network in every oriented section, add up simultaneously
The nodes of sub-network and Oriented Path from Its Maximal Subtrees hop count, calculate the redundancy index of respective stretch place sub-network；
(2) principle, with the sub-network little person of redundancy index in place, section in step (1) preferentially chosen, from transportation network
All sections in first choose several ways section as candidate key section；
(3), the damage in every candidate key section in calculation procedure (2) one by one, demote or the shadow to transportation network that lost efficacy
The degree of sound, chooses the influence degree bigger several ways section key road segment as transportation network.
In the present invention, step (1) sets up the topological model of transportation network by method original in Complex Networks Theory, is to intersect
Crossing and road are held to the greatest extent and are considered as node, and the section connecting two intersections is considered as limit, the most simplest to transportation network
Map, can directly reflect the connectedness of transportation network.Each internodal geometric distance of connection can be simply mapped into again
On two internodal limits, it is possible to use the metric system distance on geography, compare the cognitive custom meeting people, it is readily appreciated that and fortune
With.
In step (1), construct centered by oriented section<i, j>, step-length radius is the sub-network of ηStep-length half
Footpath η represents sub-networkIn the ultimate range in all nodes and section<i, j>.
In step (1), described sub-networkRedundancy indexCalculation beWherein,Represent sub-networkIn nodes,Represent sub-networkIn directed edge number or 2 times of nonoriented edge number, construct in sub-network and count simultaneously.
In the present invention, it is with section<i, j>that step (2) first chooses candidate key section from all sections of transportation network
Place sub-network redundancy indexLittle person is preferentially chosen for principle.Section redundancy indexThe least, then can replace
Changing path the fewest, section<i, j>lost efficacy to sub-networkInfluence degree the biggest, section<i, j>is more likely to become traffic
The key road segment of network, is the most preferentially chosen for candidate road section.
In step (2), candidate key section number affects the search efficiency of key road segment searching algorithm simultaneously and searches for accurately
Rate, candidate key section number is the biggest, and search accuracy rate is the highest, but search duration is the longest, and search efficiency is the lowest.
In the present invention, in step (3), the influence degree of transportation network can be damaged by section, demote by candidate key section
Or the measure of variation of network performance after losing efficacy, and network performance describes the possibility that transportation network can be used within given period
Property.Conventional transportation network performance indications can be divided into reliability index, vulnerability inder and risk indicator.Reliability index stresses
Transportation network meets the degree of reliability of pre-provisioning request, including connected sets index, Travel Time Reliability index and current energy
Power reliability index.Vulnerability inder includes vulnerability inder (characteristic path length, the cluster system only considering network topology structure
Number, degree distribution, efficiency and centrality index etc.) and with the vulnerability inder of network reachability tolerance (trip integrated cost,
Hansen entirety accessibility index and ARIA (Accessibility/Remoteness Index of Australia) index).
Wherein, more conventional be damage with section, demote or lost efficacy after the increment of comprehensive travel cost of transportation network as index.
In step (3), section damage, demote or lost efficacy after network performance recession level the biggest, represent that this section is to traffic
The influence degree of network is the biggest, and section is the most crucial.The transportation network key road segment that search obtains, affects journey according on transportation network
Spend big minispread, former the key road segments that required influence degree is maximum can be obtained, and can quantitatively export the critical path of needs
The key indices of section, the key road segment that Quantitative Comparison the obtains influence degree to transportation network.
With existing transportation network key road segment searching method still based on traditional force search method, and candidate road section method
Candidate key section choose rule and still have deficiency to compare in terms of search efficiency, search accuracy rate and ease-to-operate, this
The bright optimization that transportation network key road segment searching method has been carried out following several respects:
(1) choosing key road segment candidate road section in advance, search for the key road segment of transportation network from candidate road section, raising is searched
Rope efficiency；
(2) the section redundancy index of the sub-network constructed using section is as the index for selection of key road segment candidate road section,
Under rational Parameter Conditions, there is higher search standard and remove rate and search efficiency；
(3) constructing section sub-network relatively simple to calculate sub-network redundancy index method, operability is stronger.
Therefore, in the case of ensureing certain key road segment search accuracy rate, search efficiency can be effectively improved, and have relatively
Strong operability.
Accompanying drawing explanation
Fig. 1 is transportation network key road segment searching method flow chart based on section sub-network redundancy.
Fig. 2 is that the example calculating section sub-network redundancy index cores method implements basic logic figure.
Fig. 3 is in example centered by section<9,10>, and step-length radius η is the sub-network of 1
Fig. 4 is in example centered by section<9,10>, and step-length radius η is the sub-network of 2
Detailed description of the invention
Below in conjunction with accompanying drawing, technical solution of the present invention is described further.
The core concept of the present invention is, it is provided that a kind of transportation network key road segment based on section sub-network redundancy is searched
Suo Fangfa, by introducing section sub-network redundancy index as the index for selection in candidate key section, overcomes existing traffic
Network key section searching method search efficiency, search element accuracy rate and operability in terms of deficiency.
Fig. 1 show transportation network key road segment search routine based on section sub-network redundancy:
First, urban road traffic network includes through street (overhead), major trunk roads, subsidiary road and communicating branch road, but
The network of communication lines can be set up according to practical study demand selected part type road by the original method of Complex Networks Theory for simplifying network
Network topological model G=(V, E, Ω), wherein V represents the non-NULL set of node of transportation network, and E represents the directed edge collection of transportation network,
Ω represents the property set of transportation network.
The non-NULL set of node V={v of N number of element1, v2..., vNElement v in }iRepresent the numbering (1≤i of i-th node
≤N).With natural number 1...N to each node serial number, make vi=i, then set of node is represented by again V={1, and 2 ..., N}.With one
Dimension group R (i) represents the number of the node being connected with i ∈ V node, and (i j), represents and is connected with i-node two-dimensional array RV
The node number (the most from small to large arrangement) of jth (1≤j≤R (i)) node.Therefore the directed edge being connected with i-node
Available<i, RV (i, j)>∈ E or<(i, j), i>∈ E represents RV.In property set Ω, element is mainly road section length attribute L, section
Free flow speed Vfree, section actual capacity attribute Ca and link flow attribute F, i.e. Ω={ L, Vfree, Ca, F}.
Road section length attribute L is the base attribute of road, and available two-dimensional array L={l (i, j) } describe, represent from node i
To connected jth node (the Oriented Path from Its Maximal Subtrees segment length that the directed edge of node R V (i, j)) is corresponding, it may be assumed that
When there is directed edge<i, RV (i, j)>, (i, j) value is the physical length in corresponding oriented section to l, and unit is rice
(m)；When there is not this directed edge, represent with the most infinite.
Section free flow speed VfreeThe speed reflecting section limits, available two-dimensional array Vfree={ vfree(i, j) } retouch
State, represent that (car is freely flowed in the oriented section that the directed edge of RV (i, j)) is corresponding from node i to connected jth node
Speed, it may be assumed that
When there is directed edge<i, RV (i, j)>, vfree(i, j) value is the free flow speed in corresponding oriented section
FreeVelocity, unit is meter per second (m/s), can determine according to design speed；When there is not this directed edge, can zero table
Show.By road section length attribute L and free flow speed VfreeThe journey time under the freestream conditions of each section can be calculated.
Section actual capacity attribute Ca reflects category of roads to a certain extent, available two-dimensional array Ca={ca
(i, j) } describe, represent from node i to connected jth node (the oriented section that the directed edge of RV (i, j)) is corresponding
The traffic capacity, it may be assumed that
When there is directed edge<i, RV (i, j)>, (i, j) value is the actual capacity in corresponding oriented section to ca
Capacity, unit be standard car/time (PCU/h) or hour vehicle flowrate (veh/h), can be by inquiry or with reference to HCM
Specifications such as (Highway Capacity Manual) determines；When there is not this directed edge, can zero expression.
Link flow attribute F reflects the Path selection result of traveler, available two-dimensional array F={f (i, j) } describe,
Represent from node i to connected jth node (the oriented section arithmetic for real-time traffic flow that the directed edge of RV (i, j)) is corresponding
Amount, it may be assumed that
When there is directed edge<i, RV (i, j)>, f (i；J) value is real-time traffic amount Flow in corresponding oriented section, single
Position be standard car/time (PCU/h) or hour vehicle flowrate (veh/h)；When there is not this directed edge, can zero expression.
Then, for oriented section<i, j>the ∈ E of transportation network, wherein i, j represent start, end (i, the j in section respectively
∈ V), can from network G generate centered by section<i, j>, step-length radius be the sub-network of η, be designated asNote node k is Dist (k,<i, j>) with the distance in section<i, j>, then step-length η
Definition be:
The value of the step-length radius η of sub-network mainly affect key road segment searching algorithm search element accuracy rate, generally there are
One optimum.Can with η=3～5 as test value, specifically should be according to network size and topological structure depending on, but unsuitable excessive and
Make sub-network scale close to the scale of whole transportation network.
Represent sub-networkIn the ultimate range in all nodes and section<i, j>.Remember that node i, the distance of j are | | i, j
| |, representing and connect node i, the minimum nonoriented edge number of j, then node with the definition of distance Dist (k,<i, j>) in section is:
Dist (k,<i, j>)=Min (| | k, i | |, | | k, j | |) (6)
As in figure 2 it is shown, constructing sub-network centered by section<i, j>Meanwhile, counting sub-networkIn
NodesWith directed edge numberCalculate corresponding redundancy indexCore methed, be embodied as
Mode is as follows:
Input:
Transportation network topological model G=(V, E, Ω)
Step-length radius η
Section<i, j>∈ E
Output:
Redundancy index
1. initialize:
The distance of all nodes of transportation network and section<i, j>is set
Dist (i,<i, j>)=0 and Dist (j,<i, j>)=0 is set；
Point set I=(i, j} are played in research section；
Sub-network node counter N is setsub=0 and Oriented Path from Its Maximal Subtrees segment counter Msub=0.
2. construct sub-network and add up sub-network nodes and Oriented Path from Its Maximal Subtrees hop count simultaneously:
Point set I chooses node k so that Dist (k,<i, j>)=Min Dist (a,<i, j>), a ∈ I from, until rising
Point set I is empty；
Point set I removes from node k；
Statistics sub-network nodes, arranges node counter Nsub=Nsub+1；
Research road segment end collection J={a} (a ∈ V), wherein a is to meet<a, k>∈ E or all joints of<k, a>∈ E
Point；
For each node l in terminal collection J, if meet following two formulas (7) (8) simultaneously, then Dist (l, < i, j are set
>)=Dist (k,<i, j>)+1, and added node l to point set I.If there is section<k, l>∈ E, meet following formula simultaneously
(9), then statistics sub-network Oriented Path from Its Maximal Subtrees hop count, arranges oriented section enumerator Msub=Msub+1；
Dist (k,<i, j>)+1≤η (7)
Dist (l,<i, j>)>=Dist (k,<i, j>)+1 (8)
Dist (l,<i, j>)≤η (9)
3. calculating sub-network redundancy index:
Calculate centered by section<i, j>, step-length radius is the sub-network of ηRedundancy index be
Fig. 3 and Fig. 4 is respectively centered by section<9,10>, and step-length radius η is respectively the sub-network of 1,2WithCalculate corresponding redundancy index to be respectively With
Secondly, for all sections<i, j>the ∈ E of transportation network G, the redundancy that all can be calculated respective subnet network refers to
NumberThe least, then alternative paths is the fewest, and section<i, j>lost efficacy to sub-networkAffect journey
Spending the biggest, section<i, j>is more likely to become the key road segment of transportation network, should preferentially be chosen for candidate key section, thus may be used
To obtain λ bar candidate key section.
Obviously, number λ is the biggest in candidate key section, and search accuracy rate is the highest, but search duration is the longest, and search efficiency is the lowest.
Candidate key section number can tentatively be chosen for 2～5 times of critical path hop count to be identified, specifically should estimate according to network size test
Obtain, but typically no more than the half of whole transportation network section number.
Finally, calculate the damage in every candidate key section one by one, demote or the influence degree to transportation network that lost efficacy, choosing
Take the influence degree bigger several ways section key road segment as transportation network.The influence degree of transportation network can be adopted by section
After the complete failure of section, the relative increment metric of transportation network comprehensive travel cost.
For transportation network G=(V, E, Ω) under normal condition, utilize the traffic assignation sides such as Stochastic User Equilibrium algorithm
The OD matrix of method distribution transportation network, can obtain the volume of traffic f on each section<i, j>∈ E0(i, j) with journey time c0(i,
j)；For transportation network G after candidate key section<a, b>complete failureab=(V, Eab, Ω), wherein Eab=E {<a, b>},
The same OD matrix distributing transportation network, correspondingly can obtain the volume of traffic f on each section<i, j>∈ Eab(i, j) and stroke
Time cab(i, j).The then candidate road section<a, b>the Intrusion Index CI to transportation networkabCalculating formula is:
CIabExponential quantity is the biggest, represents that section<a, b>is the biggest to the influence degree of transportation network G, the most crucial.
The key indices in each section is ranked up from big to small, it may be assumed that
In formula, NeRepresent the section number of transportation network G=(V, E, Ω).Therefrom choose CIabSeveral that index is the biggest
Section is as the key road segment of transportation network.
Claims (3)
1. a transportation network key road segment searching method based on section sub-network redundancy, it is characterised in that include as follows
Step:
(1), set up the topological model of transportation network by original method, construct the sub-network in every oriented section, add up subnet simultaneously
The nodes of network and Oriented Path from Its Maximal Subtrees hop count, calculate the redundancy index of respective stretch place sub-network；
(2) principle, with the sub-network little person of redundancy index in place, section in step (1) preferentially chosen, from the institute of transportation network
Have in section and first choose several ways section as candidate key section；
(3), the damage in every candidate key section in calculation procedure (2) one by one, demoting or losing efficacy affects journey to transportation network
Degree, chooses the influence degree bigger several ways section key road segment as transportation network.
2. the method for claim 1, it is characterised in that in step (1), structure is centered by oriented section<i, j>, wherein
I, j are node serial number；Step-length radius is the sub-network of ηStep-length radius η represents sub-networkIn all nodes with
The ultimate range in oriented section<i, j>.
3. the method for claim 1, it is characterised in that in step (1), described sub-networkRedundancy indexCalculation beWherein,Represent sub-networkIn nodes,
Represent sub-networkIn directed edge number or 2 times of nonoriented edge number, it is the most right to construct in sub-networkWith
Count.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310312172.8A CN104217579B (en) | 2013-07-23 | 2013-07-23 | Transportation network key road segment searching method based on section sub-network redundancy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310312172.8A CN104217579B (en) | 2013-07-23 | 2013-07-23 | Transportation network key road segment searching method based on section sub-network redundancy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104217579A CN104217579A (en) | 2014-12-17 |
| CN104217579B true CN104217579B (en) | 2016-08-24 |
Family
ID=52099014
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310312172.8A Expired - Fee Related CN104217579B (en) | 2013-07-23 | 2013-07-23 | Transportation network key road segment searching method based on section sub-network redundancy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104217579B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106652440B (en) * | 2015-10-30 | 2019-05-21 | 杭州海康威视数字技术股份有限公司 | A kind of determination method and device in the frequent activities region of vehicle |
| CN105548067B (en) * | 2015-12-16 | 2018-07-03 | 西南大学 | A kind of Wavelength selecting method using amoeba real-time performance minimum redundancy |
| CN106981194B (en) * | 2017-05-02 | 2019-06-07 | 北京大学 | A kind of recognition methods of highway network key road segment |
| CN109377048B (en) * | 2018-10-23 | 2020-06-12 | 北京航空航天大学 | Comprehensive transportation network hub node selection method |
| CN111028511B (en) * | 2019-12-25 | 2021-10-15 | 亚信科技（中国）有限公司 | Traffic jam early warning method and device |
| CN111862595B (en) * | 2020-06-08 | 2021-12-31 | 同济大学 | Speed prediction method, system, medium and device based on road network topological relation |
| CN112598896B (en) * | 2020-12-07 | 2021-11-12 | 吉林大学 | Industrial park logistics key road section identification method based on GPS data |
| CN114399124B (en) * | 2022-03-24 | 2022-06-17 | 腾讯科技（深圳）有限公司 | Path data processing method, path planning method, path data processing device, path planning device and computer equipment |
| CN115691126B (en) * | 2022-10-26 | 2023-08-22 | 长安大学 | Traffic network redundancy measurement method based on depth-first search algorithm |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0902406A2 (en) * | 1997-09-12 | 1999-03-17 | MANNESMANN Aktiengesellschaft | Method for transmitting traffic data and for analysing the road traffic network, traffic-evaluating central unit and terminal therefor |
| CN101488158A (en) * | 2009-02-13 | 2009-07-22 | 同济大学 | Road network modeling method based on road element |
| CN101650191A (en) * | 2009-09-11 | 2010-02-17 | 北京四维图新科技股份有限公司 | Abstract method and device of road network topology |
| CN102175256A (en) * | 2010-12-27 | 2011-09-07 | 浙江工业大学 | Path planning determining method based on cladogram topological road network construction |
| CN102194259A (en) * | 2010-03-16 | 2011-09-21 | 上海交技发展股份有限公司 | Method for computing toll by modeling networked tolling lane of highway based on graph theory |
| CN202584124U (en) * | 2011-12-23 | 2012-12-05 | 北京易华录信息技术股份有限公司 | Road data processing system based on dynamic segmentation technology |
| KR20130012608A (en) * | 2011-07-26 | 2013-02-05 | 한국철도기술연구원 | Transit network information management system and method using smart card data |
| CN103150680A (en) * | 2013-03-25 | 2013-06-12 | 东南大学 | Automatic layout method for urban development land with best road accessibility |
-
2013
- 2013-07-23 CN CN201310312172.8A patent/CN104217579B/en not_active Expired - Fee Related
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0902406A2 (en) * | 1997-09-12 | 1999-03-17 | MANNESMANN Aktiengesellschaft | Method for transmitting traffic data and for analysing the road traffic network, traffic-evaluating central unit and terminal therefor |
| CN101488158A (en) * | 2009-02-13 | 2009-07-22 | 同济大学 | Road network modeling method based on road element |
| CN101650191A (en) * | 2009-09-11 | 2010-02-17 | 北京四维图新科技股份有限公司 | Abstract method and device of road network topology |
| CN102194259A (en) * | 2010-03-16 | 2011-09-21 | 上海交技发展股份有限公司 | Method for computing toll by modeling networked tolling lane of highway based on graph theory |
| CN102175256A (en) * | 2010-12-27 | 2011-09-07 | 浙江工业大学 | Path planning determining method based on cladogram topological road network construction |
| KR20130012608A (en) * | 2011-07-26 | 2013-02-05 | 한국철도기술연구원 | Transit network information management system and method using smart card data |
| CN202584124U (en) * | 2011-12-23 | 2012-12-05 | 北京易华录信息技术股份有限公司 | Road data processing system based on dynamic segmentation technology |
| CN103150680A (en) * | 2013-03-25 | 2013-06-12 | 东南大学 | Automatic layout method for urban development land with best road accessibility |
Non-Patent Citations (1)
| Title |
|---|
| 基于减灾的城市交通系统规划射击与管理;云美萍 等;《城市交通》;20080930;第6卷(第5期);第5-10页：正文全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104217579A (en) | 2014-12-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104217579B (en) | Transportation network key road segment searching method based on section sub-network redundancy | |
| CN100491918C (en) | Two-step multi-path optimization method for central controlled vehicle information system | |
| CN103971184B (en) | Transmission line of electricity path generating method based on GIS Spatial GISs | |
| CN104318758B (en) | Based on multi-level multimodal Public transport network planning method | |
| CN102538806B (en) | A kind of paths planning method and relevant device | |
| CN105844362B (en) | Urban traffic comprehensive trip decision-making device | |
| CN101650191B (en) | Road network topology aggregation method and device | |
| CN101149268A (en) | Road topology data model for navigation and calculation method | |
| CN107123260A (en) | Method of traffic assignment based on traveler budget limit | |
| CN104391907B (en) | A kind of fast path method for searching of variable resolution degree | |
| CN106326637A (en) | Link predicting method based on local effective path degree | |
| CN105740964A (en) | Urban road network data organization and shortest path rapid calculation method | |
| CN105574541A (en) | Compactness sorting based network community discovery method | |
| CN109543882A (en) | It is a kind of to be averaged the density of public transport network calculation method of station spacing based on optimal public transport | |
| CN107730113A (en) | A kind of quantitative evaluation method of the urban road network planning based on function | |
| CN105160429B (en) | It is a kind of that there is the multi-mode Public Transport Transfer method for virtually changing to micro- hinge | |
| CN107092986A (en) | The bus passenger travel route choice method based on website and collinearly run | |
| CN106289287A (en) | A kind of vehicle-mounted end Multiobjective Shortest Path computational methods based on route selection experience | |
| CN104462714A (en) | Calculation method for optimizing municipal drainage network plane layout design | |
| CN116611586A (en) | Newly built road network flow prediction method and system based on double-layer heterogeneous network | |
| CN202650258U (en) | Traffic jam information issuing system | |
| CN107588779B (en) | Intelligent vehicle navigation method based on travel time between any two nodes | |
| CN102542617B (en) | Path identification station arranging method of complicated road net | |
| CN108053651A (en) | A kind of data safety management system of efficient administration | |
| CN103021165A (en) | Urban road traffic information board layout optimizing method considering road network topological attribute |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160824 Termination date: 20190723 |