CN103241268B - Subway departure time optimizing method for reducing transfer time of tunnel transfer stations - Google Patents
Subway departure time optimizing method for reducing transfer time of tunnel transfer stations Download PDFInfo
- Publication number
- CN103241268B CN103241268B CN201310165942.0A CN201310165942A CN103241268B CN 103241268 B CN103241268 B CN 103241268B CN 201310165942 A CN201310165942 A CN 201310165942A CN 103241268 B CN103241268 B CN 103241268B
- Authority
- CN
- China
- Prior art keywords
- circuit
- time
- train
- station
- classes
- 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
The invention discloses a subway departure time optimizing method for reducing transfer time of tunnel transfer stations. The subway departure time optimizing method includes steps of acquiring train numbers and arrival time intervals of all lines within a set study time range; computing the sum of transfer walking time of passengers of two platforms; judging whether to optimize departure time according to the ratio of average arrival time interval of the two lines and the sum of the transfer walking time of the two platforms; optimizing departure train numbers and the time arriving a station S of the first line to the fourth line within the study time range; and aiming to optimize train numbers of previous and later lines to be identical, adjusting the obtained departure train numbers and the obtained time arriving the station S of the first line to the fourth line. The subway departure time optimizing method for reducing transfer time of tunnel transfer stations can guarantee that passengers walk to a transfer platform as soon as a train to be transfer arrives and keep the original train number without change, thus, transfer time of passengers can be shortened, attraction of subway is improved, the problem of traffic jam caused by private cars is alleviated, and operating cost of subway operation enterprises cannot be additionally added.
Description
Technical field
The present invention relates to metro operation management technique field, particularly relate to a kind of subway departure time optimization method reducing the passage transfer stop transfer time.
Background technology
At present, China is in the critical period of social economy and urbanization high speed development, and city size constantly expands, and Car ownership rapidly increases, and the thing followed is day by day serious Urban Traffic Jam Based.Greatly develop public transport and become the important channel alleviating the problem such as urban congestion, traffic pollution, and the advantages such as subway is high with its punctual rate, freight volume is large, comfortable and energy-conserving and environment-protective obtain extensive accreditation, obtain the favor in more and more city.
Subway gauze can form the backbone network of urban public transport, but cannot overlap with all travelling OD point, the trip service of " door-to-door " can not being provided to passenger, in order to improve the Occupation coefficient of metro operation service, just needing to consider the transfer between subway line.Transfer passenger flow organizational form between subway line has passage to change to, changes on the same stage, outer transfer etc. of standing, wherein in the majority with passage transfer manner.Passage transfer refers at two line infalls, and the platform of two circuits to be connected with stair by interface channel to be changed to for passenger.In metro operation peak period, the order of classes or grades at school of dispatching a car of subway train is intensive, and it is shorter that passenger changes to wait time, and transfer stop does not need the coordination optimization carrying out the train departure moment.And in off-peak period, the departure interval of subway train is longer, it is long that passenger changes to wait time.
This situation is changed to for subway off-peak period passage, operator does not have the time of departure according to transfer passenger's walking time and two circuit departure interval coordination optimizations, two circuit trains, remain and use conventional methods according to passenger flow to arrange the time of departure, this considerably increases the time that transfer passenger waits for, adverse effect is created to the convenience of going on a journey, traveling comfort, weaken the attractive force of subway, become the important restriction factor of urban public transport development.
Summary of the invention
The object of the invention is for overcoming the deficiencies in the prior art, for the passage transfer stop that off-peak period subway two subway lines intersect, provide a kind of subway departure time optimization method reducing the passage transfer stop transfer time, after the method has considered the transfer walking time of transfer passenger in passage and the original order of classes or grades at school of dispatching a car of train, the time of departure of two subway line trains is optimized, while passenger walks to transfer platform, make to change to train to enter the station as far as possible, and keep original order of classes or grades at school constant, so both can shorten the transfer time of passenger, thus allow passenger pay the utmost attention to subway trip, alleviate the large problem that urban highway is crowded, simultaneously, also the running cost of metro operation company can not additionally be increased.
For achieving the above object, concrete grammar of the present invention is as follows:
Reduce the subway departure time optimization method of passage transfer stop transfer time, comprise the following steps:
Step 1, within the setting research period, gather each circuit order of classes or grades at school and interval of arriving at a station: establish two subway lines intersecting at passage transfer station S to be respectively a line and b line, a line up-downlink direction circuit is respectively circuit one and circuit two, b line up-downlink direction circuit is respectively circuit three and circuit four, described passage transfer station refers at two subway line infalls, article two, the platform of subway line is connected the subway station changed to for passenger with stair by interface channel, choose research time opening A and end time B, described research period overall length is T, T is greater than 30 minutes, establish circuit one in the research period respectively, circuit two, the get to the station order of classes or grades at school number of S of circuit three and circuit four train is I, J, K, L, and the get to the station equispaced of S of circuit one, circuit two, circuit three and circuit four train is
with
Step 2, calculate two platform passengers and change to walking time sum, be designated as C:C=w
1+ w
2, wherein w
1for transfer passenger from a line platform to b line platform needed for walking time, w
2for walking time needed for from b line platform to a line platform;
Whether step 3, on average to arrive at a station according to two circuits interval and the two platform passengers ratio in judgement of changing between walking time sum carry out the optimization at the time of departure: the interval of on average arriving at a station calculating a line and b line up-downgoing train S AT STATION respectively
with
calculate respectively
with the ratio r of C
a, r
b:
wherein " [] " operator representation is rounded up to integer-bit to result of calculation; If r
aor r
bequal 0, then represent that the train departure interval before optimizing is shorter, the transfer wait time of passenger is not long, without the need to being optimized frequency, terminates this optimizing process, otherwise expression needs frequency to be optimized, and enters step 4;
Step 4, time of dispatch a car order of classes or grades at school and the S that gets to the station of circuit one to circuit four train in the optimizing research period, concrete steps are:
Step 4-1, make the interval of arriving at a station of a line up-downgoing train of initial optimization S AT STATION equal, gap length is C
a, C
a=C × r
a, make the interval of arriving at a station of the b line up-downgoing train of initial optimization S AT STATION equal, gap length is C
b, C
b=C × r
b;
Step 4-2, use t
1, i' represent that circuit one i-th class of train after initial optimization within the research period gets to the station time of S, t
2, j' represent that circuit two jth class train after initial optimization within the research period gets to the station time of S, t
3, k' represent that circuit three kth class train after initial optimization within the research period gets to the station time of S, t
4, l' represent that circuit four l class train after initial optimization within the research period gets to the station time of S; Make get to the station train arrival time of S of circuit one and circuit two first shift within the research period identical, i.e. t
1,1'=t
2,1', and this time equal to optimize before in the research period circuit one first shift get to the station train arrival time of S, identical with J ' with the train order of classes or grades at school I ' of circuit two through the circuit one of the s that gets to the station of initial optimization in the research period: I '=J '=< (B-t
1,1')/C
a>+1=< (B-t
2,1')/C
a>+1, wherein " <> " operator representation is to result of calculation round numbers, and circuit one i-th class of train of initial optimization gets to the station the time t of s
1, i' be the i-th-1 class train arrival time t
1, (i-1)' add C
a, i.e. t
1, i'=t
1, (i-1)'+C
a, (i=2,3 ... I '), the circuit two jth class train of initial optimization gets to the station the time t of s
2, j' be jth-1 class of train arrival time t
2, (j-1)' add C
a, i.e. t
2, j'=t
2, (j-1)'+C
a, (j=2,3 ... J '), with set { t
1, i' and { t
2, j' represent the time studying in the period s that gets to the station through the circuit one of initial optimization and circuit two train respectively, (i=1,2 ... I ', j=1,2 ... J '); Make get to the station train arrival time of S of circuit three and circuit four first shift within the research period identical, i.e. t
3,1'=t
4,1', and this time equal t
1,1' add w
1, i.e. t
3,1'=t
4,1'=t
1,1'+w
1, identical with L ' with the train order of classes or grades at school K ' of circuit four through the circuit three of the s that gets to the station of initial optimization in the research period: K '=L '=< (B-t
3,1')/C
b>+1=< (B-t
4,1')/C
b>+1, the circuit three kth class train of initial optimization gets to the station the time t of s
3, k' be kth-1 class of train arrival time t
3, (k-1)' add C
b, i.e. t
3, k'=t
3, (k-1)'+C
b, (k=2,3 ... K '), the circuit four l class train of initial optimization gets to the station the time t of s
4, l' be l-1 class train arrival time t
4, (l-1)' add C
b, i.e. t
4, l'=t
4, (l-1)'+C
b, (l=2,3 ... L '), with set { t
3, k' and { t
4, l' represent the time studying in the period s that gets to the station through the circuit three of initial optimization and circuit four train respectively, (k=1,2 ... K ', l=1,2 ... L ').
Step 5, be all target mutually with each circuit train order of classes or grades at school before and after optimizing, the time of dispatch a car order of classes or grades at school and the S that gets to the station of circuit one to circuit four train that set-up procedure 4 obtains: if optimize rank rear vehicle shift time to be greater than the front order of classes or grades at school of optimization, then reduce the order of classes or grades at school of dispatching a car tentatively determined, if optimize rank rear vehicle shift time to be less than the front order of classes or grades at school of optimization, then increase the order of classes or grades at school of dispatching a car tentatively determined, after adjustment, finally determine to study each circuit train in the period get to the station time of S, concrete steps are:
Step 5-1, judge to optimize in the research period before and after circuit one to get to the station order of classes or grades at school I and I ' of s, if I '=I, then circuit one train that final optimization pass obtains gets to the station the time set { t of s
1, i}={ t
1, i'; If I ' <I, then need to increase (I-I ') class circuit one train, the n-th row train of increase gets to the station the time t of s
nthan { t
1, i' in
row train arrival C in evening time
a/ 2, namely
(n=1,2 ... I-I '), " [] " operational symbol meaning is the same, and the n row train arrival time of increase is added set { t
1, i' in, obtain through circuit one train of final optimization pass get to the station s time set { t
1, i, (i=1,2 ... I); If I ' >I, then at { t
1, i' in remove
the arrival time of row train
(n=1,2 ... I '-I), obtain through circuit one train of final optimization pass get to the station s time set { t
1, i, (i=1,2 ... I);
Step 5-2, judge to optimize in the research period before and after circuit two to get to the station order of classes or grades at school J and J ' of s, if J '=J, then circuit two train that final optimization pass obtains gets to the station the time set { t of s
2, j}={ t
2, j'; If J ' <J, then need to increase (J-J ') class circuit two train, the n-th row train of increase gets to the station the time t of s
nthan { t
2, j' in
row train arrival C in evening time
a/ 2, namely
(n=1,2 ... J-J '), the n row train arrival time of increase is added set { t
2, j' in, obtain through circuit two train of final optimization pass get to the station s time set { t
2, j, (j=1,2 ... J); If J ' >J, then at { t
2, j' in remove
the arrival time of row train
(n=1,2 ... J '-J), obtain through circuit two train of final optimization pass get to the station s time set { t
2, j, (j=1,2 ... J);
Step 5-3, judge to optimize in the research period before and after circuit three to get to the station order of classes or grades at school K and K ' of s, if K '=K, then circuit three train that final optimization pass obtains gets to the station the time set { t of s
3, k}={ t
3, k'; If K ' <K, then need to increase (K-K ') class circuit three train, the n-th row train of increase gets to the station the time t of s
nthan { t
3, k' in
row train arrival C in evening time
b/ 2, namely
(n=1,2 ... K-K '), the n row train arrival time of increase is added set { t
3, k' in, obtain through circuit three train of final optimization pass get to the station s time set { t
3, k, (k=1,2 ... K); If K ' >K, then at { t
3, k' in remove
the arrival time of row train
(n=1,2 ... K '-K), obtain through circuit three train of final optimization pass get to the station s time set { t
3, k, (k=1,2 ... K);
Step 5-4, judge to optimize in the research period before and after circuit four to get to the station order of classes or grades at school L and L ' of s, if L '=L, then circuit four train that final optimization pass obtains gets to the station the time set { t of s
4, l}={ t
4, l'; If L ' <L, then need to increase (L-L ') class circuit four train, the n-th row train of increase gets to the station the time t of s
nthan { t
4, l' in
row train arrival C in evening time
b/ 2, namely
(n=1,2 ... L-L '), the n row train arrival time of increase is added set { t
4, l' in, obtain through circuit four train of final optimization pass get to the station s time set { t
4, l, (l=1,2 ... L); If L ' >L, then at { t
4, l' in remove
the arrival time of row train
(n=1,2 ... L '-L), obtain through circuit four train of final optimization pass get to the station s time set { t
4, l, (l=1,2 ... L);
Step 6, each circuit train obtained from originating station to the travel time of station S and step 4 according to the different order of classes or grades at school train of each circuit get to the station time of S, determine to study each circuit subway train frequency after optimizing in the period.
In described step 1: the described research period should within the off-peak period of metro operation, off-peak period can be determined according to the ratio of the actual passenger capacity of subway train and subway train rated passenger capacity, when the ratio of the actual passenger capacity of subway train and subway train rated passenger capacity is less than 50%, think to be now the off-peak period of metro operation.
In described step 6: technical personnel according to the different order of classes or grades at school of four circuits in the historical data setting research period from originating station to the parking waiting time at each station of station s approach, and train running time is on the way definite value, running time in different for each circuit order of classes or grades at school parking period and way is added and obtains circuit one, circuit two, circuit three order of classes or grades at school train different from circuit four is from respective originating station to the travel time d of station s
1, i, d
2, j, d
3, kand d
4, l, i, j, k, l represent order of classes or grades at school, (i=1,2 ... I, j=1,2 ... J, k=1,2 ... K, l=1,2 ... L), finally obtain studying in the period f at the time of departure optimizing rear circuit one i-th class of train
1, i=t
1, i-d
1, i, (i=1,2 ... I), the f at the time of departure of circuit two jth class train
2, j=t
2, j-d
2, j, (j=1,2 ... J), the f at the time of departure of circuit three kth class train
3, k=t
3, k-d
3, k, (k=1,2 ... and the f at the time of departure of circuit four l class train K)
4, l=t
4, l-d
4, l, (l=1,2 ... L).
Beneficial effect: compared with prior art, the present invention has the following advantages:
1, towards the passage transfer mode that common two subway lines intersect, few for off-peak period train departure order of classes or grades at school, interval is large, the problem that transfer passenger's wait time is long, the present invention is the time of departure of two subway lines according to the transfer walking time coordination optimization of transfer passenger in passage, while passenger walks to transfer platform, make to change to train to enter the station as far as possible, greatly can shorten the time that passenger changes to wait like this, promote convenience and the traveling comfort of subway trip, improve the attractive force of subway in people's go off daily, alleviate the traffic jam issue caused by private car.
2, make the train departure order of classes or grades at school after optimization identical with before optimization, because conventional train departure plan considers formulation according to passenger flow and operation grade two aspect, so adopt the dispatch a car order of classes or grades at school identical with before optimization can not increase the operation cost of metro operation company while reducing transfer wait time, keep train order of classes or grades at school to coordinate mutually with passenger flow volume, avoid occurring that hypodynamic problem transported by the low or subway of subway passenger capacity.
Accompanying drawing explanation
Fig. 1 is the subway departure time optimization method diagram of circuit that the present invention reduces the passage transfer stop transfer time;
Fig. 2 is Line of Nanjing Subway line south extensions, No. two line circuit rough schematic views;
Fig. 3 studies circuit one, circuit three train arrival time and transfer passenger's wait time schematic diagram in the period before optimizing;
Fig. 4 be initial optimization the research period in circuit one, circuit three train arrival time and transfer passenger's wait time schematic diagram;
Fig. 5 is circuit one in research period of finally determining, circuit three train arrival time and transfer passenger's wait time schematic diagram.
Detailed description of the invention
Below in conjunction with accompanying drawing, the present invention is further described.
Reduce the subway departure time optimization method of passage transfer stop transfer time, the method diagram of circuit as shown in Figure 1, comprises the following steps.
Step 1, two subway lines intersecting at passage transfer station S are established to be respectively a line and b line, a line up-downlink direction circuit is respectively circuit one and circuit two, b line up-downlink direction circuit is respectively circuit three and circuit four, described passage transfer station refers at two subway line infalls, the platform of two circuits is connected the subway station changed to for passenger with stair by interface channel, choose research time opening A and end time B, described research period overall length is that T, T need be greater than 30 minutes; Establish circuit one in the research period respectively, circuit two, the get to the station order of classes or grades at school number of S of circuit three and circuit four train is I, J, K, L, and the get to the station equispaced of S of circuit one to circuit four train is
with
if transfer passenger's walking time needed for from a line platform to b line platform is w
1, needed for from b line platform to a line platform, walking time is w
2;
In the present embodiment, choose Metro Line 1 in Nanjing south extensions and No. 2 lines as research object, two subway line circuits are as shown in Figure 2.Line of Nanjing Subway line south extensions are North gets Maigaoqiao, and to the east of China Medicine University, subway No. two lines starting point oil mill bridge station westerly, to through sky way station, station, Xin Jie Kou is the passage transfer stop of two subway lines.If Line of Nanjing Subway line is a line, Maigaoqiao station to China Medicine University station is circuit one, and China Medicine University station is circuit two to Maigaoqiao station, subway No. two lines are b line, bridge station, oil mill is to being circuit three through sky way station, and be circuit four through bridge station, sky way station to oil mill, station, Xin Jie Kou is station S; Choosing the research time opening is 10:00:00 and end time 11:00:00, research period overall length is one hour, gather circuit one in the research period on the spot, circuit two, circuit three and circuit four train get to the station order of classes or grades at school I=16, J=13, K=8, L=8 of S, the interval of arriving at a station of each circuit train S is AT STATION as shown in table 1, the average at interval of arriving at a station
for circuit one, circuit three, before optimizing, research period these two circuit train arrival times interior and transfer passenger's wait time schematic diagram are as shown in Figure 3, wherein on horizontal time shaft, dotted line represents that platform is without transfer passenger's time period, fine line represents that platform has the passenger in one class of train to need the time period of changing to, and heavy line represents that platform has the passenger in more than two classes or two classes trains to need the time period of changing to.In this example, transfer passenger walking time w1 needed for from a line platform to b line platform and walking time w2 needed for from b line platform to a line platform obtains according to field observation data.Adopt the method collection of random sampling to study 50 transfer passengers in the period and, from a line platform to b line platform required time, 85% transfer walking time in sampling sample is decided to be w
1, w
1=60 seconds, described 85% transfer walking time referred to that having the transfer passenger of 85% to complete within this time in sample walks to another platform from a platform; Adopting 50 transfer passengers in the collection research period that uses the same method and, from b line platform to a line platform required time, 85% transfer walking time in sampling sample being decided to be w
2, w
2=180 seconds.
The interval of arriving at a station of front each circuit train S AT STATION optimized by table 1
| Order of classes or grades at school | Circuit one | Circuit two | Circuit three | Circuit four |
| 1 | 11:01:13 | 11:02:02 | 11:02:24 | 11:04:36 |
| 2 | 11:05:07 | 11:06:57 | 11:10:49 | 11:12:17 |
| 3 | 11:09:03 | 11:11:50 | 11:19:12 | 11:19:56 |
| 4 | 11:12:32 | 11:16:23 | 11:27:29 | 11:27:29 |
| 5 | 11:16:29 | 11:21:21 | 11:35:21 | 11:34:37 |
| 6 | 11:20:11 | 11:26:09 | 11:43:39 | 11:41:55 |
| 7 | 11:24:10 | 11:30:36 | 11:51:36 | 11:49:08 |
| 8 | 11:27:47 | 11:35:12 | 11:59:42 | 11:56:38 |
| 9 | 11:31:50 | 11:39:52 | ─ | ─ |
| 10 | 11:35:48 | 11:44:32 | ─ | ─ |
| 11 | 11:39:18 | 11:49:12 | ─ | ─ |
| 12 | 11:43:16 | 11:53:52 | ─ | ─ |
| 13 | 11:47:04 | 11:58:32 | ─ | ─ |
| 14 | 11:50:48 | ─ | ─ | ─ |
| 15 | 11:54:30 | ─ | ─ | ─ |
| 16 | 11:58:13 | ─ | ─ | ─ |
Step 2, calculate the interval of on average arriving at a station of a line and b line up-downgoing train S AT STATION respectively
with
note C=w
1+ w
2, according to
with the ratio size of C judge whether to need to a, b two line subway train be optimized the time of departure, if need to optimize, enter step 3, otherwise terminate this optimizing process; Calculate respectively
with the ratio r of C
a, r
b:
wherein " [] " operator representation is rounded up to integer-bit to result of calculation; If r
aor r
bequal 0, then represent that the train departure interval before optimizing is shorter, the transfer wait time of passenger is not long, without the need to being optimized frequency, terminates this optimizing process, otherwise expression needs frequency to be optimized, and enters step 3;
In the present embodiment, the interval of on average arriving at a station of a line and b line up-downgoing train S AT STATION
divide 14 seconds,
divide 48 seconds; C=w
1+ w
2=240 seconds=4 minutes; Calculate respectively
with the ratio of C
due to r
aand r
ball be not equal to 0, meet optimal conditions, enter step 3.
Step 3, basis
with the interval C that arrives at a station of a line after C respectively calculation optimization and b line up-downgoing train S AT STATION
aand C
b; According to circuit one first time that train gets to the station and C in the research period
awith C
bvalue, tentatively determine to optimize the time of dispatch a car order of classes or grades at school and the S that gets to the station of circuit one to circuit four train in the rear research period; Step 3 is specifically further comprising the steps of:
Step 3-1, make the interval of arriving at a station of a line up-downgoing train of initial optimization S AT STATION equal, gap length is C
a, C
a=C × r
a, make the interval of arriving at a station of the b line up-downgoing train of initial optimization S AT STATION equal, gap length is C
b, C
b=C × r
b;
Step 3-2, use t
1, i' represent that circuit one i-th class of train after initial optimization within the research period gets to the station time of S, t
2, j' represent that circuit two jth class train after initial optimization within the research period gets to the station time of S, t
3, k' represent that circuit three kth class train after initial optimization within the research period gets to the station time of S, t
4, l' represent that circuit four l class train after initial optimization within the research period gets to the station time of S; Make get to the station train arrival time of S of circuit one and circuit two first shift within the research period identical, i.e. t
1,1'=t
2,1', and this time equal to optimize before in the research period circuit one first shift get to the station train arrival time of S, identical with J ' with the train order of classes or grades at school I ' of circuit two through the circuit one of the s that gets to the station of initial optimization in the research period: I '=J '=< (B-t
1,1')/C
a>+1=< (B-t
2,1')/C
a>+1, wherein " <> " operator representation is to result of calculation round numbers, and circuit one i-th class of train of initial optimization gets to the station the time t of s
1, i' be the i-th-1 class train arrival time t
1, (i-1)' add C
a, i.e. t
1, i'=t
1, (i-1) '+C
a, (i=2,3 ... I '), the circuit two jth class train of initial optimization gets to the station the time t of s
2, j' be jth-1 class of train arrival time t
2, (j-1)' add C
a, i.e. t
2, j'=t
2, (j-1)'+C
a, (j=2,3 ... J '), with set { t
1, i' and { t
2, j' represent the time studying in the period s that gets to the station through the circuit one of initial optimization and circuit two train respectively, (i=1,2 ... I ', j=1,2 ... J '); Make get to the station train arrival time of S of circuit three and circuit four first shift within the research period identical, i.e. t
3,1'=t
4,1', and this time equal t
1,1' add w
1, i.e. t
3,1'=t
4,1'=t
1,1'+w
1, identical with L ' with the train order of classes or grades at school K ' of circuit four through the circuit three of the s that gets to the station of initial optimization in the research period: K '=L '=< (B-t
3,1')/C
b>+1=< (B-t
4,1')/C
b>+1, the circuit three kth class train of initial optimization gets to the station the time t of s
3, k' be kth-1 class of train arrival time t
3, (k-1)' add C
b, i.e. t
3, k'=t
3, (k-1)'+C
b, (k=2,3 ... K '), the circuit four l class train of initial optimization gets to the station the time t of s
4, l' be l-1 class train arrival time t
4, (l-1)' add C
b, i.e. t
4, l'=t
4, (l-1)'+C
b, (l=2,3 ... L '), with set { t
3, k' and { t
4, l' represent the time studying in the period s that gets to the station through the circuit three of initial optimization and circuit four train respectively, (k=1,2 ... K ', l=1,2 ... L ').
In the present embodiment, the interval C that arrives at a station of a line up-downgoing train of initial optimization S AT STATION
a=C × r
a=4 minutes, the interval C that arrives at a station of the b line up-downgoing train of initial optimization S AT STATION
b=C × r
b=8 minutes, circuit one and circuit two first shift within the research period got to the station the train arrival time t of S
1,1'=t
2,1'=11:01:13, through the circuit one of the s that gets to the station of initial optimization and the train order of classes or grades at school I '=J '=< (B-t of circuit two
1,1')/C
a>+1=< (B-t
2,1')/C
a>+1=<0:58:47/0:04:00GreatT.Gr eaT.GT+1=15, circuit three and circuit four first shift within the research period gets to the station the train arrival time t of S
3,1'=t
4,1'=t
1,1'+w
1=11:02:13, through the circuit three of the s that gets to the station of initial optimization and train order of classes or grades at school K '=L '=8 of circuit four in the research period, as shown in table 2 through get to the station time of s of circuit one to circuit four train of initial optimization in the research period.For circuit one, circuit three, within the research period of initial optimization, these two circuit train arrival times and transfer passenger's wait time schematic diagram are as shown in Figure 4.
Step 4, be all target mutually with each circuit train order of classes or grades at school before and after optimizing, the time of dispatch a car order of classes or grades at school and the S that gets to the station of circuit one to circuit four train that set-up procedure 3 obtains, if optimize rank rear vehicle shift time to be greater than the front order of classes or grades at school of optimization, then reduce the order of classes or grades at school of dispatching a car tentatively determined, if optimize rank rear vehicle shift time to be less than the front order of classes or grades at school of optimization, then increase the order of classes or grades at school of dispatching a car tentatively determined, after adjustment, finally determine to study each circuit train in the period get to the station time of S; Step 4 is specifically further comprising the steps of:
Step 4-1, judge to optimize in the research period before and after circuit one to get to the station order of classes or grades at school I and I ' of s, if I '=I, then circuit one train that final optimization pass obtains gets to the station the time set { t of s
1, i}={ t
1, i'; If I ' <I, then need to increase (I-I ') class circuit one train, the n-th row train of increase gets to the station the time t of s
nthan { t
1, i' in
row train arrival C in evening time
a/ 2, namely
(n=1,2 ... I-I '), " [] " operational symbol meaning is the same, and the n row train arrival time of increase is added set { t
1, i' in, obtain through circuit one train of final optimization pass get to the station s time set { t
1, i, (i=1,2 ... I); If I ' >I, then at { t
1, i' in remove
the arrival time of row train
(n=1,2 ... I '-I), obtain through circuit one train of final optimization pass get to the station s time set { t
1, i, (i=1,2 ... I);
Step 4-2, judge to optimize in the research period before and after circuit two to get to the station order of classes or grades at school J and J ' of s, if J '=J, then circuit two train that final optimization pass obtains gets to the station the time set { t of s
2, j}={ t
2, j'; If J ' <J, then need to increase (J-J ') class circuit two train, the n-th row train of increase gets to the station the time t of s
nthan { t
2, j' in
row train arrival C in evening time
a/ 2, namely
(n=1,2 ... J-J '), the n row train arrival time of increase is added set { t
2, j' in, obtain through circuit two train of final optimization pass get to the station s time set { t
2, j, (j=1,2 ... J); If J ' >J, then at { t
2, j' in remove
the arrival time of row train
(n=1,2 ... J '-J), obtain through circuit two train of final optimization pass get to the station s time set { t
2, j, (j=1,2 ... J);
Step 4-3, judge to optimize in the research period before and after circuit three to get to the station order of classes or grades at school K and K ' of s, if K '=K, then circuit three train that final optimization pass obtains gets to the station the time set { t of s
3, k}={ t
3, k'; If K ' <K, then need to increase (K-K ') class circuit three train, the n-th row train of increase gets to the station the time t of s
nthan { t
3, k' in
row train arrival C in evening time
b/ 2, namely
(n=1,2 ... K-K '), the n row train arrival time of increase is added set { t
3, k' in, obtain through circuit three train of final optimization pass get to the station s time set { t
3, k, (k=1,2 ... K); If K ' >K, then at { t
3, k' in remove
the arrival time of row train
(n=1,2 ... K '-K), obtain through circuit three train of final optimization pass get to the station s time set { t
3, k, (k=1,2 ... K);
Step 4-4, judge to optimize in the research period before and after circuit three to get to the station order of classes or grades at school L and L ' of s, if L '=L, then circuit four train that final optimization pass obtains gets to the station the time set { t of s
4, l}={ t
4, l'; If L ' <L, then need to increase (L-L ') class circuit four train, the n-th row train of increase gets to the station the time t of s
nthan { t
4, l' in
row train arrival C in evening time
b/ 2, namely
(n=1,2 ... L-L '), the n row train arrival time of increase is added set { t
4, l' in, obtain through circuit four train of final optimization pass get to the station s time set { t
4, l, (l=1,2 ... L); If L ' >L, then at { t
4, l' in remove
the arrival time of row train
(n=1,2 ... L '-L), obtain through circuit four train of final optimization pass get to the station s time set { t
4, l, (l=1,2 ... L);
In the present embodiment, before and after optimizing in the research period, circuit one gets to the station the order of classes or grades at school I=16 of s, I '=15, and I ' <I, need increase by 1 class of train, and 1 row train of increase gets to the station time of s than late 2 minutes just fixed of the 8th row train arrival time; Before and after optimizing in the research period, circuit two gets to the station the order of classes or grades at school J=13 of s, J '=15, and J ' >J, needs the arrival time removing the former 5th and the 10 two train in just fixed arrival time-table, make final order of classes or grades at school equal 13; Before and after optimizing in the research period, circuit three gets to the station the order of classes or grades at school K=8 of s, and K '=8, do not need to adjust; Before and after optimizing in the research period, circuit four gets to the station the order of classes or grades at school L=8 of s, and L '=8, do not need to adjust; Get to the station time of s of circuit one to circuit four train finally obtained is as shown in table 2.For circuit one, circuit three, within the research period of final optimization pass, these two circuit train arrival times and transfer passenger's wait time schematic diagram are as shown in Figure 5.
Table 2 is through initial optimization and finally adjust each circuit train obtained and get to the station time of s
Step 5, each circuit train obtained from originating station to the travel time of station S and step 4 according to the different order of classes or grades at school train of each circuit get to the station time of S, determine to study each circuit subway train frequency after optimizing in the period.Its detailed process is: technical personnel according to the different order of classes or grades at school of four circuits in the historical data setting research period from originating station to the parking waiting time at each station of station s approach, and train running time is on the way definite value, running time in different for each circuit order of classes or grades at school parking period and way is added and obtains circuit one, circuit two, circuit three order of classes or grades at school train different from circuit four is from respective originating station to the travel time d of station s
1, i, d
2, j, d
3, kand d
4, l, i, j, k, l represent order of classes or grades at school, (i=1,2 ... I, j=1,2 ... J, k=1,2 ... K, l=1,2 ... L), finally obtain studying in the period f at the time of departure optimizing rear circuit one i-th class of train
1, i=t
1, i-d
1, i, (i=1,2 ... I), the f at the time of departure of circuit two jth class train
2, j=t
2, j-d
2, j, (j=1,2 ... J), the f at the time of departure of circuit three kth class train
3, k=t
3, k-d
3, k, (k=1,2 ... and the f at the time of departure of circuit four l class train K)
4, l=t
4, l-d
4, l, (l=1,2 ... L).
In the present embodiment, if circuit one different order of classes or grades at school train is from respective originating station to the travel time d of station s
1, i=15 minutes, (i=1,2 ... 16), circuit two different order of classes or grades at school train is from respective originating station to the travel time d of station s
2, j=28 minutes, (j=1,2 ... 13), circuit three different order of classes or grades at school train is from respective originating station to the travel time d of station s
3, k=23 minutes, circuit four different order of classes or grades at school train was from respective originating station to the travel time d of station s
4, l=36 minutes, the time of departure of rear four the circuit trains that are optimized thus, as shown in table 3.
The time of departure of rear each circuit train optimized by table 3
| Order of classes or grades at school | Circuit one | Circuit two | Circuit three | Circuit four |
| 1 | 10:46:13 | 10:33:13 | 10:39:13 | 10:26:13 |
| 2 | 10:50:13 | 10:37:13 | 10:47:13 | 10:34:13 |
| 3 | 10:54:13 | 10:41:13 | 10:55:13 | 10:42:13 |
| 4 | 10:58:13 | 10:45:13 | 11:03:13 | 10:50:13 |
| 5 | 11:02:13 | 10:53:13 | 11:11:13 | 10:58:13 |
| 6 | 11:06:13 | 10:57:13 | 11:19:13 | 11:06:13 |
| 7 | 11:10:13 | 11:01:13 | 11:27:13 | 11:14:13 |
| 8 | 11:14:13 | 11:05:13 | 11:35:13 | 11:22:13 |
| 9 | 11:16:13 | 11:13:13 | ─ | ─ |
| 10 | 11:18:13 | 11:17:13 | ─ | ─ |
| 11 | 11:22:13 | 11:21:13 | ─ | ─ |
| 12 | 11:26:13 | 11:25:13 | ─ | ─ |
| 13 | 11:30:13 | 11:29:13 | ─ | ─ |
| 14 | 11:34:13 | ─ | ─ | ─ |
| 15 | 11:38:13 | ─ | ─ | ─ |
| 16 | 11:42:13 | ─ | ─ | ─ |
In order to intuitively represent effect of optimization of the present invention, the wait time optimizing front and back transfer passenger is calculated as follows.Due to a line circuit one, between circuit two and b line circuit three, transfer passenger flow is there is hardly between circuit four, therefore only consider eight kinds of combinations being left, wherein circuit one changes to circuit three, circuit one changes to circuit four, and to change to wait time as shown in table 4, circuit two changes to circuit three, circuit two changes to circuit four, and to change to wait time as shown in table 5, circuit three changes to circuit one, circuit three changes to circuit two, and to change to wait time as shown in table 6, and circuit four changes to circuit one, and circuit four changes to circuit two, and to change to wait time as shown in table 7.Can see from table, the average transfer wait time that circuit one changes to each passenger of circuit three decrease 2 points 16 seconds, circuit one change to circuit four wait time decrease 1 point 38 seconds, circuit two change to circuit three wait time decrease 2 points 13 seconds, circuit two change to circuit four wait time decrease 1 point 33 seconds, circuit three change to circuit one wait time decrease 2 points 05 second, circuit three change to circuit two wait time decrease 1 point 44 seconds, circuit four change to circuit one wait time decrease 1 point 38 seconds, circuit four change to circuit two wait time decrease 1 point 51 seconds.The transfer walking time of transfer passenger in passage and the original order of classes or grades at school of dispatching a car of train are considered as seen, after coordination optimization is carried out to two subway line train departure times, the transfer wait time of passenger shortens greatly, contribute to promoting the attractive force of subway in people's go off daily, alleviate the traffic jam issue caused by private car, also do not have frequency increase, the extra running cost strengthening metro operation company, therefore effect of optimization is obvious simultaneously.
Table 4 is optimized front and back circuit one passenger and is changed to wait time
Table 5 is optimized front and back circuit two passenger and is changed to wait time
Table 6 is optimized front and back circuit three passenger and is changed to wait time
Table 7 is optimized front and back circuit four passenger and is changed to wait time
The above is only the preferred embodiment of the present invention; be noted that for those skilled in the art; under the premise without departing from the principles of the invention, can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (3)
1. reduce the subway departure time optimization method of passage transfer stop transfer time, it is characterized in that, the method comprises the following steps:
Step 1, within the setting research period, gather each circuit order of classes or grades at school and interval of arriving at a station: establish two subway lines intersecting at passage transfer station S to be respectively a line and b line, a line up-downlink direction circuit is respectively circuit one and circuit two, b line up-downlink direction circuit is respectively circuit three and circuit four, described passage transfer station refers at two subway line infalls, article two, the platform of subway line is connected the subway station changed to for passenger with stair by interface channel, choose research time opening A and end time B, described research period overall length is T, T is greater than 30 minutes, establish circuit one in the research period respectively, circuit two, the get to the station order of classes or grades at school number of S of circuit three and circuit four train is I, J, K, L, and the get to the station equispaced of S of circuit one, circuit two, circuit three and circuit four train is
with
Step 2, calculate two platform passengers and change to walking time sum, be designated as C:C=w
1+ w
2, wherein w
1for transfer passenger from a line platform to b line platform needed for walking time, w
2for walking time needed for from b line platform to a line platform;
Whether step 3, on average to arrive at a station according to two circuits interval and the two platform passengers ratio in judgement of changing between walking time sum carry out the optimization at the time of departure: the interval of on average arriving at a station calculating a line and b line up-downgoing train S AT STATION respectively
with
Calculate respectively
with the ratio r of C
a,
wherein " [] " operator representation is rounded up to integer-bit to result of calculation; If r
aor r
bequal 0, then represent that the train departure interval before optimizing is shorter, the transfer wait time of passenger is not long, without the need to being optimized frequency, terminates this optimizing process, otherwise expression needs frequency to be optimized, and enters step 4;
Step 4, time of dispatch a car order of classes or grades at school and the S that gets to the station of circuit one to circuit four train in the optimizing research period, concrete steps are:
Step 4-1, make the interval of arriving at a station of a line up-downgoing train of initial optimization S AT STATION equal, gap length is C
a, C
a=C × r
a, make the interval of arriving at a station of the b line up-downgoing train of initial optimization S AT STATION equal, gap length is C
b, C
b=C × r
b;
Step 4-2, use t
1, i' represent that circuit one i-th class of train after initial optimization within the research period gets to the station time of S, t
2, j' represent that circuit two jth class train after initial optimization within the research period gets to the station time of S, t
3, k' represent that circuit three kth class train after initial optimization within the research period gets to the station time of S, t
4, l' represent that circuit four l class train after initial optimization within the research period gets to the station time of S; Make get to the station train arrival time of S of circuit one and circuit two first shift within the research period identical, i.e. t
1,1'=t
2,1', and this time equal to optimize before in the research period circuit one first shift get to the station train arrival time of S, identical with J ' with the train order of classes or grades at school I ' of circuit two through the circuit one of the S that gets to the station of initial optimization in the research period: I '=J '=< (B-t
1,1')/C
a>+1=< (B-t
2,1')/C
a>+1, wherein " <> " operator representation is to result of calculation round numbers, and circuit one i-th class of train of initial optimization gets to the station the time t of S
1, i' be the i-th-1 class train arrival time t
1, (i-1)' add C
a, i.e. t
1, i'=t
1, (i-1)'+C
a, (i=2,3 ... I '), the circuit two jth class train of initial optimization gets to the station the time t of S
2, j' be jth-1 class of train arrival time t
2, (j-1)' add C
a, i.e. t
2, j'=t
2, (j-1)'+C
a, (j=2,3 ... J '), with set { t
1, i' and { t
2, j' represent the time studying in the period S that gets to the station through the circuit one of initial optimization and circuit two train respectively, (i=1,2 ... I ', j=1,2 ... J '); Make get to the station train arrival time of S of circuit three and circuit four first shift within the research period identical, i.e. t
3,1'=t
4,1', and this time equal t
1,1' add w
1, i.e. t
3,1'=t
4,1'=t
1,1'+w
1, identical with L ' with the train order of classes or grades at school K ' of circuit four through the circuit three of the S that gets to the station of initial optimization in the research period: K '=L '=< (B-t
3,1')/C
b>+1=< (B-t
4,1')/C
b>+1, the circuit three kth class train of initial optimization gets to the station the time t of S
3, k' be kth-1 class of train arrival time t
3, (k-1)' add C
b, i.e. t
3, k'=t
3, (k-1)'+C
b, (k=2,3 ... K '), the circuit four l class train of initial optimization gets to the station the time t of S
4, l' be l-1 class train arrival time t
4, (l-1)' add C
b, i.e. t
4, l'=t
4, (l-1)'+C
b, (l=2,3 ... L '), with set { t
3, k' and { t
4, l' represent the time studying in the period S that gets to the station through the circuit three of initial optimization and circuit four train respectively, (k=1,2 ... K ', l=1,2 ... L ');
Step 5, be all target mutually with each circuit train order of classes or grades at school before and after optimizing, the time of dispatch a car order of classes or grades at school and the S that gets to the station of circuit one to circuit four train that set-up procedure 4 obtains: if optimize rank rear vehicle shift time to be greater than the front order of classes or grades at school of optimization, then reduce the order of classes or grades at school of dispatching a car tentatively determined, if optimize rank rear vehicle shift time to be less than the front order of classes or grades at school of optimization, then increase the order of classes or grades at school of dispatching a car tentatively determined, after adjustment, finally determine to study each circuit train in the period get to the station time of S, concrete steps are:
Step 5-1, judge to optimize in the research period before and after circuit one to get to the station order of classes or grades at school I and I ' of S, if I '=I, then circuit one train that final optimization pass obtains gets to the station the time set { t of S
1, i}={ t
1, i'; If I ' <I, then need to increase (I-I ') class circuit one train, the n-th row train of increase gets to the station the time t of S
nthan { t
1, i' in
row train arrival C in evening time
a/ 2, namely
(n=1,2 ... I-I '), " [] " operational symbol meaning is the same, and the n row train arrival time of increase is added set { t
1, i' in, obtain through circuit one train of final optimization pass get to the station S time set { t
1, i, (i=1,2 ... I); If I ' >I, then at { t
1, i' in remove
the arrival time of row train
(n=1,2 ... I '-I), obtain through circuit one train of final optimization pass get to the station S time set { t
1, i, (i=1,2 ... I);
Step 5-2, judge to optimize in the research period before and after circuit two to get to the station order of classes or grades at school J and J ' of S, if J '=J, then circuit two train that final optimization pass obtains gets to the station the time set { t of S
2, j}={ t
2, j'; If J ' <J, then need to increase (J-J ') class circuit two train, the n-th row train of increase gets to the station the time t of S
nthan { t
2, j' in
row train arrival C in evening time
a/ 2, namely
(n=1,2 ... J-J '), the n row train arrival time of increase is added set { t
2, j' in, obtain through circuit two train of final optimization pass get to the station S time set { t
2, j, (j=1,2 ... J); If J ' >J, then at { t
2, j' in remove
the arrival time of row train
(n=1,2 ... J '-J), obtain through circuit two train of final optimization pass get to the station S time set { t
2, j, (j=1,2 ... J);
Step 5-3, judge to optimize in the research period before and after circuit three to get to the station order of classes or grades at school K and K ' of S, if K '=K, then circuit three train that final optimization pass obtains gets to the station the time set { t of S
3, k}={ t
3, k'; If K ' <K, then need to increase (K-K ') class circuit three train, the n-th row train of increase gets to the station the time t of S
nthan { t
3, k' in
row train arrival C in evening time
b/ 2, namely
(n=1,2 ... K-K '), the n row train arrival time of increase is added set { t
3, k' in, obtain through circuit three train of final optimization pass get to the station S time set { t
3, k, (k=1,2 ... K); If K ' >K, then at { t
3, k' in remove
the arrival time of row train
(n=1,2 ... K '-K), obtain through circuit three train of final optimization pass get to the station S time set { t
3, k, (k=1,2 ... K);
Step 5-4, judge to optimize in the research period before and after circuit four to get to the station order of classes or grades at school L and L ' of S, if L '=L, then circuit four train that final optimization pass obtains gets to the station the time set { t of S
4, l}={ t
4, l'; If L ' <L, then need to increase (L-L ') class circuit four train, the n-th row train of increase gets to the station the time t of S
nthan { t
4, l' in
row train arrival C in evening time
b/ 2, namely
(n=1,2 ... L-L '), the n row train arrival time of increase is added set { t
4, l' in, obtain through circuit four train of final optimization pass get to the station S time set { t
4, l, (l=1,2 ... L); If L ' >L, then at { t
4, l' in remove
the arrival time of row train
(n=1,2 ... L '-L), obtain through circuit four train of final optimization pass get to the station S time set { t
4, l, (l=1,2 ... L);
Step 6, each circuit train obtained from originating station to the travel time of station S and step 5 according to the different order of classes or grades at school train of each circuit get to the station time of S, determine to study each circuit subway train frequency after optimizing in the period.
2. reduce the subway departure time optimization method of passage transfer stop transfer time as claimed in claim 1, it is characterized in that, in described step 1: the described research period should within the off-peak period of metro operation, off-peak period can be determined according to the ratio of the actual passenger capacity of subway train and subway train rated passenger capacity, when the ratio of the actual passenger capacity of subway train and subway train rated passenger capacity is less than 50%, think to be now the off-peak period of metro operation.
3. reduce the subway departure time optimization method of passage transfer stop transfer time as claimed in claim 1, it is characterized in that, in described step 6: technical personnel according to the different order of classes or grades at school of four circuits in the historical data setting research period from originating station to the parking waiting time at each station of station S approach, and train running time is on the way definite value, running time in different for each circuit order of classes or grades at school parking period and way is added and obtains circuit one, circuit two, circuit three order of classes or grades at school train different from circuit four is from respective originating station to the travel time d of station S
1, i, d
2, j, d
3, kand d
4, l, i, j, k, l represent order of classes or grades at school, (i=1,2 ... I, j=1,2 ... J, k=1,2 ... K, l=1,2 ... L), finally obtain studying in the period f at the time of departure optimizing rear circuit one i-th class of train
1, i=t
1, i-d
1, i, (i=1,2 ... I), the f at the time of departure of circuit two jth class train
2, j=t
2, j-d
2, j, (j=1,2 ... J), the f at the time of departure of circuit three kth class train
3, k=t
3, k-d
3, k, (k=1,2 ... and the f at the time of departure of circuit four l class train K)
4, l=t
4, l-d
4, l, (l=1,2 ... L).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310165942.0A CN103241268B (en) | 2013-05-07 | 2013-05-07 | Subway departure time optimizing method for reducing transfer time of tunnel transfer stations |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310165942.0A CN103241268B (en) | 2013-05-07 | 2013-05-07 | Subway departure time optimizing method for reducing transfer time of tunnel transfer stations |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103241268A CN103241268A (en) | 2013-08-14 |
| CN103241268B true CN103241268B (en) | 2015-06-03 |
Family
ID=48921222
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310165942.0A Expired - Fee Related CN103241268B (en) | 2013-05-07 | 2013-05-07 | Subway departure time optimizing method for reducing transfer time of tunnel transfer stations |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103241268B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104648443B (en) * | 2014-12-19 | 2016-08-24 | 北京易华录信息技术股份有限公司 | Subway dispatching method and the system of second can be accurate to during the change of a kind of dwell time |
| CN107016633B (en) * | 2017-03-29 | 2020-06-30 | 东南大学 | Method for generating planned departure time of receiving, transporting and transporting buses of urban rail transit |
| CN108738037B (en) * | 2017-04-17 | 2021-07-30 | 上海大唐移动通信设备有限公司 | Identification method and device |
| CN110718089A (en) * | 2019-10-15 | 2020-01-21 | Oppo（重庆）智能科技有限公司 | Travel service method, travel service device and computer readable storage medium |
| CN111114595B (en) * | 2019-12-13 | 2021-11-12 | 交控科技股份有限公司 | Adjustment method for switching in train number running chart |
| CN113635945B (en) * | 2021-07-19 | 2022-09-09 | 交控科技股份有限公司 | Train operation diagram adjusting method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101799981A (en) * | 2010-02-09 | 2010-08-11 | 华南理工大学 | Multi-mode public transport region scheduling control method |
| CN101980326A (en) * | 2010-11-11 | 2011-02-23 | 百度在线网络技术（北京）有限公司 | Method and device for establishing public transport transfer network |
| CN102061649A (en) * | 2010-12-29 | 2011-05-18 | 上海市城市建设设计研究院 | Circular island for short-distance transfer |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4294432B2 (en) * | 2003-10-16 | 2009-07-15 | 株式会社日立製作所 | Information processing apparatus, data management method according to plan data change, program, and recording medium |
-
2013
- 2013-05-07 CN CN201310165942.0A patent/CN103241268B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101799981A (en) * | 2010-02-09 | 2010-08-11 | 华南理工大学 | Multi-mode public transport region scheduling control method |
| CN101980326A (en) * | 2010-11-11 | 2011-02-23 | 百度在线网络技术（北京）有限公司 | Method and device for establishing public transport transfer network |
| CN102061649A (en) * | 2010-12-29 | 2011-05-18 | 上海市城市建设设计研究院 | Circular island for short-distance transfer |
Non-Patent Citations (1)
| Title |
|---|
| "城市轨道交通系统的换乘研究";周立新 等;《城市轨道交通研究》;20011231(第4期);35-38 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103241268A (en) | 2013-08-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103241268B (en) | Subway departure time optimizing method for reducing transfer time of tunnel transfer stations | |
| CN105205557B (en) | A kind of City Routine Transit Network Design method | |
| CN104574970B (en) | The connection traffic behavior evaluation methodology of Urban Underground shutdown system gateway | |
| CN100425768C (en) | Zero commuter station structure of bus and zero transferring fast public traffic system | |
| CN103761589B (en) | A kind of distribution method for urban rail transit | |
| CN104217129A (en) | Passenger flow estimation method for urban rail road network | |
| CN102737129A (en) | Method for compiling bus regional running timetable | |
| CN104239726A (en) | Passenger flow estimation system under condition of urban rail road network emergency | |
| CN107180538B (en) | A kind of recognition methods of vehicle-mounted track traffic direction | |
| CN108090668A (en) | Urban track traffic for passenger flow matching and the timetable method of adjustment of time-varying passenger flow driving | |
| CN104464276B (en) | A kind of dispatching method preventing bus concentration from arriving at a station based on GPS technology | |
| CN104192148B (en) | A kind of major trunk roads speed planing method based on traffic signal information precognition | |
| CN105427604B (en) | Performance public transport is passed unimpeded the implementation method of index | |
| CN103793760A (en) | Multi-mode optimization method for comprehensive transportation junction interior passenger flow transfer distribution ratio | |
| CN103310062A (en) | Simulation testing device and simulation testing method of urban rail transit line | |
| CN108830399A (en) | What a kind of rail traffic website plugged into the facility equilibrium of supply and demand optimizes and revises method | |
| CN105679076A (en) | City bus transfer coordination scheduling method | |
| Liang et al. | Influence of bus stop location on traffic flow | |
| CN103714700B (en) | Method for determining urban traffic jam | |
| CN110148297B (en) | Parking transfer system using regular bus connection and optimization method | |
| CN109584546B (en) | Method for determining departure flow threshold of quick-conventional bus sharing lane | |
| WO2019051936A1 (en) | Dispatching method for multiplying transport capacity of rail transit train based on concept of primary and second train | |
| CN105575135B (en) | Green wave design system between a kind of main line bus station in high density road area | |
| Li et al. | Applicative suburban line pattern of urban rail transit in China | |
| CN109034593B (en) | Car-sharing priority management and control strategy implementation benefit evaluation method |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150603 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |