CN102592445A - Traffic network crowding solution method based on dynamic max-flow coordination control - Google Patents

Traffic network crowding solution method based on dynamic max-flow coordination control Download PDF

Info

Publication number
CN102592445A
CN102592445A CN2012100613853A CN201210061385A CN102592445A CN 102592445 A CN102592445 A CN 102592445A CN 2012100613853 A CN2012100613853 A CN 2012100613853A CN 201210061385 A CN201210061385 A CN 201210061385A CN 102592445 A CN102592445 A CN 102592445A
Authority
CN
China
Prior art keywords
vehicle
subscript
traffic
east
network
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
Application number
CN2012100613853A
Other languages
Chinese (zh)
Other versions
CN102592445B (en
Inventor
史忠科
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xian Feisida Automation Engineering Co Ltd
Original Assignee
Xian Feisida Automation Engineering Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xian Feisida Automation Engineering Co Ltd filed Critical Xian Feisida Automation Engineering Co Ltd
Priority to CN201210061385.3A priority Critical patent/CN102592445B/en
Publication of CN102592445A publication Critical patent/CN102592445A/en
Application granted granted Critical
Publication of CN102592445B publication Critical patent/CN102592445B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Traffic Control Systems (AREA)

Abstract

The invention provides a traffic network crowding solution method based on dynamic max-flow coordination control, aiming at overcoming the problems that the traditional traffic network has long coordination and optimization control period and becomes invalid frequently. According to the traffic network crowding solution method, a traffic network graph structure which marks the dynamic traffic capacity is obtained according to the queuing length and the current road section traffic flow status in each direction of a crossroad, the large-scale network optimization is converted into the coordination control problem of a network minimum cut set by determining a minimum cut set corresponding to the dynamic max-flow of the traffic network and intensively coordinating the neck of a local traffic network, and thus the coordination control capability of the overall traffic network is improved.

Description

A kind of transportation network of coordinating control based on dynamic max-flow solution of blocking up
Technical field
The present invention relates to the road traffic coordination control problem of blocking up, particularly a kind of transportation network of coordinating control based on dynamic max-flow solution of blocking up.
Background technology
Along with rapid economy development; The continuous increase of automobile pollution; Congested in traffic countries in the world Focal Point of Common Attention and the major issue of being badly in need of solving of having become; The congested in traffic while has also been caused the serious environmental pollution; In 9 kinds of main air pollutants; 6 kinds relevant with motor vehicle exhaust emission directly or indirectly, exceeds 5 ~ 6 times when automobile is discharged concentration of narmful substance than cruising under the traffic congestion state; In addition, congested in traffic and traffic hazard is the two large problems of urban transportation symbiosis.On the one hand, urban transportation intensive traffic flow of peak time makes traffic hazard take place frequently, and very easily causes serious traffic congestion; On the other hand, when traffic congestion took place, the vehicle driver lost patience because excessively wait for easily, makes the traffic hazard odds increase greatly; It is thus clear that the congested in traffic matter of the whole that influences the global urban sustainable development that become.
Because the seriousness of congested in traffic problem, existing both at home and abroad numerous scholars have carried out research, alleviate the coordination control strategy that congested in traffic groundwork concentrates on the normal property sent out and sporadic crowded control strategy, particularly city traffic network basically at present; Solving or alleviating the normal crowded countermeasure of property of sending out mainly is to enlarge to supply with and two aspects of controlling consumption, and these strategies are summarised as vehicle needs control, improve for how much and to management three aspects of transport need; Following several technology is taked in the control of vehicle needs: the control of track inlet control, the control of track main line, right-of-way, regional channel control and zone charge control; The urban highway traffic often another kind of method of the property sent out Congestion Control is to improve the traffic capacity of bottleneck road; Its basic solution is to repartition the track or the reconstruction through whole transversal section increases the track through the curb on road surface, or on original circuit additional branch line; The third method is the management to transport need, and this method can reduce the peak period transport need, and it is stressed to reduce vehicle and uses and encourage non-peak period use express lane.Used technology comprises car, park and shift and the service of improvement public transport etc. of share, as: effective utilization of the dispersion on transport need peak, automobile, the service of improvement public transport etc.; Control strategy to accidental sexual behavior part is mainly: 1) set up surveillance: in time find and identify the character of incident, confirm suitable action.Comprise artificial supervision, detector monitors, closed-circuit television and air surveillance etc.; 2) set up the Event Service system: during occurrence of traffic accident, emergency services (ambulance, obstacles removing car etc.) is provided in time; When vehicle breaks down, maintenance service is provided, gets rid of the incident that causes delay rapidly with the driver who helps to find oneself in the mire; 3) information system for driver is provided: in the scope that traffic events possibly influence, for the driver provides information.
In city traffic network; Arterial traffic has been born a large amount of traffic loadings, and research arterial street traffic control strategy improves the coordination of arterial traffic and controls effect; To reducing parking rate and the traffic delay on the arterial highway, improve the urban highway traffic situation and be significant.The coordination control of arterial street traffic signals is to be easy in the urban traffic control realize and widely used a kind of control mode, also is the basis that urban traffic area is coordinated control; Now a lot of research work mostly are to concentrate the aspects such as regional traffic control of coordinating control and network optimization with major trunk roads; These controls mostly are abroad in not stopping state proposition down of traffic, because coordination and the optimization cycle of transportation network are longer, particularly are difficult to dynamically obtain problems such as complete traffic flow data, make these methods inefficacies in the urban transportation LAN is controlled.
Summary of the invention
Existing transportation network is coordinated and long and frequent Problem of Failure of optimal control cycle in order to overcome; The invention provides a kind of transportation network of coordinating control based on dynamic max-flow solution of blocking up; This method obtains the transportation network graphic structure of mark dynamic headroom ability size according to queue length, the road traffic delay present situation of intersection all directions; By confirming the corresponding minimal cut set of the dynamic max-flow of transportation network; Emphasis is coordinated the bottleneck of local transportation network; The large-scale network optimization is converted into the coordination control problem of network minimal cut set, has improved the coordination control ability of whole transportation network.
The technical solution adopted for the present invention to solve the technical problems: a kind of transportation network of coordinating control based on dynamic max-flow solution of blocking up is characterized in may further comprise the steps:
1. obtain the transportation network graphic structure of mark dynamic headroom ability size according to queue length, the road traffic delay present situation of intersection all directions; Dynamically the bus capacity (equivalent vehicle number/unit interval) in highway section is kept straight on, turns right, is turned left to define according to this highway section, is example with thing and North and South direction intersection:
Vehicles traveling southward direction:? ?
Figure 370952DEST_PATH_IMAGE001
Vehicles traveling in the north direction:
Figure 396677DEST_PATH_IMAGE002
Vehicles traveling in the east direction:
Vehicle is at direction running westwards:
Where: equivalent vehicle is priced vehicles of different sizes standard car number, if equivalent to 2.5 standard trolley buses, etc., indicates vehicle capacity,
Figure 462536DEST_PATH_IMAGE006
represents an average density of road vehicles,
Figure 216865DEST_PATH_IMAGE007
to consider the intersection queue length, adjacent intersections The congestion and traffic signal control, etc. The coefficients are given, when the next cycle of the network regulation
Figure 894490DEST_PATH_IMAGE008
congestion within certain direction, then the corresponding
Figure 417875DEST_PATH_IMAGE009
,
Figure 847720DEST_PATH_IMAGE007
The vehicle can be freely exercised in accordance with the maximum number of lanes when other specific circumstances can be determined,
Figure 761449DEST_PATH_IMAGE010
is the traffic unified network time subscript indicates the direction of the vehicle traveling in the south section of subscript
Figure 945623DEST_PATH_IMAGE012
indicates the direction of the vehicle traveling in the north section of subscript indicates the direction of the vehicle traveling in the east section of subscript
Figure 947394DEST_PATH_IMAGE014
indicates the direction of the vehicle traveling in the east sections, the subscript means the vehicle straight south direction, the subscript
Figure 461869DEST_PATH_IMAGE016
northward direction the vehicle straight, subscript east direction the vehicle straight, subscript east direction the vehicle straight, subscript
Figure 4343DEST_PATH_IMAGE019
indicates the direction of the vehicle left the south east , the subscript
Figure 294510DEST_PATH_IMAGE020
indicates the direction of the vehicle in the south west turn right, subscript indicates the vehicle turn right in the direction of the north east, the subscript
Figure 674992DEST_PATH_IMAGE022
indicates the direction of the vehicle left the north west, the subscript
Figure 33293DEST_PATH_IMAGE023
turn right at the vehicle in the south east direction, the next subscript
Figure 505862DEST_PATH_IMAGE024
indicates that the vehicle left the north east direction, subscript
Figure 353732DEST_PATH_IMAGE025
means that the vehicle left the south west direction, the subscript
Figure 216646DEST_PATH_IMAGE026
indicates the vehicle turn right in the direction of the North West;
2. confirm the corresponding minimal cut set of the dynamic max-flow of transportation network, the traffic capacity of down direction is zero when confirming the minimal cut set of up direction; As confirming east that when the max-flow traffic capacity is handled according to zero in the other direction;
According to the dynamic minimal cut set of confirming to the transportation network dynamic coordinate, solve the bottleneck problem of local transportation network.
The invention has the beneficial effects as follows: through confirming the corresponding minimal cut set of the dynamic max-flow of transportation network; Emphasis is coordinated the bottleneck of local transportation network; The large-scale network optimization is converted into the coordination control problem of network minimal cut set; Improved the coordination control ability of whole transportation network, be convenient in real time the transportation network problem regulated and control.
Below in conjunction with embodiment the present invention is elaborated.
Embodiment
1. obtain the transportation network graphic structure of mark dynamic headroom ability size according to queue length, the road traffic delay present situation of intersection all directions; Dynamically the bus capacity (equivalent vehicle number/unit interval) in highway section is kept straight on, turns right, is turned left to define according to this highway section, is example with thing and North and South direction intersection:
Vehicles traveling southward direction:
Figure 440954DEST_PATH_IMAGE001
Vehicles traveling in the north direction:
Figure 768030DEST_PATH_IMAGE002
Vehicles traveling in the east direction:
Figure 987135DEST_PATH_IMAGE003
Vehicles traveling in the west direction:
Figure 399661DEST_PATH_IMAGE004
Where: equivalent vehicle is priced vehicles of different sizes standard car number, if equivalent to 2.5 standard trolley buses, etc., indicates vehicle capacity,
Figure 281347DEST_PATH_IMAGE006
represents an average density of road vehicles,
Figure 736599DEST_PATH_IMAGE007
to consider the intersection queue length, adjacent intersections The congestion and traffic signal control, etc. The coefficients are given, when the next cycle of the network regulation
Figure 636422DEST_PATH_IMAGE008
congestion within certain direction, then the corresponding ,
Figure 176305DEST_PATH_IMAGE007
The vehicle can be freely exercised in accordance with the maximum number of lanes when other specific circumstances can be determined,
Figure 802458DEST_PATH_IMAGE010
is the traffic unified network time subscript
Figure 127260DEST_PATH_IMAGE011
indicates the direction of the vehicle traveling in the south section of subscript
Figure 231482DEST_PATH_IMAGE012
indicates the direction of the vehicle traveling in the north section of subscript
Figure 387657DEST_PATH_IMAGE013
indicates the direction of the vehicle traveling in the east section of subscript
Figure 122395DEST_PATH_IMAGE014
indicates the direction of the vehicle traveling in the east sections, the subscript
Figure 731231DEST_PATH_IMAGE015
means the vehicle straight south direction, the subscript
Figure 904723DEST_PATH_IMAGE016
northward direction the vehicle straight, subscript
Figure 853088DEST_PATH_IMAGE017
east direction the vehicle straight, subscript east direction the vehicle straight, subscript
Figure 917176DEST_PATH_IMAGE019
indicates the direction of the vehicle left the south east , the subscript
Figure 300884DEST_PATH_IMAGE020
indicates the direction of the vehicle in the south west turn right, subscript
Figure 431651DEST_PATH_IMAGE021
indicates the vehicle turn right in the direction of the north east, the subscript
Figure 570508DEST_PATH_IMAGE022
indicates the direction of the vehicle left the north west, the subscript
Figure 91619DEST_PATH_IMAGE023
turn right at the vehicle in the south east direction, the next subscript
Figure 341335DEST_PATH_IMAGE024
indicates that the vehicle left the north east direction, subscript means that the vehicle left the south west direction, the subscript
Figure 588699DEST_PATH_IMAGE026
indicates the vehicle turn right in the direction of the North West;
2. confirm the corresponding minimal cut set of the dynamic max-flow of transportation network with reference to Ford and Fulkerson labeling method; The traffic capacity of down direction is zero when confirming the minimal cut set of up direction; As confirming east that when the max-flow traffic capacity is handled according to zero in the other direction, confirm to specify the down direction max-flow of cut set simultaneously;
3. according to the dynamic minimal cut set of confirming, to the transportation network dynamic coordinate, solve the bottleneck problem of local transportation network according to the traffic density equalization methods in each highway section.

