CN104575074A - Load balancing method for urban road network - Google Patents
Load balancing method for urban road network Download PDFInfo
- Publication number
- CN104575074A CN104575074A CN201510031697.3A CN201510031697A CN104575074A CN 104575074 A CN104575074 A CN 104575074A CN 201510031697 A CN201510031697 A CN 201510031697A CN 104575074 A CN104575074 A CN 104575074A
- 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.)
- Granted
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
Along with the progressively modernization of Process of Urbanization Construction process, the day by day crowded of urban transportation brings problems for urban construction and life, the particularly lifting of personal automobile consumption in recent years, and land resource is rare, cause the contradiction between highly dense living environment and high flow capacity traffic supply and demand, cause the congestion problems of traffic to be the key factor seriously hindering city to further develop.In traffic network, the optimal path finding vehicle is the basic function of trip navigation.Optimal path is generally the path of the shortest path of distance or shortest time.But, if all select this optimal path from the vehicle at different crossings in road network, probably cause blocking up of traffic.
In traffic network, just a paths of the simple optimum calculated usually causes the laod unbalance on road network, and some roads are crowded, and some roads are idle, cause blocking up of urban transportation.When wagon flow is less, this method of one paths of simple computation optimum has good effect, but this method does not consider the vehicle flowrate on current road network, so can not effectively utilize road network resource, affect the overall performance of urban road network.
Summary of the invention
The object of the invention is to overcome the deficiencies in the prior art, a kind of balancing method of loads of city road network is provided, by shunting wagon flow, reach the effect more effectively utilizing city road network resource, ensure when traffic is not blocked up, improve the handling capacity of road network, and then improve the overall performance of urban road network.
The object of the invention is to be achieved through the following technical solutions: a kind of balancing method of loads of city road network, it comprises the following steps:
S1. add up departure place and the destination information of all vehicles in given wagon flow, all vehicles in given wagon flow with identical departure place and destination are defined as branch's wagon flow, calculate this branch's wagon flow shortest path from origin to destination;
S2. utilize this shortest path to form first network topology, calculate the weights W of each link of existing second network topology according to first this network topology, recalculate the shortest path of this branch's wagon flow described in step S1 according to the weights W of each link;
S3. step S1 ~ S2 is repeated, for all vehicles in given wagon flow calculate shortest path.
Described step S1 comprises following sub-step:
S11. departure place is defined as source node s, destination is defined as destination node t; Find out the adjacent node on all out-degree limits of source node s in branch's wagon flow in given wagon flow;
S12. arrange the weights W of each link according to the passed through volume of traffic C of existing network topology link, the weights W of each link is that this link can pass through the inverse ratio of volume of traffic C;
Adjacent node on all out-degree limits of the weight calculation source node s of the link S13. obtained according to step S12 is to the shortest path of destination node t.
Described step S2 comprises following sub-step:
S21. according to the shortest path structure first network topology that step S1 calculates;
S22. minimum the passed through volume of traffic C in all links in this first network topology is found out;
S23. the vehicle flowrate of this branch's wagon flow described in minimum the passed through volume of traffic C obtained in step S22 and step S1 is compared:
If this minimum passed through volume of traffic C is less than the vehicle flowrate of this wagon flow, then according to this minimum passed through volume of traffic, layout of roads mark is carried out to the Some vehicles in this branch's wagon flow, and be this part vehicle calculating shortest path;
If this minimum passed through volume of traffic is greater than the vehicle flowrate of this branch's wagon flow, then layout of roads mark is carried out to all vehicles in this branch's wagon flow, and be all vehicles calculating shortest paths in this branch's wagon flow;
S24. the passed through volume of traffic C of all links in first network topology is upgraded;
The weights W of all links on the shortest path S25. calculated in calculation procedure S23;
Whether all vehicles in this branch's wagon flow S26. described in determining step S1 have all carried out layout of roads mark, if all vehicles in this branch's wagon flow have all carried out layout of roads mark, then and jump procedure S3, otherwise jump procedure S22.
Being drawn by following formulae discovery of the weight of the link W described in step S25:
W
(e)＝W′
(e)(1+Q
(e)/V
(e))
In formula: W
(e)the amended weight of-link e, W '
(e)the present weight of-link e, Q
(e)the volume of traffic that-link e is current, V
(e)the actual capacity of-link e.
Described shortest path is shortest time path or distance shortest path.
The invention has the beneficial effects as follows: time in method proposed by the invention for certain wagon flow selecting paths, incessantly calculate a paths, calculate many shortest paths, under the network topology that many shortest paths are formed, each vehicle being given wagon flow by the weight of change link recalculates an optimal path, the resource more effectively utilizing city road network can be reached like this by shunting, ensure when traffic is not blocked up, improve the handling capacity of road network, and then improve the overall performance of urban road network.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of the balancing method of loads of city road network of the present invention.
Embodiment
Below in conjunction with accompanying drawing, technical scheme of the present invention is described in further detail, but protection scope of the present invention is not limited to the following stated.
As shown in Figure 1, a kind of balancing method of loads of city road network, it comprises the following steps:
S1. add up departure place and the destination information of all vehicles in given wagon flow, all vehicles in given wagon flow with identical departure place and destination are defined as branch's wagon flow, calculate this branch's wagon flow shortest path from origin to destination;
S2. utilize this shortest path to form first network topology, calculate the weights W of each link of existing second network topology according to first this network topology, recalculate the shortest path of this branch's wagon flow described in step S1 according to the weights W of each link;
S3. step S1 ~ S2 is repeated, for all vehicles in given wagon flow calculate shortest path.
Described step S1 comprises following sub-step:
S11. departure place is defined as source node s, destination is defined as destination node t; Find out the adjacent node on all out-degree limits of source node s in branch's wagon flow in given wagon flow;
S12. arrange the weights W of each link according to the passed through volume of traffic C of existing network topology link, the weights W of each link is that this link can pass through the inverse ratio of volume of traffic C;
Adjacent node on all out-degree limits of the weight calculation source node s of the link S13. obtained according to step S12 is to the shortest path of destination node t.
Described step S2 comprises following sub-step:
S21. according to the shortest path structure first network topology that step S1 calculates;
S22. minimum the passed through volume of traffic C in all links in this first network topology is found out;
S23. the vehicle flowrate of this branch's wagon flow described in minimum the passed through volume of traffic C obtained in step S22 and step S1 is compared:
If this minimum passed through volume of traffic C is less than the vehicle flowrate of this wagon flow, then according to this minimum passed through volume of traffic, layout of roads mark is carried out to the Some vehicles in this branch's wagon flow, and be this part vehicle calculating shortest path;
If this minimum passed through volume of traffic is greater than the vehicle flowrate of this branch's wagon flow, then layout of roads mark is carried out to all vehicles in this branch's wagon flow, and be all vehicles calculating shortest paths in this branch's wagon flow;
S24. the passed through volume of traffic C of all links in first network topology is upgraded;
The weights W of all links on the shortest path S25. calculated in calculation procedure S23;
Whether all vehicles in this branch's wagon flow S26. described in determining step S1 have all carried out layout of roads mark, if all vehicles in this branch's wagon flow have all carried out layout of roads mark, then and jump procedure S3, otherwise jump procedure S22.
Being drawn by following formulae discovery of the weight of the link W described in step S25:
W
(e)＝W′
(e)(1+Q
(e)/V
(e))
In formula: W
(e)the amended weight of-link e, W '
(e)the present weight of-link e, Q
(e)the volume of traffic that-link e is current, V
(e)the actual capacity of-link e.Link e represents e article of link in all links.
Described shortest path can be shortest time path, also can be distance shortest path.
From traffic flow theory, when the current amount of traffic Q in a certain section increases gradually, when reaching Q/V=1, the vehicle on section is crowded by starting to produce.Wherein, Q is section current amount of traffic (/h), and V is section actual capacity (/h).In order to slow down traffic congestion, need to ensure when Q/V can not more than 1, current as much as possible more vehicle flowrate, namely needs to carry out city road network load balance.
With G (N, E, W, C) represent figure, wherein N represents node set, and E represents link set, W represents the weight of link, C represents the active volume of link, and in city road network, N is equivalent to crossing, E is equivalent to section, W is equivalent to the length in section, and C is equivalent to the passed through volume of traffic in section, i.e. C=V-Q.A subset M={ (s, t, d) in N } be the departure place of given wagon flow and destination, represent that the possible different departure place of vehicle on road network arrives different destinations.Wherein s is source node, i.e. departure place, and t is destination node, i.e. destination, and d is the vehicle flowrate of departure place to destination.
Claims (5)
1. a balancing method of loads for city road network, is characterized in that: it comprises the following steps:
S1. add up departure place and the destination information of all vehicles in given wagon flow, all vehicles in given wagon flow with identical departure place and destination are defined as branch's wagon flow, calculate this branch's wagon flow shortest path from origin to destination;
S2. utilize this shortest path to form first network topology, calculate the weights W of each link of existing second network topology according to first this network topology, recalculate the shortest path of this branch's wagon flow described in step S1 according to the weights W of each link;
S3. step S1 ~ S2 is repeated, for 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, is characterized in that: described step S1 comprises following sub-step:
S11. departure place is defined as source node s, destination is defined as destination node t; Find out the adjacent node on all out-degree limits of source node s in branch's wagon flow in given wagon flow;
S12. arrange the weights W of each link according to the passed through volume of traffic C of existing network topology link, the weights W of each link is that this link can pass through the inverse ratio of volume of traffic C;
Adjacent node on all out-degree limits of the weight calculation source node s of the link S13. obtained according to step S12 is to the shortest path of destination node t.
3. the balancing method of loads of a kind of city road network according to claim 1, is characterized in that: described step S2 comprises following sub-step:
S21. according to the shortest path structure first network topology that step S1 calculates;
S22. minimum the passed through volume of traffic C in all links in this first network topology is found out;
S23. the vehicle flowrate of this branch's wagon flow described in minimum the passed through volume of traffic C obtained in step S22 and step S1 is compared:
If this minimum passed through volume of traffic C is less than the vehicle flowrate of this wagon flow, then according to this minimum passed through volume of traffic, layout of roads mark is carried out to the Some vehicles in this branch's wagon flow, and be this part vehicle calculating shortest path;
If this minimum passed through volume of traffic is greater than the vehicle flowrate of this branch's wagon flow, then layout of roads mark is carried out to all vehicles in this branch's wagon flow, and be all vehicles calculating shortest paths in this branch's wagon flow;
S24. the passed through volume of traffic C of all links in first network topology is upgraded;
The weights W of all links on the shortest path S25. calculated in calculation procedure S23;
Whether all vehicles in this branch's wagon flow S26. described in determining step S1 have all carried out layout of roads mark, if all vehicles in this branch's wagon flow have all carried out layout of roads mark, then and jump procedure S3, otherwise jump procedure S22.
4. the balancing method of loads of a kind of city road network according to claim 3, is characterized in that: being drawn by following formulae discovery of the weight of the link W described in step S25:
W
(e)＝W′
(e)(1+Q
(e)/V
(e))
In formula: W
(e)the amended weight of-link e, W '
(e)the present weight of-link e, Q
(e)the volume of traffic that-link e is current, V
(e)the actual capacity of-link e.
5. the balancing method of loads of a kind of city road network according to claim 1, is characterized in that: described shortest path is shortest time path or distance 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 true CN104575074A (en) | 2015-04-29 |
| CN104575074B 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) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI621026B (en) * | 2017-05-17 | 2018-04-11 | 國立清華大學 | Traffic network reliability evaluating method and system thereof |
| CN109642923A (en) * | 2016-06-28 | 2019-04-16 | 贝宝公司 | Current-dividing network data are to execute load balance |
| CN110375762A (en) * | 2019-08-13 | 2019-10-25 | 福建工程学院 | A kind of method and device for assisting planning guidance path |
| US10491507B2 (en) | 2016-02-28 | 2019-11-26 | Cisco Technology, Inc. | Traffic management system |
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 |
|---|
| 卢照: "基于城市路网最短路径井行搜索算法的研究", 《中国优秀硕士学位论文全文数据库（电子期刊）》, no. 3, 15 March 2011 (2011-03-15), pages 138 - 33 * |
| 马海波，等: "交通流预测网格自适应负载平衡研究", 《科学技术与工程》, vol. 8, no. 15, 29 August 2008 (2008-08-29), pages 4185 - 4187 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10491507B2 (en) | 2016-02-28 | 2019-11-26 | Cisco Technology, Inc. | Traffic management system |
| CN109642923A (en) * | 2016-06-28 | 2019-04-16 | 贝宝公司 | Current-dividing network data are to execute load balance |
| CN109642923B (en) * | 2016-06-28 | 2021-07-20 | 贝宝公司 | Offloading network data to perform load balancing |
| US11082346B2 (en) | 2016-06-28 | 2021-08-03 | 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 |
| US10235876B2 (en) | 2017-05-17 | 2019-03-19 | National Tsing Hua University | Traffic network reliability evaluating method and system thereof |
| CN110375762A (en) * | 2019-08-13 | 2019-10-25 | 福建工程学院 | A kind of method and device for assisting planning guidance path |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104575074B (en) | 2017-04-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103268701B (en) | Urban road network load balancing method | |
| Scellato et al. | Traffic optimization in transport networks based on local routing | |
| CN104575074A (en) | Load balancing method for urban road network | |
| CN105429894A (en) | Service route selection method and device in electric power communication network | |
| CN105592138B (en) | A kind of city vehicle-mounted road of crossing ad hoc nodes auxiliary is by protocol method | |
| CN103968854B (en) | A kind of Path Clustering planing method | |
| CN105489043A (en) | Real-time path planning method based on vehicular ad-hoc network | |
| CN102137462A (en) | Prediction-based routing method at intersection in vehicle self-organizing network | |
| Zhao et al. | A vehicle density and load aware routing protocol for VANETs in city scenarios | |
| CN104318793B (en) | A kind of road water logging event is promptly dredged and is joined stream generating method | |
| CN105160429A (en) | Multi-mode public transportation transfer method with virtual transfer micro-hubs | |
| Zhou et al. | A small-scale traffic monitoring system in urban wireless sensor networks | |
| CN103079249A (en) | Internet of Things multicast data transmission method based on traffic density | |
| CN104837173A (en) | Metropolitan area vehicle-mounted communication system with parking node | |
| Elbery et al. | A novel stochastic linear programming feedback eco-routing traffic assignment system | |
| CN103294909A (en) | Separation path calculation method based on sharing degree | |
| Wang et al. | An improved VANET intelligent forward decision-making routing algorithm | |
| Zheng et al. | Congestion and efficiency in complex traffic networks | |
| Duraimurugan et al. | Energy Efficient Nodes Clustering and Routing Using Multi-Objective Spider Monkey Optimization Algorithm in Wireless Sensor Network | |
| CN104344831A (en) | Navigation system, navigation method, and navigation terminal for escaping from current position | |
| Wadea et al. | Connecting the autonomous: A distributed game theory approach for VANET connectivity | |
| Tee et al. | Adaptive reactive routing for VANET in city environments | |
| Garrosi et al. | Loop-free enhanced intersection-based perimeter geo-routing with carry-and-forward for urban vanets | |
| CN104101347A (en) | Modern control theory state equation-based optimum dynamic navigation method | |
| Gomez et al. | How virtual police agents can help in the traffic guidance? |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170426 Termination date: 20220122 |