2016 IEEE Congress on Evolutionary Computation (CEC) 2016
DOI: 10.1109/cec.2016.7743821
|View full text |Cite
|
Sign up to set email alerts
|

Traffic signal optimization and coordination using neighborhood mutation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 14 publications
0
5
0
Order By: Relevance
“…cycle, offset, or green times) of one signal system S in the solution. The choice of the used mutation operator depends on specific mutation rates following Armas et al works [30]. The rates are defined as P cycle , P green and P offset for cycle time, green times and offset time mutators, respectively.…”
Section: Mutation Operatorsmentioning
confidence: 99%
See 4 more Smart Citations
“…cycle, offset, or green times) of one signal system S in the solution. The choice of the used mutation operator depends on specific mutation rates following Armas et al works [30]. The rates are defined as P cycle , P green and P offset for cycle time, green times and offset time mutators, respectively.…”
Section: Mutation Operatorsmentioning
confidence: 99%
“…Therefore, we compare the performances of five optimization algorithms: a stochastic hill-climbing algorithm (see Algorithm 2), a simple elitist evolutionary algorithm from [30] and three bandit-based algorithms which differ on the way their arms and rewards are defined (from equation 5). The first bandit algorithm considers the context of Liu's works, which has been outlined in section 3.5; in that respect, there are as many bandit arms as there are signal systems in the road network.…”
Section: Performances Of Optimization Algorithmsmentioning
confidence: 99%
See 3 more Smart Citations