CN109887280A - A kind of transportation network node criticality appraisal procedure - Google Patents
A kind of transportation network node criticality appraisal procedure Download PDFInfo
- Publication number
- CN109887280A CN109887280A CN201910153174.4A CN201910153174A CN109887280A CN 109887280 A CN109887280 A CN 109887280A CN 201910153174 A CN201910153174 A CN 201910153174A CN 109887280 A CN109887280 A CN 109887280A
- Authority
- CN
- China
- Prior art keywords
- section
- network
- traffic
- criticality
- node
- 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.)
- Granted
Links
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of transportation network node criticality appraisal procedures, are related to traffic programme and complex network field.Firstly, collecting the traffic network information within the scope of bridge or tunnel perimeter to be assessed, the traffic network including the bridge or tunnel to be assessed is built；According to nodes all in traffic network and section, the conspicuousness criticality and destructive criticality of bridge or tunnel nodes to be assessed are calculated.According to the conspicuousness criticality in bridge to be assessed or tunnel and destructive criticality, the criticality of bridge or tunnel to be assessed is calculated.The present invention is more comprehensive to the criticality assessment of bridge tunnel, accurately, is more in line with the actual conditions of traffic network.
Description
Technical field
The present invention relates to traffic programme and complex network field, especially a kind of transportation network node criticality assessment side
Method.
Background technique
Transportation network is the most important skeleton of integrated transport system and support, wherein important component part is traffic road
Net.Possess a traffic network structurally reasonable, capacity is sufficient, function is complete, is the necessary condition of sustainable development.Traffic road
The complication system that net is made of the road of different function, different brackets, different zones with certain density and form, Bridge
Tunnel is all very important infrastructure in road network, and criticality needs are assessed in entire road network.
The fundamental of traffic network includes section and node, wherein critical section is the bottle of the road network traffic capacity
Neck.The congestion in crucial bridge or tunnel will cause in coupled section traffic flow can not normal pass, in turn result in road
The congestion of section, and due to the cascading in section and node, entire road network large area failure or the whole network paralysis are ultimately caused,
And then road network is made to lose its normal communication function.By carrying out resource inclination and focused protection to these crucial bridge tunnels,
It can effectively ensure effective trip of the unimpeded and resident of entire traffic network, while can be prominent for traffic management department's reply
Traffic administration decision is done when hair event and natural calamity, and auxiliary direction and reference are provided.
The recognition methods in current main key node or section is divided into two classes: based on road network topology structure and based on road network
Discharge characteristic.Common evaluation index based on road network topology structure has Connected degree, shortest path and betweenness etc..These indexs can be from
The importance in section is embodied to a certain extent, but road network is only closed from the angle analysis of road network topology structure as transportation network
Key section has certain one-sidedness.Road network is the transportation network with specific function, the more bodies of the importance in section
Present network is on the satisfaction degree of transportation demand.Therefore in road network, the importance in section is not only by road network topology structure
It influences, also to be influenced by traffic flow in network.Single evaluation index be although able to reflect problem in some terms, still simultaneously
It is incomplete, it is difficult to embody the truth of entire transportation network.
Summary of the invention
In view of the above-mentioned problems, the present invention combines complicated Network Science and traffic science, integrated network structure and flow
The criticality in node or section is assessed, especially the criticality of bridge or tunnel is assessed, proposes a kind of network of communication lines
Network node criticality appraisal procedure.
Specific step is as follows:
Step 1: collecting the traffic network information within the scope of bridge or tunnel perimeter to be assessed；
Traffic network information includes the trip requirements and road network attribute information between each intersection；Road network attribute information packet
It includes: the section etc. that road section length, road section capacity and intersection are connected to；
Step 2: building the traffic network including the bridge or tunnel to be assessed using traffic network information；
Specific build process are as follows: the intersection of mainstream is set as node, the section of mainstream is set as even side, the length in section and sets
For weight.Intersection set is denoted as N, and section set is denoted as A.
Step 3: calculating the conspicuousness of bridge or tunnel nodes to be assessed according to nodes all in traffic network and section
Criticality.
Specific step is as follows:
N number of intersection node is numbered step 301 by number, to the link road between every two Adjacent Intersections
Section is marked；
Connection section between intersection i to intersection j is denoted as aij；
Step 302, the effective length for calculating each section in traffic network；
For section aijEffective length formula are as follows:
Wherein D (aij) indicate section aijDegree, lijIndicate section aijLength, β is adjustable parameter.
Step 303, statistics intersection i to intersection j between under parameter beta all shortest number of passes of effective length
Bridge to be assessed or tunnel are set as node k by step 304, and selection is through celebrating a festival between intersection i to intersection j
The shortest number of passes of all effective lengths of point k；
Indicate that effective shortest path passes through the item number of node k under parameter beta between intersection i to intersection j；
Step 305 utilizes ratioEffective betweenness of calculate node k；
Calculation formula are as follows:
Step 306, the effective betweenness for similarly calculating each node in traffic network, and select effective betweenness maximum value Bmax；
Step 307 utilizes effective betweenness maximum value BmaxCalculate the conspicuousness criticality of bridge or tunnel nodes k to be assessed.
Conspicuousness criticality calculation formula are as follows:
Step 4: calculating the destructiveness of bridge or tunnel nodes to be assessed according to nodes all in traffic network and section
Criticality.
Specific step is as follows:
Step 401, each initial parameter for establishing road traffic road network R (0)；
Parameter includes: section aijInitial flow be denoted as xij(0), it is generated by user equilibrium model；Section aijPassage
Ability is denoted as Uij, the initial flow for meeting all sides is respectively less than the traffic capacity.
Step 402, attack bridge to be assessed or tunnel nodes k update so that the connected relevant road segments of node k fail
Road traffic road network；
All flows in step 403, failure section are redistributed into the remaining all sections of new traffic network
On.
For the flow in road traffic road network, flow is carried out by the way of locally reassigning；
Part reassign strategy: by the flow in section of failing according to adjacent segments capacity it is proportional be assigned to it is adjacent thereto
Section on.
The flow not yet gone on a journey is redistributed in road traffic road network using user equilibrium model.
Step 404 is directed to time step t, successively judges whether the flow in each section after flow again meets xij(t)
> p*Uij, if so, entering step 405；Otherwise, 406 are entered step, the flow in the section is updated.
P is adjustable parameter, indicates section failure after certain link flow is more than p times of the traffic capacity；
Step 405, section failure are deleted, and road traffic road network, return step 403 are updated；
Step 406, when there is no section failure, record time step be t+1, obtain the damage capability G of node kk；
Wherein | A'| indicates the remaining section quantity in traffic network, | A | indicate the also total initial section number of traffic network
Amount.
Step 407, the damage capability for calculating each node in traffic network select damage capability maximum value Gmax；
Step 408 utilizes the destructive criticality of damage capability maximum value calculation bridge to be assessed or tunnel nodes k；
Step 5: being calculated to be evaluated according to the conspicuousness criticality of bridge to be assessed or tunnel nodes k and destructive criticality
Estimate the criticality in bridge or tunnel.
Calculation formula are as follows:λ is adjustable parameter.
Advantages of the present invention with have the active effect that
1), a kind of transportation network node criticality appraisal procedure, from complex network science angle, it is contemplated that the network of communication lines
Jam situation present in network proposes effective betweenness index in traffic network, is more in line with the actual conditions of traffic network.
2) a kind of, transportation network node criticality appraisal procedure, topological structure and the magnitude of traffic flow for comprehensively considering road network are special
Property, it is more comprehensive to the criticality assessment of bridge tunnel, accurately.
3) a kind of, transportation network node criticality appraisal procedure reassigns traffic policy and user equilibrium plan using part
It slightly combines, and locally reassigns strategy using according to the proportional reassignment mode of road section capacity, more fitting is practical
Traffic circulation.
4) a kind of, transportation network node criticality appraisal procedure, can take into account the structure and discharge characteristic of traffic network, be
Traffic administration person provides relatively reliable auxiliary information.
Detailed description of the invention
Fig. 1 is a kind of flow chart of transportation network node criticality appraisal procedure of the present invention；
Fig. 2 is the flow chart for the conspicuousness criticality that the present invention calculates bridge or tunnel nodes to be assessed；
Fig. 3 is the flow chart for the destructive criticality that the present invention calculates bridge or tunnel nodes to be assessed.
Specific embodiment
In order to enable the invention to be more clearly understood its technical principle, with reference to the accompanying drawing specifically, be set forth
The embodiment of the present invention.
The present invention is a kind of node based on traffic network structure and flow and the even criticality appraisal procedure on side, is related to
Data collection process module, road net model construct module, and conspicuousness criticality evaluation module and destructive criticality assess mould
Block；
Data collection process module obtains going out between each intersection in target road network by the means such as searching for and investigating
Row demand and road network attribute information；Road net model constructs module according to the road network information of collection, is to connect side with section, intersection is
Node constructs highway network；Bridge tunnel criticality evaluation module includes that conspicuousness criticality evaluation module and destructiveness are crucial
Spend evaluation module.Conspicuousness criticality evaluation module proposes that effective betweenness in traffic network refers to from road network topology structure
Mark；Destructive criticality evaluation module is found destructive from the magnitude of traffic flow in conjunction with the cascading failure process in traffic network
Strong section can more fully evaluate bridge tunnel finally by the conspicuousness for comprehensively considering section and destructive criticality
Criticality in road network.
As shown in Figure 2, the specific steps are as follows:
Step 1: collecting the traffic network information within the scope of bridge or tunnel perimeter to be assessed；
Pass through the trip requirements and road network attribute information between each intersection of data collection process module collection；Road network category
Property information includes: road section length, the section that road section capacity is connected to intersection, intersection information, link flow and
OD is to information etc..
Step 2: building the traffic network including the bridge or tunnel to be assessed using traffic network information；
Traffic network, specific build process are built using road net model building module are as follows: are set as saving by the intersection of mainstream
Point, the section of mainstream are set as even side, and the length in section is set as weight building highway network.Intersection set is denoted as N, section set
It is denoted as A.There is OD transportation demand between each intersection, it is zero that no, which is transportation demand,.
Step 3: calculating the conspicuousness of bridge or tunnel nodes to be assessed according to nodes all in traffic network and section
Criticality.
Calculating conspicuousness criticality using conspicuousness criticality evaluation module, specific step is as follows:
N number of intersection node is numbered step 301 by number, to the link road between every two Adjacent Intersections
Section is marked；
Connection section between intersection i to intersection j is denoted as aij；
Step 302, the effective length for calculating each section in traffic network；
For section aijEffective length formula are as follows:
Wherein D (aij) indicate section aijConnected degree；Determined by the angle value of the intersection at section both ends, it may be assumed that D
(aij)=Di+Dj；DiAnd DjIt is the angle value of the section both ends a node i and j.Node angle value is determined by the item number in the section that is connected with node
It is fixed.It is studied according to related scholar, node degree is as follows: with angle value corresponding to the item number of section
| Section item number | 2 | 3 | 4 | ≥5 |
| Node degree | 4 | 6 | 8 | 10 |
lijIndicate section aijLength, β is adjustable parameter.
Step 303, statistics intersection i to intersection j between under parameter beta all shortest number of passes of effective length
Bridge to be assessed or tunnel are set as node k by step 304, and selection is through celebrating a festival between intersection i to intersection j
The shortest number of passes of all effective lengths of point k；
Indicate that effective shortest path passes through the item number of node k under parameter beta between intersection i to intersection j；
Step 305 utilizes ratioEffective betweenness of calculate node k；
In Complex Networks Theory, betweenness is frequently used to the Assessment of Important index as side.The betweenness on side defines
All shortest paths pass through the ratio on the side in road network.In specific transportation network, it can be seen that the section unit is entire
Active force and influence power in Road Transportation network.
Although the betweenness of standard can embody significance level of the node (section) in road network to a certain extent, it is had ignored
There are jam situation in transportation network, user be may tend to around congested link, and therefore, the present invention proposes effective shortest path
Diameter, i.e. calculating i, when j node shortest path, each section of each path does not directly use length as index, but by road
The jam situation of section also allows for.The jam situation in section and the Connected degree in section have certain relationship, and section Connected degree is bigger
Section is more easy to happen congestion.SectionEffective length be defined as follows:
When β=0, effective length degenerates into path length, β=1 in the present invention.Node i, in parameter beta item between j
Under part, the effective length of a paths is the sum of the effective length in each section in the path.Correspondingly, effective betweenness of node kIt is defined as follows:
Effective biggish section of betweenness, section conspicuousness criticality in road network is bigger, provides to such section
Source inclination is most important for the operational efficiency for promoting entire road network.
Step 306, the effective betweenness for similarly calculating each node in traffic network, and select effective betweenness maximum value Bmax；
Step 307 utilizes effective betweenness maximum value BmaxCalculate the conspicuousness criticality of bridge or tunnel nodes k to be assessed.
Conspicuousness criticality calculation formula are as follows:
The conspicuousness criticality of node illustrates that the node is more important about close to 1.
Step 4: calculating the destructiveness of bridge or tunnel nodes to be assessed according to nodes all in traffic network and section
Criticality.
Cascading failure model in the road network that the present invention uses is as follows:
Step 401, each initial parameter for establishing road traffic road network R (0)；
Given Traffic Net model, and guarantee that all nodes (side) are normal when original state；
Parameter includes: section aijInitial flow be denoted as xij(0), it is generated by user equilibrium model；Section aijPassage
Ability is denoted as Uij, the initial flow for meeting all sides is respectively less than the traffic capacity, which is determined by road network.Initial flow
Amount is generated by user equilibrium model.
The parameter d of user equilibrium modelijIndicate the transportation demand of intersection i to intersection j, user equilibrium model is by institute
There is the transportation demand between intersection to be assigned in entire road network.
Step 402, attack bridge to be assessed or tunnel nodes k, so that the connected section node k and node k's is adjacent
Section is failed, and road traffic road network is updated；
Failure is deletion of node and section connected to it；
All flows in step 403, failure section are redistributed into the remaining all sections of new traffic network
On.
Trip requirements are divided into two parts: a part of traveler is learning road network corrupted information with regard to oneself before travel, can comment again
Estimate degeneration road network state, empirically or inquires the modes such as road network information to redefine trip route, trip mode, departure time
Equal traffic behaviors；And another part traveler is to learn road network by modes such as variable information board, Traffic Announcements on the way in trip
Information is destroyed, trip route conditionally can only be temporarily changed in road, other alternative paths is selected to continue to go on a journey nearby.
The deletion in road network section will lead to road network and change, for the flow in road network, using part
The mode of reassignment carries out flow, and the flow not yet gone on a journey is redistributed in road network using user equilibrium model.
OD transportation demand is proportionally divided into two parts in the present embodiment, has been handed over using the transportation demand of half
(initial flow adopts the demand between OD pairs of half, acquires by user equilibrium model) is transported in access net, the other half is examined
Consider the demand that do not go on a journey not yet.It is that part reassigns strategy and user equilibrium strategy respectively that corresponding flow, which redistributes strategy,.
Part reassign strategy: by the flow in section of failing according to adjacent segments capacity it is proportional be assigned to it is adjacent thereto
Section on.Failure section is denoted as section ajk, section ajkAdjacent segments set E={ amn| (m=j ∨ n=k) ∧ m ≠ n }.
It is as follows that part reassigns tactful formula:
Global traffic redistributes strategy using user equilibrium model.
User equilibrium model: the crowded influence to running time, the institute of traveler selection are considered in Traffic Net
There is trip route will be small than other nonoptional paths in total impedance (expense, time, distance and comfort level etc.).Work as city
When Traffic Net is in equilibrium state, the smaller path of total impedance again can not find in urban highway traffic road network
?.Just reach balance when traveler cannot be by changing the path between terminus to reduce path impedance, here it is " with per family
Weighing apparatus " (User Equilibriu, abbreviation UE).The mathematical formulae of user equilibrium is as follows:
Wherein Ca(x) impedance function on a of section, the highway network road provided in the present invention using Bureau of Public Roads are indicated
Section impedance function, i.e.,WhereinIt is link proportion of the section a in free flow, UaIndicate road
The traffic capacity of section a, α, η are model parameter, α=0.15, η=0.4；xaIndicate the flow on a of section,Indicate that starting point r is arrived
Flow on all paths between terminal s on kth paths；Indicate section a between starting point r to terminal s
On kth paths,Expression does not exist.
The present invention solves user equilibrium model using Frank-Wolfe algorithm.
Section failure judgement is carried out after step 404, flow, for time step t, is successively judged every after flow again
Whether the flow in a section meets xij(t) > p*Uij, if so, entering step 405；Otherwise, 406 are entered step, the road is updated
The flow of section.
P is adjustable cascading failure threshold values, indicates section failure after certain link flow is more than p times of the traffic capacity；
Its value is related with traffic administration and control greater than 1, p, and traffic administration and the better p value of control are bigger.
Flow causes link flow to change, if link flow is greater than p times of its traffic capacity, then it is assumed that the section
Failure.
Step 405, section failure are deleted, and road traffic road network, return step 403 are updated；
Step 406, when not having section failure, process restrains, and record time step is t+1, obtains the damage capability of node k
Gk；
Wherein | A'| indicates the effective section quantity of the residue in traffic network, | A | indicate traffic network before cascading failure
In initial section quantity.
Step 407, the damage capability for calculating each node in traffic network select damage capability maximum value Gmax；
Step 408 utilizes the destructive criticality of damage capability maximum value calculation bridge to be assessed or tunnel nodes k；
Step 5: being calculated to be evaluated according to the conspicuousness criticality of bridge to be assessed or tunnel nodes k and destructive criticality
Estimate the criticality K in bridge or tunnelk。
Calculation formula are as follows:λ is adjustable parameter.
Claims (5)
1. a kind of transportation network node criticality appraisal procedure, which is characterized in that specific step is as follows:
Step 1: collecting the traffic network information within the scope of bridge or tunnel perimeter to be assessed；
Step 2: building the traffic network including the bridge or tunnel to be assessed using traffic network information；
Step 3: the conspicuousness for calculating bridge or tunnel nodes to be assessed is crucial according to nodes all in traffic network and section
Degree；
Step 4: the destructiveness for calculating bridge or tunnel nodes to be assessed is crucial according to nodes all in traffic network and section
Degree；
Specific step is as follows:
Step 401, each initial parameter for establishing road traffic road network R (0)；
Parameter includes: section aijInitial flow be denoted as xij(0), it is generated by user equilibrium model；Section aijThe traffic capacity
It is denoted as Uij, the initial flow for meeting all sides is respectively less than the traffic capacity；
Step 402, attack bridge to be assessed or tunnel nodes k update road so that the connected relevant road segments of node k fail
Traffic network；
All flows in step 403, failure section are redistributed on the remaining all sections of new traffic network；
For the flow in road traffic road network, flow is carried out by the way of locally reassigning；
Step 404 is directed to time step t, successively judges whether the flow in each section after flow again meets xij(t) > p*
Uij, if so, entering step 405；Otherwise, 406 are entered step, the flow in the section is updated；
P is adjustable parameter, indicates section failure after certain link flow is more than p times of the traffic capacity；
Step 405, section failure are deleted, and road traffic road network, return step 403 are updated；
Step 406, when there is no section failure, record time step be t+1, obtain the damage capability G of node kk；
Wherein | A'| indicates the remaining section quantity in traffic network, | A | indicate the also total initial section quantity of traffic network；
Step 407, the damage capability for calculating each node in traffic network select damage capability maximum value Gmax；
Step 408 utilizes the destructive criticality of damage capability maximum value calculation bridge to be assessed or tunnel nodes k；
Step 5: calculating bridge to be assessed according to the conspicuousness criticality of bridge to be assessed or tunnel nodes k and destructive criticality
The criticality of beam or tunnel；
Calculation formula are as follows:λ is adjustable parameter.
2. a kind of transportation network node criticality appraisal procedure as described in claim 1, which is characterized in that described in step 1
Traffic network information include trip requirements and road network attribute information between each intersection；Road network attribute information includes: road
The section that segment length, road section capacity and intersection are connected to.
3. a kind of transportation network node criticality appraisal procedure as described in claim 1, which is characterized in that described in step 2
Traffic network specific build process are as follows: the intersection of mainstream is set as node, the section of mainstream is set as even side, the length in section
Degree is set as weight；Intersection set is denoted as N, and section set is denoted as A.
4. a kind of transportation network node criticality appraisal procedure as described in claim 1, which is characterized in that the step three
Specific step is as follows:
N number of intersection node is numbered step 301 by number, to the connection section between every two Adjacent Intersections into
Line flag；
Connection section between intersection i to intersection j is denoted as aij；
Step 302, the effective length for calculating each section in traffic network；
For section aijEffective length formula are as follows:
Wherein D (aij) indicate section aijDegree, lijIndicate section aijLength, β is adjustable parameter；
Step 303, statistics intersection i to intersection j between under parameter beta all shortest number of passes of effective length
Bridge to be assessed or tunnel are set as node k by step 304, and selection is by node k's between intersection i to intersection j
All shortest number of passes of effective length；
Indicate that effective shortest path passes through the item number of node k under parameter beta between intersection i to intersection j；
Step 305 utilizes ratioEffective betweenness of calculate node k；
Calculation formula are as follows:
Step 306, the effective betweenness for similarly calculating each node in traffic network, and select effective betweenness maximum value Bmax；
Step 307 utilizes effective betweenness maximum value BmaxCalculate the conspicuousness criticality of bridge or tunnel nodes k to be assessed；
Conspicuousness criticality calculation formula are as follows:
5. a kind of transportation network node criticality appraisal procedure as described in claim 1, which is characterized in that described in step 403
Part reassign strategy: the flow in section of failing proportional is assigned to section adjacent thereto according to the capacity of adjacent segments
On；
The flow not yet gone on a journey is redistributed in road traffic road network using user equilibrium model.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910153174.4A CN109887280B (en) | 2019-02-28 | 2019-02-28 | Traffic network node criticality assessment method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910153174.4A CN109887280B (en) | 2019-02-28 | 2019-02-28 | Traffic network node criticality assessment method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109887280A true CN109887280A (en) | 2019-06-14 |
| CN109887280B CN109887280B (en) | 2020-04-24 |
Family
ID=66930092
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910153174.4A Active CN109887280B (en) | 2019-02-28 | 2019-02-28 | Traffic network node criticality assessment method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109887280B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110752990A (en) * | 2019-10-24 | 2020-02-04 | 西安电子科技大学 | Time-varying network shortest routing method for guaranteeing elasticity |
| CN112102611A (en) * | 2020-08-03 | 2020-12-18 | 上海理工大学 | Urban road network key path identification method based on interruption probability influence model |
| CN116564086A (en) * | 2023-05-10 | 2023-08-08 | 北京交通大学 | Method for configuring pre-defense resources of road traffic network |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2002011099A1 (en) * | 2000-07-31 | 2002-02-07 | Siemens Aktiengesellschaft | Method and system for determining a connection current in a connection in a network |
| CN102270388A (en) * | 2011-06-03 | 2011-12-07 | 王正武 | Method for measuring and calculating importance of traffic network nodes with consideration of cascading failure |
| CN102592440A (en) * | 2012-02-14 | 2012-07-18 | 清华大学 | Diagnostic technique for road network key nodes |
| CN105023445A (en) * | 2014-07-04 | 2015-11-04 | 吴建平 | Regional traffic dynamic regulation-control method and system |
| CN105608896A (en) * | 2016-03-14 | 2016-05-25 | 西安电子科技大学 | Traffic bottleneck identification method in urban traffic network |
| CN106530687A (en) * | 2016-10-13 | 2017-03-22 | 北京交通大学 | Time-space-attribute-based method for measuring traffic network node importance degrees |
-
2019
- 2019-02-28 CN CN201910153174.4A patent/CN109887280B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2002011099A1 (en) * | 2000-07-31 | 2002-02-07 | Siemens Aktiengesellschaft | Method and system for determining a connection current in a connection in a network |
| CN102270388A (en) * | 2011-06-03 | 2011-12-07 | 王正武 | Method for measuring and calculating importance of traffic network nodes with consideration of cascading failure |
| CN102592440A (en) * | 2012-02-14 | 2012-07-18 | 清华大学 | Diagnostic technique for road network key nodes |
| CN105023445A (en) * | 2014-07-04 | 2015-11-04 | 吴建平 | Regional traffic dynamic regulation-control method and system |
| CN105608896A (en) * | 2016-03-14 | 2016-05-25 | 西安电子科技大学 | Traffic bottleneck identification method in urban traffic network |
| CN106530687A (en) * | 2016-10-13 | 2017-03-22 | 北京交通大学 | Time-space-attribute-based method for measuring traffic network node importance degrees |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110752990A (en) * | 2019-10-24 | 2020-02-04 | 西安电子科技大学 | Time-varying network shortest routing method for guaranteeing elasticity |
| CN110752990B (en) * | 2019-10-24 | 2021-01-05 | 西安电子科技大学 | Time-varying network shortest routing method for guaranteeing elasticity |
| CN112102611A (en) * | 2020-08-03 | 2020-12-18 | 上海理工大学 | Urban road network key path identification method based on interruption probability influence model |
| CN116564086A (en) * | 2023-05-10 | 2023-08-08 | 北京交通大学 | Method for configuring pre-defense resources of road traffic network |
| CN116564086B (en) * | 2023-05-10 | 2024-01-23 | 北京交通大学 | Method for configuring pre-defense resources of road traffic network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109887280B (en) | 2020-04-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Shanmukhappa et al. | Spatial analysis of bus transport networks using network theory | |
| Rui et al. | Optimum transit operations during the emergency evacuations | |
| D'este et al. | Network vulnerability: an approach to reliability analysis at the level of national strategic transport networks | |
| Bekhor et al. | Evaluation of choice set generation algorithms for route choice models | |
| Gao et al. | Dynamic robustness analysis of a two-layer rail transit network model | |
| Xu et al. | Scaling and correlations in three bus-transport networks of China | |
| Moreno et al. | A branch-and-benders-cut algorithm for the crew scheduling and routing problem in road restoration | |
| Shang et al. | Benchmark analysis for robustness of multi-scale urban road networks under global disruptions | |
| Li et al. | Resilience assessment and optimization for urban rail transit networks: A case study of beijing subway network | |
| Akbari et al. | Multi-vehicle prize collecting arc routing for connectivity problem | |
| Yang et al. | Measuring route diversity for urban rail transit networks: A case study of the Beijing metro network | |
| CN109887280A (en) | A kind of transportation network node criticality appraisal procedure | |
| Eklund et al. | A dynamic multi-source Dijkstra's algorithm for vehicle routing | |
| Ventura et al. | A continuous network location problem for a single refueling station on a tree | |
| Gao et al. | A resilience assessment framework for urban transportation systems | |
| Lertworawanich | Highway network restoration after the great flood in Thailand | |
| Panahi et al. | A GIS-based dynamic shortest path determination in emergency vehicles | |
| Jin et al. | Exploring the robustness of public transportation system on augmented network: A case from Nanjing China | |
| Lu et al. | Modeling cascading failures of urban rail transit network based on passenger spatiotemporal heterogeneity | |
| Kepaptsoglou et al. | Planning postdisaster operations in a highway network: Network design model with interdependencies | |
| Ismail et al. | Integration of geospatial multi-mode transportation Systems in Kuala Lumpur | |
| Ivanchev et al. | Spatial and temporal analysis of mismatch between planned road infrastructure and traffic demand in large cities | |
| Ivanchev et al. | On identifying dynamic intersections in large cities | |
| CN115691126B (en) | Traffic network redundancy measurement method based on depth-first search algorithm | |
| Jian et al. | Modeling and simulation of coordination relationship between rail and bus lines |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |