CN104899654B - It is a kind of to be used to alleviate the crowded routing resource of track traffic - Google Patents
It is a kind of to be used to alleviate the crowded routing resource of track traffic Download PDFInfo
- Publication number
- CN104899654B CN104899654B CN201510300997.7A CN201510300997A CN104899654B CN 104899654 B CN104899654 B CN 104899654B CN 201510300997 A CN201510300997 A CN 201510300997A CN 104899654 B CN104899654 B CN 104899654B
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- passengers
- section
- passenger
- 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
Abstract
It is used to alleviate the crowded routing resource of track traffic the invention discloses a kind of, this method is based on water channel principium algorithm and shortest path first, by being ranked up to the outer Trip Costs of total value of all " transfer stops to " according to order from big to small, positioning needs to provide " transfer stop to " of routing information；And then choose the passenger of " transfer stop to " of the small part by positioning and provides routing information, guiding passenger's selection minimum Trip Costs path, so that it is crowded to alleviate track traffic for this part passenger.By varying the path of small part passenger, only slightly increase a small amount of passenger's travel time, so that it may it is crowded effectively to alleviate track traffic.Also, only issuing path advisory information it need to can reach required effect on a few website.The routing information drawn using this method can be issued by information medias such as TV, broadcast, message board, official website and microbloggings, application simple possible, easily operated.
Description
Technical field
It is used to alleviate the crowded routing resource of track traffic the present invention relates to a kind of.
Background technology
Urban track traffic is as one kind in public trip mode, in occupation of importantly in present Urban Traffic
Position, carries more and more traffic tasks.However, due to the imbalance of traffic supply and demand, traffic congestion phenomenon takes place frequently.In subway
In network, handling capacity of passengers not only causes the waste of subway transport capacity resource, also reduces going out for passenger there are notable difference between each circuit
Row quality.In order to improve the utilization to track traffic transport capacity resource, alleviation urban track traffic is crowded, effectively guides passenger's peace
Entirely, it is convenient, quickly take track traffic, many cities begin setting up track traffic information issuing system.However, these tracks are handed over
Logical information issuing system still suffers from following deficiency at present：
1) the real-time passenger flow situation of track traffic is issued in most track traffic information issuing system timing at present, by multiplying
Objective autonomous selection traffic path is crowded to evade, existence information issue not in time, intelligent Path selection suggestion etc. can not be provided
Problem, the effect of crowded optimization are limited；
2) in improved track traffic information issuing system, can be changed according to the volume of the flow of passengers between the issue of flexible arrangement information
Shorten information issuing time interval every, phase commuter rush hour, provide congestion information in time for passenger, but passenger's Path selection still oneself
Main decision, selection that could not be to passenger route are effectively guided, and still can only carry out part optimization to crowded state；
3), can only at present, although track traffic information issuing system also occur provides Path selection suggestion for passenger
So-called optimal path is provided for passenger according to passenger flow situation at that time, guiding passenger largely selects not crowded section, easily
Original not crowded section is caused to become crowded, so that the path of part passenger selection becomes due to the influence of other passenger flows
It is no longer optimal path to obtain；
Or in conclusion existing urban track traffic information issuing system simply issue real-time passenger flow situation, by
Passenger independently selects traffic path；Traffic path is provided for passenger according to real-time passenger flow situation, but is the failure to consider
Influencing each other between passenger flow.Routing resource is crowded to track traffic all only in existing track traffic information issuing system
It can carry out part to optimize, also there are considerable room for improvement.
The content of the invention
It is used to alleviate the crowded routing resource of track traffic the present invention provides a kind of, this method is with minimum cost road
Based on footpath algorithm and shortest path first, orient by the crowded a few passengers for influencing maximum of track traffic, and to this part
Passenger provides path advisory information, and then guides passenger to select suitable path, and it is crowded preferably to alleviate track traffic, carries
The high utilization to transport capacity resource.
It is a kind of to be used to alleviate the crowded routing resource of track traffic, it is first, equal to the passenger in Rail traffic network
According to shortest-path method Selecting Travel Paths, extra Trip Costs of all passengers in Rail traffic network are calculated；Then,
Calculate the outer Trip Costs of total value in Rail traffic network between any two transfer stop；Then, to all transfer stops pair
The outer Trip Costs of total value are ranked up according to order from big to small, and positioning needs to provide the transfer stop pair of routing information；Finally,
Routing information is provided for passenger to information according to oriented transfer stop, the passenger's of oriented transfer stop pair additionally goes out
The passenger of P% selects water channel principium method trip route before row cost comes, remaining all passenger selects shortest path side
Method trip route；
Wherein, the Rail traffic network is formed by connecting side between node and node, and the node refers to track traffic
Station in network, the connection side between the node and node refer to the block section between stations of Rail traffic network；
Trip Costs c of the passenger in Rail traffic network on every section of block section between stationsij(fij) refer to that i stations are adjacent
J stations travel time cost and the sum of congestion costs：
Wherein, fijAnd MijThe volume of the flow of passengers and rated capacity in mono- hour from station i to adjacent station j are illustrated respectively in,
tijRepresent the travel time at the j stations that i stands adjacent, α represents congestion costs linear dimensions, and value range is 0.15~0.45, β tables
Show congestion costs index parameters, value range is 1~10；
Extra Trip Costs ce of the passenger in Rail traffic network on every section of track sectionij(fij) refer to that i stands
The sum of adjacent congestion costs at j stations：
Extra Trip Costs of the passenger in transportation network are to distribute to obtain going out for passenger using shortest-path method
Walking along the street footpath, based on the sum of extra Trip Costs on the every section of block section between stations included in passenger's paths traversed；
The outer Trip Costs C of total value in the Rail traffic network between any two transfer stopERefer to by the two
The summation of the extra Trip Costs of all passengers of transfer stop；
The positioning needs to provide the quantity N of the transfer stop pair of routing information by the first average additional passengers number F0Determine：
First, when making all passengers' selection water channel principium trips, the first average additional passengers number F is obtained0；
Then, by N from 0 gradually increase, when meeting 1.00F0＜ F (N) ＜ 1.10F0, the value of N is obtained, F (N) represents warp
All passengers of the transfer stop pair of N before the outer Trip Costs of total value come are crossed with least cost routing Selecting Travel Paths, it is remaining
When all passengers are with critical path method (CPM) Selecting Travel Paths, the average additional passengers number of Rail traffic network；
Average additional passengers number refers to the additional passengers number divided by track block section between stations sum of track block section between stations, the volume
Outer ridership refers to the passengers quantity more than vehicle rated passenger capacity；
The P is by the second average additional passengers number F1Determine：
First, when all passengers of transfer stop pair by positioning select water channel principium, and without positioning
When all passengers of transfer stop pair select shortest path, the second obtained average additional passengers number is F1；
Secondly, by P from 0 gradually increase, when meeting 1.00F1＜ F (P) ＜ 1.10F1When, obtain the value of P.
It is described to be formed the total Trip Costs of Rail traffic network with the sum of Trip Costs of all track sections and reach minimum, come
The magnitude of traffic flow on every section of track in Rail traffic network is distributed, is comprised the following steps that：
Step 1：Iterations n=1 is made, based on travel time tij, each track section is distributed using dijkstra's algorithm
The magnitude of traffic flow, obtains the volume of the flow of passengers f of each track sectionij；
Step 2：Based on the volume of the flow of passengers of each track section, the Trip Costs of every section of track section are calculated, and according to following public affairs
Formula obtains the Trip Costs conversion value of every section of track section
Step 3：The Trip Costs conversion value of the every section of track section obtained with step 2, is distributed using dijkstra's algorithm
Track traffic flow, obtains the volume of the flow of passengers intermediateness value g of every section of track sectionij；
Step 4：Determine that iteration step length λ, λ meet formulagij n
And fij nThe volume of the flow of passengers intermediateness value and iterative value of track section are obtained during being illustrated respectively in n-th generation repeatedly；
Step 5：Determine new iteration starting point：fij n+1=fij n+λ(gij n-fij n)；
Step 6：Test for convergence, judges the visitor of the volume of the flow of passengers that every section of track section distributes in n-th and the (n+1)th sub-distribution
Whether flow does not change, i.e., whether meets formulaε is to judge the factor, ε ＜ 10-3It is if full
Sufficient formula, then stop iteration, with the volume of the flow of passengers iterative value distribution path on every section of current track section；Otherwise, return to step
2, with fij n+1Recalculate the Trip Costs of every section of track section.
Realize water channel principium so that total Trip Costs of whole track traffic are minimum.
Beneficial effect
It is used to alleviate the crowded routing resource of track traffic the present invention provides a kind of, this method is with minimum cost road
Based on footpath algorithm and shortest path first, by the outer Trip Costs of total value to all " transfer stops to " according to from big to small
Order be ranked up, positioning needs to provide " transfer stop to " of routing information；And then small part is chosen by positioning
The passenger of " transfer stop to " simultaneously provides routing information for this part passenger, and guiding passenger selects minimum Trip Costs path,
It is crowded so as to alleviate track traffic.To the routing resource based on passenger than ever, routing resource proposed by the present invention
Based on website, only it a small amount of routing information need to be issued on a few website can effectively alleviate track traffic and gather around
Squeeze, there is stronger specific aim and feasibility.Such as in the present invention, it is only necessary to select information in 10 website issuing paths, just
Beijing Metro network congestion can effectively be alleviated.The routing information drawn using this method can be by TV, broadcast, letter
Cease the information media issue such as board, official website and microblogging, it is application simple possible, easily operated.
Brief description of the drawings
Fig. 1 is the flow chart of the method for the invention；
The extra Trip Costs C of Fig. 2EDistribution map, wherein, (a) is the extra Trip Costs of subway network " transfer stop to "
The distribution map to sort from big to small, (b) are the statistical Butut of the extra Trip Costs of iron net network " transfer stop to "；
Corresponding effect of optimization displaying figures of " transfer stop to " quantity N that Fig. 3 chooses and transfer stop that routing information is provided
Position distribution, wherein, (a) is average additional passengers number with the change curve of " transfer stop to " quantity N of selection, and (b) is average
For Trip Costs with the change curve of " transfer stop to " quantity N of selection, (c) is the transfer stop that need to provide routing information in MTR network
The location of in network；
Fig. 4 selects the corresponding effect of optimization of the trip proportion P in path to show according to the routing information that information system provides
Figure, wherein, (a) is change curve of the average additional passengers number with P, and (b) is change curve of the average travel cost with P.
Embodiment
The present invention is described in further detail with specific embodiment below in conjunction with the accompanying drawings, but not as the limit to the present invention
It is fixed.
It is a kind of to be used to alleviate the crowded routing resource of track traffic, as shown in Figure 1, first, to Rail traffic network
In passenger according to shortest-path method Selecting Travel Paths, calculate extra trip of all passengers in Rail traffic network
Cost；Then, the outer Trip Costs of total value in Rail traffic network between any two transfer stop are calculated；Then, to all
The outer Trip Costs of the total value of transfer stop pair are ranked up according to order from big to small, and positioning needs to provide the transfer of routing information
Stand pair；Finally, routing information is provided for passenger to information according to oriented transfer stop, oriented transfer stop is to multiplying
The passenger of P% selects water channel principium method trip route before the extra Trip Costs of visitor come, remaining all passenger's selection
Shortest-path method Selecting Travel Paths；It is crowded so as to alleviate track traffic；
Comprise the following steps that：
The present invention is based on track traffic brushing card data prediction peak hour OD amount.Brushing card data have recorded each passenger and enter the station
With the outbound time, therefore distribution map of the volume of traffic with the time can be obtained according to brushing card data, so as to obtain morning peak and evening
The time interval on peak, and then intercept out the OD of morning peak and evening peak.
The first step：Structure Beijing Metro network simultaneously predicts Beijing Metro peak hour OD；
Beijing Metro website and its connection relation are found from Beijing Metro official website, then with Google Earth (paddy
Sing map) each station geographical coordinate (including longitude and latitude) of software acquisition；Collect each block section between stations information, including starting point, end
Point, travel time and direction；Node and block section between stations information are converted into shape (map graph) file, so as to create north
Capital subway network.
Based on Beijing Metro brushing card data, predict the travel amount of Beijing Metro morning peak and evening peak, be respectively 2,028,
440 trips/hour and 1,692,770 trips/hour.
Second step：The distribution magnitude of traffic flow simultaneously calculates the extra Trip Costs between each transfer stop；
Distribute the magnitude of traffic flow according to shortest-path method, calculate extra trip of all passengers in Rail traffic network into
This.
Calculate the outer Trip Costs of the total value in Beijing Metro network between any two transfer stop and (pass through the two transfer stops
All passengers extra Trip Costs it is cumulative)；Then, outside to the total value of all " transfer stop to " (two transfer websites)
Trip Costs are ranked up according to order from big to small.(a) represents the outer Trip Costs of the total value of " transfer stop to " from big in Fig. 2
To the distribution map (50 first " transfer stop to ") of small sequence；(b) show that the extra Trip Costs of " transfer stop to " obey power law point
Most extra Trip Costs are occupied in cloth, i.e., least a portion of " transfer stop to ", and e.g., the total value of preceding ten " transfer stop to " is gone out
Row cost just accounts for the 23.2% of the outer Trip Costs of whole subway network total value.
3rd step：Positioning needs to provide the transfer stop of routing information；
A small amount of transfer stop is chosen, routing information is provided in these transfer stops, guiding passenger selects suitable path, alleviates
Track traffic is crowded.
Choose " transfer stop to " the corresponding effect of optimization of quantity N such as Fig. 3 that routing information is provided.(b) shows to choose in Fig. 3
The outer Trip Costs of total value come preceding ten " transfer stop to ", and all passengers for process this ten " transfer stop to " (account for always going out
5%) row amount provides water channel principium information, it is possible to so that the average travel cost of network drops to approximate minimum.And
(a) show, to reduce the average additional passengers number of whole network, it is necessary to provide routing information for more " transfer stops to ".When
When choosing 50 " transfer stop to " (account for total travel amount 15%), meet 1.00F0＜ F (N) ＜ 1.10F0.Wherein F0It is all
Passenger selects the average additional passengers number of Rail traffic network during water channel principium, dotted line in corresponding diagram.
After choosing " transfer stop to ", next statistics needs to provide the transfer website of routing information.If ten before choosing
" transfer stop to ", then only need to provide routing information in international trade station, West Second Qi station and Huo Yingzhan, wherein, international trade station need to carry
Information is selected for 6 paths, West Second Qi station need to provide 3 paths selection information, and Huo Yingzhan need to provide 1 paths selection information.
When scheming (c) and representing to choose 50 " transfer stop to ", 10 websites of routing information need to be provided (required for including each website
The location of the routing information quantity of offer) in subway network.
4th step：Position portion needs to provide the passenger of routing information
In practical applications, all passengers of " transfer stop to " that is positioned by the 3rd step are allowed all according to information system
The routing information of offer selects the path difficult, and Fig. 3 illustrates the routing information that is provided according to information system to select road
The corresponding effect of optimization of trip proportion P in footpath.P=0.3 be in the passenger of " transfer stop to " by positioning extra trip into
Originally preceding 30% passenger is come with water channel principium distribution path, remaining all passenger (including " transfer without positioning
Stand to " passenger) use shortest path distribution path.As shown in Figure 4, the effect of optimization of similar P=1 is just can reach during P=0.3.
Claims (2)
1. a kind of be used to alleviate the crowded routing resource of track traffic, it is characterised in that first, in Rail traffic network
Passenger according to shortest-path method Selecting Travel Paths, calculate extra trip of all passengers in Rail traffic network into
This；Then, the outer Trip Costs of total value in Rail traffic network between any two transfer stop are calculated；Then, all are changed
The outer Trip Costs of total value for multiplying station pair are ranked up according to order from big to small, and positioning needs to provide the transfer stop of routing information
It is right；Finally, routing information, the passenger of oriented transfer stop pair are provided for passenger to information according to oriented transfer stop
Extra Trip Costs come before the passenger of P% select water channel principium method trip route, remaining all passengers selection is most
Short-circuit routing method trip route；
Wherein, the Rail traffic network is formed by connecting side between node and node, and the node refers to Rail traffic network
In station, the connection side between the node and node refers to the block section between stations of Rail traffic network；
Trip Costs c of the passenger in Rail traffic network on every section of block section between stationsij(fij) refer to the j stations that i stands adjacent
Travel time cost and the sum of congestion costs：
<mrow>
<msub>
<mi>c</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>f</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>+</mo>
<mi>&alpha;</mi>
<msup>
<mrow>
<mo>(</mo>
<mfrac>
<msub>
<mi>f</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<msub>
<mi>M</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mfrac>
<mo>)</mo>
</mrow>
<mi>&beta;</mi>
</msup>
<mo>)</mo>
</mrow>
<msub>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>=</mo>
<msub>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>+</mo>
<mi>&alpha;</mi>
<msup>
<mrow>
<mo>(</mo>
<mfrac>
<msub>
<mi>f</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<msub>
<mi>M</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mfrac>
<mo>)</mo>
</mrow>
<mi>&beta;</mi>
</msup>
<msub>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mrow>
Wherein, fijAnd MijIt is illustrated respectively in the volume of the flow of passengers and rated capacity in mono- hour, t from station i to adjacent station jijTable
Show the travel time at the j stations that i stands adjacent, α represents congestion costs linear dimensions, and value range represents to gather around for 0.15~0.45, β
It is extruded into this index parameters, value range is 1~10；
Extra Trip Costs ce of the passenger in Rail traffic network on every section of track sectionij(fij) refer to that i stations are adjacent
J stations the sum of congestion costs：
<mrow>
<msub>
<mi>ce</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>f</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mi>&alpha;</mi>
<msup>
<mrow>
<mo>(</mo>
<mfrac>
<msub>
<mi>f</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<msub>
<mi>M</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mfrac>
<mo>)</mo>
</mrow>
<mi>&beta;</mi>
</msup>
<msub>
<mi>t</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mrow>
Extra Trip Costs of the passenger in transportation network are to go out walking along the street using what shortest-path method distributed to obtain passenger
Footpath, based on the sum of extra Trip Costs on the every section of block section between stations included in passenger's paths traversed；
The outer Trip Costs C of total value in the Rail traffic network between any two transfer stopERefer to by the two transfer stops
All passengers extra Trip Costs summation；
The positioning needs to provide the quantity N of the transfer stop pair of routing information by the first average additional passengers number F0Determine：
First, when making all passengers' selection water channel principium trips, the first average additional passengers number F is obtained0；
Then, by N from 0 gradually increase, when meeting 1.00F0＜ F (N) ＜ 1.10F0, the value of N is obtained, F (N) is represented by total
All passengers of the transfer stop pair of N are all with least cost routing Selecting Travel Paths, residue before extra Trip Costs come
Passenger with critical path method (CPM) Selecting Travel Paths when, the average additional passengers number of Rail traffic network；
Average additional passengers number refers to the additional passengers number divided by track block section between stations sum of track block section between stations, described additionally to multiply
Objective number refers to the passengers quantity more than vehicle rated passenger capacity；
The P is by the second average additional passengers number F1Determine：
First, when all passengers of transfer stop pair by positioning select water channel principium, and without the transfer of positioning
When all passengers to stand couple select shortest path, the second obtained average additional passengers number is F1；
Secondly, by P from 0 gradually increase, when meeting 1.00F1＜ F (P) ＜ 1.10F1When, obtain the value of P.
It is 2. according to claim 1 a kind of for alleviating the crowded routing resource of track traffic, it is characterised in that with
The sum of Trip Costs of all track sections form the total Trip Costs of Rail traffic network and reach minimum, to distribute rail transit network
The magnitude of traffic flow in network on every section of track, comprises the following steps that：
Step 1：Iterations n=1 is made, based on travel time tij, utilize the traffic of each track section of dijkstra's algorithm distribution
Flow, obtains the volume of the flow of passengers f of each track sectionij；
Step 2：Based on the volume of the flow of passengers of each track section, the Trip Costs of every section of track section are calculated, and are obtained according to the following formula
Take the Trip Costs conversion value of every section of track section
Step 3：The Trip Costs conversion value of the every section of track section obtained with step 2, track is distributed using dijkstra's algorithm
The magnitude of traffic flow, obtains the volume of the flow of passengers intermediateness value g of every section of track sectionij；
Step 4：Determine that iteration step length λ, λ meet formulagij nAnd fij n
It is illustrated respectively in during nth iteration and obtains the volume of the flow of passengers intermediateness value and iterative value of track section；
Step 5：Determine new iteration starting point：
Step 6：Test for convergence, judges the volume of the flow of passengers that every section of track section distributes in n-th and the volume of the flow of passengers of the (n+1)th sub-distribution
Whether do not change, i.e., whether meet formulaε is to judge the factor, ε ＜ 10-3If meet public
Formula, then stop iteration, with the volume of the flow of passengers iterative value distribution path on every section of current track section；Otherwise, return to step 2, with
fij n+1Recalculate the Trip Costs of every section of track section.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510300997.7A CN104899654B (en) | 2015-06-05 | 2015-06-05 | It is a kind of to be used to alleviate the crowded routing resource of track traffic |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510300997.7A CN104899654B (en) | 2015-06-05 | 2015-06-05 | It is a kind of to be used to alleviate the crowded routing resource of track traffic |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104899654A CN104899654A (en) | 2015-09-09 |
| CN104899654B true CN104899654B (en) | 2018-05-11 |
Family
ID=54032307
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510300997.7A Expired - Fee Related CN104899654B (en) | 2015-06-05 | 2015-06-05 | It is a kind of to be used to alleviate the crowded routing resource of track traffic |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104899654B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106296354B (en) * | 2016-08-08 | 2020-02-14 | 李建成 | Method and system for improving co-traffic rate of driver and passenger |
| CN106779190B (en) * | 2016-12-02 | 2020-03-31 | 东南大学 | Urban rail transit passenger travel path suggestion method and system |
| CN107067103A (en) * | 2017-03-22 | 2017-08-18 | 北京交通大学 | A kind of passenger's Path selection analysis method based on AFC system |
| CN110309936A (en) * | 2019-04-03 | 2019-10-08 | 广州市交通规划研究院 | A kind of sub-interchange recognition methods combined based on mobile phone location data and path estimating |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103793760A (en) * | 2014-01-24 | 2014-05-14 | 同济大学 | Multi-mode optimization method for comprehensive transportation junction interior passenger flow transfer distribution ratio |
| CN104537439A (en) * | 2014-12-29 | 2015-04-22 | 中南大学 | Minimal-cost path and mixed path distribution method for alleviating track traffic congestion |
| CN104599001A (en) * | 2015-02-12 | 2015-05-06 | 东南大学 | City streetcar, BRT and conventional bus transit network traffic allocation method and transfer junction determining method |
-
2015
- 2015-06-05 CN CN201510300997.7A patent/CN104899654B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103793760A (en) * | 2014-01-24 | 2014-05-14 | 同济大学 | Multi-mode optimization method for comprehensive transportation junction interior passenger flow transfer distribution ratio |
| CN104537439A (en) * | 2014-12-29 | 2015-04-22 | 中南大学 | Minimal-cost path and mixed path distribution method for alleviating track traffic congestion |
| CN104599001A (en) * | 2015-02-12 | 2015-05-06 | 东南大学 | City streetcar, BRT and conventional bus transit network traffic allocation method and transfer junction determining method |
Non-Patent Citations (3)
| Title |
|---|
| Congestion avoidance routing in urban rail transit networks;Kun He；Junjie Wang；Lianbo Deng；Pu Wang;《Intelligent Transportation Systems (ITSC)》;20141120;第200-205页 * |
| 出行者有限理性条件下的网络均衡分析及其应用研究;刘玉印;《中国博士学位论文全文数据库 工程科技Ⅱ辑》;20111215(第12期);第C034-42页 * |
| 城市轨道交通网络客流分配模型与计算方法研究;蔡晓春;《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》;20110915(第09期);第C033-40页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104899654A (en) | 2015-09-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103017780B (en) | The planing method of public bus network, system and device under mobile status | |
| CN104899654B (en) | It is a kind of to be used to alleviate the crowded routing resource of track traffic | |
| CN104408082B (en) | A kind of Metro Passenger method of servicing based on real time information | |
| CN104537439B (en) | It is a kind of to be used to alleviate the crowded water channel principium of track traffic and mixed path distribution method | |
| CN101187996B (en) | A quick bus line selection algorithm based on self-adapted backbone network | |
| CN107036617A (en) | The traffic path method and system for planning that a kind of taxi is combined with subway | |
| Gutiérrez-Jarpa et al. | Rapid transit network design for optimal cost and origin–destination demand capture | |
| CN103530694A (en) | Urban subway dynamic passenger flow distribution method constructed on the basis of time-space network | |
| Leurent et al. | A user equilibrium, traffic assignment model of network route and parking lot choice, with search circuits and cruising flows | |
| CN109612488B (en) | Big data micro-service-based mixed travel mode path planning system and method | |
| CN106203725A (en) | Door-to-door trip route scheme personalized recommendation method based on heuristic search | |
| CN105678410A (en) | Public traffic system space-time reachability modeling method of considering network connectivity time varying characteristics | |
| CN103020435B (en) | Rail transit trip path estimation method and system | |
| CN104217086A (en) | Urban public transport network optimization method | |
| CN103177561A (en) | Method and system for generating bus real-time traffic status | |
| CN106056242A (en) | High-speed train operating scheme evaluation method based on passenger flow dynamic allocation | |
| CN105718755B (en) | The high ferro network capabilities fitness-for-service assessment method dynamically distributed based on passenger flow | |
| Deng et al. | Optimal design of feeder-bus network related to urban rail line based on transfer system | |
| CN101587650A (en) | GPS bus transfering navigation method and system thereof | |
| CN107092986A (en) | The bus passenger travel route choice method based on website and collinearly run | |
| CN104318081A (en) | Method for allocating bicycles at public bicycle rental stations with urgent demand in city | |
| CN104599001A (en) | City streetcar, BRT and conventional bus transit network traffic allocation method and transfer junction determining method | |
| CN106294869A (en) | A kind of public traffic network modeling method with public bicycles subnet based on spatial network | |
| CN106203708A (en) | A kind of fast method solving urban track traffic last bus connection problem | |
| Mishra et al. | Joint travel demand and environmental model to incorporate emission pricing for large transportation networks |
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: 20180511 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |