Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Complex weighted traffic network key node identification method based on semi-local centrality

A technology of key nodes and recognition methods, applied in character and pattern recognition, computer components, instruments, etc., can solve complex problems such as Katz centrality, does not consider the traffic characteristics of the traffic network, and cannot be applied to large-scale traffic networks, etc. problem, to achieve the effect of short calculation time and high computational complexity

Pending Publication Date: 2019-08-16
JIANGSU OPEN UNIV
View PDF2 Cites 25 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

At present, the identification of key nodes in the transportation network mainly has the following problems: (1) The unique traffic characteristics of the transportation network are not considered, and the identified results are quite different from the actual ones; (2) The identification of key nodes is mainly concentrated in the unauthorized network. The weight plays an important role in the performance of the network. The weighted traffic network can more accurately describe the actual complex network, and can better reflect the role of nodes on the network; (3) Key node identification algorithms based on global centrality, such as node betweenness, Katz centrality and other complexities are high and cannot be applied to large-scale transportation networks

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Complex weighted traffic network key node identification method based on semi-local centrality
  • Complex weighted traffic network key node identification method based on semi-local centrality
  • Complex weighted traffic network key node identification method based on semi-local centrality

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0038] The present invention is described in further detail now in conjunction with accompanying drawing.

[0039] as attached figure 1 As shown, the present invention provides a method for identifying key nodes in a complex weighted traffic network based on semi-local centrality, comprising the following steps:

[0040] S1 Constructing a complex weighted traffic network: using the original method to construct a traffic network, using road section intersections as nodes and road sections as edges; generating a corresponding adjacency matrix; according to the road grade, a weighted adjacency matrix is ​​obtained from the adjacency matrix;

[0041] Specifically include:

[0042] Obtain the topological map of the traffic network, and use the original method to abstract the intersections of the road sections in the graph as nodes and the road sections as edges, and establish an L-space weighted network to preserve the layout characteristics of the traffic network and the spatial ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a complex weighted traffic network key node identification method based on semi-local centrality, comprising the following steps: S1, constructing a complex weighted traffic network: constructing a traffic network by adopting an original method, and taking road sections as nodes and road sections as edges; generating a corresponding adjacent matrix; according to the road grade, obtaining a weighted adjacency matrix through the adjacency matrix; S2, processing the weighted adjacency matrix, and analyzing network characteristics: calculating degree distribution of nodes, calculating an average clustering coefficient, and calculating an average path length; analyzing network characteristics according to the degree distribution of the nodes, the average clustering coefficient and the average path length; S3, identifying key nodes by adopting a semi-local centrality algorithm; and S4, sorting the key nodes of the traffic network: sorting the nodes in a descending order according to the importance degree to obtain the key nodes in the traffic network. The road grade is used as the weight, and the semi-local centrality algorithm is adopted, so that the problems thatthe key node identification calculation complexity of the existing traffic network is high and the traffic network characteristics are not considered are solved.

Description

technical field [0001] The invention belongs to the technical field of identification of key nodes of traffic networks, and in particular relates to a key node identification method of complex weighted traffic networks based on semi-local centrality. Background technique [0002] With the substantial increase in the number of vehicles, the urban traffic system is becoming larger and more complex, and urban traffic problems are becoming more and more serious. Studies have shown that the traffic network has small-world characteristics or scale-free characteristics, and the traffic network has the structure and function of a complex network. Using complex network theory to study urban transportation network is of great significance to improve its accessibility and operational efficiency. The determination of transportation hubs or key nodes in urban transportation network is one of the research topics on the complexity of urban transportation network. The position of the nodes...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F17/50G06K9/62G06Q10/04G06Q50/26
CPCG06Q10/047G06Q50/26G06F30/18G06F18/2321
Inventor 刘伟彦李欣刘涛刘斌勾荣
Owner JIANGSU OPEN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products