CN107705591A - A kind of tramcar and the cooperative control method of social wagon flow - Google Patents

A kind of tramcar and the cooperative control method of social wagon flow Download PDF

Info

Publication number
CN107705591A
CN107705591A CN201710868230.3A CN201710868230A CN107705591A CN 107705591 A CN107705591 A CN 107705591A CN 201710868230 A CN201710868230 A CN 201710868230A CN 107705591 A CN107705591 A CN 107705591A
Authority
CN
China
Prior art keywords
mrow
msub
msubsup
mtd
tram
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
CN201710868230.3A
Other languages
Chinese (zh)
Other versions
CN107705591B (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 CN201710868230.3A priority Critical patent/CN107705591B/en
Publication of CN107705591A publication Critical patent/CN107705591A/en
Application granted granted Critical
Publication of CN107705591B publication Critical patent/CN107705591B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/07Controlling traffic signals
    • G08G1/087Override of traffic control, e.g. by signal transmitted by an emergency vehicle
    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/07Controlling traffic signals

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • Emergency Management (AREA)
  • Medicines Containing Antibodies Or Antigens For Use As Internal Diagnostic Agents (AREA)
  • Traffic Control Systems (AREA)

Abstract

本发明公开了一种有轨电车与社会车流的协同控制方法,包括如下步骤:(1)道路交通基础数据采集及信号公共周期的确定,(2)检测器的设置和激活,(3)到达检测器检测到有轨电车后,信号控制机生成有轨电车优先通行申请,按照有轨电车与社会车流的协同控制方法进行信号配时方案调整,(4)有轨电车到达检测器的关闭与开启。该技术方案将预测、信号优先、协调控制的技术合而为一,以保证有轨电车在交叉口间连续优先通行,同时使得社会车辆在交叉口的延误尽可能小。The invention discloses a method for coordinated control of trams and social traffic flow, which comprises the following steps: (1) collection of road traffic basic data and determination of signal common periods, (2) setting and activation of detectors, (3) arrival After the detector detects the tram, the signal control machine generates a tram priority application, and adjusts the signal timing scheme according to the coordinated control method of the tram and the social traffic flow. open. This technical solution combines the technologies of forecasting, signal priority, and coordinated control to ensure that trams continue to pass preferentially at intersections, and at the same time make the delay of social vehicles at intersections as small as possible.

Description

一种有轨电车与社会车流的协同控制方法A collaborative control method for trams and social traffic flow

技术领域technical field

本发明属于公交信号控制技术领域,用于有轨电车系统,涉及一种考虑现代有轨电车停站时间的有轨电车与社会车流的协同控制方法。The invention belongs to the technical field of bus signal control, is used for a tram system, and relates to a coordinated control method for a tram and social traffic flow considering the stop time of modern trams.

背景技术Background technique

从上世纪90年代的法国开始,现代有轨电车作为一种高效清洁的公共交通方式,逐渐风靡,但有轨电车需要足够的时空路权来保证其行驶效率和服务水平。近年来,不管是在科研研究领域还是专利应用领域,很少有涉及到有轨电车信号优先的方法,其中极少数涉及到的方法策略还主要属于主动式信号优先,给予有轨电车的优先幅度有限,且缺乏与其他交通方式间的协调,会对社会车辆的通行带来负面影响,这种现象在饱和度较高的时候更为明显。本发明便是在这样的背景下产生的。Beginning in France in the 1990s, modern trams have gradually become popular as an efficient and clean form of public transportation, but trams need sufficient time and space right of way to ensure their driving efficiency and service level. In recent years, no matter in the field of scientific research or patent application, there are few methods involving tram signal priority, and very few of the methods involved are mainly active signal priority, giving trams a priority range Limited and lack of coordination with other modes of transportation will have a negative impact on the traffic of social vehicles, and this phenomenon is more obvious when the saturation is high. The present invention is produced under such background.

发明内容Contents of the invention

本发明正是为解决地耦合天线测厚存在较大误差的不足,提供一种基于电磁波叠加原理的有轨电车与社会车流的协同控制方法,该方案为公路无损检测提供重要依据。The present invention is to solve the problem of relatively large errors in thickness measurement of ground-coupled antennas, and provides a coordinated control method for trams and social traffic flow based on the principle of electromagnetic wave superposition, which provides an important basis for non-destructive testing of highways.

为了实现上述发明目的,本发明采用如下技术方案:一种有轨电车与社会车流的协同控制方法,其特征在于,所述控制方法包括如下步骤:In order to achieve the above-mentioned purpose of the invention, the present invention adopts the following technical solutions: a coordinated control method for trams and social traffic flow, characterized in that the control method includes the following steps:

(1)道路交通基础数据采集及信号公共周期的确定,(1) Acquisition of road traffic basic data and determination of signal public cycle,

(2)检测器的设置和激活,(2) Detector setup and activation,

(3)到达检测器检测到有轨电车后,信号控制机生成有轨电车优先通行申请,按照有轨电车与社会车流的协同控制方法进行信号配时方案调整,(3) After the tram is detected by the arrival detector, the signal control machine generates a tram priority application, and adjusts the signal timing scheme according to the coordinated control method of the tram and the social traffic flow,

(4)有轨电车到达检测器的关闭与开启;协调路段实行优化后的信号控制方案,会暂时关闭有轨电车到达检测器,等到检测器检测到有轨电车离开协调路段后,结束本辆有轨电车的信号优先协同控制流程,恢复到原有的控制方案,此时有轨电车到达检测器重新启动,等待进入下一辆有轨电车的信号优先协同控制,若再次检测到有轨电车的到达,会重新进入步骤(3)。(4) Closing and opening of the tram arrival detector; the coordinated road section implements the optimized signal control scheme, which will temporarily close the tram arrival detector, and end the vehicle when the detector detects that the tram has left the coordination road section. The priority coordinated control process of the signal of the tram is restored to the original control scheme. At this time, the arrival detector of the tram is restarted, waiting for the signal priority of the next tram to be controlled. If the tram is detected again will re-enter step (3).

作为本发明的一种改进,所述步骤(1)具体如下,该步骤采用韦伯斯特公式计算信号周期,并取各交叉口中最大周期作为协调控制的公共周期;As a kind of improvement of the present invention, described step (1) is specifically as follows, this step adopts Webster's formula to calculate signal cycle, and gets maximum cycle in each crossing as the common cycle of coordinated control;

L=∑I(l+I-A);L= ∑I (l+IA);

C-韦伯斯特公式计算的周期时长(s);The cycle duration (s) calculated by the C-Webster formula;

L-周期损失时间(s);L-cycle loss time (s);

Y-交叉口总流量比;Y-intersection total flow ratio;

A-黄灯时间(s);A- yellow light time (s);

I-绿灯间隔时间(s);I-green light interval time (s);

l-启动损失时间(s),查表得;l- start-up loss time (s), look up the table;

yi=maxj(qij/Sij),第i相位的流量比;y i =max j (q ij /S ij ), the flow ratio of the i-th phase;

qij–第i相位第j车道的小时流量;q ij – the hourly traffic flow of the jth lane in the ith phase;

Sij-第i相位第j车道的通行能力,由基本通行能力得;S ij - the traffic capacity of the jth lane of the i-th phase, obtained from the basic traffic capacity;

通过相关分析,该方案所需的道路交通基础数据包括如下所示:各个交叉口车道数Nij和规定的车道方向即包括直行、左转、右转、直左、直右、左直右、左右转、相邻交叉口的间距lij等静态数据、交叉口的流量流向数据(各进口道的饱和度yi)、信号配时现状(黄灯时间A、一个周期内的相位数i、绿灯间隔时间I)等动态数据以及车辆停靠时间序列y,有轨电车到站实际时刻x1、上车人数x2、下车人数x3、与上一辆进站电车的车头时距x4,有轨电车长度Ltr,交叉口清空距离Ld,有轨电车速度Vtr等数据。Through correlation analysis, the road traffic basic data required by the program include as follows: the number of lanes N ij of each intersection and the prescribed lane directions include straight, left, right, straight left, straight right, left straight right, Static data such as left and right turns, distance l ij of adjacent intersections, flow direction data of intersections (saturation of each entrance y i ), signal timing status (yellow light time A, phase number i in one cycle, Dynamic data such as green light interval time I) and vehicle stop time series y, the actual arrival time of the tram x1, the number of people on board x2, the number of people getting off x3, the headway distance from the last incoming tram x4, the tram Length L tr , intersection clearing distance L d , tram speed Vtr and other data.

作为本发明的一种改进,步骤(2)中检测器的设置和激活具体如下,在协调控制区段上游入口处布置有轨电车到达检测器,在协调控制区段下游出口处布置有轨电车离开检测器,第一辆有轨电车通过离开检测器时,有轨电车到达检测器被激活,处于能够接收后续有轨电车优先申请的状态。As an improvement of the present invention, the setting and activation of the detectors in step (2) are specifically as follows, the tram arrival detector is arranged at the upstream entrance of the coordinated control section, and the tram is arranged at the downstream exit of the coordinated control section After leaving the detector, when the first tram passes the departure detector, the arrival detector of the tram is activated and is in a state capable of receiving subsequent tram priority applications.

作为本发明的一种改进,所述步骤(3)中,到达检测器检测到有轨电车后,信号控制机生成有轨电车优先通行申请,按照有轨电车与社会车流的协同控制方法进行信号配时方案调整,待检测器检测到有轨电车时,信号控制机生成有轨电车优先通行申请,具体如下;As an improvement of the present invention, in the step (3), after the arrival detector detects the tram, the signal control machine generates a tram priority application, and signals according to the coordinated control method of the tram and the social traffic flow. Timing scheme adjustment, when the detector detects a tram, the signal control machine generates a tram priority application, as follows;

31)有轨电车站点停靠时间预测:本次发明中的“有轨电车站点停靠时间”是基于SVM(支持向量机)进行预测的,可通过C++等软件进行操作;31) Tram stop time prediction: the "tram stop time" in this invention is predicted based on SVM (Support Vector Machine), which can be operated by software such as C++;

32)信号协调优化方案:通过31)的有轨电车站点停靠时间预测,可在此基础上得到电车到达交叉口停车线的时刻,然后结合社会车辆的到达率基于嵌套算法得到交叉口的绿灯时间与相位差等参数,并根据“绿灯时间与相位差”指标确定信号协调优化方案。32) Signal coordination optimization scheme: Through the prediction of the stop time of the tram station in 31), the time when the tram arrives at the stop line at the intersection can be obtained on this basis, and then the green light at the intersection can be obtained based on the nested algorithm combined with the arrival rate of social vehicles Time and phase difference and other parameters, and determine the signal coordination optimization scheme according to the "green light time and phase difference" index.

作为本发明的一种改进,步骤(31)中有轨电车站点停靠时间预测具体如下,将有轨电车到达停车线时间的预测过程简化,主要预测电车在站台的停靠时间,即因停靠产生的非正常行驶持续时间,考虑到有轨电车的停靠时间与电车系统本身特点、有轨电车与乘客相互作用是呈现非线性关系,基于SVM模型设计算法进行非线性回归,该方案采用多项式核函数算法,基于此算法实现停站时间的预测;并以此为依据,预测有轨电车到达交叉口的时间;As an improvement of the present invention, the prediction of the stop time of the tram station in step (31) is specifically as follows, the prediction process of the time when the tram arrives at the stop line is simplified, and the main prediction is the stop time of the tram at the platform, that is, the time caused by the stop For the duration of abnormal driving, considering the stop time of trams and the characteristics of the tram system itself, the interaction between trams and passengers presents a nonlinear relationship, based on the SVM model design algorithm for nonlinear regression, the program uses polynomial kernel function algorithm , based on this algorithm to realize the prediction of the stop time; and based on this, predict the time when the tram arrives at the intersection;

