CN109214656A - A kind of node importance appraisal procedure for Urban Transit Network - Google Patents
A kind of node importance appraisal procedure for Urban Transit Network Download PDFInfo
- Publication number
- CN109214656A CN109214656A CN201810914329.7A CN201810914329A CN109214656A CN 109214656 A CN109214656 A CN 109214656A CN 201810914329 A CN201810914329 A CN 201810914329A CN 109214656 A CN109214656 A CN 109214656A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- follows
- appraisal procedure
- calculated
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
Abstract
The invention discloses a kind of node importance appraisal procedures for Urban Transit Network, comprising the following steps: calculates the right of all nodes；Deletion of node forms new network one by one, and calculates the right difference of new network and primitive network；The dynamic attribute of aggregators, obtains quantized result.The present invention is according to the dynamic attribute and static attribute of Node Contraction in Complex Networks, a kind of node importance appraisal procedure for Urban Transit Network is proposed on the basis of the node importance appraisal procedure based on knot removal, combine the dynamic attribute that node assigns node in the static attribute of network topology structure present position and mankind's activity, contacting between node and node is taken into account, the significance level that can reflect node changes with time situation, so that quantized result is more reasonable, and algorithm is simple, strong operability.
Description
Technical field
The present invention relates to a kind of for alleviating the method for urban road congestion, more particularly to one kind for Urban Transit Network
Node importance appraisal procedure.
Background technique
All the time, traffic difficulty is the livelihood issues of people's common concern.Quick economic growth promotes motor vehicles to increase
Long, the raising of living standards of the people brings the growth of private car quantity, however land resource is limited, the road for causing oneself to have
Supply falls short of demand with road needed for vehicle driving, brings a series of traffic jam, traffic pollution and the traffic such as conevying efficiency is low
Problem.At traffic reform and development initial stage, comprehensive urban road construction slightly delayed vehicle substantially, rapid growth and road construction it is slow
Contradiction.Transport development mid-term is arrived, people no longer meet the road construction that oneself has, and road surface transform, smooth traffic project become traffic
The target of planning management.
In face of the problem of the traffic congestion, trip hardly possible that become increasingly conspicuous, traditional technological means is difficult to grasp vehicle in high speed
Situation under operation, can not alleviate road crowded state.
The traffic system of a set of wisdom can not only reduce traffic accident rate, reduce energy consumption, reduce pollution,
It can also promote economic results in society, build harmonious social traffic environment.Traditional technology can not handle above ask perfectly
Topic solves traffic problem encountered by information-based, intelligent means how under the background that China pushes Internet of Things development
As the task of top priority.
The corresponding traffic flow data of intelligent transportation system is not only huge and includes static and multidate information.How by these
Magnanimity, complicated traffic flow data is converted to intelligible, useful knowledge, so that instructing communications policy just becomes current face
The important problem faced.For example, present traffic congestion and traffic overspeed problem is very serious.Traditional technology is difficult from a large amount of
Data in extract valuable, intelligible knowledge.
In nature or society, almost each system, always has one or more key element to occupy extremely important
Position, if removing them, this system will structure, stability even survive on be greatly affected.Therefore by complexity
The significance level of each node is different in the complex network that system abstracts, in various complex networks, with quantitatively
The method of analysis finds which node in ultra-large network is most important or some node is relative to other one or more sections
The significance level of point is a basic problem of complex network research.Generally speaking, assessment node importance is broadly divided at present
Three classes method is to refer to calibration method based on node center, be associated with based on the method for deleting actor with based on node respectively
Property refers to calibration method, lower mask body introduction.
Refer to calibration method based on node center, index is for some nodes in quantitative expression network than other nodes
Position more important or in more center, the index be used to determine in network individual present position and its influence in group or
Relationship between person's appeal.Such as degree, centrality etc. be think the centralization status of node in a network depend on and other
The proximity of node；Betweenness etc. is to think that the centralization status of node depends on node present position between other nodes pair
The influence of communicative.
Method based on deleting actor, index reflect the complete of certain function of system using the connectivity of network
Property, reflect the importance of network node to the influence degree of network connectivty by node metric.In general, it is saved in system
Other than the connectivity that will affect system, therefore also will affect the other some indexs of system can pass through calculating for the deletion of point
The performance change of these indexs carrys out the importance of node metric.Such as maximum component size, network efficiency, the spanning tree of network
Number etc..
Refer to calibration method based on node relevance, lay particular emphasis between node and be directly connected to state, passes through analysis network
Topological structure knows node role.In Undirected networks, node importance passes through destination node and other adjacent nodes
Connection number embody, i.e., in network the most node of connection number plays a key effect in a network, and in directed networks, more
Lay particular emphasis on the in-degree of node.Common methods degree of having index and subgraph index.
In complex network, the whole situation of network is changed with time change, such as public traffic network, in difference
In period, the busy extent of node is different, it is meant that the significance level of node is not unalterable, and above-mentioned
The dynamic change of node importance can not be presented in node importance evaluation index, cannot be in conjunction with the dynamic attribute completion pair of node
The dynamic evaluation of node importance.
Summary of the invention
The object of the invention is that providing a kind of node weight for Urban Transit Network to solve the above-mentioned problems
The property wanted appraisal procedure.
The present invention through the following technical solutions to achieve the above objectives:
A kind of node importance appraisal procedure for Urban Transit Network, comprising the following steps:
Step (1): calculating the right of all nodes, specifically includes the following steps:
Step (1.1): initialization adjacency matrix N and nodal community set V, when the nodal community set V includes:
Between before attribute matrix, angle value, adjacent angle value, right value, knot removal with the right difference after deletion, wherein time attribute matrix packet
Dynamic attribute containing node, i.e., bus is in the down time of node and the vehicle flowrate of node within the unit time；
Step (1.2): from certain node, successively traversing all nodes, calculates each node degree Di；
Step (1.3): the adjacent degree A of each node is calculated according to traversing result in step (1.2)i, adjacent degree AiDefinition such as
Under: for a node V in network Gi, all and V in GiThe summation of the degree of adjacent node is known as node ViAdjacent degree Ai；
Step (1.4): according to the node degree D of step (1.2)iWith the adjacent degree A of step (1.3)i, calculate the conjunction of each node
Spend Bi, right BiIt is defined as follows: for a node V in network Gi, neighbour's degree AiIt is known as saving with the sum of node itself angle value
Point ViRight Bi；
Step (1.5): according to the right B of step (1.4)i, the right S of network is calculated, the definition of the right S of network is such as
Under: the right B of all nodes in network GiThe sum of be the network right S；
Step (2): deletion of node forms new network one by one, and calculates the right difference of new network and primitive network, specifically
Steps are as follows:
Step (2.1): deletion of node Vi, repeat step (1.1) and arrive step (1.5), obtain the right value of each new network
Ri；
Step (2.2): the right difference H before calculate node is deleted and after deletingi, in this, as the static attribute of node,
The significance level of the more big then node of difference is higher；
Step (3): the dynamic attribute of aggregators obtains quantized result, the specific steps are as follows:
Step (3.1): a certain period T for needing to assess node importance of selection；
Step (3.2): dynamic attribute of each node in period T, i.e. down time of the bus in node are calculated
PiWith the vehicle flowrate F of nodei；
Step (3.3): according to the right difference H of step (2.2)i, by right difference HiAccording to ascending sort, numerical value is indexed
More big then node significance level is higher；
Step (3.4): according to step (3.2), by down time PiWith vehicle flowrate FiRespectively according to ascending sort, index number
It is higher to be worth more big then node significance level；
Step (3.5): according to step (3.3) and step (3.4), by the right difference H of each nodei, down time Pi、
Vehicle flowrate FiIndex numerical value be added and by output result constrain in [0,1], with guarantee output result validity, complete city
The node importance of public traffic network is assessed.
Specifically, in the step (1.3), the adjacent degree A of each node is calculatediFormula are as follows:
Wherein ΩiFor with node ViThe node set being connected；Here the meaning of j is identical as i, is all some node.
In the step (1.4), the right B of each node is calculatediFormula are as follows:
Bi=Di+Ai。
In the step (1.5), the formula of the right S of network is calculated are as follows:
Wherein n is the number of nodes in network.
In the step (2.2), right difference H is calculatediFormula are as follows:
Hi=S-Ri。
In the step (3.2), down time P is calculatediWith vehicle flowrate FiFormula are as follows:
Wherein pj、fjBus is in the down time of node and the vehicle flowrate of node respectively in the unit time.
In the step (3.5), by the right difference H of each nodei, down time Pi, vehicle flowrate FiIndex numerical value phase
Adduction constrains in result is exported [0,1], used formula are as follows:
Wherein n is the number of nodes in network, ReiFor final quantized result, the significance level of the more big then node of numerical value
It is higher.
The beneficial effects of the present invention are:
The present invention is important in the node based on knot removal according to the dynamic attribute and static attribute of Node Contraction in Complex Networks
A kind of node importance appraisal procedure for Urban Transit Network is proposed on the basis of property appraisal procedure, first according to node
The angle value of angle value and its adjacent node calculates the right of the right and network of the node, simultaneous by the exaggerating of angle value of node
Contacting between node and node is cared for；Then the index based on knot removal method in node importance evaluation index is utilized
Thought, node is deleted one by one, then calculates the right value of new network again, compares the variation for deleting front and back, and changing value is bigger
Mean that the significance level of node is higher；Finally calculate the dynamic attributes of certain time period interior nodes again, by right changing value and
Dynamic attribute sorts in the way of ascending order respectively, and by the index of the index value of the right difference of each node and dynamic attribute
Normalized is done in value addition, in this, as final node importance quantized result.The method of the present invention combines node in net
The static attribute of network topological structure present position and mankind's activity assign the dynamic attribute of node, have taken into account between node and node
Connection, the significance level that can reflect node changes with time situation, so that quantized result is more reasonable, and algorithm letter
It is single, strong operability.The present invention can be used for urban road congestion Study on Trend, resident trip situation analysis and macroscopical stream of people's trend
Prediction etc. dredges for the analysis city traffic congestion origin cause of formation, city layout, city road planning and real-time traffic and provides foundation.
Detailed description of the invention
Fig. 1 is first five node of the significance level ranking calculated using the conventional method based on deleting actor
Manage position view；
Fig. 2 is first five node geo-location schematic diagram of the significance level ranking calculated using the method for the present invention.
Specific embodiment
The present invention will be further explained below with reference to the attached drawings:
Node importance appraisal procedure of the present invention for Urban Transit Network, comprising the following steps:
Step (1): calculating the right of all nodes, specifically includes the following steps:
Step (1.1): initialization adjacency matrix N and nodal community set V, when the nodal community set V includes:
Between before attribute matrix, angle value, adjacent angle value, right value, knot removal with the right difference after deletion, wherein time attribute matrix packet
Dynamic attribute containing node, i.e., bus is in the down time of node and the vehicle flowrate of node within the unit time；
Step (1.2): from certain node, successively traversing all nodes, calculates each node degree Di；
Step (1.3): the adjacent degree A of each node is calculated according to traversing result in step (1.2)i, adjacent degree AiDefinition such as
Under: for a node V in network Gi, all and V in GiThe summation of the degree of adjacent node is known as node ViAdjacent degree Ai；
Specific formula is as follows:
Wherein ΩiFor with node ViThe node set being connected；
Step (1.4): according to the node degree D of step (1.2)iWith the adjacent degree A of step (1.3)i, calculate the conjunction of each node
Spend Bi, right BiIt is defined as follows: for a node V in network Gi, neighbour's degree AiIt is known as saving with the sum of node itself angle value
Point ViRight Bi；Specific formula is as follows:
Bi=Di+Ai；
Step (1.5): according to the right B of step (1.4)i, the right S of network is calculated, the definition of the right S of network is such as
Under: the right B of all nodes in network GiThe sum of be the network right S；Specific formula is as follows:
Wherein n is the number of nodes in network；
Step (2): deletion of node forms new network one by one, and calculates the right difference of new network and primitive network, specifically
Steps are as follows:
Step (2.1): deletion of node Vi, repeat step (1.1) and arrive step (1.5), obtain the right value of each new network
Ri；
Step (2.2): the right difference H before calculate node is deleted and after deletingi, in this, as the static attribute of node,
The significance level of the more big then node of difference is higher；Specific formula is as follows:
Wherein pj、fjBus is in the down time of node and the vehicle flowrate of node respectively in the unit time；
Step (3): the dynamic attribute of aggregators obtains quantized result, the specific steps are as follows:
Step (3.1): a certain period T for needing to assess node importance of selection；
Step (3.2): dynamic attribute of each node in period T, i.e. down time of the bus in node are calculated
PiWith the vehicle flowrate F of nodei；
Step (3.3): according to the right difference H of step (2.2)i, by right difference HiAccording to ascending sort, numerical value is indexed
More big then node significance level is higher；
Step (3.4): according to step (3.2), by down time PiWith vehicle flowrate FiRespectively according to ascending sort, index number
It is higher to be worth more big then node significance level；
Step (3.5): according to step (3.3) and step (3.4), by the right difference H of each nodei, down time Pi、
Vehicle flowrate FiIndex numerical value be added and by output result constrain in [0,1], with guarantee output result validity, complete city
The node importance of public traffic network assess specific formula is as follows:
Wherein n is the number of nodes in network, ReiFor final quantized result, the significance level of the more big then node of numerical value
It is higher.
It is compared with the traditional method to verify the present invention with greater advantages, below with the tradition based on deleting actor
Explanation is compared for first five node geo-location of the significance level ranking that method and the method for the present invention are calculated.
Parameter comparison involved by two kinds of algorithms is as shown in the table combined with Figure 1 and Figure 2:
By Fig. 1, Fig. 2 and upper table it is found that node B, D, E are detected by two kinds of algorithms, (note: number of nodes be 2124 and
And sequence is since 0 ing), although the DN result of node C, F, higher than node G, (DN result is right before and after knot removal to H
Difference), but the down time within this time and vehicle flowrate are but much smaller than node G, H.This also means that node G, H exist
The period is in a busy state, provides service for more people.In complex network, the significance level of node is depended not only upon
It is and closely related with mankind's activity in the location of network topology structure, and the method for the present invention combines the two aspects,
Therefore its acquired results reasonability is higher.In addition, the method for the present invention can dynamically assess the importance of node, this is tradition side
Advantage not available for method.
Above-described embodiment is presently preferred embodiments of the present invention, is not a limitation on the technical scheme of the present invention, as long as
Without the technical solution that creative work can be realized on the basis of the above embodiments, it is regarded as falling into the invention patent
Rights protection scope in.
Claims (7)
1. a kind of node importance appraisal procedure for Urban Transit Network, it is characterised in that: the following steps are included:
Step (1): calculating the right of all nodes, specifically includes the following steps:
Step (1.1): initialization adjacency matrix N and nodal community set V, the nodal community set V includes: time attribute
With the right difference after deletion before matrix, angle value, adjacent angle value, right value, knot removal, wherein time attribute matrix includes node
Dynamic attribute, i.e., bus is in the down time of node and the vehicle flowrate of node within the unit time；
Step (1.2): from certain node, successively traversing all nodes, calculates each node degree Di；
Step (1.3): the adjacent degree A of each node is calculated according to traversing result in step (1.2)i, adjacent degree AiIt is defined as follows: right
A node V in network Gi, all and V in GiThe summation of the degree of adjacent node is known as node ViAdjacent degree Ai；
Step (1.4): according to the node degree D of step (1.2)iWith the adjacent degree A of step (1.3)i, calculate the right B of each nodei,
Right BiIt is defined as follows: for a node V in network Gi, neighbour's degree AiIt is known as node V with the sum of node itself angle valuei
Right Bi；
Step (1.5): according to the right B of step (1.4)i, the right S of network is calculated, the right S of network is defined as follows: network
The right B of all nodes in GiThe sum of be the network right S；
Step (2): deletion of node forms new network one by one, and calculates the right difference of new network and primitive network, specific steps
It is as follows:
Step (2.1): deletion of node Vi, repeat step (1.1) and arrive step (1.5), obtain the right value R of each new networki；
Step (2.2): the right difference H before calculate node is deleted and after deletingi, in this, as the static attribute of node, difference is got over
It is big then the significance level of node is higher；
Step (3): the dynamic attribute of aggregators obtains quantized result, the specific steps are as follows:
Step (3.1): a certain period T for needing to assess node importance of selection；
Step (3.2): dynamic attribute of each node in period T, i.e. down time P of the bus in node are calculatediAnd section
The vehicle flowrate F of pointi；
Step (3.3): according to the right difference H of step (2.2)i, by right difference HiAccording to ascending sort, it is bigger to index numerical value
Then node significance level is higher；
Step (3.4): according to step (3.2), by down time PiWith vehicle flowrate FiRespectively according to ascending sort, indexes numerical value and get over
It is big then node significance level is higher；
Step (3.5): according to step (3.3) and step (3.4), by the right difference H of each nodei, down time Pi, wagon flow
Measure FiIndex numerical value be added and by output result constrain in [0,1], with guarantee output result validity, complete city bus
The node importance of network is assessed.
2. the node importance appraisal procedure according to claim 1 for Urban Transit Network, it is characterised in that: described
In step (1.3), the adjacent degree A of each node is calculatediFormula are as follows:
Wherein ΩiFor with node ViThe node set being connected.
3. the node importance appraisal procedure according to claim 1 for Urban Transit Network, it is characterised in that: described
In step (1.4), the right B of each node is calculatediFormula are as follows:
Bi=Di+Ai。
4. the node importance appraisal procedure according to claim 1 for Urban Transit Network, it is characterised in that: described
In step (1.5), the formula of the right S of network is calculated are as follows:
Wherein n is the number of nodes in network.
5. the node importance appraisal procedure according to claim 1 for Urban Transit Network, it is characterised in that: described
In step (2.2), right difference H is calculatediFormula are as follows:
Hi=S-Ri。
6. the node importance appraisal procedure according to claim 1 for Urban Transit Network, it is characterised in that: described
In step (3.2), down time P is calculatediWith vehicle flowrate FiFormula are as follows:
Wherein pj、fjBus is in the down time of node and the vehicle flowrate of node respectively in the unit time.
7. the node importance appraisal procedure according to claim 1 for Urban Transit Network, it is characterised in that: described
In step (3.5), by the right difference H of each nodei, down time Pi, vehicle flowrate FiIndex numerical value be added and will output knot
Fruit constrains in [0,1], used formula are as follows:
Wherein n is the number of nodes in network, ReiSignificance level for final quantized result, the more big then node of numerical value is higher.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810914329.7A CN109214656A (en) | 2018-08-10 | 2018-08-10 | A kind of node importance appraisal procedure for Urban Transit Network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810914329.7A CN109214656A (en) | 2018-08-10 | 2018-08-10 | A kind of node importance appraisal procedure for Urban Transit Network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109214656A true CN109214656A (en) | 2019-01-15 |
Family
ID=64987871
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810914329.7A Pending CN109214656A (en) | 2018-08-10 | 2018-08-10 | A kind of node importance appraisal procedure for Urban Transit Network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109214656A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109615275A (en) * | 2019-01-21 | 2019-04-12 | 国网福建省电力有限公司 | A kind of power telecom network equipment health degree integrated evaluating method |
| CN111478854A (en) * | 2020-04-01 | 2020-07-31 | 中国人民解放军国防科技大学 | Real-time network node importance ordering method based on flow data |
| CN111598427A (en) * | 2020-05-12 | 2020-08-28 | 东南大学 | Urban rail transit station importance evaluation method |
-
2018
- 2018-08-10 CN CN201810914329.7A patent/CN109214656A/en active Pending
Non-Patent Citations (2)
| Title |
|---|
| WENQI PEI 等: "BVis: urban traffic visual analysis based on bus sparse trajectories", 《JOURNAL OF VISUALIZATION》 * |
| 张玫: "节点重要性评估及其在城市公交网络中的应用", 《中国优秀博硕士学位论文全文数据库(硕士) 工程科技Ⅱ辑》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109615275A (en) * | 2019-01-21 | 2019-04-12 | 国网福建省电力有限公司 | A kind of power telecom network equipment health degree integrated evaluating method |
| CN111478854A (en) * | 2020-04-01 | 2020-07-31 | 中国人民解放军国防科技大学 | Real-time network node importance ordering method based on flow data |
| CN111478854B (en) * | 2020-04-01 | 2021-10-12 | 中国人民解放军国防科技大学 | Real-time network node importance ordering method based on flow data |
| CN111598427A (en) * | 2020-05-12 | 2020-08-28 | 东南大学 | Urban rail transit station importance evaluation method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109214656A (en) | A kind of node importance appraisal procedure for Urban Transit Network | |
| CN101650191B (en) | Road network topology aggregation method and device | |
| CN108718246B (en) | Resource scheduling method and system oriented to network function virtualization | |
| CN104202183B (en) | The method and apparatus that a kind of solution SDN stream ranks configuration conformance updates | |
| CN110648022A (en) | Community public transport network and departure frequency synchronous optimization method considering station full coverage for connecting subways | |
| CN106326637A (en) | Link predicting method based on local effective path degree | |
| CN110232819B (en) | Complex network-based urban key road excavation method | |
| CN109166311A (en) | A kind of region first aid monitoring method, system and device based on vehicle scheduling | |
| CN104915717A (en) | Data processing method, knowledge base reasoning method and related device | |
| CN113190939B (en) | Large sparse complex network topology analysis and simplification method based on polygon coefficient | |
| CN107092986A (en) | The bus passenger travel route choice method based on website and collinearly run | |
| CN107730113A (en) | A kind of quantitative evaluation method of the urban road network planning based on function | |
| CN106411904A (en) | Network risk control method based on microstate prediction | |
| CN106685745A (en) | Network topology construction method and device | |
| CN109327401A (en) | A kind of traffic scheduling method and system of SDN network | |
| CN106981194B (en) | A kind of recognition methods of highway network key road segment | |
| CN107316094A (en) | One kind commuting circuit method for digging and device | |
| CN110162716B (en) | Influence community searching method and system based on community retrieval | |
| CN104125146B (en) | A kind of method for processing business and device | |
| CN104283792B (en) | WInternet pipelined communication protocols routing algorithms based on content | |
| CN111623790B (en) | Rapid path planning method for dynamic urban traffic network | |
| CN116485203A (en) | Road reconstruction and expansion time decision method based on network theory | |
| CN105933091A (en) | Minimum weight triangulation method and device based on spatial network coding | |
| CN109889393A (en) | A kind of geographically distributed figure processing method and system | |
| Zhang et al. | Solving multi-class traffic assignment problem with genetic algorithm |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190115 |