CN104575074B - Load balancing method for urban road network - Google Patents
Load balancing method for urban road network Download PDFInfo
- Publication number
- CN104575074B CN104575074B CN201510031697.3A CN201510031697A CN104575074B CN 104575074 B CN104575074 B CN 104575074B CN 201510031697 A CN201510031697 A CN 201510031697A CN 104575074 B CN104575074 B CN 104575074B
- Authority
- CN
- China
- Prior art keywords
- wagon flow
- link
- branch
- traffic
- shortest path
- 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.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/09—Arrangements for giving variable traffic instructions
- G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
- G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
- G08G1/096833—Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route
- G08G1/096844—Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route where the complete route is dynamically recomputed based on new data
Landscapes
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- General Physics & Mathematics (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a load balancing method for an urban road network. The load balancing method comprises the following steps that S1, statistics is carried out on information of departure places and destinations of all vehicles in given traffic flow, all the vehicles, with the same departure place and the destination, in the given traffic flow are defined as one traffic flow branch, and the shortest path, from the departure place to the destination of the traffic flow branch is calculated; S2, the shortest path is utilized for forming first network topology, weights W of all links of existing second network topology are calculated according to the first network topology, and the shortest path of the traffic flow branch in the step S1 is calculated again according to the weights W in all the links; S3, the steps S1 and S2 are repeated, shortest paths for all the vehicles in the given traffic flow are calculated. According to the method, the traffic flow is distributed, the effect of utilizing city road network resources more effectively is achieved, under the circumstance of ensuring that traffic is not jammed, the handling capacity of the road network is improved, and then the overall performance of the city traffic road network is improved.
Description
Technical field
The present invention relates to a kind of balancing method of loads of city road network.
Background technology
With the progressively modernization of Process of Urbanization Construction process, the increasingly crowded of urban transportation is brought with life for urban construction
Problems, the particularly lifting of personal automobile consumption in recent years, and land resource is rare, cause highly dense living environment with
Contradiction between high flow capacity traffic supply and demand, the congestion problems for causing traffic have been seriously hinder city further to develop one
Key factor.In traffic network, the optimal path for finding vehicle is the basic function of trip navigation.Optimal path be usually away from
From the most short path in most short path or time.But, if in road network from the vehicle at different crossings all
Select this optimal path, it is more likely that cause the congestion of traffic.
In traffic network, the load that simply a paths of the simple optimum for calculating are frequently resulted on road network is uneven
Weighing apparatus, some roads are crowded, and some roads are idle, cause the congestion of urban transportation.In the case where wagon flow is less, simple computation
Optimum this method of a paths has good effect, but this method does not account for the vehicle flowrate on current road network,
So road network resource effectively can not be utilized, the overall performance of urban road network is affected.
The content of the invention
It is an object of the invention to overcome the deficiencies in the prior art, there is provided a kind of balancing method of loads of city road network, lead to
Cross and wagon flow shunted, reach the effect more effectively using city road network resource, it is ensured that in the case of traffic not congestion,
The handling capacity of road network is improve, and then improves the overall performance of urban road network.
The purpose of the present invention is achieved through the following technical solutions：A kind of balancing method of loads of city road network, it
Comprise the following steps：
S1. departure place and the destination information of all vehicles in given wagon flow are counted, will have in given wagon flow it is identical go out
The all vehicles for sending out ground and destination are defined as branch's wagon flow, calculate branch's wagon flow from origin to destination most
Short path；
S2. first network topology is constituted using the shortest path, existing second network is calculated according to the first network topology
Weight W of each link of topology, recalculates the most short of branch's wagon flow described in step S1 according to weight W of each link
Path；
S3. repeat step S1～S2, is that all vehicles in given wagon flow calculate shortest path.
Described step S1 includes following sub-step：
S11. departure place is defined as into source node s, destination is defined as destination node t；Find out point in given wagon flow
Prop up the adjacent node on all out-degree sides of source node s in wagon flow；
S12., weight W of each link, the power of each link are set according to the passed through volume of traffic C of existing network topology link
Weight W is that the link can pass through the inverse ratio of volume of traffic C；
Adjacent node on all out-degree sides of the weight calculation source node s of the link for S13. being obtained according to step S12 is arrived
The shortest path of destination node t.
Described step S2 includes following sub-step：
S21. first network topology is constructed according to the shortest path that step S1 is calculated；
S22. find out the passed through volume of traffic C of the minimum in all links in the first network topology；
S23. by the passed through volume of traffic C of the minimum obtained in step S22 and the branch's wagon flow described in step S1
Vehicle flowrate be compared：
If the passed through volume of traffic C of the minimum is less than the vehicle flowrate of the wagon flow, according to the passed through traffic of the minimum
Amount carries out layout of roads labelling to the Some vehicles in branch's wagon flow, and calculates shortest path for this Some vehicles；
If the passed through volume of traffic of the minimum is more than the vehicle flowrate of branch's wagon flow, to the institute in branch's wagon flow
Have vehicle to carry out layout of roads labelling, and for branch's wagon flow in all vehicles calculate shortest paths；
S24. update the passed through volume of traffic C of all links in first network topology；
Weight W of all links on the shortest path for S25. calculating in calculation procedure S23；
S26. judge whether all vehicles in the branch's wagon flow described in step S1 have all carried out layout of roads mark
Note, if all vehicles in branch's wagon flow have all carried out layout of roads labelling, otherwise jump procedure S3, jump procedure
S22。
The weight of the link W described in step S25 is calculated by below equation：
W(e)=W '(e)(1+Q(e)/V(e))
In formula：W(e)The amended weights of-link e, W '(e)The present weight of-link e, Q(e)- link e current traffic
Amount, V(e)The actual capacity of-link e.
Described shortest path is for shortest time path footpath or apart from shortest path.
The invention has the beneficial effects as follows：It is when selecting path for certain wagon flow in method proposed by the invention, more than to calculate
One paths, calculate a plurality of shortest path, under the network topology that a plurality of shortest path is constituted, by the power for changing link
Weight is that each vehicle of given wagon flow recalculates an optimal path, so can be reached by shunting and more effectively utilize city
The resource of city's road network, it is ensured that in the case of traffic not congestion, improve the handling capacity of road network, and then improve urban road network
Overall performance.
Description of the drawings
Fig. 1 is the flow chart of the balancing method of loads of city road network of the present invention.
Specific embodiment
Technical scheme is described in further detail below in conjunction with the accompanying drawings, but protection scope of the present invention is not limited to
Described below.
As shown in figure 1, a kind of balancing method of loads of city road network, it comprises the following steps：
S1. departure place and the destination information of all vehicles in given wagon flow are counted, will have in given wagon flow it is identical go out
The all vehicles for sending out ground and destination are defined as branch's wagon flow, calculate branch's wagon flow from origin to destination most
Short path；
S2. first network topology is constituted using the shortest path, existing second network is calculated according to the first network topology
Weight W of each link of topology, recalculates the most short of branch's wagon flow described in step S1 according to weight W of each link
Path；
S3. repeat step S1～S2, is that all vehicles in given wagon flow calculate shortest path.
Described step S1 includes following sub-step：
S11. departure place is defined as into source node s, destination is defined as destination node t；Find out point in given wagon flow
Prop up the adjacent node on all out-degree sides of source node s in wagon flow；
S12., weight W of each link, the power of each link are set according to the passed through volume of traffic C of existing network topology link
Weight W is that the link can pass through the inverse ratio of volume of traffic C；
Adjacent node on all out-degree sides of the weight calculation source node s of the link for S13. being obtained according to step S12 is arrived
The shortest path of destination node t.
Described step S2 includes following sub-step：
S21. first network topology is constructed according to the shortest path that step S1 is calculated；
S22. find out the passed through volume of traffic C of the minimum in all links in the first network topology；
S23. by the passed through volume of traffic C of the minimum obtained in step S22 and the branch's wagon flow described in step S1
Vehicle flowrate be compared：
If the passed through volume of traffic C of the minimum is less than the vehicle flowrate of the wagon flow, according to the passed through traffic of the minimum
Amount carries out layout of roads labelling to the Some vehicles in branch's wagon flow, and calculates shortest path for this Some vehicles；
If the passed through volume of traffic of the minimum is more than the vehicle flowrate of branch's wagon flow, to the institute in branch's wagon flow
Have vehicle to carry out layout of roads labelling, and for branch's wagon flow in all vehicles calculate shortest paths；
S24. update the passed through volume of traffic C of all links in first network topology；
Weight W of all links on the shortest path for S25. calculating in calculation procedure S23；
S26. judge whether all vehicles in the branch's wagon flow described in step S1 have all carried out layout of roads mark
Note, if all vehicles in branch's wagon flow have all carried out layout of roads labelling, otherwise jump procedure S3, jump procedure
S22。
The weight of the link W described in step S25 is calculated by below equation：
W(e)=W '(e)(1+Q(e)/V(e))
In formula：W(e)The amended weights of-link e, W '(e)The present weight of-link e, Q(e)- link e current traffic
Amount, V(e)The actual capacity of-link e.Link e represents the e article link in all links.
Described shortest path can be shortest time path footpath, or apart from shortest path.
From traffic flow theory, when the current amount of traffic Q in a certain section gradually increases, when reaching Q/V=1, on section
Vehicle will start produce it is crowded.Wherein, Q is section current amount of traffic (/h), and V is section actual capacity (/h).
In order to slow down traffic congestion, needs ensure that in the case where Q/V is no more than 1 pass through more vehicle flowrates as far as possible, that is, need
Carry out city road network load balance.
Represented with G (N, E, W, C) and schemed, wherein N represents node set, and E represents link set, and W represents the weight of link, C
The active volume of link is represented, in city road network, equivalent to crossing, E is equivalent to section, length of the W equivalent to section, C phases for N
When in the passed through volume of traffic in section, i.e. C=V-Q.A subset M={ (s, t, d) } in N is the departure place of given wagon flow
And destination, represent that the possible different departure place of the vehicle on road network reaches different destinatioies.Wherein s is source node,
That is departure place, t is destination node, i.e. destination, and d is vehicle flowrate of the departure place to destination.
Claims (3)
1. a kind of balancing method of loads of city road network, it is characterised in that：It comprises the following steps：
S1. departure place and the destination information of all vehicles in given wagon flow are counted, will there is identical departure place in given wagon flow
Branch's wagon flow is defined as with all vehicles of destination, branch's wagon flow shortest path from origin to destination is calculated
Footpath；
S2. first network topology is constituted using the shortest path, existing second network topology is calculated according to the first network topology
Each link weight W, the shortest path of the branch's wagon flow described in step S1 is recalculated according to weight W of each link
Footpath；
Described step S2 includes following sub-step：
S21. first network topology is constructed according to the shortest path that step S1 is calculated；
S22. find out the passed through volume of traffic C of the minimum in all links in the first network topology；
S23. by the car of the branch's wagon flow described in the passed through volume of traffic C of the minimum obtained in step S22 and step S1
Flow is compared：
If the passed through volume of traffic C of the minimum is less than the vehicle flowrate of the wagon flow, according to the passed through volume of traffic pair of the minimum
Some vehicles in branch's wagon flow carry out layout of roads labelling, and calculate shortest path for this Some vehicles；
If the passed through volume of traffic of the minimum is more than the vehicle flowrate of branch's wagon flow, to all cars in branch's wagon flow
Carry out layout of roads labelling, and for branch's wagon flow in all vehicles calculate shortest paths；
S24. update the passed through volume of traffic C of all links in first network topology；
Weight W of all links on the shortest path for S25. calculating in calculation procedure S23；
Weight W of the link described in step S25 is calculated by below equation：
W(e)=W '(e)(1+Q(e)/V(e))
In formula：W(e)The amended weights of-link e, W '(e)The present weight of-link e, Q(e)- link e current the volume of traffic,
V(eThe actual capacity of)-link e；
S26. judge whether all vehicles in the branch's wagon flow described in step S1 have all carried out layout of roads labelling, if
All vehicles in branch's wagon flow have all carried out layout of roads labelling, then jump procedure S3, otherwise jump procedure S22；
S3. repeat step S1～S2, is that all vehicles in given wagon flow calculate shortest path.
2. the balancing method of loads of a kind of city road network according to claim 1, it is characterised in that：Described step S1 bag
Include following sub-step：
S11. departure place is defined as into source node s, destination is defined as destination node t；Find out branch's car in given wagon flow
Adjacent node in stream on all out-degree sides of source node s；
S12., weight W of each link, weight W of each link are set according to the passed through volume of traffic C of existing network topology link
Can be passed through the inverse ratio of volume of traffic C for the link；
Adjacent node on all out-degree sides of the weight calculation source node s of the link for S13. being obtained according to step S12 is to Su Jie
The shortest path of point t.
3. the balancing method of loads of a kind of city road network according to claim 1, it is characterised in that：Described shortest path
For shortest time path footpath or apart from shortest path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510031697.3A CN104575074B (en) | 2015-01-22 | 2015-01-22 | Load balancing method for urban road network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510031697.3A CN104575074B (en) | 2015-01-22 | 2015-01-22 | Load balancing method for urban road network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104575074A CN104575074A (en) | 2015-04-29 |
| CN104575074B true CN104575074B (en) | 2017-04-26 |
Family
ID=53091015
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510031697.3A Expired - Fee Related CN104575074B (en) | 2015-01-22 | 2015-01-22 | Load balancing method for urban road network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104575074B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10491507B2 (en) | 2016-02-28 | 2019-11-26 | Cisco Technology, Inc. | Traffic management system |
| US10432531B2 (en) * | 2016-06-28 | 2019-10-01 | Paypal, Inc. | Tapping network data to perform load balancing |
| TWI621026B (en) * | 2017-05-17 | 2018-04-11 | 國立清華大學 | Traffic network reliability evaluating method and system thereof |
| CN110375762B (en) * | 2019-08-13 | 2021-06-11 | 福建工程学院 | Method and device for assisting in planning navigation path |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH08137509A (en) * | 1994-11-07 | 1996-05-31 | Honda Motor Co Ltd | Control method using map prepared by utilizing neural network |
| CA2596048A1 (en) * | 2005-05-18 | 2006-11-23 | Lg Electronics Inc. | Method and apparatus for providing transportation status information and using it |
| CN101608922A (en) * | 2008-06-18 | 2009-12-23 | 北京东方泰坦科技有限公司 | Method for quickest routing planning based on Real-time Traffic Information |
| CN102200446A (en) * | 2010-03-23 | 2011-09-28 | 日电（中国）有限公司 | Continuous path detection device and method based on traffic data |
| CN103090878A (en) * | 2011-10-28 | 2013-05-08 | 北京中交兴路信息科技有限公司 | Vehicle path planning method, vehicle path planning system and vehicle navigation apparatus |
| CN103177595A (en) * | 2011-12-26 | 2013-06-26 | 北京易华录信息技术股份有限公司 | Dynamic routing optimization system and method based on real-time traffic information |
| CN103268701A (en) * | 2013-06-05 | 2013-08-28 | 王燚 | Urban road network load balancing method |
| CN103471596A (en) * | 2012-06-08 | 2013-12-25 | 纽海信息技术（上海）有限公司 | Shortest path guiding method and shortest path guiding system |
| CN103968854A (en) * | 2014-05-27 | 2014-08-06 | 四川汇源吉迅数码科技有限公司 | Route cluster planning method |
-
2015
- 2015-01-22 CN CN201510031697.3A patent/CN104575074B/en not_active Expired - Fee Related
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH08137509A (en) * | 1994-11-07 | 1996-05-31 | Honda Motor Co Ltd | Control method using map prepared by utilizing neural network |
| CA2596048A1 (en) * | 2005-05-18 | 2006-11-23 | Lg Electronics Inc. | Method and apparatus for providing transportation status information and using it |
| CN101608922A (en) * | 2008-06-18 | 2009-12-23 | 北京东方泰坦科技有限公司 | Method for quickest routing planning based on Real-time Traffic Information |
| CN102200446A (en) * | 2010-03-23 | 2011-09-28 | 日电（中国）有限公司 | Continuous path detection device and method based on traffic data |
| CN103090878A (en) * | 2011-10-28 | 2013-05-08 | 北京中交兴路信息科技有限公司 | Vehicle path planning method, vehicle path planning system and vehicle navigation apparatus |
| CN103177595A (en) * | 2011-12-26 | 2013-06-26 | 北京易华录信息技术股份有限公司 | Dynamic routing optimization system and method based on real-time traffic information |
| CN103471596A (en) * | 2012-06-08 | 2013-12-25 | 纽海信息技术（上海）有限公司 | Shortest path guiding method and shortest path guiding system |
| CN103268701A (en) * | 2013-06-05 | 2013-08-28 | 王燚 | Urban road network load balancing method |
| CN103968854A (en) * | 2014-05-27 | 2014-08-06 | 四川汇源吉迅数码科技有限公司 | Route cluster planning method |
Non-Patent Citations (2)
| Title |
|---|
| 交通流预测网格自适应负载平衡研究;马海波，等;《科学技术与工程》;20080829;第8卷(第15期);第4185-4187页 * |
| 基于城市路网最短路径井行搜索算法的研究;卢照;《中国优秀硕士学位论文全文数据库（电子期刊）》;20110315(第3期);第I138-33页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104575074A (en) | 2015-04-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104575074B (en) | Load balancing method for urban road network | |
| CN103745611B (en) | A kind of traffic route planing method, Apparatus and system | |
| CN103268701B (en) | Urban road network load balancing method | |
| Thai et al. | Negative externalities of GPS-enabled routing applications: A game theoretical approach | |
| CN105429894A (en) | Service route selection method and device in electric power communication network | |
| Scellato et al. | Traffic optimization in transport networks based on local routing | |
| CN107464417A (en) | Traffic scheduling management-control method based on the analysis of trip route big data | |
| CN103968854B (en) | A kind of Path Clustering planing method | |
| CN105489043A (en) | Real-time path planning method based on vehicular ad-hoc network | |
| CN104156459A (en) | Efficient path-finding method and system based on the same cost grids | |
| CN104217086A (en) | Urban public transport network optimization method | |
| CN109660465A (en) | A kind of car networking load balancing method for routing of roadside unit auxiliary | |
| CN107103169A (en) | It is a kind of to be used to meet the transportation network equilibrium calculation method that trip continuation of the journey is required | |
| CN105160429A (en) | Multi-mode public transportation transfer method with virtual transfer micro-hubs | |
| CN103079249A (en) | Internet of Things multicast data transmission method based on traffic density | |
| CN103294909A (en) | Separation path calculation method based on sharing degree | |
| Elbery et al. | A novel stochastic linear programming feedback eco-routing traffic assignment system | |
| CN104123845A (en) | Modern control theory based intelligent dynamic navigation | |
| Zheng et al. | Congestion and efficiency in complex traffic networks | |
| CN104835346B (en) | Road network marking method for traffic crossing state indication | |
| Dragoi et al. | A model for traffic control in urban environments | |
| CN104101347A (en) | Modern control theory state equation-based optimum dynamic navigation method | |
| CN109583715A (en) | A kind of method of public transport and the through route shift adjustment gone on a journey of track transfer | |
| CN104468050A (en) | Self-adaptation data package transmission method for deadline sensing in collaboration wireless network | |
| CN108985511A (en) | A kind of public transportation lane layout optimization method based on SUE |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170426 Termination date: 20220122 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |