{"title":"城市交通仿真通用循环交通流模型","authors":"E. Sofronova, Ghazi Alnowaini","doi":"10.1109/ICTSA52017.2021.9406555","DOIUrl":null,"url":null,"abstract":"This paper presents a universal recurrent traffic flow model designed to simulate traffic flows and solve the problem of finding the optimal durations of traffic light phases. The model belongs to the class of microscopic and is based on the theory of controlled networks. The road network is presented as a configurable graph. The nodes of the graph are the road sections, and the edges are the maneuvers between the sections. The graph configuration is changed by turning the graph edges on or off, which corresponds to the permission or prohibition of certain maneuvers. Traffic flows are controlled by traffic lights at regulated intersections. To apply this model it is assumed that the information about the parameters of flows and the road network is available. The description of the model, its properties, and a methodological example of calculation are given.","PeriodicalId":334654,"journal":{"name":"2021 International Conference of Technology, Science and Administration (ICTSA)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Universal Recurrent Traffic Flow Model for Urban Traffic Simulation\",\"authors\":\"E. Sofronova, Ghazi Alnowaini\",\"doi\":\"10.1109/ICTSA52017.2021.9406555\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a universal recurrent traffic flow model designed to simulate traffic flows and solve the problem of finding the optimal durations of traffic light phases. The model belongs to the class of microscopic and is based on the theory of controlled networks. The road network is presented as a configurable graph. The nodes of the graph are the road sections, and the edges are the maneuvers between the sections. The graph configuration is changed by turning the graph edges on or off, which corresponds to the permission or prohibition of certain maneuvers. Traffic flows are controlled by traffic lights at regulated intersections. To apply this model it is assumed that the information about the parameters of flows and the road network is available. The description of the model, its properties, and a methodological example of calculation are given.\",\"PeriodicalId\":334654,\"journal\":{\"name\":\"2021 International Conference of Technology, Science and Administration (ICTSA)\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference of Technology, Science and Administration (ICTSA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTSA52017.2021.9406555\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference of Technology, Science and Administration (ICTSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTSA52017.2021.9406555","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Universal Recurrent Traffic Flow Model for Urban Traffic Simulation
This paper presents a universal recurrent traffic flow model designed to simulate traffic flows and solve the problem of finding the optimal durations of traffic light phases. The model belongs to the class of microscopic and is based on the theory of controlled networks. The road network is presented as a configurable graph. The nodes of the graph are the road sections, and the edges are the maneuvers between the sections. The graph configuration is changed by turning the graph edges on or off, which corresponds to the permission or prohibition of certain maneuvers. Traffic flows are controlled by traffic lights at regulated intersections. To apply this model it is assumed that the information about the parameters of flows and the road network is available. The description of the model, its properties, and a methodological example of calculation are given.