算法如下:The algorithm is as follows:

其中,f(x)为非线性回归函数,为拉格朗日待定系数,可由公式(3)求得,SVs代表支持向量机集合,ε是不敏感系数;Among them, f(x) is a nonlinear regression function, with is the Lagrangian undetermined coefficient, which can be obtained by formula (3), SV s represents the set of support vector machines, and ε is the insensitivity coefficient;

其中,y为样本序列,是采集到的车辆停靠时间原始序列,l为支持向量数目,x=(x1,x2,x3,x4)为属性变量,与有轨电车停靠时间紧密相关,分别为电车到站实际时刻、上车人数、下车人数、与上一辆进站电车的车头时距,这些都可通过跟车调查获取。Among them, y is the sample sequence, which is the original sequence of the collected vehicle stop time, l is the number of support vectors, x=(x 1 , x 2 , x 3 , x 4 ) is the attribute variable, which is closely related to the tram stop time , are the actual arrival time of the tram, the number of people boarding, the number of people getting off, and the headway distance from the last incoming tram, all of which can be obtained through follow-up surveys.

作为本发明的一种改进,所述步骤(32)中采用嵌套算法确定绿灯时长和相位差,模块一以有轨电车在协调区段停车最小为目标,并将此目标作为新约束带入模块二,即控制区段总延误最小为优化目标,保证有轨电车在交叉口间连续优先通行的同时使得社会车辆在交叉口的延误尽可能小;As an improvement of the present invention, a nested algorithm is used in the step (32) to determine the duration of the green light and the phase difference, and the module one takes the minimum stop of the tram in the coordination section as the goal, and takes this goal as a new constraint into Module 2, that is, the minimum total delay of the control section is the optimization goal, which ensures that the trams continue to pass through the intersections and at the same time makes the delay of social vehicles at the intersections as small as possible;

模块一:有轨电车绿波通行;Module 1: Green Wave Passage of Trams;

要实现有轨电车的协调控制,最理想的状态就是有轨电车可以不停车通过目标区段,因此,模块一以申请优先的有轨电车在目标区段的累计停车次数Sall最小为目标函数,对应的算法如下:To realize the coordinated control of trams, the ideal state is that the trams can pass through the target section without stopping. Therefore, the objective function of module 1 is to minimize the accumulative parking times S all of the trams applying for priority in the target section , the corresponding algorithm is as follows:

其中,为第j个交叉口有轨电车通行相位绿灯启亮时间,oj为第j个交叉口的绝对相位差,a为正整数,C为协调控制的公共周期时长;in, is the time when the green light of the tram passing phase at the jth intersection is turned on, o j is the absolute phase difference of the jth intersection, a is a positive integer, and C is the duration of the public cycle of coordinated control;

为有轨电车到达第j个交叉口的时间; is the time when the tram arrives at the jth intersection;

temp=(Ltr+Ld)/vtr为有轨电车穿越交叉口的清空时间;为第j个交叉口第i相位的绿灯时间,为第j个交叉口第i相位的最短绿灯时间,qij为第j个交叉口第i相位单周期车流量,Sij为第j个交叉口第i相位的车道饱和流率;t emp = (L tr +L d )/v tr is the clearing time for the tram to cross the intersection; is the green time of the i-th phase of the j-th intersection, is the shortest green light time of the i-th phase of the j-th intersection, q ij is the single-period traffic flow of the j-th intersection in the i-th phase, S ij is the lane saturation flow rate of the j-th intersection in the i-th phase;

通过整数空间粒子群算法求解式(5)和式(6),将求解结果作为新的约束条件带入模块二;Formula (5) and formula (6) are solved by the integer space particle swarm optimization algorithm, and the solution result is brought into module 2 as a new constraint condition;

模块二:基于期望延误的配时优化;Module 2: Timing optimization based on expected delay;

有轨电车的信号优先会给占用其他相位社会车辆的通行时间,为了在保障电车通行权的前提下,信号配时应当尽量降低其他相位社会车辆的通行延误,其算法如下:The signal of trams gives priority to the passage time of vehicles occupying other phases. In order to ensure the right of way of trams, the signal timing should minimize the delay of passage of vehicles in other phases. The algorithm is as follows:

其中,为第i个交叉口第j相位的车辆头车到达停车线的时间;uij为第i个交叉口第j相位考虑上游交叉口影响后的到达率;in, u ij is the arrival rate of the jth phase of the i-th intersection after considering the influence of the upstream intersection;

利用整数空间的粒子群算法就可以求得满足目标函数的各交叉口的信号相位配时和相位差。The signal phase timing and phase difference of each intersection satisfying the objective function can be obtained by using the particle swarm optimization algorithm in the integer space.

相对于现有技术,本发明的有益效果如下,(1)本发明是在有轨电车信号控制领域的一次新的尝试,将预测、信号优先、协调控制的技术合而为一,保证有轨电车在交叉口间连续优先通行的同时,使社会车辆在交叉口的延误尽可能小,兼顾多方面的利益,意图使系统获得最优实施效果;(2)本发明方法不需要额外的道路改造与基础设施投入,因而其资金投入少,对城市的财政要求不高,发明的操作性非常强。Compared with the prior art, the beneficial effects of the present invention are as follows, (1) the present invention is a new attempt in the field of tram signal control, combining the techniques of forecasting, signal priority, and coordinated control to ensure that the tram While trams continue to give priority to passage between intersections, the delay of social vehicles at the intersection is minimized as much as possible, taking into account the interests of many aspects, and the intention is to make the system obtain the best implementation effect; (2) the method of the present invention does not require additional road reconstruction And infrastructure investment, so its capital investment is small, the financial requirements of the city are not high, and the operability of the invention is very strong.

附图说明Description of drawings

图1为本发明方法的流程图;Fig. 1 is the flowchart of the inventive method;

图2为道路信息与动态数据图;Fig. 2 is a map of road information and dynamic data;

图3为求解目标示意图。Figure 3 is a schematic diagram of the solution target.

具体实施方式detailed description

为了加深对本发明的认识和理解,下面结合附图和具体实施例对本发明做进一步说明。In order to deepen the knowledge and understanding of the present invention, the present invention will be further described below in conjunction with the accompanying drawings and specific embodiments.

参见图1-图3,如附图1所示为一种有轨电车与社会车流的协同控制方法流程图,下面结合实例进一步说明。Referring to Fig. 1-Fig. 3, as shown in Fig. 1, it is a flow chart of a coordinated control method for trams and social traffic flows, which will be further described in conjunction with examples below.

(1)道路交通基础数据采集及信号公用周期的确定;(1) Acquisition of road traffic basic data and determination of signal public cycle;

本发明首先采用韦伯斯特公式计算信号周期,并取各交叉口中最大周期作为协调控制的共用周期。The present invention first uses Webster's formula to calculate the signal cycle, and takes the largest cycle in each intersection as the common cycle of coordinated control.

C-韦伯斯特公式计算的周期时长(s)Cycle duration calculated by C-Webster formula (s)

L-周期损失时间(s)L-cycle loss time (s)

Y-交叉口总流量比Y-intersection total flow ratio

A-黄灯时间(s)A-yellow light time (s)

I-绿灯间隔时间(s)I-green light interval time (s)

l-启动损失时间(s),查表得l- start-up loss time (s), look up the table to get

yi=maxj(qij/Sij),第i相位的流量比y i =max j (q ij /S ij ), the flow ratio of the i-th phase

qij–第i相位第j车道的小时流量q ij – the hourly traffic flow of the jth lane in the ith phase

Sij-第i相位第j车道的通行能力,由基本通行能力得。S ij - the traffic capacity of the j-th lane in the i-th phase, obtained from the basic traffic capacity.

通过相关分析,本次发明所需的道路交通基础数据包括如下所示:各个交叉口车道数Nij和规定的车道方向(直行、左转、右转、直左、直右、左直右、左右转)、相邻交叉口的间距lij等静态数据、交叉口的流量流向数据(各进口道的饱和度yi)、信号配时现状(黄灯时间A、一个周期内的相位数i、绿灯间隔时间I)等动态数据以及车辆停靠时间序列y,有轨电车到站实际时刻x1、上车人数x2、下车人数x3、与上一辆进站电车的车头时距x4,有轨电车长度Ltr,交叉口清空距离Ld,有轨电车速度Vtr等数据。By correlation analysis, the required road traffic basic data of this invention comprises as follows: each intersection lane number N ij and the lane direction of regulation (going straight, turning left, turning right, straight left, straight right, left straight right, turn left and right), the distance between adjacent intersections l ij and other static data, the flow direction data of the intersection (saturation of each entrance y i ), signal timing status (yellow light time A, phase number i in a cycle , green light interval time I) and other dynamic data and vehicle stop time series y, the actual arrival time of the tram x1, the number of people on the bus x2, the number of people getting off the bus x3, the headway distance from the last incoming tram x4, the tram Tram length L tr , intersection clearance distance L d , tram speed Vtr and other data.

在本实例中,各个交叉口车道数Nij和规定的车道方向(直行、左转、右转、直左、直右、左直右、左右转)、相邻交叉口的间距lij、交叉口的流量流向数据(各进口道的饱和度yi)、信号配时现状(黄灯时间A、一个周期内的相位数i、绿灯间隔时间I)、有轨电车长度Ltr可以采取实地调查方法获得;车辆停靠时间序列y、有轨电车到站实际时刻x1、上车人数x2、下车人数x3、与上一辆进站电车的车头时距x4、有轨电车速度Vtr等可采用摄像法采集,即通过摄像机采集相关的视频,并通过专门的视频处理软件(例如,Adobe公司的PremierePro 2.0)对视频信息进行处理以获取所需数据。In this example, the number of lanes N ij of each intersection and the direction of the specified lanes (go straight, turn left, turn right, go straight left, go straight right, go straight left, go right, turn left), distance between adjacent intersections l ij , intersection The flow direction data at the entrance (saturation y i of each entrance), signal timing status (yellow light time A, phase number i in a cycle, green light interval time I), and tram length L tr can be taken on-site investigation Obtained by the method; vehicle stop time series y, actual time of tram arrival x1, number of people on board x2, number of people getting off x3, headway distance from the last incoming tram x4, tram speed Vtr, etc. can be obtained by camera Acquisition by means of a video camera, that is, relevant video is collected by a camera, and the video information is processed by a special video processing software (for example, Adobe's PremierePro 2.0) to obtain the required data.

(2)检测器的设置和激活:(2) Detector setup and activation:

在协调控制区段上游入口处布置有轨电车到达检测器,在协调控制区段下游出口处布置有轨电车离开检测器,第一辆有轨电车通过离开检测器时,有轨电车到达检测器被激活,处于能够接收后续有轨电车优先申请的状态,检测器的位置如附图2所示。The tram arrival detector is arranged at the upstream entrance of the coordination control section, and the tram departure detector is arranged at the downstream exit of the coordination control section. When the first tram passes the departure detector, the tram arrival detector Activated, in the state of being able to receive subsequent tram priority applications, the position of the detector is shown in Figure 2.

注意有轨电车到达检测器的布置应与停靠站点和交叉口保持一定距离,避免有轨电车排队溢出的影响。Note that the layout of the tram arrival detector should keep a certain distance from the stop site and the intersection, so as to avoid the impact of the overflow of the tram queuing.

(3)到达检测器检测到有轨电车后,信号控制机生成有轨电车优先通行申请,按照有轨电车与社会车流的协同控制方法进行信号配时方案调整,(3) After the tram is detected by the arrival detector, the signal control machine generates a tram priority application, and adjusts the signal timing scheme according to the coordinated control method of the tram and the social traffic flow,

待检测器检测到有轨电车时,信号控制机生成有轨电车优先通行申请,具体如下,When the detector detects a tram, the signal control machine generates a tram priority application, as follows:

31)有轨电车站点停靠时间预测:本次发明中的“有轨电车站点停靠时间”是基于SVM(支持向量机)进行预测的,可通过C++等软件进行操作;31) Tram stop time prediction: the "tram stop time" in this invention is predicted based on SVM (Support Vector Machine), which can be operated by software such as C++;

