(Created page with " == Abstract == This study proposes Reinforcement Learning (RL) based algorithm for finding optimum signal timings in Coordinated Signalized Networks (CSN) for fixed set of l...")
 
m (Scipediacontent moved page Draft Content 323325153 to Haldenbilen et al 2015a)
 
(No difference)

Latest revision as of 12:45, 16 February 2021

Abstract

This study proposes Reinforcement Learning (RL) based algorithm for finding optimum signal timings in Coordinated Signalized Networks (CSN) for fixed set of link flows. For this purpose, MOdified REinforcement Learning algorithm with TRANSYT-7F (MORELTRANS) model is proposed by way of combining RL algorithm and TRANSYT-7F. The modified RL differs from other RL algorithms since it takes advantage of the best solution obtained from the previous learning episode by generating a sub-environment at each learning episode as the same size of original environment. On the other hand, TRANSYT-7F traffic model is used in order to determine network performance index, namely disutility index. Numerical application is conducted on medium sized coordinated signalized road network. Results indicated that the MORELTRANS produced slightly better results than the GA in signal timing optimization in terms of objective function value while it outperformed than the HC. In order to show the capability of the proposed model for heavy demand condition, two cases in which link flows are increased by 20% and 50% with respect to the base case are considered. It is found that the MORELTRANS is able to reach good solutions for signal timing optimization even if demand became increased. (C) 2015 Elsevier Ltd. All rights reserved.


Original document

The different versions of the original document can be found in:

https://api.elsevier.com/content/article/PII:S0968090X15000893?httpAccept=text/plain,
http://dx.doi.org/10.1016/j.trc.2015.03.010 under the license https://www.elsevier.com/tdm/userlicense/1.0/
https://trid.trb.org/view/1350252,
http://www.sciencedirect.com/science/article/pii/S0968090X15000893,
https://academic.microsoft.com/#/detail/1974937264
Back to Top

Document information

Published on 01/01/2015

Volume 2015, 2015
DOI: 10.1016/j.trc.2015.03.010
Licence: Other

Document Score

0

Views 5
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?