Vishu Gupta, Avinash Sharma, S. Reddy K, R. Kumar, B. Panigrahi
{"title":"Traffic Signal Coordination using Termite Spatial Correlation Optimization for Oversaturated Signals","authors":"Vishu Gupta, Avinash Sharma, S. Reddy K, R. Kumar, B. Panigrahi","doi":"10.1109/WIECON-ECE.2017.8468911","DOIUrl":null,"url":null,"abstract":"This article proposes a novel method for solving traffic signal coordination problem under over-saturated conditions. This problem is a large combinatorial optimization problem formulated as a dynamic optimization problem. The algorithm derives optimal green times for a network consisting of 20 interconnected signals using termite spatial correlation optimization (TSCO) algorithm. The algorithm tries to do so by incorporating proper queue dissipation along with maximizing number of vehicles precessed by the network in the congestion period. The resulted green times and fitness values have been compared with those derived using Genetic Algorithm (GA) and Ant Colony Optimization (ACO). TSCO is shown to outperform GA and ACO in terms of fitness value as well as overall function evaluations.","PeriodicalId":188031,"journal":{"name":"2017 IEEE International WIE Conference on Electrical and Computer Engineering (WIECON-ECE)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International WIE Conference on Electrical and Computer Engineering (WIECON-ECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIECON-ECE.2017.8468911","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This article proposes a novel method for solving traffic signal coordination problem under over-saturated conditions. This problem is a large combinatorial optimization problem formulated as a dynamic optimization problem. The algorithm derives optimal green times for a network consisting of 20 interconnected signals using termite spatial correlation optimization (TSCO) algorithm. The algorithm tries to do so by incorporating proper queue dissipation along with maximizing number of vehicles precessed by the network in the congestion period. The resulted green times and fitness values have been compared with those derived using Genetic Algorithm (GA) and Ant Colony Optimization (ACO). TSCO is shown to outperform GA and ACO in terms of fitness value as well as overall function evaluations.