32)信号协调优化方案:通过1)的有轨电车站点停靠时间预测,可在此基础上得到电车到达交叉口停车线的时刻,然后结合社会车辆的到达率基于嵌套算法得到交叉口的绿灯时间与相位差等参数,并根据“绿灯时间与相位差”指标确定信号协调优化方案。32) Signal coordination optimization scheme: Through the prediction of the stop time of the tram station in 1), the time when the tram arrives at the stop line at the intersection can be obtained on this basis, and then the green light at the intersection can be obtained based on the nested algorithm combined with the arrival rate of social vehicles Time and phase difference and other parameters, and determine the signal coordination optimization scheme according to the "green light time and phase difference" index.

(4)有轨电车到达检测器的关闭与开启;(4) Closing and opening of the tram arrival detector;

协调路段实行优化后的信号控制方案,会暂时关闭有轨电车到达检测器,等到检测器检测到有轨电车离开协调路段后,结束本辆有轨电车的信号优先协同控制流程,有轨电车到达检测器重新启动,等待进入下一辆有轨电车的信号优先协同控制,若再次检测到有轨电车的到达,会重新进入步骤(3)。The coordinated road section implements the optimized signal control scheme, and the tram arrival detector will be temporarily turned off. After the detector detects that the tram has left the coordinated road section, the signal priority coordinated control process of this tram is ended, and the tram arrives. Detector restarts, waits to enter the signal priority cooperative control of next streetcar, if the arrival of streetcar is detected again, can enter step (3) again.

依照上述方法调整交叉口信号配时,可得到一种有轨电车与社会车流的协同控制方法,实现有轨电车优先通行的同时,社会车辆在交叉口的延误尽可能小。By adjusting the intersection signal timing according to the above method, a coordinated control method of trams and social traffic flow can be obtained, which can realize the priority of trams and minimize the delay of social vehicles at the intersection as much as possible.

应用实例:为了验证本发明的有效性,下面结合某市有轨电车实际调查数据及VISSIM,对本发明作进一步的说明。Application example: In order to verify the effectiveness of the present invention, the present invention will be further described below in conjunction with the actual survey data and VISSIM of a certain city's tram.

设某条主干道依次具有5个交叉口,依次编号为1、2、3、4、5。这个区域包含信号优先协调控制交叉口:通江—太湖路交叉口(2),通江—龙锦路交叉口(3)以及通江—龙城路交叉口(4),而1和5交叉口作为协调控制的过渡交叉口,各项指标并不计入统计,以抵消上游交叉口对于控制效果的影响。如附图2所示:Assume that a certain arterial road has 5 intersections sequentially, numbered 1, 2, 3, 4, 5 in sequence. This area contains signal priority coordination control intersections: Tongjiang-Taihu Road intersection (2), Tongjiang-Longjin Road intersection (3) and Tongjiang-Longcheng Road intersection (4), while 1 and 5 intersections As a transitional intersection for coordinated control, various indicators are not included in the statistics to offset the impact of the upstream intersection on the control effect. As shown in Figure 2:

(1)通过基础数据的采集,所得结果如下:(1) Through the collection of basic data, the results obtained are as follows:

协同优先控制区域内主要交叉口的信号周期、相位方案、交叉口渠化、交叉口间距、公交站点具体位置、各交叉口的流量流向等信息如附图2所示;Information such as the signal cycle, phase scheme, intersection channelization, intersection distance, specific location of bus stops, and flow direction of each intersection of major intersections in the collaborative priority control area is shown in Figure 2;

(2)效果分析;(2) Effect analysis;

为了验证本发明的效果,将有轨电车优先条件下的协调控制方法与原始信号配时和只考虑社会车辆的静态双向绿波控制方法进行对比,也就是说,每一种信号配时方法在效果分析中对应着一类信号配时策略,分别是实际信号配时控制,配时数据见附图2,传统静态双向绿波,即通过韦伯斯特公式确定公共信号周期,然后按各相位流量比分配绿灯时间,最后用数解法求解满足社会车辆绿波带宽最大的交叉口间的相位差,以及本发明提出的一种有轨电车与社会车流的协同控制方法。In order to verify the effect of the present invention, the coordinated control method under the tram priority condition is compared with the original signal timing and the static two-way green wave control method that only considers social vehicles, that is to say, each signal timing method is in The effect analysis corresponds to a type of signal timing strategy, which is the actual signal timing control. The timing data is shown in Figure 2. The traditional static two-way green wave, that is, the public signal period is determined by Webster's formula, and then according to the flow rate of each phase Finally, the phase difference between intersections satisfying the maximum green wave bandwidth of social vehicles is solved by numerical solution method, and a coordinated control method of trams and social traffic flows proposed by the present invention.

实际工程中经常会遇到交通需求波动的情况,所以发明不局限于优化现状流量下的通行效率,为了进一步测试本发明方法在不同交通量下的信号控制效果的稳定性,在上述三种信号配时策略下均设置5个流量级别,分别是原始流量的80%,90%,100%,110%和120%。即本效果分析共构建3种信号控制策略,每种策略均测试5个流量条件,效果分析的具体设置如表1。Traffic demand fluctuations are often encountered in actual engineering, so the invention is not limited to optimizing the traffic efficiency under the current flow rate. In order to further test the stability of the signal control effect of the method of the present invention under different traffic volumes, the above three signal Five traffic levels are set under the timing strategy, which are 80%, 90%, 100%, 110% and 120% of the original traffic. That is to say, in this effect analysis, a total of 3 signal control strategies are constructed, and each strategy tests 5 traffic conditions. The specific settings of the effect analysis are shown in Table 1.

表1信号配时策略设计Table 1 Signal Timing Strategy Design

车辆的行驶速度是预估车辆达到停车线时间,从而通过嵌套算法实现信号控制的重要参数,VISSIM中对车速的输入采用的形式定义。在城市道路中,由于信号控制的影响,车流前往下游交叉口的到达率并不是均匀的,因此,在效果分析中,信号协调区段的上游均设置有过渡的信号灯,以保证车队的出现,从而更贴近交通运行的实际情况,且这些交叉口并不会列入最终的指标统计,如附图2中的交叉口1和5。The driving speed of the vehicle is an important parameter to estimate the time when the vehicle reaches the stop line, so as to realize the signal control through the nested algorithm. The input of the vehicle speed in VISSIM is defined in the form. On urban roads, due to the influence of signal control, the arrival rate of traffic flow to the downstream intersection is not uniform. Therefore, in the effect analysis, the upstream of the signal coordination section is equipped with transitional signal lights to ensure the appearance of the convoy. Therefore, it is closer to the actual situation of traffic operation, and these intersections will not be included in the final index statistics, such as intersections 1 and 5 in Figure 2.

有轨电车在站台的停靠时间对信号优先的效果有重要影响。效果分析通过在不同的时间间隔内设置不同的乘客到达率,以保证有轨电车载运的乘客数与表1中的观测数据一致,从而推测出有轨电车在站台的停靠过程。影响有轨电车停靠时间和到达交叉口时间的另一个重要因素是车辆进入信号协调区段的时刻。调查通过视频采集有轨电车进入信号协调区段时间,并将这些时间以时刻表的方式录入效果分析系统,即每一辆车对应一个进入效果分析系统时间。The stop time of the tram at the platform has an important influence on the effect of signal priority. The effect analysis sets different passenger arrival rates in different time intervals to ensure that the number of passengers carried by the tram is consistent with the observation data in Table 1, so as to infer the stop process of the tram at the platform. Another important factor affecting the tram stop time and arrival time at the intersection is the moment when the vehicle enters the signal coordination section. The survey collects the time of trams entering the signal coordination section through video, and enters these times into the effect analysis system in the form of a timetable, that is, each car corresponds to a time of entering the effect analysis system.

整个效果分析时长为3600s,与之对应的现实时间段是研究区域的晚高峰17:15~18:15。表1中的每个情景的每一个流量条件进行10次效果分析,每次效果分析取不同的随机种子。The entire effect analysis time is 3600s, and the corresponding real time period is the evening peak of the research area from 17:15 to 18:15. In Table 1, 10 effect analyzes are carried out for each flow condition of each scenario, and different random seeds are used for each effect analysis.

(3)效果分析结果;(3) Results of effect analysis;

(31)有轨电车站台停靠时间预测结果分析;(31) Analysis of the prediction results of the stop time of the tram platform;

协调控制区段内影响有轨电车到达停车线时间预测的站点共有4个,已经在附图2中标出。由于有轨电车的停靠时间预测与自身特性有关,因此本发明利用南京市河西区有轨电车元通站的相关数据来标定基于SVM模型算法中的惩罚因子E、不敏感系数ε以及核函数参数γ,再将研究区段的4个站点的属性向量,带入回归函数,从而预测有轨电车的停靠时间。有轨电车在元通站的停靠时间y和相关属性向量x=(x1,x2,x3,x4),样本量为115。其中,x1~x4为属性变量,与有轨电车停靠时间紧密相关,这里分别为电车到站实际时刻、上车人数、下车人数、与上一辆进站电车的车头时距。参数标定结果为:E=24.619,ε=0.4972,γ=0.9997。算法的平均相对百分误差(MAPE)和均方误差(MSE)两项指标分别为8.12%和37.58s2,均相对较小,这证明了基于SVM模型算法的预测效果较为可靠,也为预测有轨电车到达交叉口时间和设置信号优先协调控制方案提供了充分的依据。There are 4 stations in the coordinated control section that affect the prediction of the time when the tram arrives at the stop line, which have been marked in Figure 2. Since the stop time prediction of the tram is related to its own characteristics, the present invention uses the relevant data of the tram Yuantong Station in Hexi District, Nanjing to calibrate the penalty factor E, insensitivity coefficient ε and kernel function parameters based on the SVM model algorithm. γ, and then bring the attribute vectors of the four stations in the research section into the regression function to predict the stop time of the tram. The stop time y of the tram at Yuantong Station and the related attribute vector x=(x 1 , x 2 , x 3 , x 4 ), the sample size is 115. Among them, x 1 ~ x 4 are attribute variables, which are closely related to the stop time of the tram. Here, they are the actual arrival time of the tram, the number of people getting on the bus, the number of people getting off the bus, and the headway distance from the last tram that entered the station. The parameter calibration results are: E=24.619, ε=0.4972, γ=0.9997. The average relative percentage error (MAPE) and mean square error (MSE) of the algorithm are 8.12% and 37.58s 2 respectively, both of which are relatively small, which proves that the prediction effect of the algorithm based on the SVM model is relatively reliable, and it is also a good example for the prediction The arrival time of trams at intersections and the coordinated control scheme of setting signal priority provide a sufficient basis.

(32)对有轨电车的影响;(32) Impact on trams;

