[go: up one dir, main page]

CN110688982B - Intelligent rail transit time control method based on target detection technology and ACO-BP algorithm - Google Patents

Intelligent rail transit time control method based on target detection technology and ACO-BP algorithm Download PDF

Info

Publication number
CN110688982B
CN110688982B CN201910973432.3A CN201910973432A CN110688982B CN 110688982 B CN110688982 B CN 110688982B CN 201910973432 A CN201910973432 A CN 201910973432A CN 110688982 B CN110688982 B CN 110688982B
Authority
CN
China
Prior art keywords
input
people
algorithm
train
weight
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.)
Active
Application number
CN201910973432.3A
Other languages
Chinese (zh)
Other versions
CN110688982A (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.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
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 Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201910973432.3A priority Critical patent/CN110688982B/en
Publication of CN110688982A publication Critical patent/CN110688982A/en
Application granted granted Critical
Publication of CN110688982B publication Critical patent/CN110688982B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06VIMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V20/00Scenes; Scene-specific elements
    • G06V20/50Context or environment of the image
    • G06V20/52Surveillance or monitoring of activities, e.g. for recognising suspicious objects
    • G06V20/53Recognition of crowd images, e.g. recognition of crowd congestion
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/004Artificial life, i.e. computing arrangements simulating life
    • G06N3/006Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/04Architecture, e.g. interconnection topology
    • G06N3/045Combinations of networks
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/08Learning methods
    • G06N3/084Backpropagation, e.g. using gradient descent
    • 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/10Services
    • G06Q50/26Government or public services

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Business, Economics & Management (AREA)
  • General Health & Medical Sciences (AREA)
  • Computational Linguistics (AREA)
  • Evolutionary Computation (AREA)
  • Biophysics (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Biomedical Technology (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Artificial Intelligence (AREA)
  • Data Mining & Analysis (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Tourism & Hospitality (AREA)
  • Multimedia (AREA)
  • Educational Administration (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Primary Health Care (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

The invention requests to protect an intelligent rail transit time control method based on a target detection technology and an ACO-BP algorithm. Firstly, counting the daily pedestrian flow of each station of a third line of the track traffic for Chongqing by using a target detection technology, and counting to obtain the waiting number and the actual number of passengers getting on the train; secondly, taking the number of waiting people and the number of actual people who actually get on the train as input, and obtaining a relation weight of the influence of the pedestrian volume and the arrival time interval on the train carrying capacity based on the BP neural network; and further, taking the current pedestrian flow in each station as an input quantity, taking the relation weight as an influence parameter, transmitting the influence parameter into an ant colony algorithm to establish a mathematical model, and obtaining the maximum carrying capacity by continuously changing the departure interval. Meanwhile, the error between the expected carrying capacity and the actual carrying capacity is used as input, and the updating of the weight value and the optimization result are realized based on the learning function of a BP (Back propagation) neural network. The invention acquires the train time interval of the maximum carrying capacity by collecting the environmental information of the light rail station in real time and continuously updating the algorithm.

Description

基于目标检测技术和ACO-BP算法的智能轨道交通时间控制 方法Intelligent rail transit time control method based on target detection technology and ACO-BP algorithm

技术领域technical field

本发明属于城市轨道交通控制领域,具体是利用当前各站点内人流量与历史数据通过算法匹配出最优通行方案,该系统是基于目标检测技术和ACO-BP算法的智能轨道交通时间控制系统。The invention belongs to the field of urban rail transit control, and specifically uses the current human flow and historical data in each station to match an optimal traffic plan through an algorithm. The system is an intelligent rail transit time control system based on target detection technology and ACO-BP algorithm.

背景技术Background technique

随着城市规模的不断扩大,汽车数量猛增,上下班高时段及关键地带道路十分拥堵。在交通需求量巨大的情况下,城市轨道交通因其方便、安全、快捷、准点率高等特点,越来越受人们的喜爱。但现在轻轨面临着同样的拥堵问题,在一些商圈、机场、车站以及在高峰时间段,地铁及地铁站人流量巨大,导致乘客等待时间变长且十分拥挤,并且也容易出现安全事故。With the continuous expansion of the city, the number of cars has soared, and the roads are very congested during high commuting hours and key areas. Under the circumstance of huge traffic demand, urban rail transit is more and more popular because of its convenient, safe, fast, and high punctuality rate. But now the light rail is facing the same congestion problem. In some business districts, airports, stations and during peak hours, the subway and subway stations have a huge flow of people, which leads to long waiting times for passengers and is very crowded, and it is also prone to safety accidents.

目前大部分地铁站都是采用高峰时段和低峰时段分别定时。如王寿钦[1]以广州地铁三号线为例,通过蒙特卡洛建模仿真获得高峰时段和非高峰时段的最佳发车时间间隔,但是这种方法仅能求出某种模拟出来的情况下的最佳发车时间间隔,并不能完全解决拥挤问题;文献[2]也指出,为保证乘客安全与交通方便,需要根据实际情况来设置不同时期不同地铁站的停靠时间;汪林[3]、张天宇[4]分别以南京地铁二号线、北京地铁昌平线和上海城市轨道交通金山线为例,将问题简化为数学模型以优化时刻表。以上算法基本都是以优化时刻表进行建模从而达到缓解拥挤的问题。而本发明将通过分析实际情况,进而来设置不同时期不同地铁站的停靠时间,以实现一种自动调节。At present, most subway stations use separate timings during peak and low-peak hours. For example, Wang Shouqin [1] took Guangzhou Metro Line 3 as an example. Monte Carlo modeling and simulation was used to obtain the optimal departure time interval between peak hours and off-peak hours. However, this method can only obtain certain simulation conditions. The optimal departure time interval cannot completely solve the problem of congestion; Literature [2] also pointed out that in order to ensure the safety of passengers and convenient transportation, it is necessary to set the stopping time of different subway stations in different periods according to the actual situation; Wang Lin [3], Zhang Tianyu [4] took Nanjing Metro Line 2, Beijing Metro Changping Line and Shanghai Urban Rail Transit Jinshan Line as examples, and simplified the problem into a mathematical model to optimize the timetable. The above algorithms are basically modeled by optimizing the timetable to alleviate the problem of congestion. The present invention will set the stop time of different subway stations in different periods by analyzing the actual situation, so as to realize an automatic adjustment.

近几年,为解决地铁站拥挤问题,各个地区在此投入大量研究,寻找解决的方案。刘涛[5]等人提出了减少客流量情况下均衡收益水平的“为拥挤买单”的概念,通过高峰期提升票价来改善拥挤度,这种方法在一定程度上是有效的,可以让一些不是很着急的人不在高峰时段乘坐地铁,但是对于上学放学时间段,其效果有待进一步改善;基于此,以动态角度为切入点,魏化永[6]提出基于模糊控制算法的城市轨道交通信号控制系统设计方法,采用变结构PID模糊神经网络控制方法对城市轨道交通信号的控制规则进行改进,在嵌入式环境下进行城市轨道交通信号控制系统的硬件设计;陈志杰[7]以客流为研究主线,基于A F C刷卡数据,从进站乘客去向估计、乘客进出站和换乘走行过程参数推算、列车和车站负荷的推算,通过控制客流量以缓解拥挤,这种方法主要是控制客流量,可以起到减缓地铁以及地铁站台的拥挤情况,但是不能缓解地铁站的拥挤,并且使乘客等待时间变长,与地铁方便快捷的特点相违背。In recent years, in order to solve the problem of congestion in subway stations, various regions have invested a lot of research here to find solutions. Liu Tao[5] and others put forward the concept of "paying for congestion" to reduce the equilibrium income level in the case of passenger flow, and improve the congestion degree by increasing the fare during peak hours. This method is effective to a certain extent, and can make some People who are not in a hurry do not take the subway during peak hours, but the effect needs to be further improved for the time period when going to school and after school. Based on this, taking the dynamic angle as the starting point, Wei Huayong [6] proposed an urban rail transit signal control system based on fuzzy control algorithm. The design method uses the variable structure PID fuzzy neural network control method to improve the control rules of urban rail transit signals, and carries out the hardware design of the urban rail transit signal control system in an embedded environment; Chen Zhijie [7] takes passenger flow as the main research line, based on A F C card swiping data, from the estimation of the destination of incoming passengers, the estimation of the parameters of the passengers entering and leaving the station and the transfer process, the estimation of the train and station load, and the control of the passenger flow to relieve congestion. This method is mainly to control the passenger flow, which can play a role in slowing down The congestion of subways and subway platforms can not relieve the congestion of subway stations and make passengers wait longer, which is contrary to the convenience and speed of subways.

综上,基于目标检测技术,考虑到蚁群算法在网络路由中具有信息分布式性、动态性、随机性和异步性等特点,结合BP(back propagation)神经网络算法,本发明提出一种基于目标检测技术和ACO-BP算法的智能轨道交通时间控制方法,以缓解地铁站拥堵问题。To sum up, based on the target detection technology, considering that the ant colony algorithm has the characteristics of information distribution, dynamics, randomness and asynchrony in network routing, combined with the BP (back propagation) neural network algorithm, the present invention proposes a Intelligent rail transit time control method based on target detection technology and ACO-BP algorithm to alleviate the congestion problem of subway stations.

参考文献references

[1]王寿钦.基于蒙特卡洛建模仿真的广州地铁三号线列车发车时间间隔研究[D].华南理工大学:王寿钦,2010.[1] Wang Shouqin. Research on the departure time interval of Guangzhou Metro Line 3 based on Monte Carlo modeling and simulation [D]. South China University of Technology: Wang Shouqin, 2010.

[2]李思让,罗旭阳,傅饶.北京地铁高峰期最佳停靠时间分析——以北京地铁10号线惠新西街南口站为例[J].名师在线,2016,(08):11-13.[2] Li Sirang, Luo Xuyang, Fu Rao. Analysis of the Best Stop Time of Beijing Subway During Peak Period——Taking the South Exit Station of Huixin West Street of Beijing Subway Line 10 as an Example [J]. Famous Teachers Online, 2016, (08): 11- 13.

[3]汪林.基于客流需求的城市轨道交通时刻表优化研究[D].东南大学:汪林,2015.[3] Wang Lin. Research on optimization of urban rail transit timetable based on passenger flow demand [D]. Southeast University: Wang Lin, 2015.

[4]张天宇.动态客流需求下基于公平与效率的城市轨道交通列车时刻表优化模型与算法[D].北京交通大学:张天宇,2018.[4] Zhang Tianyu. Optimization model and algorithm of urban rail transit train schedule based on fairness and efficiency under dynamic passenger flow demand [D]. Beijing Jiaotong University: Zhang Tianyu, 2018.

[5]刘涛,姚鸿超.北京地铁的分时定价策略研究[J].企业改革与管理,2017,(13):207-215.[5] Liu Tao, Yao Hongchao. Research on Time-of-use Pricing Strategy of Beijing Subway [J]. Enterprise Reform and Management, 2017, (13): 207-215.

[6]魏化永.基于模糊控制算法的城市轨道交通信号控制系统设计分析[J].许昌学院学报,2018,(06):73-76.[6] Wei Huayong. Design and Analysis of Urban Rail Transit Signal Control System Based on Fuzzy Control Algorithm [J]. Journal of Xuchang University, 2018, (06): 73-76.

[7]陈志杰.城市轨道交通线路负荷实时推算模型及控制方法[D].北京交通大学:陈志杰,2018.[7] Chen Zhijie. Real-time estimation model and control method of urban rail transit line load [D]. Beijing Jiaotong University: Chen Zhijie, 2018.

发明内容SUMMARY OF THE INVENTION

本发明旨在解决以上现有技术的问题。提出了一种实现轨道交通客运量最大化的基于目标检测技术和ACO-BP算法的智能轨道交通时间控制方法。本发明的技术方案如下:The present invention aims to solve the above problems of the prior art. An intelligent rail transit time control method based on target detection technology and ACO-BP algorithm is proposed to maximize the passenger volume of rail transit. The technical scheme of the present invention is as follows:

一种基于目标检测技术和ACO-BP算法的智能轨道交通时间控制方法,其包括以下步骤:An intelligent rail transit time control method based on target detection technology and ACO-BP algorithm, comprising the following steps:

首先,考虑到深度学习在机器视觉领域独特的检测性能,利用Faster-RCNN目标检测方法,通过深度学习技术对图像进行特征提取,进而捕捉车辆以及行人图像,统计轨道线路每个站点每天的人流量大小,统计得到每个班次等待人数与实际上车人数;实时统计车厢数和车辆间隔时间,再传入BP神经网络中;First, considering the unique detection performance of deep learning in the field of machine vision, the Faster-RCNN target detection method is used to extract features from images through deep learning technology, and then capture images of vehicles and pedestrians, and count the daily flow of people at each station of the track line. The number of people waiting for each shift and the actual number of vehicles are obtained by statistics; the number of cars and the interval time between vehicles are calculated in real time, and then passed into the BP neural network;

其次,以等待人数与实际上车人数、以及车辆实际发车间隔为输入,基于BP神经网络得出等车人数与列车发车时间间隔对实际上车人数的关系权值;Secondly, taking the number of people waiting, the actual number of trains, and the actual departure interval of the vehicle as the input, based on the BP neural network, the weight of the relationship between the number of waiting people and the time interval of train departure to the actual number of trains is obtained;

最后,以当前各站点内人流量为输入量,关系权值作为影响参数传入到蚁群算法建立数学模型,通过不断改变发车间隔来得到最大承运量,同时以期望与实际承运量之间的误差为输入,基于BP神经网络学习功能,实现权值的更新,优化结果;Finally, take the current flow of people in each station as the input, and the relationship weight as the influence parameter is input to the ant colony algorithm to establish a mathematical model, and the maximum carrying capacity is obtained by continuously changing the departure interval. The error is input, based on the learning function of BP neural network, the update of weights is realized and the result is optimized;

所述BP神经网络寻找关系权值的步骤具体包括:利用非线性变换函数

Figure GDA0003636457760000031
作为传递函数The step of finding the relationship weight value by the BP neural network specifically includes: using a nonlinear transformation function
Figure GDA0003636457760000031
as a transfer function

其激活函数则为:

Figure GDA0003636457760000032
Its activation function is:
Figure GDA0003636457760000032

wik学习权值,B为常量,Bk待学习的偏置量,yk表示输出,I表示输入数据个数;w ik learning weight, B is a constant, B k is the offset to be learned, y k represents the output, and I represents the number of input data;

初期建立过程中,将权值初始化为W1、W2,权值更新过程中利用梯度下降原理;In the initial establishment process, the weights are initialized to W 1 and W 2 , and the gradient descent principle is used in the weight update process;

此时算法输出结果与实际情况之间误差用以下公式表示At this time, the error between the output of the algorithm and the actual situation is expressed by the following formula

Figure GDA0003636457760000033
Figure GDA0003636457760000033

其中i为输入元、k为隐含元、j为输出元、X为输入量,Y为输出量,Sj为实际承运量,Yj为最大承运量;O表示输出个数,对应于输入数据个数;where i is the input element, k is the implicit element, j is the output element, X is the input quantity, Y is the output quantity, S j is the actual carrying quantity, and Y j is the maximum carrying quantity; O represents the number of outputs, corresponding to the input number of data;

根据梯度下降法的原理,权值的修正值与误差函数呈正比为:According to the principle of the gradient descent method, the correction value of the weight is proportional to the error function as:

Figure GDA0003636457760000041
Figure GDA0003636457760000041

令:make:

Wkj表示网络中待学习的权值,a表示常量,E表示误差函数;W kj represents the weight to be learned in the network, a represents a constant, and E represents an error function;

Figure GDA0003636457760000042
Figure GDA0003636457760000042

则:but:

Figure GDA0003636457760000043
Figure GDA0003636457760000043

Yk表示当前隐含层输出,δk为梯度变化量,H表示当前隐含层输入数据个数;Y k represents the output of the current hidden layer, δ k is the gradient change, and H represents the number of input data of the current hidden layer;

对于偏置Bj For bias B j

Figure GDA0003636457760000044
Figure GDA0003636457760000044

令:make:

Figure GDA0003636457760000045
Figure GDA0003636457760000045

则:but:

ΔBj=δkj (7)ΔB j = δ kj (7)

由上述公式可以得到输出层结点j到隐含层的返向传播的权重W与偏置B如下:From the above formula, the weight W and bias B of the back propagation from the output layer node j to the hidden layer can be obtained as follows:

Figure GDA0003636457760000046
Figure GDA0003636457760000046

Bj=Bj-a*δkj (9)B j =B j -a*δ kj (9)

令:make:

Figure GDA0003636457760000047
Figure GDA0003636457760000047

得到隐含层结点k到输入层的返向传播的权重W与偏置B如下:The weight W and bias B of the back propagation from the hidden layer node k to the input layer are obtained as follows:

Figure GDA0003636457760000048
Figure GDA0003636457760000048

Bk=Bk-b*δik (12)B k =B k -b* δik (12)

b表示常数,从而实现隐含层到输出层的权值的更新b represents a constant, so as to realize the update of the weights from the hidden layer to the output layer

其中,BP神经网络隐含层的输出值为Among them, the output value of the hidden layer of the BP neural network is

Figure GDA0003636457760000051
Figure GDA0003636457760000051

Yk=f(yk) (14)Y k =f(y k ) (14)

最终输出层的输出值为The output value of the final output layer is

Figure GDA0003636457760000052
Figure GDA0003636457760000052

Yj=f(yj) (16)Y j =f(y j ) (16)

最终得到的结果为列车在每个站点的实际承运量,yj表示中间输出值;The final result is the actual carrying capacity of the train at each station, and y j represents the intermediate output value;

所述以当前各站点内人流量为输入量,关系权值作为影响参数传入到蚁群算法建立数学模型,通过不断改变发车间隔来得到最大承运量,同时以期望与实际承运量之间的误差为输入,基于BP神经网络学习功能,实现权值的更新,优化结果,具体包括:The current flow of people in each station is used as the input, and the relationship weight is input as an influence parameter to the ant colony algorithm to establish a mathematical model, and the maximum carrying capacity is obtained by continuously changing the departure interval. The error is the input, and based on the learning function of the BP neural network, the weights are updated and the results are optimized, including:

以当前各站点内人流量为输入量,关系权值作为影响参数传入到蚁群算法建立数学模型,此处的蚁群算法,基本框架是对于当前人流量,让算法随机去分配上车的人数,并留下相应的信息素,在下一次的迭代的过程中利用这些信息素,对于不同的上车人数,让它以一个特定的概率分布对是否是最大承载进行选择,概率分布如下:Taking the current flow of people in each site as the input, and the relationship weight as the influencing parameter, it is input to the ant colony algorithm to establish a mathematical model. The basic framework of the ant colony algorithm here is to randomly assign the people to the car for the current flow of people. number of people, and leave the corresponding pheromone, and use these pheromone in the next iteration process. For different number of people getting on the bus, let it choose whether it is the maximum load with a specific probability distribution. The probability distribution is as follows:

Figure GDA0003636457760000053
Figure GDA0003636457760000053

其中

Figure GDA0003636457760000054
表示当前人数量上车的概率,η表示一个启发值,τ为信息素浓度,Jk(r)表示不同上车人数的集合,δ和β表示τ和η的比重,δ越大,τ比重越大,反之亦然,通常设定δ=1,β=6;in
Figure GDA0003636457760000054
Indicates the probability of the current number of people getting on the bus, η represents a heuristic value, τ is the pheromone concentration, J k (r) represents the set of different number of people getting on the bus, δ and β represent the proportion of τ and η, the larger the δ, the greater the proportion of τ The larger, and vice versa, usually set δ=1, β=6;

调整列车发车时车厢数量与整条线路全天人流量的关系,确定设置最优车厢数量,最后利用ACO算法智能匹配,最终得到最优值,得到最优列车时间间隔和车厢数量,使得列车单次承运量最大化。Adjust the relationship between the number of carriages when the train departs and the passenger flow of the entire line throughout the day, determine the optimal number of carriages, and finally use the ACO algorithm to intelligently match, and finally obtain the optimal value, obtain the optimal train time interval and the number of carriages, and make the train single Maximum sub-carriage.

进一步的,所述BP神经网络共三层,包括输入层即编码层、隐含层以及输出层,输入层有3个神经元,隐含层有6个神经元,输出层有2个神经元。本发明的优点及有益效果如下:Further, the BP neural network has three layers, including the input layer, namely the coding layer, the hidden layer and the output layer. The input layer has 3 neurons, the hidden layer has 6 neurons, and the output layer has 2 neurons. . The advantages and beneficial effects of the present invention are as follows:

(1)首先利用深度学习技术Faster-RCNN去进行目标检测,能够确保检测的精确度,能够得到准确的不同时间段的实际人流量;此外,本发明采用了BP神经网络算法相结合,使得其能够根据历史数据信息进行分析运算,对列车每站运行时间动态调节。相比于传统控制方法更为灵活,实时性更强。(1) First, the deep learning technology Faster-RCNN is used to perform target detection, which can ensure the accuracy of detection and obtain accurate actual flow of people in different time periods; It can analyze and calculate according to historical data information, and dynamically adjust the running time of each station of the train. Compared with traditional control methods, it is more flexible and has stronger real-time performance.

(2)以BP神经网络为基础的算法能够对所传入数据不断学习,通过不断更新权值能够快速适应当前轻轨站内人流量突变情况,及时反馈给列车,具有较强的适应性,达到提高承载量目的。(2) The algorithm based on the BP neural network can continuously learn the incoming data, and can quickly adapt to the sudden change of the current passenger flow in the light rail station by continuously updating the weight value, and timely feedback to the train, which has strong adaptability and achieves improvement. carrying capacity purpose.

(3)在道路运作当中各个轻轨站内智能检测系统能够独立运作,计算量较小,ACO-BP算法的分布式存储和并行协同处理能够促进全局优化,产生叠加效应,扩大优化效果。(3) During the road operation, the intelligent detection systems in each light rail station can operate independently, with a small amount of calculation. The distributed storage and parallel collaborative processing of the ACO-BP algorithm can promote global optimization, produce superposition effects, and expand the optimization effect.

通过深度学习目标检测技术,结合传统BP网络以及蚁群算法,实现调度。Through deep learning target detection technology, combined with traditional BP network and ant colony algorithm, scheduling is realized.

附图说明Description of drawings

图1是本发明提供优选实施例逻辑框架模型Fig. 1 is the logical framework model of the preferred embodiment provided by the present invention

图2:BP神经网络结构Figure 2: BP neural network structure

图3:模拟车站列车以及行人入口Figure 3: Simulated station train and pedestrian entrance

图4:模拟行人等待列车Figure 4: Simulated pedestrian waiting for a train

图5:列车承运效果Figure 5: Train carrying effect

具体实施方式Detailed ways

下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清楚、详细地描述。所描述的实施例仅仅是本发明的一部分实施例。The technical solutions in the embodiments of the present invention will be described clearly and in detail below with reference to the accompanying drawings in the embodiments of the present invention. The described embodiments are only some of the embodiments of the invention.

本发明解决上述技术问题的技术方案是:The technical scheme that the present invention solves the above-mentioned technical problems is:

目前而言,解决轻轨车厢节数以及发车时间间隔仍是沿用传统的公交车时间间隔设置,虽然轻轨在设置上会根据自身实际情况进行一定程度的优化,但是缺乏大数据的支撑难得到最佳优化结果。本发明提出了一种基于ACO-BP智能算法以及目标检测技术的智能车辆调度模型,该系统通过对重庆轻轨三号线各个站点人流量以及上车人数等数据进行收集,同时利用AOC-BP算法,结合当天列车实际车厢数和车辆间隔时间来得到最优配置方案,具有可行性强,效率高的特点。At present, the traditional bus time interval setting is still used to solve the number of light rail carriages and the departure time interval. Although the light rail setting will be optimized to a certain extent according to its own actual situation, it is difficult to get the best results without the support of big data. Optimization Results. The present invention proposes an intelligent vehicle scheduling model based on the ACO-BP intelligent algorithm and target detection technology. The system collects data such as the flow of people and the number of passengers on each station of Chongqing Light Rail Line 3, and uses the AOC-BP algorithm at the same time. , combined with the actual number of train carriages and the vehicle interval time of the day to obtain the optimal configuration plan, which has the characteristics of strong feasibility and high efficiency.

基于目标检测技术、ACO-BP算法的轻轨列车运行调配模型,其特征在于,利用目标检测技术对当前各个轻轨站等车人数以及上车人数进行实时统计。其次,通过将轨道交通三号线历史数据输入BP神经网络以得到车站人流量、发车时间间隔对实际上车人数影响的关系权值,以当前站点人流量信息为输入,关系权值作为影响参数,得到最优列车到达时间间隔,同时将未能上车人数数据信息传递到蚁群算法当中得到车厢最优节数设置匹配方案,实现对轻轨列车发车间隔时间和车厢节数的合理配置,使得轨道交通通行能力得到高效合理的最大化利用。其相应的运作原理如图1所示,同时BP(Backpropagation)神经网络可以对理论承运量与实际承运量进行比较分析,实现关系权值的更新,优化算法。The light rail train operation and deployment model based on target detection technology and ACO-BP algorithm is characterized in that the target detection technology is used to conduct real-time statistics on the number of passengers waiting and boarding at each light rail station. Secondly, by inputting the historical data of Rail Transit Line 3 into the BP neural network, the relationship weights of the influence of the station traffic and the departure time interval on the actual number of trains are obtained. The current station traffic information is used as the input, and the relationship weights are used as the influencing parameters. , get the optimal train arrival time interval, and at the same time pass the data information of the number of people who fail to get on the train to the ant colony algorithm to get the optimal number of carriages setting matching scheme, and realize the reasonable configuration of the departure interval time and the number of carriages of light rail trains, so that Rail transit capacity is efficiently and rationally maximized. The corresponding operation principle is shown in Figure 1. At the same time, the BP (Backpropagation) neural network can compare and analyze the theoretical carrying capacity and the actual carrying capacity, realize the update of the relationship weight and optimize the algorithm.

1、目标检测1. Target detection

首先,通过目标检测技术Faster-RCNN,通过深度学习技术对图像进行特征提取,进而捕捉行车辆以及行人图像,达到目标检测的目的,达到目标检测的目的。First of all, through the target detection technology Faster-RCNN, through the deep learning technology to extract the features of the image, and then capture the images of moving vehicles and pedestrians, to achieve the purpose of target detection, to achieve the purpose of target detection.

2、BP神经网络寻找关系权值2. BP neural network to find relationship weights

BP(back propagation)神经网络模型是一种可以通过对输入其中数据进行不断地学习,通过更新权值而得到最优解的智能算法。The BP (back propagation) neural network model is an intelligent algorithm that can obtain the optimal solution by continuously learning the input data and updating the weights.

以重庆轻轨三号线龙头寺轻轨站为例,以当前车站内等车人数,实际上车人数以及车辆实际发车间隔为输入量,最终分别得到等车人数与列车发车时间间隔对实际上车人数的关系权值,如图2所示。Taking the Longtousi Light Rail Station of Chongqing Light Rail Line 3 as an example, taking the current number of people waiting for trains in the station, the actual number of trains and the actual departure interval of vehicles as the input quantities, and finally the number of people waiting for trains and the time interval between train departures and the actual number of trains are obtained respectively. The relationship weights are shown in Figure 2.

因此,我们设置输入层节点数3个,输出层节点数为2个,设定的隐含层个数为6个,并采用单层神经网络模式。Therefore, we set the number of input layer nodes to 3, the number of output layer nodes to 2, and the set number of hidden layers to 6, and use the single-layer neural network model.

利用非线性变换函数

Figure GDA0003636457760000081
作为传递函数Using nonlinear transformation functions
Figure GDA0003636457760000081
as a transfer function

其激活函数则为:

Figure GDA0003636457760000082
Its activation function is:
Figure GDA0003636457760000082

其中i为输入元、k为隐含元、j为输出元、X为输入量,Y为输出量。Where i is the input element, k is the hidden element, j is the output element, X is the input quantity, and Y is the output quantity.

初期建立过程中,我们将权值初始化为W1、W2,权值更新过程中利用梯度下降原理。In the initial establishment process, we initialize the weights to W 1 and W 2 , and use the gradient descent principle in the weight update process.

此时算法输出结果与实际情况之间误差用以下公式表示At this time, the error between the output of the algorithm and the actual situation is expressed by the following formula

Figure GDA0003636457760000083
Figure GDA0003636457760000083

Sj为路口实际承运量,Yj为最大承运量;S j is the actual carrying capacity of the intersection, and Y j is the maximum carrying capacity;

根据梯度下降法的原理,权值的修正值与误差函数呈正比为:According to the principle of the gradient descent method, the correction value of the weight is proportional to the error function as:

Figure GDA0003636457760000084
Figure GDA0003636457760000084

令:make:

Figure GDA0003636457760000085
Figure GDA0003636457760000085

则:but:

Figure GDA0003636457760000086
Figure GDA0003636457760000086

对于偏置Bj For bias B j

Figure GDA0003636457760000087
Figure GDA0003636457760000087

令:make:

Figure GDA0003636457760000088
Figure GDA0003636457760000088

则:but:

ΔBj=δkj (7)ΔB j = δ kj (7)

由上述公式可以得到输出层结点j到隐含层的返向传播的权重W与偏置B如下:From the above formula, the weight W and bias B of the back propagation from the output layer node j to the hidden layer can be obtained as follows:

Figure GDA0003636457760000091
Figure GDA0003636457760000091

Bj=Bj-a*δkj (9)B j =B j -a*δ kj (9)

令:make:

Figure GDA0003636457760000092
Figure GDA0003636457760000092

得到隐含层结点k到输入层的返向传播的权重W与偏置B如下:The weight W and bias B of the back propagation from the hidden layer node k to the input layer are obtained as follows:

Figure GDA0003636457760000093
Figure GDA0003636457760000093

Bk=Bk-b*δik (12)B k =B k -b* δik (12)

从而实现隐含层到输出层的权值的更新So as to realize the update of the weights from the hidden layer to the output layer

其中,BP神经网络隐含层的输出值为Among them, the output value of the hidden layer of the BP neural network is

Figure GDA0003636457760000094
Figure GDA0003636457760000094

Yk=f(yk)(其中f为激活函数) (14)Y k = f(y k ) (where f is the activation function) (14)

最终输出层的输出值为The output value of the final output layer is

Figure GDA0003636457760000095
Figure GDA0003636457760000095

Yj=f(yj) (16)Y j =f(y j ) (16)

最终得到的结果为列车在每个站点的实际承运量。The final result is the actual capacity of the train at each station.

3、蚁群算法智能优化3. Intelligent optimization of ant colony algorithm

运用ACO-BP智能算法解决列车到站间隔时间以及车厢节数问题。由于同一轻轨站在不同时间线下全天人流量变化大体相同。传统的蚁群算法无法参考于历史信息而得出全局最优解。通过BP(back propagation)神经网络算法的引入,可以参照与历史数据信息的列车运行时间以及人流量对实际上车乘客数量的关系权值W1,W2,以站内实际等车人数为输入条件,关系权值为影响参数计算出使得列车承运效率最高的到站时间间隔,并得到理论最大承载量。The ACO-BP intelligent algorithm is used to solve the problem of the interval time between trains arriving at the station and the number of carriages. Because the same light rail station under different time lines changes in roughly the same amount of people throughout the day. The traditional ant colony algorithm cannot obtain the global optimal solution with reference to historical information. Through the introduction of the BP (back propagation) neural network algorithm, the weights W 1 , W 2 of the relationship between the train running time and the historical data information and the flow of people to the actual number of passengers in the train can be referred to, and the actual number of passengers waiting in the station is used as the input condition. , the relationship weight is the influence parameter to calculate the arrival time interval that makes the train carrying the highest efficiency, and the theoretical maximum carrying capacity is obtained.

同时我们将列车承载量与其列车车厢数量看作为正比关系,每辆车厢能够承载60人,通过目标检测技术检测每一站点未能上车的乘客数量,并将整条线路的数据综合,模拟增加或减少车厢对于整条线路运载效率的影响程度,来调整列车发车时车厢数量与整条线路全天人流量的关系,确定设置最优车厢数量。最后利用ACO算法智能匹配,得到最优列车时间间隔和车厢数量,使得列车单次承运量最大化。同时,将理论承运量与实际承运量之间产生的误差E传递到神经网络,进一步更新权值,优化算法。At the same time, we regard the train carrying capacity and the number of train cars as a proportional relationship. Each car can carry 60 people. The target detection technology is used to detect the number of passengers who fail to get on the train at each station, and the data of the entire line is integrated to simulate the increase. Or reduce the influence of the carriages on the carrying efficiency of the entire line, to adjust the relationship between the number of carriages when the train departs and the passenger flow of the entire line throughout the day, and to determine the optimal number of carriages. Finally, the ACO algorithm is used for intelligent matching to obtain the optimal train time interval and the number of carriages, so as to maximize the single carrying capacity of the train. At the same time, the error E generated between the theoretical carrying capacity and the actual carrying capacity is transmitted to the neural network to further update the weights and optimize the algorithm.

以上这些实施例应理解为仅用于说明本发明而不用于限制本发明的保护范围。在阅读了本发明的记载的内容之后,技术人员可以对本发明作各种改动或修改,这些等效变化和修饰同样落入本发明权利要求所限定的范围。The above embodiments should be understood as only for illustrating the present invention and not for limiting the protection scope of the present invention. After reading the contents of the description of the present invention, the skilled person can make various changes or modifications to the present invention, and these equivalent changes and modifications also fall within the scope defined by the claims of the present invention.

Claims (2)

1.一种基于目标检测技术和ACO-BP算法的智能轨道交通时间控制方法,其特征在于,包括以下步骤:1. an intelligent rail transit time control method based on target detection technology and ACO-BP algorithm, is characterized in that, comprises the following steps: 首先,考虑到深度学习在机器视觉领域独特的检测性能,利用Faster-RCNN目标检测方法,通过深度学习技术对图像进行特征提取,进而捕捉车辆以及行人图像,统计轨道线路每个站点每天的人流量大小,统计得到每个班次等待人数与实际上车人数;实时统计车厢数和车辆间隔时间,再传入BP神经网络中;First, considering the unique detection performance of deep learning in the field of machine vision, the Faster-RCNN target detection method is used to extract features from images through deep learning technology, and then capture images of vehicles and pedestrians, and count the daily flow of people at each station of the track line. The number of people waiting for each shift and the actual number of vehicles are obtained by statistics; the number of cars and the interval time between vehicles are calculated in real time, and then passed into the BP neural network; 其次,以等待人数与实际上车人数、以及车辆实际发车间隔为输入,基于BP神经网络得出等车人数与列车发车时间间隔对实际上车人数的关系权值;Secondly, taking the number of people waiting, the actual number of trains, and the actual departure interval of the vehicle as the input, based on the BP neural network, the weight of the relationship between the number of waiting people and the time interval of train departure to the actual number of trains is obtained; 最后,以当前各站点内人流量为输入量,关系权值作为影响参数传入到蚁群算法建立数学模型,通过不断改变发车间隔来得到最大承运量,同时以期望与实际承运量之间的误差为输入,基于BP神经网络学习功能,实现权值的更新,优化结果;Finally, take the current flow of people in each station as the input, and the relationship weight as the influence parameter is input to the ant colony algorithm to establish a mathematical model, and the maximum carrying capacity is obtained by continuously changing the departure interval. The error is input, based on the learning function of BP neural network, the update of weights is realized and the result is optimized; 所述BP神经网络寻找关系权值的步骤具体包括:利用非线性变换函数
Figure FDA0003636457750000011
作为传递函数
The step of finding the relationship weight value by the BP neural network specifically includes: using a nonlinear transformation function
Figure FDA0003636457750000011
as a transfer function
其激活函数则为:
Figure FDA0003636457750000012
Its activation function is:
Figure FDA0003636457750000012
wik学习权值,B为常量,Bk待学习的偏置量,yk表示输出,I表示输入数据个数;w ik learning weight, B is a constant, B k is the offset to be learned, y k represents the output, and I represents the number of input data; 初期建立过程中,将权值初始化为W1、W2,权值更新过程中利用梯度下降原理;In the initial establishment process, the weights are initialized to W 1 and W 2 , and the gradient descent principle is used in the weight update process; 此时算法输出结果与实际情况之间误差用以下公式表示At this time, the error between the output of the algorithm and the actual situation is expressed by the following formula
Figure FDA0003636457750000013
Figure FDA0003636457750000013
其中i为输入元、k为隐含元、j为输出元、X为输入量,Y为输出量,Sj为实际承运量,Yj为最大承运量;O表示输出个数,对应于输入数据个数;where i is the input element, k is the implicit element, j is the output element, X is the input quantity, Y is the output quantity, S j is the actual carrying quantity, and Y j is the maximum carrying quantity; O represents the number of outputs, corresponding to the input number of data; 根据梯度下降法的原理,权值的修正值与误差函数呈正比为:According to the principle of the gradient descent method, the correction value of the weight is proportional to the error function as:
Figure FDA0003636457750000014
Figure FDA0003636457750000014
令:make: Wkj表示网络中待学习的权值,a表示常量,E表示误差函数;W kj represents the weight to be learned in the network, a represents a constant, and E represents an error function;
Figure FDA0003636457750000021
Figure FDA0003636457750000021
则:but:
Figure FDA0003636457750000022
Figure FDA0003636457750000022
Yk表示当前隐含层输出,δk为梯度变化量,H表示当前隐含层输入数据个数;Y k represents the output of the current hidden layer, δ k is the gradient change, and H represents the number of input data of the current hidden layer; 对于偏置Bj For bias B j
Figure FDA0003636457750000023
Figure FDA0003636457750000023
令:make:
Figure FDA0003636457750000024
Figure FDA0003636457750000024
则:but: ΔBj=δkj (7)ΔB j = δ kj (7) 由上述公式可以得到输出层结点j到隐含层的返向传播的权重W与偏置B如下:From the above formula, the weight W and bias B of the back propagation from the output layer node j to the hidden layer can be obtained as follows:
Figure FDA0003636457750000025
Figure FDA0003636457750000025
Bj=Bj-a*δkj (9)B j =B j -a*δ kj (9) 令:make:
Figure FDA0003636457750000026
Figure FDA0003636457750000026
得到隐含层结点k到输入层的返向传播的权重W与偏置B如下:The weight W and bias B of the back propagation from the hidden layer node k to the input layer are obtained as follows:
Figure FDA0003636457750000027
Figure FDA0003636457750000027
Bk=Bk-b*δik (12)B k =B k -b* δik (12) b表示常数,从而实现隐含层到输出层的权值的更新b represents a constant, so as to realize the update of the weights from the hidden layer to the output layer 其中,BP神经网络隐含层的输出值为Among them, the output value of the hidden layer of the BP neural network is
Figure FDA0003636457750000028
Figure FDA0003636457750000028
Yk=f(yk) (14)Y k =f(y k ) (14) 最终输出层的输出值为The output value of the final output layer is
Figure FDA0003636457750000031
Figure FDA0003636457750000031
Yj=f(yj) (16)Y j =f(y j ) (16) 最终得到的结果为列车在每个站点的实际承运量,yj表示中间输出值;The final result is the actual carrying capacity of the train at each station, and y j represents the intermediate output value; 所述以当前各站点内人流量为输入量,关系权值作为影响参数传入到蚁群算法建立数学模型,通过不断改变发车间隔来得到最大承运量,同时以期望与实际承运量之间的误差为输入,基于BP神经网络学习功能,实现权值的更新,优化结果,具体包括:The current flow of people in each station is used as the input, and the relationship weight is input as an influence parameter to the ant colony algorithm to establish a mathematical model, and the maximum carrying capacity is obtained by continuously changing the departure interval. The error is the input, and based on the learning function of the BP neural network, the weights are updated and the results are optimized, including: 以当前各站点内人流量为输入量,关系权值作为影响参数传入到蚁群算法建立数学模型,此处的蚁群算法,基本框架是对于当前人流量,让算法随机去分配上车的人数,并留下相应的信息素,在下一次的迭代的过程中利用这些信息素,对于不同的上车人数,让它以一个特定的概率分布对是否是最大承载进行选择,概率分布如下:Taking the current flow of people in each site as the input, and the relationship weight as the influencing parameter, it is input to the ant colony algorithm to establish a mathematical model. The basic framework of the ant colony algorithm here is to randomly assign the people to the car for the current flow of people. number of people, and leave the corresponding pheromone, and use these pheromone in the next iteration process. For different number of people getting on the bus, let it choose whether it is the maximum load with a specific probability distribution. The probability distribution is as follows:
Figure FDA0003636457750000032
Figure FDA0003636457750000032
其中
Figure FDA0003636457750000033
表示当前人数量上车的概率,η表示一个启发值,τ为信息素浓度,Jk(r)表示不同上车人数的集合,δ和β表示τ和η的比重,δ越大,τ比重越大,反之亦然,通常设定δ=1,β=6;
in
Figure FDA0003636457750000033
Indicates the probability of the current number of people getting on the bus, η represents a heuristic value, τ is the pheromone concentration, J k (r) represents the set of different number of people getting on the bus, δ and β represent the proportion of τ and η, the larger the δ, the greater the proportion of τ The larger, and vice versa, usually set δ=1, β=6;
调整列车发车时车厢数量与整条线路全天人流量的关系,确定设置最优车厢数量,最后利用ACO算法智能匹配,最终得到最优值,得到最优列车时间间隔和车厢数量,使得列车单次承运量最大化。Adjust the relationship between the number of carriages when the train departs and the passenger flow of the entire line throughout the day, determine the optimal number of carriages, and finally use the ACO algorithm to intelligently match, and finally obtain the optimal value, obtain the optimal train time interval and the number of carriages, and make the train single Maximum sub-carriage.
2.根据权利要求1所述的一种基于目标检测技术和ACO-BP算法的智能轨道交通时间控制方法,其特征在于,所述BP神经网络共三层,包括输入层即编码层、隐含层以及输出层,输入层有3个神经元,隐含层有6个神经元,输出层有2个神经元。2. a kind of intelligent rail transit time control method based on target detection technology and ACO-BP algorithm according to claim 1, is characterized in that, described BP neural network has three layers in all, including input layer namely coding layer, hidden layer The input layer has 3 neurons, the hidden layer has 6 neurons, and the output layer has 2 neurons.
CN201910973432.3A 2019-10-14 2019-10-14 Intelligent rail transit time control method based on target detection technology and ACO-BP algorithm Active CN110688982B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910973432.3A CN110688982B (en) 2019-10-14 2019-10-14 Intelligent rail transit time control method based on target detection technology and ACO-BP algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910973432.3A CN110688982B (en) 2019-10-14 2019-10-14 Intelligent rail transit time control method based on target detection technology and ACO-BP algorithm

Publications (2)

Publication Number Publication Date
CN110688982A CN110688982A (en) 2020-01-14
CN110688982B true CN110688982B (en) 2022-07-01

Family

ID=69112371

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910973432.3A Active CN110688982B (en) 2019-10-14 2019-10-14 Intelligent rail transit time control method based on target detection technology and ACO-BP algorithm

Country Status (1)

Country Link
CN (1) CN110688982B (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111343726B (en) * 2020-02-27 2023-03-24 中国联合网络通信集团有限公司 User scheduling method and device
CN111582339B (en) * 2020-04-28 2023-07-25 江西理工大学 Vehicle detection and recognition method based on deep learning
CN112078633B (en) * 2020-08-28 2022-08-16 通号城市轨道交通技术有限公司 Rail transit train dispatching method and system
CN113968492B (en) * 2021-10-25 2023-04-07 中煤科工智能储装技术有限公司 Demand-driven intelligent conveying method for bulk materials
CN114299713B (en) * 2021-12-01 2023-09-29 重庆邮电大学 A single-point intersection vehicle dispatching system and method based on adaptive traffic lights
CN116757253B (en) * 2023-07-03 2024-06-11 浙江永贵博得交通设备有限公司 Intelligent automatic learning door opening and closing algorithm for rail transit
CN118333233B (en) * 2024-05-13 2024-12-03 北京中科建友科技股份有限公司 Traffic big data prediction system based on artificial intelligence

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105095994A (en) * 2015-07-29 2015-11-25 西南交通大学 Urban rail line passenger flow peak prediction method based on linear programming
CN106485359A (en) * 2016-10-13 2017-03-08 东南大学 A kind of urban track traffic section passenger flow estimation method based on train schedule
CN108550098A (en) * 2018-04-24 2018-09-18 西南交通大学 A kind of urban rail transit network passenger flow current-limiting method
CN108583626A (en) * 2018-04-11 2018-09-28 北京交通大学 Urban rail circuit Train Group collaboration operation control method based on efficiency
WO2018187632A1 (en) * 2017-04-05 2018-10-11 Carnegie Mellon University Deep learning methods for estimating density and/or flow of objects, and related methods and software
CN108647832A (en) * 2018-05-18 2018-10-12 辽宁工业大学 A kind of subway circulation interval time control algolithm based on neural network
WO2019078025A1 (en) * 2017-10-16 2019-04-25 株式会社日立製作所 Timetable preparation device and automatic train control system

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105095994A (en) * 2015-07-29 2015-11-25 西南交通大学 Urban rail line passenger flow peak prediction method based on linear programming
CN106485359A (en) * 2016-10-13 2017-03-08 东南大学 A kind of urban track traffic section passenger flow estimation method based on train schedule
WO2018187632A1 (en) * 2017-04-05 2018-10-11 Carnegie Mellon University Deep learning methods for estimating density and/or flow of objects, and related methods and software
WO2019078025A1 (en) * 2017-10-16 2019-04-25 株式会社日立製作所 Timetable preparation device and automatic train control system
CN108583626A (en) * 2018-04-11 2018-09-28 北京交通大学 Urban rail circuit Train Group collaboration operation control method based on efficiency
CN108550098A (en) * 2018-04-24 2018-09-18 西南交通大学 A kind of urban rail transit network passenger flow current-limiting method
CN108647832A (en) * 2018-05-18 2018-10-12 辽宁工业大学 A kind of subway circulation interval time control algolithm based on neural network

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Forecasting Railway Network Data Traffic: A Model and a Neural Network Solution Algorithm;Teng Jing;《2008 Workshop on Power Electronics and Intelligent Transportation System》;20080926;全文 *
基于动态客流的城际客运专线列车开行方案调整优化研究;苏彦升;《中国优秀博硕士学位论文全文数据库(硕士)工程科技Ⅱ辑》;20180315;全文 *
基于模糊神经网络的城市轨道交通行车间隔时间优化研究;肖枫;《中国优秀博硕士学位论文全文数据库(硕士)工程科技Ⅱ辑》;20140315;全文 *

Also Published As

Publication number Publication date
CN110688982A (en) 2020-01-14

Similar Documents

Publication Publication Date Title
CN110688982B (en) Intelligent rail transit time control method based on target detection technology and ACO-BP algorithm
Sun et al. A bi-objective timetable optimization model for urban rail transit based on the time-dependent passenger volume
CN104778834B (en) Urban road traffic jam judging method based on vehicle GPS data
CN106600991B (en) A kind of city expressway Ramp control method for coordinating based on chaos
Li et al. A dynamic simulation model of passenger flow distribution on schedule-based rail transit networks with train delays
Li et al. Public bus arrival time prediction based on traffic information management system
CN106652434A (en) Bus dispatching method based on rail transit coordination
CN112949078B (en) Matching degree calculation method for urban rail transit passenger flow and traffic flow
KR101742043B1 (en) Apparatus and method for travel mode choice prediction
CN109887267A (en) A conventional bus adjustment method for rail transit common line segment
CN107274000A (en) Urban track traffic section passenger flow forecasting under a kind of accident
CN110570656A (en) Method and device for customizing public transport line
CN113299078B (en) A multi-mode traffic arterial signal coordination control method and device based on multi-agent cooperation
Liu et al. A reservation-based coordinated transit signal priority method for bus rapid transit system with connected vehicle technologies
CN113362618B (en) Multi-mode traffic adaptive signal control method and device based on strategy gradient
CN111367900B (en) Calculation Method of Normal Current Limiting Strength of Urban Rail Transit Network Based on AFC Data
Li et al. Coordination of last train transfers using potential passenger demand from public transport modes
Liu et al. Modelling and simulation of cooperative control for bus rapid transit vehicle platoon in a connected vehicle environment
Li et al. Flexible Bus Route Setting and Scheduling Optimization Adapted to Spatial-temporal Variation of Passenger Flow.
Schmaranzer et al. A discrete event simulation model of the Viennese subway system for decision support and strategic planning
CN109447352B (en) Bus trip OD matrix reverse-thrust combination method
Liu Bi-level optimization algorithm for dynamic reversible lane control based on short-term traffic flow prediction
CN115424461A (en) Multi-agent-based regional road traffic signal control optimization method
Wang et al. A segmented signal progression model for the modern streetcar system
Trofimov et al. Algorithms for constructing optimal paths and statistical analysis of passenger traffic

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