CN103218670A - Urban railway traffic random passenger flow loading method - Google Patents
Urban railway traffic random passenger flow loading method Download PDFInfo
- Publication number
- CN103218670A CN103218670A CN2013100937842A CN201310093784A CN103218670A CN 103218670 A CN103218670 A CN 103218670A CN 2013100937842 A CN2013100937842 A CN 2013100937842A CN 201310093784 A CN201310093784 A CN 201310093784A CN 103218670 A CN103218670 A CN 103218670A
- Authority
- CN
- China
- Prior art keywords
- time
- path
- passenger
- track traffic
- urban track
- 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
Images
Abstract
The invention discloses an urban railway traffic random passenger flow loading method which comprises the following steps: 1.1, initializing, dividing one day into a plurality of time windows averagely, loading basic data, at the same time, setting the total number of the time windows as n, setting and marking an initial value of a variable t of the time windows as 1, and setting an initial value CN1 of road congestion charge as 0; 1.2, reading an origin and destination (OD) distribution volume of a tth time window, based on a basically effective path collection, calculating time of a first regular bus and a last regular bus of each path, judging the relationship of the time and the tth time window, and generating a dynamic effective path collection; 1.3, based on the dynamic effective path collection and an urban railway traffic passenger going-out path selection model, confirming a selected portion of each effective path between the OD, and obtaining a path flow; 1.4, performing statistics on a passenger flow of each section of a road, and updating the road congestion charge CNt+1; and 1.5, stopping the judgment, if the t is less than n, t=t+1 and continuing to iterate from the step 1.2, or, stopping the method.
Description
Technical field
The present invention relates to the track traffic technical field, relate in particular to a kind of urban track traffic passenger flow loading method at random.
Background technology
Urban track traffic network passenger flow loading at random is the final link of urban track traffic for passenger flow demand forecast, not only can obtain important passenger flow indexs such as section flow, transfer amount and circuit flow by the passenger flow loading is equipped with and the train operation plan establishment to instruct the train capacity, can also obtain different subject of operations' freight allocating table, so the passenger flow of efficiently and accurately is loaded with important practical sense.
Present urban track traffic network is the passenger flow loading method at random, is divided into based on the theoretical loading of collection meter with based on the loading of non-collection meter theory (Logit or Probit model).Based on the theoretical loading result of the passenger flow at random demonstration of collection meter is the macroscopic statistics rule, analyze the go on a journey microcosmic in path of passenger and select behavior and load the subordinate act Angle of Interpretation based on the passenger flow at random of non-collection meter theory, thus based on the passenger flow at random of non-collection meter theory load more can reflect reality, more accurate.But based on the urban track traffic network passenger flow loading at random of non-collection meter theory, lack of the influence of consideration road network topology structure and path trend at present to passenger's routing; Generally represent Congestion surcharge usefulness, can't reflect the continuous variation of Congestion surcharge, and partial parameters wherein generally derives from empirical value the influence of passenger's routing preference with piecewise function; The general influence of ignoring the restriction of first and last regular bus to the passenger flow loading result.
Summary of the invention
In order to overcome the deficiency of prior art structure, the invention provides a kind of urban track traffic passenger flow loading method at random.
The embodiment of the invention discloses a kind of urban track traffic passenger flow loading method at random, may further comprise the steps:
1.1, initialization, to on average be divided into a plurality of time windows in one day, and load OD abundance under road network topology data, time-table, each time window, the setting-up time window adds up to n simultaneously, the initial value of setting the variable t of mark time window is 1, sets the initial value CN of highway section Congestion surcharge with index
1=0;
1.2, read the OD abundance of t time window, based on basic active path set, calculate the first and last regular bus time in each path, judge the relation of this time and t time window, generate dynamic active path and gather RSET
t
1.3, based on dynamic active path set RSET
tWith the urban track traffic passenger path Choice Model of going on a journey, determine each active path selection percentage between OD, obtain the path flow, wherein, urban track traffic passenger urban track traffic passenger that the utility function of path Choice Model set up when basic active path set makes up in the step 1.2 routing utility function of going on a journey of going on a journey;
1.4, the volume of the flow of passengers of adding up each highway section, upgrade highway section Congestion surcharge CN
T+1
1.5, stop to judge that if t<n, then t=t+1 continues iteration from step 1.2; Otherwise this method stops.
Further, as preferably, the structure of basic active path set may further comprise the steps in the described step 1.2:
2.1, make up the urban track traffic passenger routing utility function of going on a journey, variable in the utility function walks line time, number of transfer and crowded cost element except admission fee, turnover station time, riding time, platform Waiting time, transfer, also introduced the angle expense and expressed the influence to passenger's routing of road network topology and path trend;
2.2, based on the equivalence riding time coefficient, other factors are converted into riding time one after another;
2.3, determine the tolerance threshold value of passenger to the time;
2.4, utilize the Double-sweep searching algorithm to determine the set of basic active path.
The present invention carries out having added when passenger flow loads first and last regular bus time restriction condition, and kernel model has been introduced the angle expense and has been expressed the influence to the passenger routing of road network structure and path trend, Congestion surcharge is treated to the product of compartment load factor and highway section working time, with of the continuous variation of same function reflection Congestion surcharge, loading rationality and path flow estimation precision have been improved to the influence of passenger's routing preference.
Description of drawings
When considered in conjunction with the accompanying drawings, by the reference following detailed, can more completely understand the present invention better and learn wherein many attendant advantages easily, but accompanying drawing described herein is used to provide further understanding of the present invention, constitute a part of the present invention, illustrative examples of the present invention and explanation thereof are used to explain the present invention, do not constitute to improper qualification of the present invention, wherein:
Fig. 1 is an embodiment of the invention urban track traffic passenger flow loading method process flow diagram at random.
Fig. 2 is an angle expense exemplary plot.
Embodiment
With reference to Fig. 1-2 embodiments of the invention are described.
For above-mentioned purpose, feature and advantage can be become apparent more, the present invention is further detailed explanation below in conjunction with the drawings and specific embodiments.
As shown in Figure 1, a kind of urban track traffic is the passenger flow loading method at random, and the embodiment of this method is as follows.
S1, initialization:
(1) on average be divided into each time window with one day, the 1st time window is the zero-time section of every day, and the initial value of setting the variable t of mark time window is 1, and time window adds up to n.
(2) load under road network topology data, time-table, each time window basic data such as OD abundance.
(3) the Congestion surcharge initial value used in highway section is 0, i.e. CN
1=0.
S2, read the t time window the OD(starting point to terminal) abundance, based on basic active path set, calculate the first and last regular bus time in each path, judge the relation of this time and t time window, generate dynamic active path and gather RSET
t(the active path set of t time window).
Dynamically active path is gathered RSET
tThe generation method, be under the t time window following processing to be done in each path in the set of basic active path: the first vehicle hour puts aside greater than this time window or the final vehicle hour path less than this time window; The path that first vehicle hour is between this time window is considered by normal current path; The path that final vehicle hour is between this time window is that node is refined as little time window with the final vehicle hour, and determines OD abundance under the little time window according to the proportion of the shared time window of little time window, and normal current path is can be regarded as in this path under this little time window.
S3, based on RSET
tWith the urban track traffic passenger path Choice Model (time window is in morning peak, evening peak or flat peak phase, model parameter difference) of going on a journey, determine each active path selection percentage between OD, obtain the path flow.
In the formula,
Be the volume of the flow of passengers of k bar active path between the OD from r to s (unit: person-time); q
RsBe the timesharing OD abundance from r to s (unit: person-time);
Be the routing effectiveness of k bar active path between the OD from r to s, the urban track traffic passenger who is set up during by the set of the basic active path among the S2 structure routing utility function of going on a journey is determined.
S4, S6, the volume of the flow of passengers of adding up each highway section are upgraded the highway section Congestion surcharge and are used.
CN
t+1=qplink*TRlink (2)
Wherein, CN
T+1The highway section Congestion surcharge usefulness of upgrading when being the t time iteration (unit: hour); Qplink is the highway section load factor; TRlink is the working time (unit: hour) in highway section.
S5, termination are judged.If t<n, then t=t+1 continues iteration from S2; Otherwise this method stops.
Wherein, the building process of basic active path set is as follows among the above-mentioned S2
(1) makes up the urban track traffic passenger routing utility function of going on a journey.
Based on MNL (Multinomial Logit) model, made up the urban track traffic passenger routing utility function of going on a journey, this function has not only been considered admission fee, turnover station time, riding time, platform Waiting time, has been changed to factors such as line time, number of transfer and Congestion surcharge, also introduced the angle expense and expressed the influence of road network topology and path trend, simultaneously Congestion surcharge has been treated to the product of compartment load factor and respective stretch working time passenger's routing.
In the formula,
Routing effectiveness for k paths between the OD from r to s;
I characteristic attribute value (comprise admission fee, turnover station time, riding time, platform Waiting time, change to line time, number of transfer, Congestion surcharge usefulness and angle expense factors such as (path trends)) for k paths between the OD from r to s; β
iParameter for the individual features attribute; M is the influence factor number.
Wherein, the angle expense, as Fig. 2, be that passenger's each highway section, path trend of going on a journey is departed from from the punishment of the through direction of origin-to-destination, this value should increase progressively with the increase of deviation angle and road section length, and variation tendency is also with the increasing progressively and increase of deviation angle, and promptly the angle cost function is that single order can be led, and derived function is the increasing function greater than 0, is expressed as follows:
In the formula:
Angle expense for k paths between the OD from r to s; L
iLength for the i highway section of this paths; θ
iFor departing from from the angle of the through direction of origin-to-destination in the i highway section of this paths, value is [0, π]; M is the highway section number of this paths.
This function has been considered admission fee, turnover station time, riding time, platform Waiting time, has been changed to line time, number of transfer, Congestion surcharge usefulness and angle expense factors such as (path trends).Especially the introducing of angle expense has been corrected all the time road network topology and path trend to the ignorance of the influence of passenger routing.
A. admission fee.Urban track traffic is chargeed dual mode, and the one, " flat fare "; Another kind is by traveling mileage block meter rate, thereby admission fee p is expressed as p=δ * p'.In the formula, δ is the sign amount, is 0 when " flat fare ", is 1 during the segmentation valuation; P' is the admission fee constant when " flat fare ", is the admission fee piecewise function during segmentation valuation.
B. pass in and out the station time, mainly comprise from swiping the card and entering the station the time of entering the station of platform and departures time, represent with IOt from platform to the departures of swiping the card.
C. riding time, mainly be included between the working time and station stopping time in the compartment, represent with IVt.
D. the platform Waiting time refers on platform and waits for the time that vehicle arrives, and represents with Wt.Waiting time mainly is subjected to the departure interval influence of (TSt) and compartment load factor (qplink) between the stopping time at the station of this platform of (Int), this car, the arrival obedience of supposing the passenger evenly distributes, and the passenger arrives at twice o'clock at vehicle and always once can get on the bus, and then the platform Waiting time is: Wt=(Int+TSt)/2+ δ ' * Int.Wherein, as qplink〉120% the time, δ ' gets 1, otherwise gets 0.
E. line time is walked in transfer, refers to the line time of walking from a train to another train, represents with Trt.
F. number of transfer is represented with Trs.
G. Congestion surcharge usefulness is represented path Congestion surcharge usefulness with VP.
Wherein, VP uses for the path Congestion surcharge; CN
U, i-1The highway section Congestion surcharge usefulness of the highway section u that upgrades when being the i-1 time iteration (unit: hour); If highway section u is on k paths between the OD from r to s,
Be 1, otherwise be 0.
H. angle expense (Angular Cost) is represented with AC, utilizes formula (3) to try to achieve.
The passenger utilizes the maximum likelihood estimation technique, t value method of inspection and goodness of fit criterion to carry out parameter calibration in morning peak, the trip routing preference difference of evening peak peace peak phase, and the result is as follows:
In the formula:
The routing effectiveness of k paths between the OD during for morning peak from r to s;
The routing effectiveness of k paths between the OD during for evening peak from r to s;
The routing effectiveness of k paths between the OD during for flat peak from r to s.Because of the present invention, so do not have the admission fee factor, i.e. δ=0 data from " a ticket system " urban track traffic network.
(2) equivalent time transforms, and based on formula (4) (5) (6), utilizes formula (8) respectively, can obtain the equivalent riding time of morning peak, evening peak peace each factor of peak phase.
ETTC
i=β
i/β
1 (9)
In the formula, ETTC
iIt is equivalent riding time coefficient of i attribute; β
iBe the coefficient of i attribute in model; β
1Be the coefficient of riding time in model.
(3) passenger analyzes the time degrees of tolerance, and the passenger comprises absolute tolerance and relative tolerance to the time to the tolerance of time, as formula (8)
T
i≤min(tt+H,C*t) (10)
In the formula, T
iFor OD to T.T. of certain paths; Tt be OD to T.T. of shortest path; H is an absolute threshold; C is a relative ratio.Advised C=2.7 H=13.39 minute.
(4) utilize the Double-sweep algorithm, filter out each OD to K bar shortest path, and then by the passenger to the restriction of the degrees of tolerance of time, the path that deletion does not satisfy condition constructs basic active path set.
Though more than described the specific embodiment of the present invention, but those skilled in the art is to be understood that, these embodiments only illustrate, those skilled in the art can carry out various omissions, replacement and change to the details of said method and system under the situation that does not break away from principle of the present invention and essence.For example, merge the said method step, then belong to scope of the present invention to realize the identical result of essence thereby carry out the essence identical functions according to the identical method of essence.Therefore, scope of the present invention is only limited by appended claims.
Claims (2)
1. urban track traffic passenger flow loading method at random is characterized in that, may further comprise the steps:
1.1, initialization, to on average be divided into a plurality of time windows in one day, and load OD abundance under road network topology data, time-table, each time window, the setting-up time window adds up to n simultaneously, the initial value of setting the variable t of mark time window is 1, sets the initial value CN that the highway section Congestion surcharge is used
1=0;
1.2, read the OD abundance of t time window, based on basic active path set, calculate the first and last regular bus time in each path, judge the relation of this time and t time window, generate dynamic active path and gather RSET
t
1.3, based on dynamic active path set RSET
tWith the urban track traffic passenger path Choice Model of going on a journey, determine each active path selection percentage between OD, obtain the path flow, wherein, urban track traffic passenger urban track traffic passenger that the utility function of path Choice Model set up when basic active path set makes up in the step 1.2 routing utility function of going on a journey of going on a journey;
1.4, the volume of the flow of passengers of adding up each highway section, upgrade highway section Congestion surcharge CN
T+1
1.5, stop to judge that if t<n, then t=t+1 continues iteration from step 1.2; Otherwise this method stops.
2. according to the described urban track traffic of claim 1 passenger flow loading method at random, it is characterized in that the structure of basic active path set may further comprise the steps in the described step 1.2:
2.1, make up the urban track traffic passenger routing utility function of going on a journey, variable in the utility function walks line time, number of transfer and crowded cost element except admission fee, turnover station time, riding time, platform Waiting time, transfer, also introduced the angle expense and expressed the influence to passenger's routing of road network topology and path trend;
2.2, based on the equivalence riding time coefficient, other factors are converted into riding time one after another;
2.3, determine the tolerance threshold value of passenger to the time;
2.4, utilize the Double-sweep searching algorithm to determine the set of basic active path.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310093784.2A CN103218670B (en) | 2013-03-22 | 2013-03-22 | Urban railway traffic random passenger flow loading method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310093784.2A CN103218670B (en) | 2013-03-22 | 2013-03-22 | Urban railway traffic random passenger flow loading method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN103218670A true CN103218670A (en) | 2013-07-24 |
CN103218670B CN103218670B (en) | 2017-02-08 |
Family
ID=48816435
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201310093784.2A Active CN103218670B (en) | 2013-03-22 | 2013-03-22 | Urban railway traffic random passenger flow loading method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103218670B (en) |
Cited By (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104376624A (en) * | 2014-07-22 | 2015-02-25 | 西南交通大学 | Urban rail transit passenger flow analysis method based on AFC (Automatic Fare Collection) passenger ticket data |
CN105427394A (en) * | 2015-12-03 | 2016-03-23 | 东南大学 | Congestion charging optimal toll rate determining method based on trial-and-error method and motor vehicle flow |
CN105447592A (en) * | 2015-11-12 | 2016-03-30 | 中国科学院深圳先进技术研究院 | Passenger route choice analysis method and passenger route choice analysis device |
WO2016045195A1 (en) * | 2014-09-22 | 2016-03-31 | 北京交通大学 | Passenger flow estimation method for urban rail network |
CN105882695A (en) * | 2016-03-17 | 2016-08-24 | 北京交通大学 | Foresight associated control method for passenger flow congestion of urban railway traffic network |
CN107067707A (en) * | 2017-03-23 | 2017-08-18 | 重庆交通大学 | A kind of bus operation and passenger's trip optimization system |
CN107273999A (en) * | 2017-04-27 | 2017-10-20 | 北京交通大学 | A kind of Flow Prediction in Urban Mass Transit method under accident |
CN107274000A (en) * | 2017-04-27 | 2017-10-20 | 北京交通大学 | Urban track traffic section passenger flow forecasting under a kind of accident |
CN107705039A (en) * | 2017-10-27 | 2018-02-16 | 华东交通大学 | Urban track traffic for passenger flow Precise control method and system based on passenger flow demand |
CN108647879A (en) * | 2018-05-08 | 2018-10-12 | 深圳市公安局公交分局 | Real-time congestion index computational methods, device and the medium of Metro Network |
CN110533219A (en) * | 2019-07-24 | 2019-12-03 | 北京交通大学 | The last time-table optimization method of urban track traffic |
CN110874668A (en) * | 2018-09-03 | 2020-03-10 | 深圳先进技术研究院 | Rail transit OD passenger flow prediction method, system and electronic equipment |
CN112949078A (en) * | 2021-03-17 | 2021-06-11 | 北京交通大学 | Urban rail transit passenger flow-traffic flow matching degree calculation method |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5177684A (en) * | 1990-12-18 | 1993-01-05 | The Trustees Of The University Of Pennsylvania | Method for analyzing and generating optimal transportation schedules for vehicles such as trains and controlling the movement of vehicles in response thereto |
CN102436603A (en) * | 2011-08-29 | 2012-05-02 | 北京航空航天大学 | Rail transit full-road-network passenger flow prediction method based on probability tree destination (D) prediction |
-
2013
- 2013-03-22 CN CN201310093784.2A patent/CN103218670B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5177684A (en) * | 1990-12-18 | 1993-01-05 | The Trustees Of The University Of Pennsylvania | Method for analyzing and generating optimal transportation schedules for vehicles such as trains and controlling the movement of vehicles in response thereto |
CN102436603A (en) * | 2011-08-29 | 2012-05-02 | 北京航空航天大学 | Rail transit full-road-network passenger flow prediction method based on probability tree destination (D) prediction |
Non-Patent Citations (1)
Title |
---|
徐瑞华等: "基于多路径的城市轨道交通网络分布模型及算法研究", 《铁道学报》, vol. 31, no. 2, 30 April 2009 (2009-04-30) * |
Cited By (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104376624A (en) * | 2014-07-22 | 2015-02-25 | 西南交通大学 | Urban rail transit passenger flow analysis method based on AFC (Automatic Fare Collection) passenger ticket data |
WO2016045195A1 (en) * | 2014-09-22 | 2016-03-31 | 北京交通大学 | Passenger flow estimation method for urban rail network |
CN105447592A (en) * | 2015-11-12 | 2016-03-30 | 中国科学院深圳先进技术研究院 | Passenger route choice analysis method and passenger route choice analysis device |
CN105427394A (en) * | 2015-12-03 | 2016-03-23 | 东南大学 | Congestion charging optimal toll rate determining method based on trial-and-error method and motor vehicle flow |
CN105882695B (en) * | 2016-03-17 | 2017-11-28 | 北京交通大学 | For the perspective association control method of Urban Rail Transit passenger flow congestion |
CN105882695A (en) * | 2016-03-17 | 2016-08-24 | 北京交通大学 | Foresight associated control method for passenger flow congestion of urban railway traffic network |
CN107067707A (en) * | 2017-03-23 | 2017-08-18 | 重庆交通大学 | A kind of bus operation and passenger's trip optimization system |
CN107067707B (en) * | 2017-03-23 | 2019-12-31 | 重庆交通大学 | Bus operation and passenger trip optimization system |
CN107274000B (en) * | 2017-04-27 | 2021-04-02 | 北京交通大学 | Urban rail transit section passenger flow prediction method under emergency |
CN107274000A (en) * | 2017-04-27 | 2017-10-20 | 北京交通大学 | Urban track traffic section passenger flow forecasting under a kind of accident |
CN107273999A (en) * | 2017-04-27 | 2017-10-20 | 北京交通大学 | A kind of Flow Prediction in Urban Mass Transit method under accident |
CN107705039A (en) * | 2017-10-27 | 2018-02-16 | 华东交通大学 | Urban track traffic for passenger flow Precise control method and system based on passenger flow demand |
CN107705039B (en) * | 2017-10-27 | 2020-12-01 | 华东交通大学 | Passenger flow demand-based urban rail transit passenger flow refined control method and system |
CN108647879A (en) * | 2018-05-08 | 2018-10-12 | 深圳市公安局公交分局 | Real-time congestion index computational methods, device and the medium of Metro Network |
CN110874668A (en) * | 2018-09-03 | 2020-03-10 | 深圳先进技术研究院 | Rail transit OD passenger flow prediction method, system and electronic equipment |
CN110874668B (en) * | 2018-09-03 | 2022-11-18 | 深圳先进技术研究院 | Rail transit OD passenger flow prediction method, system and electronic equipment |
CN110533219A (en) * | 2019-07-24 | 2019-12-03 | 北京交通大学 | The last time-table optimization method of urban track traffic |
CN110533219B (en) * | 2019-07-24 | 2022-07-22 | 北京交通大学 | Urban rail transit last train schedule optimization method |
CN112949078A (en) * | 2021-03-17 | 2021-06-11 | 北京交通大学 | Urban rail transit passenger flow-traffic flow matching degree calculation method |
CN112949078B (en) * | 2021-03-17 | 2023-12-05 | 北京交通大学 | Matching degree calculation method for urban rail transit passenger flow and traffic flow |
Also Published As
Publication number | Publication date |
---|---|
CN103218670B (en) | 2017-02-08 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103218670A (en) | Urban railway traffic random passenger flow loading method | |
Roncoli et al. | Traffic flow optimisation in presence of vehicle automation and communication systems–Part I: A first-order multi-lane model for motorway traffic | |
Van Vuren et al. | A multiple user class assignment model for route guidance | |
Cucala et al. | Fuzzy optimal schedule of high speed train operation to minimize energy consumption with uncertain delays and driver's behavioral response | |
Sumalee et al. | Stochastic multi-modal transport network under demand uncertainties and adverse weather condition | |
EP3141451B1 (en) | Intelligent train scheduling method | |
Tirachini et al. | Multimodal transport pricing: first best, second best and extensions to non-motorized transport | |
Nesheli et al. | Improved reliability of public transportation using real-time transfer synchronization | |
CN104504459B (en) | Logistics transportation optimization method and system | |
CN104884900A (en) | Travel time information providing apparatus and travel time information providing method | |
CN105205557A (en) | Design method for conventional urban public transit network | |
CN103208033A (en) | Access passenger flow forecasting method for urban rail transit new line under network condition | |
CN103208034B (en) | A kind of track traffic for passenger flow forecast of distribution model is set up and Forecasting Methodology | |
CN101964085A (en) | Method for distributing passenger flows based on Logit model and Bayesian decision | |
DE202013012418U1 (en) | Travel planning in public transport | |
CN101661668A (en) | Electronic navigation method for public transport | |
CN106651728B (en) | A kind of definite method of comprehensive system of transport passenger traffic mode advantage haul distance | |
Mirabel et al. | Bottleneck congestion pricing and modal split: Redistribution of toll revenue | |
CN106295817A (en) | A kind of for carrying out the method and apparatus dispatched of receiving lodgers in special line transportation system | |
CN105718755A (en) | Method for assessing network capacity applicability of high-speed rail based on passenger flow dynamic allocation | |
Deng et al. | Reduce bus bunching with a real-time speed control algorithm considering heterogeneous roadway conditions and intersection delays | |
Ku et al. | Interpretations of Downs–Thomson paradox with median bus lane operations | |
Inturri et al. | Modelling the impact of alternative pricing policies on an urban multimodal traffic corridor | |
Timofeeva et al. | Analysis of transport network development via probabilistic modelling | |
CN104573067B (en) | A kind of tramcar and BRT gauze comprehensive wiring methods |
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 |