尽量减少有轨电车在路段上的非必要停留时间和停车次数是提升其运行效益的主要目标,因此延误和停车率是有轨电车协调信号优先控制的主要评价指标,也是本次发明的有轨电车信号优先控制策略最有力、最有效的论据之一。根据VISSIM输出的评价指标,三种控制策略的流量敏感度结果如表2所示。Minimizing the unnecessary stay time and parking times of trams on the road section is the main goal of improving its operating efficiency. Therefore, the delay and parking rate are the main evaluation indicators for the coordinated signal priority control of trams. One of the strongest and most effective arguments for the tram signal priority control strategy. According to the evaluation index output by VISSIM, the flow sensitivity results of the three control strategies are shown in Table 2.

总体来看,在现状流量条件下,静态的双向绿波控制由于没有考虑到有轨电车与社会车辆在行驶特性上的差异,反而造成了有轨电车在研究区段更大的行程延误,而有轨电车的停车率相对于原始情况仅有轻微提升。而在实行有轨电车与社会车流的协同控制方法后,电车的行程延误和停车率大幅度降低76.46%和95.05%。Overall, under the current flow conditions, the static two-way green wave control did not take into account the differences in the driving characteristics of trams and social vehicles, but caused greater travel delays for trams in the study section, while The tram parking rate has only slightly improved compared to the original situation. After implementing the coordinated control method of trams and social traffic flow, the travel delay and parking rate of trams are greatly reduced by 76.46% and 95.05%.

更值得注意的是,通过流量敏感度很容易发现,由于实际信号配时控制和传统静态双向绿波属于静态配时方法,所以有轨电车的行驶指标不因为道路流量的变化而变化,始终处于较低水平。本发明的信号控制策略不论在何种饱和度下均能够显著降低有轨电车的行程延误达77%以上,对应地,停车率较现状信号控制方案也骤减超90%。这充分证明了模块一的严格目标,即提出优先申请的有轨电车在目标区段内尽量少停车通过,对于提升有轨电车通行效益的重要意义,也间接验证了有轨电车停靠时间预测的准确性以及对于此控制算法的突出贡献。What is more noteworthy is that it is easy to find out through the flow sensitivity that the actual signal timing control and the traditional static two-way green wave belong to the static timing method, so the running index of the tram does not change due to the change of the road traffic, and is always in the lower level. The signal control strategy of the present invention can significantly reduce the travel delay of trams by more than 77% no matter what the saturation is, and correspondingly, the parking rate is also sharply reduced by more than 90% compared with the current signal control scheme. This fully proves the strict goal of Module 1, that is, the trams that apply for priority should stop and pass as few times as possible in the target section, which is of great significance to improving the efficiency of tram traffic, and also indirectly verifies the accuracy of tram stop time prediction. Accuracy and outstanding contribution to this control algorithm.

表2不同信号控制策略下有轨电车的各项指标Table 2 Various indicators of trams under different signal control strategies

(33)对社会车流的影响(33) Impact on social traffic flow

给予有轨电车信号优先的初衷并不是牺牲社会车辆的通行权,因此有必要对社会车辆的行驶指标进行统计以评估信号优先算法对社会车辆的影响。发明在统计社会车辆在和各节点的延误的同时,考虑到交叉口道路几何条件的约束,也对各节点的平均排队长度进行了分析。结果如表3所示。The original intention of giving tram signal priority is not to sacrifice the right of passage of social vehicles, so it is necessary to make statistics on the driving indicators of social vehicles to evaluate the impact of signal priority algorithm on social vehicles. The invention not only counts the delays of social vehicles at each node, but also analyzes the average queue length of each node in consideration of the constraints of the intersection road geometry. The results are shown in Table 3.

表3不同信号控制策略下社会车辆的各项指标Table 3 Various indicators of social vehicles under different signal control strategies

注:1表示车辆在协调控制的目标区段,即从附图2中的交叉口2行驶至交叉口4间产生的延误均值。Note: 1 represents the average value of the delay generated by vehicles traveling from intersection 2 to intersection 4 in the target section of coordinated control, that is, in Figure 2.

**表示指标相对于现状下降50%以上,说明控制方法能够十分显著提升车辆的行驶效益。** indicates that the index has dropped by more than 50% compared with the current situation, indicating that the control method can significantly improve the driving efficiency of the vehicle.

*表示指标相对于现状下降幅度在20%~50%,说明控制方法在提升车辆通行效益上有一定效果。*Indicates that the index has decreased by 20% to 50% relative to the current situation, indicating that the control method has a certain effect on improving the efficiency of vehicle traffic.

从延误和停车率指标来看,现状流量条件下,传统的静态双向绿波仅降低了20%左右的车辆延误和停车率,而有轨电车与社会车流的协同控制方法不仅大幅度降低了南北方向有轨电车的延误,此方向上的社会车辆的行驶效益也大幅提升,其延误和停车率比静态双向绿波还进一步降低了74.49%和73.06%。From the perspective of delay and parking rate indicators, under the current traffic conditions, the traditional static two-way green wave only reduces the vehicle delay and parking rate by about 20%, while the coordinated control method of trams and social traffic not only greatly reduces the north-south The delay of trams in this direction, the driving efficiency of social vehicles in this direction is also greatly improved, and its delay and parking rate are further reduced by 74.49% and 73.06% compared with the static two-way green wave.

一般情况下,非绿波期间通行的车辆易受到协调控制的干扰,现状流量下,静态双向绿波策略不仅没能明显提升社会车辆的通行效益,反而增加了其在部分交叉口的延误和停车率。相比之下,有轨电车与社会车流的协同控制方法虽然不能保证所有相位的车辆均能够像绿波期间内通行的车辆那样高效行驶,但依然能够使各交叉口的延误和停车率均值相对于现状明显下降。Under normal circumstances, vehicles passing during non-green waves are susceptible to interference from coordinated control. Under current traffic conditions, the static two-way green wave strategy not only failed to significantly improve the traffic efficiency of social vehicles, but increased its delay and parking at some intersections. Rate. In contrast, although the coordinated control method of trams and social traffic flow cannot guarantee that vehicles in all phases can travel as efficiently as vehicles passing through the green wave period, it can still make the average delay and parking rate of each intersection relatively Significantly decreased from the current situation.

对不同饱和度下的交通流进行高效控制是信号控制算法的优越性和健壮性的体现。对比不同流量比下的车辆运行指标,很容易发现,随着流量的增加,南北方向通行的车辆因静态双向绿波获得的延误降低值呈现逐渐下降的趋势,区段内各交叉口延误和排队长度也大部分受到了负面影响。虽然流量的上升也让有轨电车与社会车流的协同控制方法控制下的南北方向车辆的延误降低力度受到了一定的影响,但在各种饱和度下,有轨电车与社会车流的协同控制方法还是能比静态双向绿波提供高的多的通行效率。Efficient control of traffic flow under different saturations is the embodiment of the superiority and robustness of the signal control algorithm. Comparing the vehicle operation indicators under different flow ratios, it is easy to find that with the increase of flow, the delay reduction value of vehicles passing in the north-south direction due to the static two-way green wave presents a gradual decline trend, and the delay and queuing at each intersection in the section Length was also mostly negatively affected. Although the increase in traffic flow has also affected the delay reduction of vehicles in the north-south direction under the control of the coordinated control method of trams and social traffic flow, under various saturation levels, the coordinated control method of trams and social traffic flow It can still provide much higher traffic efficiency than the static two-way green wave.

上述大量的评价指标很好的证明了有轨电车与社会车流的协同控制方法方法在给予有轨电车强势信号优先同时减少对其他社会车辆干扰方面的巨大优势,多流量敏感度测试也表明了该方法应对不同交通流饱和度的稳定性与健壮性。The above-mentioned large number of evaluation indicators have proved the great advantages of the coordinated control method of trams and social traffic flow in giving priority to trams with strong signals while reducing interference to other social vehicles. The multi-flow sensitivity test also shows that this The stability and robustness of the method to deal with different traffic flow saturation.

以上所述仅是本发明的优选实施方式,应当指出:对于本技术领域的普通技术人员来说,在不脱离本发明原理的前提下,还可以做出若干可以预期的改进和润饰,这些改进和润饰也应视为本发明的保护范围。The above is only a preferred embodiment of the present invention, it should be pointed out that for those of ordinary skill in the art, without departing from the principle of the present invention, some predictable improvements and modifications can also be made, these improvements And retouching should also be regarded as the protection scope of the present invention.

Claims (6)