Claims (1)

1. a transportation network of coordinating control based on dynamic max-flow solution of blocking up is characterized in may further comprise the steps:
1) queue length, the road traffic delay present situation according to the intersection all directions obtains the big or small transportation network graphic structure of mark dynamic headroom ability; Dynamically the bus capacity (equivalent vehicle number/unit interval) in highway section is kept straight on, turns right, is turned left to define according to this highway section, is example with thing and North and South direction intersection:
Vehicles traveling southward direction:? ?
Figure 467008DEST_PATH_IMAGE001
Vehicles traveling in the north direction:
Figure 836810DEST_PATH_IMAGE002
Vehicles traveling in the east direction:
Figure 665089DEST_PATH_IMAGE003
Vehicles traveling in the west direction:
Figure 462143DEST_PATH_IMAGE004
Where: equivalent vehicle means vehicles of different sizes priced standard car number, if the bus is equivalent to 2.5 standard car, etc.,
Figure 70979DEST_PATH_IMAGE005
indicates vehicle capacity,
Figure 182155DEST_PATH_IMAGE006
represents an average density of road vehicles, to consider the intersection queue length, the adjacent intersection congestion and traffic signal control machine gives the coefficients of the network when the next regulation cycle
Figure 98475DEST_PATH_IMAGE008
congestion within certain direction, then the corresponding
Figure 194607DEST_PATH_IMAGE009
,
Figure 843894DEST_PATH_IMAGE007
The vehicle can be freely exercised in accordance with the maximum number of lanes when other specific circumstances can be determined,
Figure 709082DEST_PATH_IMAGE010
is a unified transport network time subscript
Figure 847939DEST_PATH_IMAGE011
indicates the vehicle heading south sections, subscript indicates the direction of the vehicle traveling in the north section of subscript
Figure 618766DEST_PATH_IMAGE013
indicates the direction of the vehicle traveling in the east section of subscript
Figure 604040DEST_PATH_IMAGE014
the vehicle In the section heading eastwards, the subscript
Figure 851482DEST_PATH_IMAGE015
southward direction of the vehicle straight, subscript
Figure 922206DEST_PATH_IMAGE016
northward direction the vehicle straight, subscript
Figure 975612DEST_PATH_IMAGE017
east direction the vehicle straight, subscript
Figure 753076DEST_PATH_IMAGE018
east direction the vehicle straight, subscript
Figure 233735DEST_PATH_IMAGE019
indicates the direction of the vehicle left the south east, the subscript indicates the vehicle turn right in the direction of the south west, the subscript
Figure 318027DEST_PATH_IMAGE021
means the vehicle turn right at the north east direction, subscript
Figure 12314DEST_PATH_IMAGE022
indicates the direction of the vehicle left the north west, the subscript
Figure 663875DEST_PATH_IMAGE023
turn right at the vehicle in the south east direction, the next subscript means that the vehicle left the north east direction, subscript
Figure 42084DEST_PATH_IMAGE025
means that the vehicle left the south west direction, the subscript
Figure 590877DEST_PATH_IMAGE026
indicates the vehicle turn right in the direction of the North West;
2) confirm the minimal cut set that the dynamic max-flow of transportation network is corresponding, the traffic capacity of down direction is zero when confirming the minimal cut set of up direction; As confirming east that when the max-flow traffic capacity is handled according to zero in the other direction;
3) according to the dynamic minimal cut set of confirming to the transportation network dynamic coordinate, solve the bottleneck problem of local transportation network.
CN201210061385.3A 2012-03-10 2012-03-10 A kind of transportation network based on dynamic max-flow cooperation control is blocked up solution Active CN102592445B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210061385.3A CN102592445B (en) 2012-03-10 2012-03-10 A kind of transportation network based on dynamic max-flow cooperation control is blocked up solution

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210061385.3A CN102592445B (en) 2012-03-10 2012-03-10 A kind of transportation network based on dynamic max-flow cooperation control is blocked up solution

Publications (2)

Publication Number Publication Date
CN102592445A true CN102592445A (en) 2012-07-18
CN102592445B CN102592445B (en) 2016-03-02

Family

ID=46481019

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210061385.3A Active CN102592445B (en) 2012-03-10 2012-03-10 A kind of transportation network based on dynamic max-flow cooperation control is blocked up solution

Country Status (1)

Country Link
CN (1) CN102592445B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103268701A (en) * 2013-06-05 2013-08-28 王燚 Urban road network load balancing method
CN104751644A (en) * 2015-04-14 2015-07-01 无锡物联网产业研究院 Traffic detection method and traffic detection device
CN109300195A (en) * 2018-10-12 2019-02-01 武汉理工大学 The method that a kind of characteristic small town scenic spot prevents people's vehicle from stealing a ride
CN110782178A (en) * 2019-11-01 2020-02-11 北京航空航天大学 Traffic network planning aid decision-making method and device

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6538991B1 (en) * 1999-08-03 2003-03-25 Lucent Technologies Inc. Constraint-based routing between ingress-egress points in a packet network
CN101883330A (en) * 2010-07-02 2010-11-10 湖南大学 Network coding-based multicast routing method applied to vehicular ad hoc network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6538991B1 (en) * 1999-08-03 2003-03-25 Lucent Technologies Inc. Constraint-based routing between ingress-egress points in a packet network
CN101883330A (en) * 2010-07-02 2010-11-10 湖南大学 Network coding-based multicast routing method applied to vehicular ad hoc network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
李平生，李斌，谢晓莉，王猛: "基于辅助图理论的路网最大流改进算法", 《交通运输***工程与信息》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103268701A (en) * 2013-06-05 2013-08-28 王燚 Urban road network load balancing method
CN104751644A (en) * 2015-04-14 2015-07-01 无锡物联网产业研究院 Traffic detection method and traffic detection device
CN109300195A (en) * 2018-10-12 2019-02-01 武汉理工大学 The method that a kind of characteristic small town scenic spot prevents people's vehicle from stealing a ride
CN110782178A (en) * 2019-11-01 2020-02-11 北京航空航天大学 Traffic network planning aid decision-making method and device

Also Published As

Publication number Publication date
CN102592445B (en) 2016-03-02

Similar Documents

Publication Publication Date Title
CN103886764B (en) Method is shared in public transportation lane timesharing
CN104408946B (en) Method of controlling priority signal for right-turning vehicles on straight-going and right-turning shared lane at intersection
CN103000027B (en) Intelligent traffic guidance method based on floating car under congestion condition
CN202090252U (en) Road structure for relieving urban traffic jam
CN102074115A (en) Crossroad traffic control method capable of enhancing vehicle traffic capacity
CN105070080A (en) Plane road intersection dispersion system without left turn conflict
CN101550666A (en) Traffic optimization method of primary and secondary road grade crossing
CN102592445A (en) Traffic network crowding solution method based on dynamic max-flow coordination control
CN103164968A (en) Intelligence traffic signal lamp controlling system based on traffic flow
CN102787569B (en) Control method of junction reversible lane marks and lane line lengths
CN111932916A (en) Control method and control system for dynamic emergency lane of urban road
CN103498394B (en) A kind of automobile-use planar road net system
CN205582271U (en) Intelligent transportation lamp system based on dynamic flow monitoring
CN103413447A (en) Electronic police system of urban traffic crossroad
CN200985480Y (en) Non-obstacle crossroad road structure
CN202202220U (en) Crossroad with disc
CN202466336U (en) Interchange overpass without traffic light
CN103898820B (en) Quasi rail transit road system
CN109272759A (en) A kind of lane dynamic allocation system and its control method based on bus or train route collaboration
CN205451505U (en) Passenger's bus station about a lot of car is berthhed simultaneously
CN113136753B (en) Urban non-motor vehicle lane design method for slow traffic
CN106128129B (en) A kind of arterial street trackside traffic interflow signal control device and method
CN204833703U (en) Bus special lane monitoring device based on automobile -mounted terminal
CN201648983U (en) Safety bus lane side
Yin et al. Research on the Optimization of external traffic organization of urban passenger station Based on VISSIM Simulation

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