Real Time Traffic Control under Time Varying Incoming Flow Rates of Vehicles to Minimize Waiting Time of Vehicles at Road Arterial Networks

Yogeswary Raviraj, W. Daundasekera
{"title":"Real Time Traffic Control under Time Varying Incoming Flow Rates of Vehicles to Minimize Waiting Time of Vehicles at Road Arterial Networks","authors":"Yogeswary Raviraj, W. Daundasekera","doi":"10.30845/ijast.v9n4p4","DOIUrl":null,"url":null,"abstract":"This paper presents two real time nonlinear quadratic programming models according to two special oversaturation conditions to minimize the aggregate delay time of vehicles at each intersection by minimizing the total number of vehicles at each intersection at the signalized two intersections arterial. This can be extended to more than two intersections arterial network by expanding the groups which are explained in this paper. These models are developed under time varying incoming flow rates of vehicles. The most important factor of traffic signal control is the number of vehicles in a queue on the lanes of intersections. The initial number of vehicles on each lane at the intersections is counted by a camera which is the most exact method among other existing methods. These models are developed to minimize the number of waiting vehicles from cycle to cycle. These proposed models include inter green signal time this is one of the main aspect compared to other existing models proposed in the former research. These models also include restriction for upper bound for cycle time allocation which leads to exact and appropriate allocation for green signal time. Nonnegative queue lengths on lanes are maintained under special conditions for oversaturation case. The lower bound of green signal time is attained by oversaturation conditions of the models. These proposed models are solved by the interior point algorithm method coded in MATLAB environment.","PeriodicalId":89777,"journal":{"name":"International journal of applied science and technology","volume":"105 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of applied science and technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30845/ijast.v9n4p4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents two real time nonlinear quadratic programming models according to two special oversaturation conditions to minimize the aggregate delay time of vehicles at each intersection by minimizing the total number of vehicles at each intersection at the signalized two intersections arterial. This can be extended to more than two intersections arterial network by expanding the groups which are explained in this paper. These models are developed under time varying incoming flow rates of vehicles. The most important factor of traffic signal control is the number of vehicles in a queue on the lanes of intersections. The initial number of vehicles on each lane at the intersections is counted by a camera which is the most exact method among other existing methods. These models are developed to minimize the number of waiting vehicles from cycle to cycle. These proposed models include inter green signal time this is one of the main aspect compared to other existing models proposed in the former research. These models also include restriction for upper bound for cycle time allocation which leads to exact and appropriate allocation for green signal time. Nonnegative queue lengths on lanes are maintained under special conditions for oversaturation case. The lower bound of green signal time is attained by oversaturation conditions of the models. These proposed models are solved by the interior point algorithm method coded in MATLAB environment.
基于时变车辆流率的道路干线网络实时交通控制以减少车辆等待时间
本文针对两种特殊的过饱和条件,提出了两种实时非线性二次规划模型,通过在两条信号主干道上使每个交叉口的车辆总数最小,从而使每个交叉口的车辆总延误时间最小。通过扩展本文所解释的组,可以将其扩展到两个以上的交叉口动脉网络。这些模型是在车辆流入流速随时间变化的情况下建立的。交通信号控制中最重要的因素是交叉口车道上排队车辆的数量。在现有的方法中,利用摄像机对交叉口每条车道的初始车辆数量进行统计是最精确的方法。这些模型的开发是为了减少每个周期等待车辆的数量。这些提出的模型包括绿灯间信号时间,这是与以往研究中提出的其他模型相比的主要方面之一。这些模型还包括周期时间分配上界的限制,使得绿色信号的时间分配准确、合理。在过饱和情况下的特殊条件下,保持车道上的非负队列长度。绿色信号时间的下界是通过模型的过饱和条件得到的。采用MATLAB环境下编写的内点算法对模型进行求解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书