1.一种有轨电车与社会车流的协同控制方法,其特征在于,所述控制方法包括如下步骤:1. a coordinated control method of streetcar and social traffic flow, it is characterized in that, described control method comprises the steps: (1)道路交通基础数据采集及信号公共周期的确定,(1) Acquisition of road traffic basic data and determination of signal public cycle, (2)检测器的设置和激活,(2) Detector setup and activation, (3)到达检测器检测到有轨电车后,信号控制机生成有轨电车优先通行申请,按照有轨电车与社会车流的协同控制方法进行信号配时方案调整,(3) After the tram is detected by the arrival detector, the signal control machine generates a tram priority application, and adjusts the signal timing scheme according to the coordinated control method of the tram and the social traffic flow, (4)有轨电车到达检测器的关闭与开启;协调路段实行优化后的信号控制方案,会暂时关闭有轨电车到达检测器,等到检测器检测到有轨电车离开协调路段后,结束本辆有轨电车的信号优先协同控制流程,恢复到原有的控制方案,此时有轨电车到达检测器重新启动,等待进入下一辆有轨电车的信号优先协同控制,若再次检测到有轨电车的到达,会重新进入步骤(3)。(4) Closing and opening of the tram arrival detector; the coordinated road section implements the optimized signal control scheme, which will temporarily close the tram arrival detector, and end the vehicle when the detector detects that the tram has left the coordination road section. The priority coordinated control process of the signal of the tram is restored to the original control scheme. At this time, the arrival detector of the tram is restarted, waiting for the signal priority of the next tram to be controlled. If the tram is detected again will re-enter step (3). 2.根据权利要求1所述的一种有轨电车与社会车流的协同控制方法,其特征在于,步骤(1)具体如下,该步骤采用韦伯斯特公式计算信号周期,并取各交叉口中最大周期作为协调控制的公共周期;2. a kind of streetcar according to claim 1 and the cooperative control method of social traffic flow, it is characterized in that, step (1) is specifically as follows, this step adopts Webster's formula to calculate signal period, and gets the maximum in each crossing cycle as a public cycle for coordinated control; <mrow> <mi>C</mi> <mo>=</mo> <mfrac> <mrow> <mn>1.5</mn> <mi>L</mi> <mo>+</mo> <mn>5</mn> </mrow> <mrow> <mn>1</mn> <mo>-</mo> <mi>Y</mi> </mrow> </mfrac> <mo>;</mo> </mrow> <mrow><mi>C</mi><mo>=</mo><mfrac><mrow><mn>1.5</mn><mi>L</mi><mo>+</mo><mn>5</mn></mrow><mrow><mn>1</mn><mo>-</mo><mi>Y</mi></mrow></mfrac><mo>;</mo></mrow> L=∑I(l+I-A);L= ∑I (l+IA); <mrow> <mi>Y</mi> <mo>=</mo> <msubsup> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msub> <mi>y</mi> <mi>i</mi> </msub> <mo>;</mo> </mrow> <mrow><mi>Y</mi><mo>=</mo><msubsup><mo>&amp;Sigma;</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>n</mi></msubsup><msub><mi>y</mi><mi>i</mi></msub><mo>;</mo></mrow> C-韦伯斯特公式计算的周期时长(s);The cycle duration (s) calculated by the C-Webster formula; L-周期损失时间(s);L-cycle loss time (s); Y-交叉口总流量比;Y-intersection total flow ratio; A-黄灯时间(s);A- yellow light time (s); I-绿灯间隔时间(s);I-green light interval time (s); l-启动损失时间(s),查表得;l- start-up loss time (s), look up the table; yi=maxj(qij/Sij),第i相位的流量比;y i =max j (q ij /S ij ), the flow ratio of the i-th phase; qij–第i相位第j车道的小时流量;q ij – the hourly traffic flow of the jth lane in the ith phase; Sij-第i相位第j车道的通行能力,由基本通行能力得;S ij - the traffic capacity of the jth lane of the i-th phase, obtained from the basic traffic capacity; 通过相关分析,该方案所需的道路交通基础数据包括如下所示:各个交叉口车道数Nij和规定的车道方向即包括直行、左转、右转、直左、直右、左直右、左右转、相邻交叉口的间距lij等静态数据、交叉口的流量流向数据(各进口道的饱和度yi)、信号配时现状(黄灯时间A、一个周期内的相位数i、绿灯间隔时间I)等动态数据以及车辆停靠时间序列y,有轨电车到站实际时刻x1、上车人数x2、下车人数x3、与上一辆进站电车的车头时距x4,有轨电车长度Ltr,交叉口清空距离Ld,有轨电车速度Vtr等数据。Through correlation analysis, the road traffic basic data required by the program include as follows: the number of lanes N ij of each intersection and the prescribed lane directions include straight, left, right, straight left, straight right, left straight right, Static data such as left and right turns, distance l ij of adjacent intersections, flow direction data of intersections (saturation of each entrance y i ), signal timing status (yellow light time A, phase number i in one cycle, Dynamic data such as green light interval time I) and vehicle stop time series y, the actual arrival time of the tram x1, the number of people on board x2, the number of people getting off x3, the headway distance from the last incoming tram x4, the tram Length L tr , intersection clearing distance L d , tram speed Vtr and other data. 3.根据权利要求2所述的一种有轨电车与社会车流的协同控制方法,其特征在于,步骤(2)中检测器的设置和激活具体如下,在协调控制区段上游入口处布置有轨电车到达检测器,在协调控制区段下游出口处布置有轨电车离开检测器,第一辆有轨电车通过离开检测器时,有轨电车到达检测器被激活,处于能够接收后续有轨电车优先申请的状态。3. A kind of coordinated control method of tramcar and social traffic flow according to claim 2, it is characterized in that, the setting and activation of detector in the step (2) are specifically as follows, at the upstream entrance of the coordinated control section, there is arranged The tram arrival detector is arranged at the downstream exit of the coordinated control section. When the first tram passes the departure detector, the tram arrival detector is activated and is in the position of being able to receive subsequent trams. Priority application status. 4.根据权利要求2或3所述的一种有轨电车与社会车流的协同控制方法,其特征在于,所述步骤(3)中,到达检测器检测到有轨电车后,信号控制机生成有轨电车优先通行申请,按照有轨电车与社会车流的协同控制方法进行信号配时方案调整,4. according to claim 2 or 3 described a kind of coordinated control method of streetcar and social vehicle flow, it is characterized in that, in described step (3), after arrival detector detects streetcar, signal control machine generates Tram priority traffic application, according to the coordinated control method of tram and social traffic flow to adjust the signal timing plan, 待检测器检测到有轨电车时,信号控制机生成有轨电车优先通行申请,具体如下,When the detector detects a tram, the signal control machine generates a tram priority application, as follows: 31)有轨电车站点停靠时间预测:31) Tram station stop time prediction: 32)信号协调优化方案:通过31)的有轨电车站点停靠时间预测,可在此基础上得到电车到达交叉口停车线的时刻,然后结合社会车辆的到达率基于嵌套算法得到交叉口的绿灯时间与相位差等参数,并根据“绿灯时间与相位差”指标确定信号协调优化方案。32) Signal coordination optimization scheme: Through the prediction of the stop time of the tram station in 31), the time when the tram arrives at the stop line at the intersection can be obtained on this basis, and then the green light at the intersection can be obtained based on the nested algorithm combined with the arrival rate of social vehicles Time and phase difference and other parameters, and determine the signal coordination optimization scheme according to the "green light time and phase difference" index. 5.根据权利要求4所述的一种有轨电车与社会车流的协同控制方法,其特征在于,步骤(31)中有轨电车站点停靠时间预测具体如下,将有轨电车到达停车线时间的预测过程简化,主要预测电车在站台的停靠时间,即因停靠产生的非正常行驶持续时间,该方案采用多项式核函数算法,基于此算法实现停站时间的预测;并以此为依据,预测有轨电车到达交叉口的时间;5. a kind of streetcar according to claim 4 and the coordinated control method of social traffic flow, it is characterized in that, in the step (31), the stop time prediction of the tram station is specifically as follows, the time when the tram arrives at the stop line The prediction process is simplified, mainly predicting the stop time of the tram at the platform, that is, the duration of abnormal driving caused by the stop. The program uses a polynomial kernel function algorithm, based on which the prediction of the stop time is realized; the time when the tram arrives at the intersection; 算法如下:The algorithm is as follows: <mrow> <mi>f</mi> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>=</mo> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>S</mi> <mi>V</mi> <mi>s</mi> </mrow> </munder> <mrow> <mo>(</mo> <mover> <msub> <mi>&amp;alpha;</mi> <mi>i</mi> </msub> <mo>-</mo> </mover> <mo>-</mo> <mover> <msubsup> <mi>&amp;alpha;</mi> <mi>i</mi> <mo>*</mo> </msubsup> <mo>-</mo> </mover> <mo>)</mo> </mrow> <mi>K</mi> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>,</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> <mrow><mi>f</mi><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow><mo>=</mo><munder><mo>&amp;Sigma;</mo><mrow><mi>S</mi><mi>V</mi><mi>s</mi></mrow></munder><mrow><mo>(</mo><mover><msub><mi>&amp;alpha;</mi><mi>i</mi></msub><mo>-</mo></mover><mo>-</mo><mover><msubsup><mi>&amp;alpha;</mi><mi>i</mi><mo>*</mo></msubsup><mo>-</mo></mover><mo>)</mo></mrow><mi>K</mi><mrow><mo>(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>,</mo><mi>x</mi><mo>)</mo></mrow><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>1</mn><mo>)</mo></mrow><mo>;</mo></mrow> <mrow> <msub> <mi>L</mi> <mi>&amp;epsiv;</mi> </msub> <mrow> <mo>(</mo> <mi>N</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mn>0</mn> </mtd> <mtd> <mrow> <mo>|</mo> <mi>f</mi> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo>-</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>|</mo> <mo>-</mo> <mi>&amp;epsiv;</mi> <mo>&lt;</mo> <mn>0</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>|</mo> <mi>f</mi> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo>-</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>|</mo> <mo>-</mo> <mi>&amp;epsiv;</mi> </mrow> </mtd> <mtd> <mrow> <mo>|</mo> <mi>f</mi> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo>-</mo> <msub> <mi>N</mi> <mi>i</mi> </msub> <mo>|</mo> <mo>-</mo> <mi>&amp;epsiv;</mi> <mo>&gt;</mo> <mo>=</mo> <mn>0</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> <mrow><msub><mi>L</mi><mi>&amp;epsiv;</mi></msub><mrow><mo>(</mo><mi>N</mi><mo>)</mo></mrow><mo>=</mo><mfenced open = "{" close = ""><mtable><mtr><mtd><mn>0</mn></mtd><mtd><mrow><mo>|</mo><mi>f</mi><mrow><mo>(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>)</mo></mrow><mo>-</mo><msub><mi>N</mi><mi>i</mi></msub><mo>|</mo><mo>-</mo><mi>&amp;epsiv;</mi><mo>&lt;</mo><mn>0</mn></mrow></mtd></mtr><mtr><mtd><mrow><mo>|</mo><mi>f</mi><mrow><mo>(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>)</mo></mrow><mo>-</mo><msub><mi>N</mi><mi>i</mi></msub><mo>|</mo><mo>-</mo><mi>&amp;epsiv;</mi></mrow></mtd><mtd><mrow><mo>|</mo><mi>f</mi><mrow><mo>(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>)</mo></mrow><mo>-</mo><msub><mi>N</mi><mi>i</mi></msub><mo>|</mo><mo>-</mo><mi>&amp;epsiv;</mi><mo>&gt;</mo><mo>=</mo><mn>0</mn></mrow></mtd></mtr></mtable></mfenced><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>2</mn><mo>)</mo></mrow><mo>;</mo></mrow> 其中,f(x)为非线性回归函数,为拉格朗日待定系数,可由公式(3)求得,SVs代表支持向量机集合,ε是不敏感系数;Among them, f(x) is a nonlinear regression function, with is the Lagrangian undetermined coefficient, which can be obtained by formula (3), SV s represents the set of support vector machines, and ε is the insensitivity coefficient; <mrow> <munder> <mi>max</mi> <mrow> <mi>&amp;alpha;</mi> <mo>,</mo> <msup> <mi>&amp;alpha;</mi> <mo>*</mo> </msup> </mrow> </munder> <mi>W</mi> <mrow> <mo>(</mo> <mi>&amp;alpha;</mi> <mo>,</mo> <msup> <mi>&amp;alpha;</mi> <mo>*</mo> </msup> <mo>)</mo> </mrow> <mo>=</mo> <munder> <mi>max</mi> <mrow> <mi>&amp;alpha;</mi> <mo>,</mo> <msup> <mi>&amp;alpha;</mi> <mo>*</mo> </msup> </mrow> </munder> <mo>{</mo> <mo>-</mo> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>l</mi> </munderover> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>l</mi> </munderover> <mrow> <mo>(</mo> <msubsup> <mi>&amp;alpha;</mi> <mi>i</mi> <mo>*</mo> </msubsup> <mo>-</mo> <msub> <mi>&amp;alpha;</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <msubsup> <mi>&amp;alpha;</mi> <mi>j</mi> <mo>*</mo> </msubsup> <mo>-</mo> <msub> <mi>&amp;alpha;</mi> <mi>j</mi> </msub> <mo>)</mo> </mrow> <mi>K</mi> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>,</mo> <msub> <mi>x</mi> <mi>j</mi> </msub> <mo>)</mo> </mrow> <mo>+</mo> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>l</mi> </munderover> <msubsup> <mi>&amp;alpha;</mi> <mi>i</mi> <mo>*</mo> </msubsup> <mrow> <mo>(</mo> <msub> <mi>y</mi> <mi>i</mi> </msub> <mo>-</mo> <mi>&amp;epsiv;</mi> <mo>)</mo> </mrow> <mo>-</mo> <msub> <mi>&amp;alpha;</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>y</mi> <mi>i</mi> </msub> <mo>+</mo> <mi>&amp;epsiv;</mi> <mo>)</mo> </mrow> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> <mrow><munder><mi>max</mi><mrow><mi>&amp;alpha;</mi><mo>,</mo><msup><mi>&amp;alpha;</mi><mo>*</mo></msup></mrow></munder><mi>W</mi><mrow><mo>(</mo><mi>&amp;alpha;</mi><mo>,</mo><msup><mi>&amp;alpha;</mi><mo>*</mo></msup><mo>)</mo></mrow><mo>=</mo><munder><mi>max</mi><mrow><mi>&amp;alpha;</mi><mo>,</mo><msup><mi>&amp;alpha;</mi><mo>*</mo></msup></mrow></munder><mo>{</mo><mo>-</mo><mfrac><mn>1</mn><mn>2</mn></mfrac><munderover><mo>&amp;Sigma;</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>l</mi></munderover><munderover><mo>&amp;Sigma;</mo><mrow><mi>j</mi><mo>=</mo><mn>1</mn></mrow><mi>l</mi></munderover><mrow><mo>(</mo><msubsup><mi>&amp;alpha;</mi><mi>i</mi><mo>*</mo></msubsup><mo>-</mo><msub><mi>&amp;alpha;</mi><mi>i</mi></msub><mo>)</mo></mrow><mrow><mo>(</mo><msubsup><mi>&amp;alpha;</mi><mi>j</mi><mo>*</mo></msubsup><mo>-</mo><msub><mi>&amp;alpha;</mi><mi>j</mi></msub><mo>)</mo></mrow><mi>K</mi><mrow><mo>(</mo><msub><mi>x</mi><mi>i</mi></msub><mo>,</mo><msub><mi>x</mi><mi>j</mi></msub><mo>)</mo></mrow><mo>+</mo><munderover><mo>&amp;Sigma;</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>l</mi></munderover><msubsup><mi>&amp;alpha;</mi><mi>i</mi><mo>*</mo></msubsup><mrow><mo>(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>-</mo><mi>&amp;epsiv;</mi><mo>)</mo></mrow><mo>-</mo><msub><mi>&amp;alpha;</mi><mi>i</mi></msub><mrow><mo>(</mo><msub><mi>y</mi><mi>i</mi></msub><mo>+</mo><mi>&amp;epsiv;</mi><mo>)</mo></mrow><mo>}</mo><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>3</mn><mo>)</mo></mrow><mo>;</mo></mrow> <mrow> <mi>s</mi> <mo>.</mo> <mi>t</mi> <mo>.</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <mn>0</mn> <mo>&amp;le;</mo> <msub> <mi>&amp;alpha;</mi> <mi>i</mi> </msub> <mo>&amp;le;</mo> <mi>E</mi> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>...</mn> <mo>,</mo> <mi>l</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mn>0</mn> <mo>&amp;le;</mo> <msubsup> <mi>&amp;alpha;</mi> <mi>i</mi> <mo>*</mo> </msubsup> <mo>&amp;le;</mo> <mi>E</mi> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mn>...</mn> <mo>,</mo> <mi>l</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>l</mi> </munderover> <mrow> <mo>(</mo> <msubsup> <mi>&amp;alpha;</mi> <mi>i</mi> <mo>*</mo> </msubsup> <mo>-</mo> <msub> <mi>&amp;alpha;</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo>=</mo> <mn>0</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> <mrow><mi>s</mi><mo>.</mo><mi>t</mi><mo>.</mo><mfenced open = "{" close = ""><mtable><mtr><mtd><mrow><mn>0</mn><mo>&amp;le;</mo><msub><mi>&amp;alpha;</mi><mi>i</mi></msub><mo>&amp;le;</mo><mi>E</mi><mo>,</mo><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>...</mn><mo>,</mo><mi>l</mi></mrow></mtd></mtr><mtr><mtd><mrow><mn>0</mn><mo>&amp;le;</mo><msubsup><mi>&amp;alpha;</mi><mi>i</mi><mo>*</mo></msubsup><mo>&amp;le;</mo><mi>E</mi><mo>,</mo><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>...</mn><mo>,</mo><mi>l</mi></mrow></mtd></mtr><mtr><mtd><mrow><munderover><mo>&amp;Sigma;</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>l</mi></munderover><mrow><mo>(</mo><msubsup><mi>&amp;alpha;</mi><mi>i</mi><mo>*</mo></msubsup><mo>-</mo><msub><mi>&amp;alpha;</mi><mi>i</mi></msub><mo>)</mo></mrow><mo>=</mo><mn>0</mn></mrow></mtd></mtr></mtable></mfenced><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>4</mn><mo>)</mo></mrow><mo>;</mo></mrow> 其中,y为样本序列,是采集到的车辆停靠时间原始序列,l为支持向量数目,x=(x1,x2,x3,x4)为属性变量,与有轨电车停靠时间紧密相关,分别为电车到站实际时刻、上车人数、下车人数、与上一辆进站电车的车头时距,这些都可通过跟车调查获取。Among them, y is the sample sequence, which is the original sequence of the collected vehicle stop time, l is the number of support vectors, x=(x 1 , x 2 , x 3 , x 4 ) is the attribute variable, which is closely related to the tram stop time , are the actual arrival time of the tram, the number of people boarding, the number of people getting off, and the headway distance from the last incoming tram, all of which can be obtained through follow-up surveys. 6.根据权利要求5所述的一种有轨电车与社会车流的协同控制方法,其特征在于,所述步骤(32)中采用嵌套算法确定绿灯时长和相位差,模块一以有轨电车在协调区段停车最小为目标,并将此目标作为新约束带入模块二,即控制区段总延误最小为优化目标,保证有轨电车在交叉口间连续优先通行的同时使得社会车辆在交叉口的延误尽可能小;6. the coordinated control method of a kind of tram and social traffic flow according to claim 5, is characterized in that, adopts nested algorithm to determine green light duration and phase difference in the described step (32), module one uses tram The minimum parking in the coordination section is the goal, and this goal is brought into Module 2 as a new constraint, that is, the minimum total delay in the control section is the optimization goal, which ensures that the trams continue to pass at the intersection while making social vehicles The delay at the port is as small as possible; 模块一:有轨电车绿波通行;Module 1: Green Wave Passage of Trams; 模块一以申请优先的有轨电车在目标区段的累计停车次数Sall最小为目标函数,对应的算法如下:Module 1 takes the cumulative parking times S all of the trams applying for priority in the target section as the minimum as the objective function, and the corresponding algorithm is as follows: <mrow> <mi>min</mi> <mi> </mi> <msub> <mi>S</mi> <mrow> <mi>a</mi> <mi>l</mi> <mi>l</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </munderover> <mi>S</mi> <mi> </mi> <mi>S</mi> <mo>=</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mn>0</mn> </mtd> <mtd> <mtable> <mtr> <mtd> <mrow> <msubsup> <mi>t</mi> <mi>s</mi> <mi>j</mi> </msubsup> <mo>&amp;le;</mo> <msubsup> <mi>t</mi> <mrow> <mi>a</mi> <mi>r</mi> <mi>r</mi> </mrow> <mi>j</mi> </msubsup> </mrow> </mtd> <mtd> <mrow> <mi>a</mi> <mi>n</mi> <mi>d</mi> </mrow> </mtd> <mtd> <mrow> <msubsup> <mi>t</mi> <mrow> <mi>a</mi> <mi>r</mi> <mi>r</mi> </mrow> <mi>j</mi> </msubsup> <mo>+</mo> <msub> <mi>t</mi> <mrow> <mi>e</mi> <mi>m</mi> <mi>p</mi> </mrow> </msub> <mo>&amp;le;</mo> <msubsup> <mi>t</mi> <mi>s</mi> <mi>j</mi> </msubsup> <mo>+</mo> <msubsup> <mi>t</mi> <mi>g</mi> <mrow> <mn>1</mn> <mi>j</mi> </mrow> </msubsup> </mrow> </mtd> </mtr> </mtable> </mtd> </mtr> <mtr> <mtd> <mn>1</mn> </mtd> <mtd> <mrow> <mi>e</mi> <mi>l</mi> <mi>s</mi> <mi>e</mi> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> <mrow><mi>min</mi><mi></mi><msub><mi>S</mi><mrow><mi>a</mi><mi>l</mi><mi>l</mi></mrow></msub><mo>=</mo><mi>min</mi><munderover><mo>&amp;Sigma;</mo><mrow><mi>j</mi><mo>=</mo><mn>1</mn></mrow><mi>n</mi></munderover><mi>S</mi><mi></mi><mi>S</mi><mo>=</mo><mfenced open = "{" close = ""><mtable><mtr><mtd><mn>0</mn></mtd><mtd><mtable><mtr><mtd><mrow><msubsup><mi>t</mi><mi>s</mi><mi>j</mi></msubsup><mo>&amp;le;</mo><msubsup><mi>t</mi><mrow><mi>a</mi><mi>r</mi><mi>r</mi></mrow><mi>j</mi></msubsup></mrow></mtd><mtd><mrow><mi>a</mi><mi>n</mi><mi>d</mi></mrow></mtd><mtd><mrow><msubsup><mi>t</mi><mrow><mi>a</mi><mi>r</mi><mi>r</mi></mrow><mi>j</mi></msubsup><mo>+</mo><msub><mi>t</mi><mrow><mi>e</mi><mi>m</mi><mi>p</mi></mrow></msub><mo>&amp;le;</mo><msubsup><mi>t</mi><mi>s</mi><mi>j</mi></msubsup><mo>+</mo><msubsup><mi>t</mi><mi>g</mi><mrow><mn>1</mn><mi>j</mi></mrow></msubsup></mrow></mtd></mtr></mtable></mtd></mtr><mtr><mtd><mn>1</mn></mtd><mtd><mrow><mi>e</mi><mi>l</mi><mi>s</mi><mi>e</mi></mrow></mtd></mtr></mtable></mfenced><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>5</mn><mo>)</mo></mrow><mo>;</mo></mrow> <mrow> <mi>s</mi> <mo>.</mo> <mi>t</mi> <mo>.</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <msubsup> <mi>t</mi> <mi>g</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>&amp;GreaterEqual;</mo> <msubsup> <mi>t</mi> <mrow> <mi>g</mi> <mi>min</mi> </mrow> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <msubsup> <mi>t</mi> <mi>g</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>=</mo> <mi>C</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mn>0</mn> <mo>&amp;le;</mo> <msub> <mi>o</mi> <mi>j</mi> </msub> <mo>&amp;le;</mo> <mi>C</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msubsup> <mi>t</mi> <mi>g</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>,</mo> <msubsup> <mi>t</mi> <mrow> <mi>g</mi> <mi>min</mi> </mrow> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>,</mo> <msub> <mi>o</mi> <mi>j</mi> </msub> <mo>&amp;GreaterEqual;</mo> <mn>0</mn> <mo>&amp;Element;</mo> <mi>int</mi> <mi>e</mi> <mi>g</mi> <mi>e</mi> <mi>r</mi> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> <mrow><mi>s</mi><mo>.</mo><mi>t</mi><mo>.</mo><mfenced open = "{" close = ""><mtable><mtr><mtd><mrow><msubsup><mi>t</mi><mi>g</mi><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>&amp;GreaterEqual;</mo><msubsup><mi>t</mi><mrow><mi>g</mi><mi>min</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msubsup></mrow></mtd></mtr><mtr><mtd><mrow><munderover><mo>&amp;Sigma;</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>m</mi></munderover><msubsup><mi>t</mi><mi>g</mi><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>=</mo><mi>C</mi></mrow></mtd></mtr><mtr><mtd><mrow><mn>0</mn><mo>&amp;le;</mo><msub><mi>o</mi><mi>j</mi></msub><mo>&amp;le;</mo><mi>C</mi></mrow></mtd></mtr><mtr><mtd><mrow><msubsup><mi>t</mi><mi>g</mi><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>,</mo><msubsup><mi>t</mi><mrow><mi>g</mi><mi>min</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>,</mo><msub><mi>o</mi><mi>j</mi></msub><mo>&amp;GreaterEqual;</mo><mn>0</mn><mo>&amp;Element;</mo><mi>int</mi><mi>e</mi><mi>g</mi><mi>e</mi><mi>r</mi></mrow></mtd></mtr></mtable></mfenced><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>6</mn><mo>)</mo></mrow><mo>;</mo></mrow> 其中,为第j个交叉口有轨电车通行相位绿灯启亮时间,oj为第j个交叉口的绝对相位差,a为正整数,C为协调控制的公共周期时长;in, is the time when the green light of the tram passing phase at the jth intersection is turned on, o j is the absolute phase difference of the jth intersection, a is a positive integer, and C is the duration of the public cycle of coordinated control; 为有轨电车到达第j个交叉口的时间; is the time when the tram arrives at the jth intersection; temp=(Ltr+Ld)/vtr为有轨电车穿越交叉口的清空时间;为第j个交叉口第i相位的绿灯时间,为第j个交叉口第i相位的最短绿灯时间,qij为第j个交叉口第i相位单周期车流量,Sij为第j个交叉口第i相位的车道饱和流率;t emp = (L tr +L d )/v tr is the clearing time for the tram to cross the intersection; is the green time of the i-th phase of the j-th intersection, is the shortest green light time of the i-th phase of the j-th intersection, q ij is the single-period traffic flow of the j-th intersection in the i-th phase, S ij is the lane saturation flow rate of the j-th intersection in the i-th phase; 通过整数空间粒子群算法求解式(5)和式(6),将求解结果作为新的约束条件带入模块二;Formula (5) and formula (6) are solved by the integer space particle swarm optimization algorithm, and the solution result is brought into module 2 as a new constraint condition; 模块二:基于期望延误的配时优化;Module 2: Timing optimization based on expected delay; 有轨电车的信号优先会给占用其他相位社会车辆的通行时间,为了在保障电车通行权的前提下,信号配时应当尽量降低其他相位社会车辆的通行延误,其算法如下:Tram signals give priority to the passing time of vehicles occupying other phases. In order to ensure the right of way of trams, the signal timing should minimize the delay of passing vehicles in other phases. The algorithm is as follows: <mrow> <mi>min</mi> <mi> </mi> <msub> <mi>D</mi> <mrow> <mi>a</mi> <mi>l</mi> <mi>l</mi> </mrow> </msub> <mo>=</mo> <mi>m</mi> <mi>i</mi> <mi>n</mi> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </munderover> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>2</mn> </mrow> <mi>m</mi> </munderover> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> <mrow><mi>min</mi><mi></mi><msub><mi>D</mi><mrow><mi>a</mi><mi>l</mi><mi>l</mi></mrow></msub><mo>=</mo><mi>m</mi><mi>i</mi><mi>n</mi><munderover><mo>&amp;Sigma;</mo><mrow><mi>j</mi><mo>=</mo><mn>1</mn></mrow><mi>n</mi></munderover><munderover><mo>&amp;Sigma;</mo><mrow><mi>i</mi><mo>=</mo><mn>2</mn></mrow><mi>m</mi></munderover><msub><mi>D</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>7</mn><mo>)</mo></mrow><mo>;</mo></mrow> <mrow> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>=</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mfrac> <mrow> <msup> <mrow> <mo>(</mo> <msubsup> <mi>t</mi> <mi>s</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>-</mo> <msubsup> <mi>t</mi> <mrow> <mi>a</mi> <mi>a</mi> </mrow> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>&amp;times;</mo> <msub> <mi>u</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>&amp;times;</mo> <msub> <mi>S</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </mrow> <mrow> <mn>2</mn> <mo>&amp;times;</mo> <mrow> <mo>(</mo> <msub> <mi>S</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>-</mo> <msub> <mi>u</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>)</mo> </mrow> </mrow> </mfrac> </mtd> <mtd> <mrow> <msubsup> <mi>t</mi> <mi>s</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>&amp;GreaterEqual;</mo> <msubsup> <mi>t</mi> <mrow> <mi>a</mi> <mi>a</mi> </mrow> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> </mrow> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> </mtd> <mtd> <mtable> <mtr> <mtd> <mrow> <msubsup> <mi>t</mi> <mi>s</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>&amp;le;</mo> <msubsup> <mi>t</mi> <mrow> <mi>a</mi> <mi>a</mi> </mrow> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> </mrow> </mtd> <mtd> <mrow> <mi>a</mi> <mi>n</mi> <mi>d</mi> </mrow> </mtd> <mtd> <mrow> <msub> <mi>q</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>-</mo> <msub> <mi>u</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>&amp;times;</mo> <mrow> <mo>(</mo> <msubsup> <mi>t</mi> <mi>g</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>-</mo> <msubsup> <mi>t</mi> <mrow> <mi>a</mi> <mi>a</mi> </mrow> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>+</mo> <msubsup> <mi>t</mi> <mi>s</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>)</mo> </mrow> <mo>&amp;GreaterEqual;</mo> <mn>0</mn> </mrow> </mtd> </mtr> </mtable> </mtd> </mtr> <mtr> <mtd> <mrow> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> <mrow> <mo>(</mo> <mn>2</mn> <mi>C</mi> <mo>-</mo> <mn>3</mn> <msubsup> <mi>t</mi> <mi>s</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mi>mod</mi> <mi> </mi> <mi>C</mi> <mo>-</mo> <msubsup> <mi>t</mi> <mi>g</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>+</mo> <msubsup> <mi>t</mi> <mrow> <mi>a</mi> <mi>a</mi> </mrow> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mi>mod</mi> <mi> </mi> <mi>C</mi> <mo>-</mo> <msub> <mi>q</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>/</mo> <msub> <mi>u</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>)</mo> </mrow> <mo>&amp;times;</mo> <mrow> <mo>(</mo> <msub> <mi>q</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>-</mo> <msub> <mi>u</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>&amp;times;</mo> <mo>(</mo> <mrow> <msubsup> <mi>t</mi> <mi>g</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>-</mo> <msubsup> <mi>t</mi> <mrow> <mi>a</mi> <mi>a</mi> </mrow> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>+</mo> <msubsup> <mi>t</mi> <mi>s</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> </mrow> <mo>)</mo> <mo>)</mo> </mrow> </mrow> </mtd> <mtd> <mrow> <mi>e</mi> <mi>l</mi> <mi>s</mi> <mi>e</mi> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> <mrow><msub><mi>D</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>=</mo>< mfenced open = "{" close = ""><mtable><mtr><mtd><mfrac><mrow><msup><mrow><mo>(</mo><msubsup><mi>t</mi><mi>s</mi><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>-</mo><msubsup><mi>t</mi><mrow><mi>a</mi><mi>a</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>)</mo></mrow><mn>2</mn></msup><mo>&amp;times;</mo><msub><mi>u</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>&amp;times;</mo><msub><mi>S</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub></mrow><mrow><mn>2</mn><mo>&amp;times;</mo><mrow><mo>(</mo><msub><mi>S</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>-</mo><msub><mi>u</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>)</mo></mrow></mrow></mfrac></mtd><mtd><mrow><msubsup><mi>t</mi><mi>s</mi><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>&amp;GreaterEqual;</mo><msubsup><mi>t</mi><mrow><mi>a</mi><mi>a</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msubsup></mrow></mtd></mtr><mtr><mtd><mn>0</mn></mtd><mtd><mtable><mtr><mtd><mrow><msubsup><mi>t</mi><mi>s</mi><mrow><mi>i</mi>mi><mi>j</mi></mrow></msubsup><mo>&amp;le;</mo><msubsup><mi>t</mi><mrow><mi>a</mi><mi>a</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msubsup></mrow></mtd><mtd><mrow><mi>a</mi><mi>n</mi><mi>d</mi></mrow></mtd><mtd><mrow><msub><mi>q</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>-</mo><msub><mi>u</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>&amp;times;</mo><mrow><mo>(</mo><msubsup><mi>t</mi><mi>g</mi><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>-</mo><msubsup><mi>t</mi><mrow><mi>a</mi><mi>a</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>+</mo><msubsup><mi>t</mi><mi>s</mi><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>)</mo></mrow><mo>&amp;GreaterEqual;</mo><mn>0</mn></mrow></mtd></mtr></mtable></mtd></mtr><mtr><mtd><mrow><mfrac><mn>1</mn><mn>2</mn></mfrac><mrow><mo>(</mo><mn>2</mn><mi>C</mi><mo>-</mo><mn>3</mn><msubsup><mi>t</mi><mi>s</mi><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mi>mod</mi><mi></mi><mi>C</mi><mo>-</mo><msubsup><mi>t</mi><mi>g</mi><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>+</mo><msubsup><mi>t</mi><mrow><mi>a</mi><mi>a</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mi>mod</mi><mi></mi><mi>C</mi><mo>-</mo><msub><mi>q</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>/</mo><msub><mi>u</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>)</mo></mrow><mo>&amp;times;</mo><mrow><mo>(</mo><msub><mi>q</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>-</mo><msub><mi>u</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>&amp;times;</mo><mo>(</mo><mrow><msubsup><mi>t</mi><mi>g</mi><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>-</mo><msubsup><mi>t</mi><mrow><mi>a</mi><mi>a</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>+</mo><msubsup><mi>t</mi><mi>s</mi><mrow><mi>i</mi><mi>j</mi></mrow></msubsup></mrow><mo>)</mo><mo>)</mo></mrow></mrow></mtd><mtd><mrow><mi>e</mi><mi>l</mi><mi>s</mi><mi>e</mi></mrow></mtd></mtr></mtable></mfenced><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>8</mn><mo>)</mo></mrow><mo>;</mo></mrow> <mrow> <mi>s</mi> <mo>.</mo> <mi>t</mi> <mo>.</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <msubsup> <mi>t</mi> <mi>g</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>&amp;GreaterEqual;</mo> <msubsup> <mi>t</mi> <mrow> <mi>g</mi> <mi>min</mi> </mrow> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <msubsup> <mi>t</mi> <mi>g</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>=</mo> <mi>C</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mn>0</mn> <mo>&amp;le;</mo> <msub> <mi>o</mi> <mi>j</mi> </msub> <mo>&amp;le;</mo> <mi>C</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msubsup> <mi>t</mi> <mi>g</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>,</mo> <msubsup> <mi>t</mi> <mrow> <mi>g</mi> <mi>min</mi> </mrow> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msubsup> <mo>,</mo> <msub> <mi>o</mi> <mi>j</mi> </msub> <mo>&amp;GreaterEqual;</mo> <mn>0</mn> <mo>&amp;Element;</mo> <mi>int</mi> <mi>e</mi> <mi>g</mi> <mi>e</mi> <mi>r</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mi>min</mi> <mi> </mi> <msub> <mi>S</mi> <mrow> <mi>a</mi> <mi>l</mi> <mi>l</mi> </mrow> </msub> <mo>=</mo> <mi>min</mi> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </munderover> <mi>S</mi> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> <mo>;</mo> </mrow> <mrow><mi>s</mi><mo>.</mo><mi>t</mi><mo>.</mo><mfenced open = "{" close = ""><mtable><mtr><mtd><mrow><msubsup><mi>t</mi><mi>g</mi><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>&amp;GreaterEqual;</mo><msubsup><mi>t</mi><mrow><mi>g</mi><mi>min</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msubsup></mrow></mtd></mtr><mtr><mtd><mrow><munderover><mo>&amp;Sigma;</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>m</mi></munderover><msubsup><mi>t</mi><mi>g</mi><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>=</mo><mi>C</mi></mrow></mtd></mtr><mtr><mtd><mrow><mn>0</mn><mo>&amp;le;</mo><msub><mi>o</mi><mi>j</mi></msub><mo>&amp;le;</mo><mi>C</mi></mrow></mtd></mtr><mtr><mtd><mrow><msubsup><mi>t</mi><mi>g</mi><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>,</mo><msubsup><mi>t</mi><mrow><mi>g</mi><mi>min</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msubsup><mo>,</mo><msub><mi>o</mi><mi>j</mi></msub><mo>&amp;GreaterEqual;</mo><mn>0</mn><mo>&amp;Element;</mo><mi>int</mi><mi>e</mi><mi>g</mi><mi>e</mi><mi>r</mi></mrow></mtd></mtr><mtr><mtd><mrow><mi>min</mi><mi></mi><msub><mi>S</mi><mrow><mi>a</mi><mi>l</mi><mi>l</mi></mrow></msub><mo>=</mo><mi>min</mi><munderover><mo>&amp;Sigma;</mo><mrow><mi>j</mi><mo>=</mo><mn>1</mn></mrow><mi>n</mi></munderover><mi>S</mi></mrow></mtd></mtr></mtable></mfenced><mo>-</mo><mo>-</mo><mo>-</mo><mrow><mo>(</mo><mn>9</mn><mo>)</mo></mrow><mo>;</mo></mrow> 其中,为第i个交叉口第j相位的车辆头车到达停车线的时间;uij为第i个交叉口第j相位考虑上游交叉口影响后的到达率;in, u ij is the arrival rate of the jth phase of the i-th intersection after considering the influence of the upstream intersection; 利用整数空间的粒子群算法就可以求得满足目标函数的各交叉口的信号相位配时和相位差。Using the particle swarm algorithm in integer space, the signal phase timing and phase difference of each intersection satisfying the objective function can be obtained.
CN201710868230.3A 2017-09-22 2017-09-22 A collaborative control method of tram and social traffic flow Active CN107705591B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710868230.3A CN107705591B (en) 2017-09-22 2017-09-22 A collaborative control method of tram and social traffic flow

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710868230.3A CN107705591B (en) 2017-09-22 2017-09-22 A collaborative control method of tram and social traffic flow

Publications (2)

Publication Number Publication Date
CN107705591A true CN107705591A (en) 2018-02-16
CN107705591B CN107705591B (en) 2020-04-14

Family

ID=61175341

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710868230.3A Active CN107705591B (en) 2017-09-22 2017-09-22 A collaborative control method of tram and social traffic flow

Country Status (1)

Country Link
CN (1) CN107705591B (en)

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109003445A (en) * 2018-07-09 2018-12-14 北方工业大学 A Tram Priority Signal Control Method Oriented to Efficient Green Wave
CN109102705A (en) * 2018-10-15 2018-12-28 上海市城市建设设计研究总院(集团)有限公司 Tramcar control method conllinear with public transport
CN109191835A (en) * 2018-09-03 2019-01-11 北京全路通信信号研究设计院集团有限公司 Tramcar operation control method and system
CN109712414A (en) * 2019-01-30 2019-05-03 同济大学 A kind of optimization method of more bandwidth arterial highway public transport control programs
CN110364003A (en) * 2019-07-18 2019-10-22 大连海事大学 Intersection double-line tramcar signal priority control method based on Internet of vehicles
CN111028521A (en) * 2019-12-19 2020-04-17 东南大学 Tramcar network green wave coordination control method and device
CN111028508A (en) * 2019-12-19 2020-04-17 东南大学 A method and device for steering control of tram based on path control
CN111311933A (en) * 2020-02-19 2020-06-19 东南大学 A green wave coordinated control method and device for a streetcar with a left-turn line in the middle of the road
CN111383466A (en) * 2018-12-27 2020-07-07 上海宝康电子控制工程有限公司 System and method for realizing signal control function of tram crossing
CN111462477A (en) * 2019-01-22 2020-07-28 上海宝康电子控制工程有限公司 Method for realizing anti-congestion control of tramcar based on road traffic state
CN111554107A (en) * 2020-03-27 2020-08-18 北京星云互联科技有限公司 Traffic control method, management platform, roadside equipment and system
CN112820126A (en) * 2020-12-31 2021-05-18 北京交通大学 Road right priority operation control and simulation method for non-invasive guided transport vehicle
CN113299081A (en) * 2021-04-30 2021-08-24 东南大学 Green wave cooperative control optimization method for social vehicles and tramcars
CN113291357A (en) * 2021-04-25 2021-08-24 东南大学 Intersection signal priority control method based on tramcar departure interval
CN115311868A (en) * 2022-07-20 2022-11-08 武汉理工大学 Bus priority-based trunk line coordination control method and device

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120326891A1 (en) * 2011-06-27 2012-12-27 Brad Cross Signal Light Priority System Utilizing Estimated Time of Arrival
CN104036648A (en) * 2014-06-27 2014-09-10 上海自仪泰雷兹交通自动化系统有限公司 Priority selection method for passing of tramcar at intersection
CN104240525A (en) * 2014-08-28 2014-12-24 公安部交通管理科学研究所 Road traffic signal controller system with streetcar priority control function
CN105206070A (en) * 2015-08-14 2015-12-30 公安部交通管理科学研究所 Real-time road traffic signal coordination optimization control method and control system thereof
CN105551273A (en) * 2016-01-25 2016-05-04 南昌航空大学 Tramcar intersection priority control detector position arrangement method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120326891A1 (en) * 2011-06-27 2012-12-27 Brad Cross Signal Light Priority System Utilizing Estimated Time of Arrival
CN104036648A (en) * 2014-06-27 2014-09-10 上海自仪泰雷兹交通自动化系统有限公司 Priority selection method for passing of tramcar at intersection
CN104240525A (en) * 2014-08-28 2014-12-24 公安部交通管理科学研究所 Road traffic signal controller system with streetcar priority control function
CN105206070A (en) * 2015-08-14 2015-12-30 公安部交通管理科学研究所 Real-time road traffic signal coordination optimization control method and control system thereof
CN105551273A (en) * 2016-01-25 2016-05-04 南昌航空大学 Tramcar intersection priority control detector position arrangement method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
钟吉林: "" 干线信号协调下的有轨电车优先研究"", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 *

