CN110378557A - A kind of staggered shifts policy evaluation method based on reverse traffic assignation - Google Patents

A kind of staggered shifts policy evaluation method based on reverse traffic assignation Download PDF

Info

Publication number
CN110378557A
CN110378557A CN201910500923.6A CN201910500923A CN110378557A CN 110378557 A CN110378557 A CN 110378557A CN 201910500923 A CN201910500923 A CN 201910500923A CN 110378557 A CN110378557 A CN 110378557A
Authority
CN
China
Prior art keywords
traffic
road network
section
period
volume
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
Application number
CN201910500923.6A
Other languages
Chinese (zh)
Other versions
CN110378557B (en
Inventor
王炜
戴随喜
陈坦
梁鸣璋
刘岩
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Southeast University
Original Assignee
Southeast University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Southeast University filed Critical Southeast University
Priority to CN201910500923.6A priority Critical patent/CN110378557B/en
Publication of CN110378557A publication Critical patent/CN110378557A/en
Application granted granted Critical
Publication of CN110378557B publication Critical patent/CN110378557B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0639Performance analysis of employees; Performance analysis of enterprise or organisation operations
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40Business processes related to the transportation industry
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02TCLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00Road transport of goods or passengers
    • Y02T10/10Internal combustion engine [ICE] based vehicles
    • Y02T10/40Engine management systems

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Theoretical Computer Science (AREA)
  • Educational Administration (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Game Theory and Decision Science (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Traffic Control Systems (AREA)

Abstract

The staggered shifts policy evaluation method based on reverse traffic assignation that the invention discloses a kind of, comprising the following steps: the positive basic road network of (A) building;(B) according to traveler from family's Departure time distribution, using multiple static traffic distribution method, before avoiding the peak hour on the road network of the basis of forward direction described in OD demand assignment to step (A);(C) the reversed basic road network of building;(D) according to staggered shifts policy, the working time of part traveler is postponed into a period of time;(E) Annual distribution arrived at the destination according to traveler after avoiding the peak hour, using multiple static traffic distribution method, on reversed road network described in the reversed OD demand assignment to step (C) after avoiding the peak hour;(F) it compares peak period step (B) and step (E) distributes resulting link counting and hourage, evaluation is made to staggered shifts policy.The present invention can make reasonable evaluation to staggered shifts policy, and provide reference for its formulation and implementation.

Description

A kind of staggered shifts policy evaluation method based on reverse traffic assignation
Technical field
The present invention relates to a kind of reverse traffic assignation technologies, belong to traffic policy evaluation field, and in particular to one kind is based on The staggered shifts policy evaluation method of reverse traffic assignation.
Background technique
With the fast development of Urbanization Process In China, Urban Traffic Jam Based is also got worse, in practice it has proved that, simply Transportation Infrastructure Construction of reinforcing not be the good plan for solving traffic congestion, and a large amount of stream of people and wagon flow Relatively centralized when Interior flowing is the main reason for causing traffic congestion problems in the city.
Staggered shifts are a kind of common Transportation Demand Management measures, and the purpose is to equilibrium traffic streams in time, are alleviated Contradiction between Supply and Demand.OD demand points out the trip between capable starting point (origin) and settled point (destination) Demand, i.e. the trip origin and destination volume of traffic.The domestic urban including Beijing, Hangzhou all implements trip policy at present, But lack the effective ways of evaluation staggered shifts policy at present, so that many staggered shifts policies are determined based on subjectivity, Its implementation result often will be until can just be evaluated after staggered shifts policy execution.
Summary of the invention
Goal of the invention: the effective ways that it is an object of the invention to solve to lack evaluation staggered shifts policy at present, so that Many staggered shifts policies are determined based on subjectivity, and implementation result often will be until that could obtain after staggered shifts policy execution To the problem of evaluation.
Technical solution: in order to solve the above-mentioned technical problem, the technical solution adopted by the present invention are as follows:
A kind of staggered shifts policy evaluation method based on reverse traffic assignation, comprising the following steps:
(A) the positive basic road network of building;
(B) each before avoiding the peak hour using multiple static traffic distribution method according to commuter person from family's Departure time distribution The OD demand assignment of period is on the basic road network of forward direction in step (A), before being avoided the peak hour each period each path or The volume of traffic and hourage on person section, and the Annual distribution that commuter person arrives at the destination before avoiding the peak hour;
(C) the reversed basic road network of building;
(D) according to staggered shifts policy, the part commuter working time of step (B) resulting specific time period is postponed one Section time, the Annual distribution that commuter person arrives at the destination after being avoided the peak hour;
(E) Annual distribution that commuter person arrives at the destination after avoiding the peak hour according to step (D), using multiple static state Method of traffic assignment obtains after avoiding the peak hour on reversed road network described in the reversed OD demand assignment to step (C) of day part Each period each path or the volume of traffic and hourage on section after avoiding the peak hour;
(F) peak period step (B) and step (E) on main section are compared and distributes the resulting volume of traffic and hourage, Evaluation is made to staggered shifts policy.
Further, the basic road network of forward direction described in step (A) characterizes intersection with node, uses directed line segment The section between intersection is characterized, the impedance in section is acquired by BPR function, specific as follows:
Wherein, taIndicate the impedance on a of section;t0Indicate time of vehicle operation when flow is 0 on section;qaIndicate section a On the volume of traffic;caIndicate the traffic capacity of section a;α, β are retardation coefficient.
Further, multiple static traffic distribution described in step (B) comprises the following processes:
(B1) entire peak period is divided into multiple minimum adjacent time inter ε, it is assumed that enter road network during [T, T+ ε] Commuter person be all to set out at the T moment;
(B2) assume in sufficiently long time λ, all vehicles into road network will all arrive at the destination, then each During traffic assignation, it is only necessary to consider vehicle of the moment during [T-λ-ε, T+ ε] that set out;
(B3) in each assigning process, vehicle that the previous period sets out by the basic traffic volume as this sub-distribution, The volume of traffic of the period will can be indicated according in identical pro rate to each path of previous period with following formula:
Wherein, TBDIndicate setting out the moment for first car;I indicates 0 to the integer between h,H indicates entire high The period number that peak divides, can be used formula h=[(TED-TBD- λ)/ε] it calculates, in formula, TEDIndicate setting out for last vehicle Moment;Expression sets out the moment in [T1,T2) the i-th paths on the volume of traffic;Expression sets out the moment in [T1, T2) the total volume of traffic;
(B4) user equilibrium model is established in each period, and is solved using Frank-Wolfe algorithm, before avoiding the peak hour Forward direction described in the OD demand assignment of day part to step (A) basis road network on, it is available avoid the peak hour before each period it is every The volume of traffic and its hourage on paths or section.
Further, in the step (B4), user equilibrium model is as follows:
Wherein, ta(xa) indicate link travel time taWith link counting xaBetween function;Indicate OD between (r, s) The path flow of kth paths;qrsIndicate OD to the distribution volume of traffic between (r, s);It indicates between section a and path k Connection relationship variable, when path k includes section a,Otherwise,
Further, in the step (B4), Frank-Wolfe algorithm is comprised the following steps:
Step 1: initialization, according to0-1 traffic flow distribution is carried out, the flow in each section is obtainedEnable n=1;
Step 2: updating the impedance in each section
Step 3: finding next step iteration direction: according to updated0-1 traffic flow distribution is being carried out, Obtain one group of additional flow
Step 4: it determines iteration step length: seeking the λ for meeting following formula with dichotomy:
Step 5: determine new iteration starting point:
Step 6: test for convergence, if metWherein ε is previously given error limit, ThenThe equilibrium solution exactly required, calculating terminate;Otherwise, n=n+1, return step 2 are enabled.
Further, in reversed basis road network described in step (C): the node and step of reversed basis road network (A) the corresponding node of the basic road network of forward direction described in is identical;The link proportion of reversed basis road network with just Corresponding link proportion size to basic road network is identical, contrary;The shortest path path of reversed basis road network It is opposite with the positive basic shortest path path direction of road network.
Further, staggered shifts policy described in step (D) specifically: for original attack time in [T1,T2] Between, ratio is the commuter person of η (0 < η < 1), their attack time will postpone a period of time τ, other commute out The working time of passerby is unaffected, and following formula specifically can be used to indicate:
Wherein, TBSIndicate the work start time of first car;TBSIndicate the work start time of last vehicle;After indicating staggered shifts policy execution, [T1,T2) volume of traffic in the period;J[T1,T2)Expression is avoided the peak hour before policy execution, [T1,T2) volume of traffic in the period.
Further, multiple static traffic described in step (E) distributes, will avoid the peak hour after day part identical as step (B) On reversed basis road network described in OD demand assignment to step (C), each period each path or road after being avoided the peak hour The volume of traffic and its hourage in section.
The utility model has the advantages that the present invention is compared with prior art:
The present invention can evaluate its implementation result before the implementation of staggered shifts scheme, be staggered shifts scheme It formulates and reference frame is provided.
Detailed description of the invention
Fig. 1 is basic flow chart of the invention;
Fig. 2 is positive basic road network schematic diagram in the method for the present invention;
Fig. 3 is reversed basic road network schematic diagram in the method for the present invention;
Fig. 4 is positive basic road network figure in the method for the present invention instance analysis;
Fig. 5 be in the method for the present invention instance analysis commuter person from family's Departure time distribution figure;
Fig. 6 is positive traffic distribution result figure before avoiding the peak hour in the method for the present invention instance analysis;
Fig. 7 is reversed basic road network figure in the method for the present invention instance analysis;
Fig. 8 is the time distribution map that commuter arrives at the destination after avoiding the peak hour in the method for the present invention instance analysis;
Fig. 9 is reverse traffic distribution result figure after avoiding the peak hour in the method for the present invention instance analysis;
Figure 10 is front and back traffic distribution result comparison diagram of avoiding the peak hour in the method for the present invention instance analysis.
Specific embodiment
The present invention is further illustrated with reference to the accompanying drawings and examples.
A kind of staggered shifts policy evaluation method based on reverse traffic assignation, comprising the following steps:
(A) the positive basic road network of building;
The basic road network of the forward direction characterizes intersection with node, between directed line segment characterization intersection The impedance in section, section is acquired by BPR function, specific as follows:
Wherein, taIndicate the impedance on a of section;t0Indicate time of vehicle operation when flow is 0 on section;qaIndicate section a On the volume of traffic;caIndicate the traffic capacity of section a;α, β are retardation coefficient.
(B) each before avoiding the peak hour using multiple static traffic distribution method according to commuter person from family's Departure time distribution The OD demand assignment of period is on the basic road network of forward direction in step (A), before being avoided the peak hour each period each path or The volume of traffic and hourage on person section, and the Annual distribution that commuter person arrives at the destination before avoiding the peak hour;
The multiple static traffic distribution comprises the following processes:
(B1) entire peak period is divided into multiple minimum adjacent time inter ε, it is assumed that enter road network during [T, T+ ε] Commuter person be all to set out at the T moment;
(B2) assume in sufficiently long time λ, all vehicles into road network will all arrive at the destination, then each During traffic assignation, it is only necessary to consider vehicle of the moment during [T-λ-ε, T+ ε] that set out;
(B3) in each assigning process, vehicle that the previous period sets out by the basic traffic volume as this sub-distribution, The volume of traffic of the period will can be indicated according in identical pro rate to each path of previous period with following formula:
Wherein, TBDIndicate setting out the moment for first car;I indicates 0 to the integer between h,H indicates entire high The period number that peak divides, can be used formula h=[(TED-TBD- λ)/ε] it calculates, in formula, TEDIndicate setting out for last vehicle Moment;Expression sets out the moment in [T1,T2) the i-th paths on the volume of traffic;Expression sets out the moment in [T1,T2) Total volume of traffic;
(B4) user equilibrium model is established in each period, and is solved using Frank-Wolfe algorithm, before avoiding the peak hour Forward direction described in the OD demand assignment of day part to step (A) basis road network on, it is available avoid the peak hour before each period it is every The volume of traffic and its hourage on paths or section.
In step (B4), user equilibrium model is as follows:
Wherein, ta(xa) indicate link travel time taWith link counting xaBetween function;Indicate OD between (r, s) The path flow of kth paths;qrsIndicate OD to the distribution volume of traffic between (r, s);It indicates to connect between section a and path k Relationship variable is connect, when path k includes section a,Otherwise,
Frank-Wolfe algorithm comprises the following steps:
Step 1: initialization, according to0-1 traffic flow distribution is carried out, the flow in each section is obtainedEnable n=1;
Step 2: updating the impedance in each section
Step 3: finding next step iteration direction: according to updated0-1 traffic flow distribution is being carried out, Obtain one group of additional flow
Step 4: it determines iteration step length: seeking the λ for meeting following formula with dichotomy:
Step 5: determine new iteration starting point:
Step 6: test for convergence, if metWherein ε is previously given error limit, ThenThe equilibrium solution exactly required, calculating terminate;Otherwise, n=n+1, return step 2 are enabled.
(C) the reversed basic road network of building;
In reversed basis road network: the basic road of forward direction described in the node and step (A) of reversed basis road network The corresponding node of road network is identical;The link proportion of reversed basis road network is corresponding with positive basic road network Link proportion size is identical, contrary;The shortest path path of reversed basis road network and positive basic road network are most Short circuit paths are contrary.
(D) according to staggered shifts policy, the part commuter working time of step (B) resulting specific time period is postponed one Section time, the Annual distribution that commuter person arrives at the destination after being avoided the peak hour;
Staggered shifts policy specifically: for original attack time in [T1,T2] between, ratio is η (0 < η < 1) Commuter person, their attack time will postpone a period of time τ, the working time of other commuters person is not by shadow It rings, following formula specifically can be used to indicate:
Wherein, TBSIndicate the work start time of first car;TBSIndicate the work start time of last vehicle;After indicating staggered shifts policy execution, [T1,T2) volume of traffic in the period;Expression is avoided the peak hour before policy execution, [T1,T2) volume of traffic in the period.
(E) Annual distribution that commuter person arrives at the destination after avoiding the peak hour according to step (D), using multiple static state Method of traffic assignment obtains after avoiding the peak hour on reversed road network described in the reversed OD demand assignment to step (C) of day part Each period each path or the volume of traffic and hourage on section after avoiding the peak hour;
Multiple static traffic distribution is identical as step (B), and the OD demand assignment of day part is to described in step (C) after avoiding the peak hour Reversed basic road network on, each period each path or the volume of traffic on section and its when travelling after being avoided the peak hour Between.
(F) peak period step (B) and step (E) on main section are compared and distributes the resulting volume of traffic and hourage, Evaluation is made to staggered shifts policy.
Embodiment
A kind of staggered shifts policy evaluation method based on reverse traffic assignation, comprising the following steps:
(A) the positive basic road network of building, as shown in Figure 3;
Positive basis road network section parameter is as shown in table 1;
1 section parameter list of table
Section The free flow time The traffic capacity
1 10 100
2 10 400
3 5 600
4 5 300
5 10 200
6 5 300
7 5 300
(B) according to commuter person from family's Departure time distribution, as shown in figure 4, by (6:15-9:45) during morning peak Transport need uses static traffic distribution method in every 5 minutes, is assigned on the basic road network of forward direction described in step (A), obtains The Annual distribution that commuter person arrives at the destination to before avoiding the peak hour is as shown in Figure 5;
(C) the reversed basic road network of building, as shown in Figure 6;
Reversed basis road network section parameter is identical with positive basic road network section parameter, specific such as table 1 It is shown;
(D) according to staggered shifts policy, commuter person of the time between 7:30-8:30 is arrived at the destination by 30% Working time postpones a hour, and the Annual distribution that commuter person arrives at the destination after being avoided the peak hour is as shown in Figure 7;
(E) Annual distribution that commuter person arrives at the destination after avoiding the peak hour according to step (D) uses for every 5 minutes Static traffic distribution method, reversed road network described in the reversed OD demand assignment to step (C) of day part after avoiding the peak hour On network, as a result as shown in Figure 8;
(F) peak period step (B) and step (E) on main section are compared and distributes the resulting volume of traffic and link proportion, As a result as shown in Figure 9, it can be seen that hourage peak period significantly decreases after avoiding the peak hour, and shows staggered shifts Policy Effect Than more significant, peak period traffic congestion can be alleviated to a certain extent.

Claims (8)

1. a kind of staggered shifts policy evaluation method based on reverse traffic assignation, which comprises the following steps:
(A) the positive basic road network of building;
(B) according to commuter person from family's Departure time distribution, using multiple static traffic distribution method, day part before avoiding the peak hour OD demand assignment on the basic road network of forward direction in step (A), each period each path or road before being avoided the peak hour The volume of traffic and hourage in section, and the Annual distribution that commuter person arrives at the destination before avoiding the peak hour;
(C) the reversed basic road network of building;
(D) according to staggered shifts policy, when the part commuter working time of step (B) resulting specific time period is postponed one section Between, commuter person arrives at the destination after being avoided the peak hour Annual distribution;
(E) Annual distribution that commuter person arrives at the destination after avoiding the peak hour according to step (D), using multiple static traffic Distribution method is avoided the peak hour after avoiding the peak hour on reversed road network described in the reversed OD demand assignment to step (C) of day part Each period each path or the volume of traffic and hourage on section afterwards;
(F) peak period step (B) and step (E) on main section are compared and distributes the resulting volume of traffic and hourage, to mistake Trip policy in peak makes evaluation.
2. the staggered shifts policy evaluation method according to claim 1 based on reverse traffic assignation, which is characterized in that step Suddenly the basic road network of forward direction described in (A) characterizes intersection with node, with the road between directed line segment characterization intersection Section, the impedance in section is acquired by BPR function, specific as follows:
Wherein, taIndicate the impedance on a of section;t0Indicate time of vehicle operation when flow is 0 on section;qaIt indicates on a of section The volume of traffic;caIndicate the traffic capacity of section a;α, β are retardation coefficient.
3. the staggered shifts policy evaluation method according to claim 1 based on reverse traffic assignation, which is characterized in that step Suddenly multiple static traffic distribution described in (B) comprises the following processes:
(B1) entire peak period is divided into multiple minimum adjacent time inter ε, it is assumed that enter the logical of road network during [T, T+ ε] Diligent traveler was set out at the T moment;
(B2) assume in sufficiently long time λ, all vehicles into road network will all arrive at the destination, then in each traffic In assigning process, it is only necessary to consider vehicle of the moment during [T-λ-ε, T+ ε] that set out;
(B3) in each assigning process, vehicle that the previous period sets out by the basic traffic volume as this sub-distribution, this when The volume of traffic of section will can be indicated according in identical pro rate to each path of previous period with following formula:
Wherein, TBDIndicate setting out the moment for first car;I indicates 0 to the integer between h,H indicates that entire peak is drawn The period number divided, can be used formula h=[(TED-TBD- λ)/ε] it calculates, in formula, TEDIndicate setting out the moment for last vehicle;Expression sets out the moment in [T1,T2) the i-th paths on the volume of traffic;Expression sets out the moment in [T1,T2) total The volume of traffic;
(B4) user equilibrium model is established in each period, and is solved using Frank-Wolfe algorithm, when each before avoiding the peak hour Section OD demand assignment to step (A) described in forward direction basis road network on, it is available avoid the peak hour before every road of each period The volume of traffic and its hourage on diameter or section.
4. the staggered shifts policy evaluation method according to claim 3 based on reverse traffic assignation, which is characterized in that institute It states in step (B4), user equilibrium model is as follows:
Wherein, ta(xa) indicate link travel time taWith link counting xaBetween function;Indicate OD to kth item between (r, s) The path flow in path;qrsIndicate OD to the distribution volume of traffic between (r, s);It indicates to connect between section a and path k and close It is variable, when path k includes section a,Otherwise,
5. the staggered shifts policy evaluation method according to claim 3 based on reverse traffic assignation, which is characterized in that institute It states in step (B4), Frank-Wolfe algorithm comprises the following steps:
Step 1: initialization, according to0-1 traffic flow distribution is carried out, the flow in each section is obtainedEnable n =1;
Step 2: updating the impedance in each section
Step 3: finding next step iteration direction: according to updated0-1 traffic flow distribution is being carried out, is being obtained One group of additional flow
Step 4: it determines iteration step length: seeking the λ for meeting following formula with dichotomy:
Step 5: determine new iteration starting point:
Step 6: test for convergence, if metWherein ε is previously given error limit, thenThe equilibrium solution exactly required, calculating terminate;Otherwise, n=n+1, return step 2 are enabled.
6. the staggered shifts policy evaluation method according to claim 1 based on reverse traffic assignation, which is characterized in that step Suddenly in reversed basis road network described in (C): forward direction basis described in the node and step (A) of reversed basis road network The corresponding node of road network is identical;The link proportion of reversed basis road network is corresponding with positive basic road network Link proportion size it is identical, it is contrary;The shortest path path of reversed basis road network and positive basic road network Shortest path path direction is opposite.
7. the staggered shifts policy evaluation method according to claim 1 based on reverse traffic assignation, which is characterized in that step Suddenly staggered shifts policy described in (D) specifically: for original attack time in [T1,T2] between, ratio is η (0 < η < 1) Commuter person, their attack time will postpone a period of time τ, the working time of other commuters person is not by shadow It rings, following formula specifically can be used to indicate:
Wherein, TESIndicate the work start time of first car;TESIndicate the work start time of last vehicle;Table After showing staggered shifts policy execution, [T1,T2) volume of traffic in the period;Expression is avoided the peak hour before policy execution, [T1,T2) when Between the volume of traffic in section.
8. the staggered shifts policy evaluation method according to claim 1 based on reverse traffic assignation, which is characterized in that step Suddenly the distribution of multiple static traffic described in (E) is identical as step (B), and the OD demand assignment of day part is to step (C) after avoiding the peak hour On the reversed basic road network, each period each path or the volume of traffic and its travelling on section after being avoided the peak hour Time.
CN201910500923.6A 2019-06-11 2019-06-11 Peak-shifting travel policy evaluation method based on reverse traffic distribution Active CN110378557B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910500923.6A CN110378557B (en) 2019-06-11 2019-06-11 Peak-shifting travel policy evaluation method based on reverse traffic distribution

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910500923.6A CN110378557B (en) 2019-06-11 2019-06-11 Peak-shifting travel policy evaluation method based on reverse traffic distribution

Publications (2)

Publication Number Publication Date
CN110378557A true CN110378557A (en) 2019-10-25
CN110378557B CN110378557B (en) 2023-05-05

Family

ID=68250064

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910500923.6A Active CN110378557B (en) 2019-06-11 2019-06-11 Peak-shifting travel policy evaluation method based on reverse traffic distribution

Country Status (1)

Country Link
CN (1) CN110378557B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114457873A (en) * 2022-03-13 2022-05-10 湖北泉洁二次供水工程有限公司 Intelligent data monitoring system for secondary water supply
CN114519933A (en) * 2022-01-29 2022-05-20 邱惠崧 Method and device for controlling appointed trip based on no-over-saturation state and storage medium
CN115472006A (en) * 2022-08-26 2022-12-13 武汉大学 Method for estimating commuting traffic flow of newly added road section of road network by utilizing mobile phone signaling data

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104881992A (en) * 2015-06-12 2015-09-02 天津大学 Urban public transport policy analysis platform based on multi-agent simulation
CN109003446A (en) * 2018-07-12 2018-12-14 重庆市城投金卡信息产业股份有限公司 A kind of city based on RFID data is avoided the peak hour current effect analysis method

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104881992A (en) * 2015-06-12 2015-09-02 天津大学 Urban public transport policy analysis platform based on multi-agent simulation
CN109003446A (en) * 2018-07-12 2018-12-14 重庆市城投金卡信息产业股份有限公司 A kind of city based on RFID data is avoided the peak hour current effect analysis method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
张晓田: "高速公路网络交通诱导分流方法研究", 《CNKI优秀硕士学位论文全文库》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114519933A (en) * 2022-01-29 2022-05-20 邱惠崧 Method and device for controlling appointed trip based on no-over-saturation state and storage medium
CN114519933B (en) * 2022-01-29 2023-11-21 邱惠崧 Method, device and storage medium for contract travel management and control based on non-oversaturation state
CN114457873A (en) * 2022-03-13 2022-05-10 湖北泉洁二次供水工程有限公司 Intelligent data monitoring system for secondary water supply
CN114457873B (en) * 2022-03-13 2023-11-07 湖北泉洁二次供水工程有限公司 Intelligent data monitoring system for secondary water supply
CN115472006A (en) * 2022-08-26 2022-12-13 武汉大学 Method for estimating commuting traffic flow of newly added road section of road network by utilizing mobile phone signaling data

Also Published As

Publication number Publication date
CN110378557B (en) 2023-05-05

Similar Documents

Publication Publication Date Title
CN110378557A (en) A kind of staggered shifts policy evaluation method based on reverse traffic assignation
WO2017045294A1 (en) Method for designing routine urban public transit network
CN104318758B (en) Based on multi-level multimodal Public transport network planning method
CN104881710A (en) Urban express delivering method based on vehicle self-organized network
CN110648022A (en) Community public transport network and departure frequency synchronous optimization method considering station full coverage for connecting subways
CN102880642A (en) Bus transfer method based on weighted directed network model
CN103942948A (en) Method for generating urban bus route network based on segmented splicing
CN103198104A (en) Bus station origin-destination (OD) obtaining method based on urban advanced public transportation system
CN104217579B (en) Transportation network key road segment searching method based on section sub-network redundancy
CN106203725A (en) Door-to-door trip route scheme personalized recommendation method based on heuristic search
CN110490381B (en) Bus trunk line planning method based on mixed integer planning
CN105225503A (en) Traffic control subarea is optimized and self-adapting regulation method
CN102880641B (en) Parametric bus transfer method in consideration of short-distance walking station pair
CN103530694A (en) Urban subway dynamic passenger flow distribution method constructed on the basis of time-space network
CN112561249B (en) Real-time demand-oriented city customized bus scheduling method
CN106017490A (en) Map display method, navigation server and navigation system
CN108765944A (en) Optimal traffic flow forecasting method based on multi-path collection and Congestion Toll method
CN107527137A (en) Urban mass transit network maturity determines method
CN108256969A (en) A kind of public bicycles lease point dispatcher-controlled territory division methods
CN104966135A (en) Bus route network optimization method based on reachability and reachability strength
CN103473606B (en) The public traffic network entirety transfer performance optimization method of the maximum shortest path length based on GIS
CN107730113A (en) A kind of quantitative evaluation method of the urban road network planning based on function
CN109238297A (en) A kind of user is optimal and the Dynamic User-Optimal Route Choice method of system optimal
CN115713207A (en) Hybrid bus service combination optimization method
CN112598305B (en) Urban road network important node identification method based on local structure flow

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant