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

Urban road network optimal restoration sequence scheme based on greedy algorithm

A road network and greedy algorithm technology, applied in the traffic control system, instrument, traffic control system of road vehicles, etc., can solve the problems of complex road network repair method model, difficult to solve, etc., to avoid calculation, easy to implement, and high efficiency Effect

Active Publication Date: 2016-02-03
BEIHANG UNIV
View PDF5 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] In view of the shortcomings that the existing research on the importance indicators of road sections is mostly proposed from the perspective of road network failure, as well as the problems that the model in the road network repair method is complex and difficult to solve

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
  • Urban road network optimal restoration sequence scheme based on greedy algorithm
  • Urban road network optimal restoration sequence scheme based on greedy algorithm
  • Urban road network optimal restoration sequence scheme based on greedy algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0051] Below in conjunction with specific embodiment, further illustrate the present invention, described method step is as follows:

[0052] 1. Know the road section set E to be repaired in the urban road network repair (hereinafter abbreviated as E r ), the set of normal road sections E normal (hereinafter abbreviated as E n ), E 0 It is the collection of all road sections of the road network, the OD matrix, capacity matrix and free flow time matrix of the road network. In this case, the user balance flow distribution is carried out on the road network, and the travel cost of the road network at this time is calculated

[0053] c 0 = Σ j ∈ E 0 t j x j

[0054] 2. In the current case, calculate E r The importance index of each link in the ...

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 discloses an urban road network optimal restoration sequence scheme based on a greedy algorithm. The method comprises the steps of: a, obtaining a set of roads to be restored in a known road network; b, defining importance discrimination indexes from the aspect of road network restoration; c, calculating importance discrimination indexes of each road in set of roads to be restored; d, utilizing a greedy selection idea to restore the most important road in the set of roads to be restored; e, repeating the steps c and d on residual roads to be restored until the set of roads to be restored is empty because after one road in the road network is restored, the state of the road network is changed, and importance discrimination indexes of the roads change too; and f, outputting a road restoration sequence, wherein the sequence is the optimal restoration sequence, and the obtained restoration sequence scheme is the optimal restoration sequence scheme of the road network. The applicability of the greedy algorithm to the road network optimal restoration sequence problem is theoretically proved, and by adopting the greedy algorithm, a large amount of tedious calculation is avoided, the efficiency is high, and the result has important guiding significance to urban road network optimal restoration in real life.

Description

technical field [0001] The invention relates to the field of traffic planning and management, in particular to a greedy algorithm-based optimal restoration sequence scheme for urban road networks. Background technique [0002] The core issue of road network restoration is: in the case of limited resources, which road or sections should be repaired first, so as to restore the road network to normal conditions as quickly as possible and improve the reliability of the road network during the restoration process. The existing road network repair methods are mainly to repair the key road sections in the network first. But how to define the key road section is not unified. Most of the previous studies used the theory of complex networks to study the key road sections of the road network. For example, some studies identified key road sections based on the degree and betweenness of road sections. These studies ignored the unique traffic characteristics of the road network itself. ...

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): G08G1/00
Inventor 鲁光泉熊莹王云鹏鹿应荣陈鹏丁川
Owner BEIHANG 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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com