Cited By (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109003445A (en) * 2018-07-09 2018-12-14 北方工业大学 A Tram Priority Signal Control Method Oriented to Efficient Green Wave
CN109191835A (en) * 2018-09-03 2019-01-11 北京全路通信信号研究设计院集团有限公司 Tramcar operation control method and system
CN109102705A (en) * 2018-10-15 2018-12-28 上海市城市建设设计研究总院(集团)有限公司 Tramcar control method conllinear with public transport
CN109102705B (en) * 2018-10-15 2020-12-18 上海市城市建设设计研究总院(集团)有限公司 Tram and bus collinear control method
CN111383466A (en) * 2018-12-27 2020-07-07 上海宝康电子控制工程有限公司 System and method for realizing signal control function of tram crossing
CN111462477A (en) * 2019-01-22 2020-07-28 上海宝康电子控制工程有限公司 Method for realizing anti-congestion control of tramcar based on road traffic state
CN109712414A (en) * 2019-01-30 2019-05-03 同济大学 A kind of optimization method of more bandwidth arterial highway public transport control programs
CN109712414B (en) * 2019-01-30 2021-09-03 同济大学 Optimization method of multi-bandwidth trunk road bus control scheme
CN110364003A (en) * 2019-07-18 2019-10-22 大连海事大学 Intersection double-line tramcar signal priority control method based on Internet of vehicles
CN110364003B (en) * 2019-07-18 2021-05-14 大连海事大学 Intersection double-line tramcar signal priority control method based on Internet of vehicles
CN111028508A (en) * 2019-12-19 2020-04-17 东南大学 A method and device for steering control of tram based on path control
CN111028521A (en) * 2019-12-19 2020-04-17 东南大学 Tramcar network green wave coordination control method and device
CN111311933A (en) * 2020-02-19 2020-06-19 东南大学 A green wave coordinated control method and device for a streetcar with a left-turn line in the middle of the road
CN111554107A (en) * 2020-03-27 2020-08-18 北京星云互联科技有限公司 Traffic control method, management platform, roadside equipment and system
CN111554107B (en) * 2020-03-27 2021-04-16 北京星云互联科技有限公司 Traffic control method, management platform, road side equipment and system
CN112820126A (en) * 2020-12-31 2021-05-18 北京交通大学 Road right priority operation control and simulation method for non-invasive guided transport vehicle
CN112820126B (en) * 2020-12-31 2021-08-24 北京交通大学 A right-of-way priority operation control and simulation method for a non-intrusive guided transport vehicle
CN113291357A (en) * 2021-04-25 2021-08-24 东南大学 Intersection signal priority control method based on tramcar departure interval
CN113291357B (en) * 2021-04-25 2022-06-17 东南大学 An intersection signal priority control method based on tram departure interval
CN113299081A (en) * 2021-04-30 2021-08-24 东南大学 Green wave cooperative control optimization method for social vehicles and tramcars
CN113299081B (en) * 2021-04-30 2022-06-07 东南大学 Green wave cooperative control optimization method for social vehicles and tramcars
CN115311868A (en) * 2022-07-20 2022-11-08 武汉理工大学 Bus priority-based trunk line coordination control method and device

Also Published As

Publication number Publication date
CN107705591B (en) 2020-04-14

Similar Documents

Publication Publication Date Title
CN107705591A (en) A kind of tramcar and the cooperative control method of social wagon flow
CN103218921B (en) Primary and secondary crossing bus rapid transit signal priority cooperative control method
CN104282162B (en) A kind of crossing self-adapting signal control method based on real-time vehicle track
CN103198681B (en) A kind of intersection signal control method towards public traffic in priority
CN103280113B (en) Self-adaptive intersection signal control method
CN102002901B (en) Intersection space design method based on complexity control
CN110136455B (en) A method of timing traffic signal lights
CN104637317B (en) A kind of crossing based on real-time vehicle track actuated signal control method
CN112037507B (en) An adaptive signal coordination design method and device for arterial lines in oversaturated traffic conditions
CN103236164B (en) Vehicle controlling method for guaranteeing public transport vehicle prior passing
CN109448403B (en) Bus signal priority necessity analysis method under trunk line coordination control
CN104200680B (en) The coordinating control of traffic signals method of arterial street under supersaturation traffic behavior
CN102568197B (en) Method for setting bidirectional green wave signals for bus trunk line
CN107610487A (en) Area Traffic Control System and method based on the dynamic random wagon flow phase difference coordination system
CN106777752A (en) A kind of bullet train follows the trail of operation curve Optimal Setting method
CN104064037B (en) Highway and city expressway convergence part traffic cooperative control system
CN106781563A (en) A kind of city expressway intersection public transport priority signal coordinating timing method
CN106297335B (en) A kind of public traffic in priority green extension optimization method that intersection-downstream bus stop interacts under environment
CN103000027A (en) Intelligent traffic guidance method based on floating car under congestion condition
CN107730886A (en) Dynamic optimization method for traffic signals at urban intersections in Internet of vehicles environment
CN102157064A (en) Method for designing signal intersection of bus lanes
CN104064041A (en) Traffic signal lamp adjusting system and method based on public transport motorcade priority
CN107886744A (en) One kind is used for subway station adjacent to intersection public transport priority signal control method
CN111383453B (en) Traffic signal control on-line simulation and real-time tracking feedback system and operation method
CN104778844A (en) Traffic signal control method of lane borrowing passing in closed construction area of highway

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