Traffic congestion has become a serious problem with the recent exponential increase in the number of vehicles. In urban areas, almost all traffic congestion occurs at intersections. One of the ways to solve this problem is road expansion, but it is difficult to realize in urban areas because of the high cost and long construction period. In such cases, traffic signal control is a reasonable method for reducing traffic jams. In an actual situation, the traffic flow changes randomly and its randomness makes the control of traffic signals difficult. A prediction of traffic jams is, therefore, necessary and effective for reducing traffic jams. In addition, an autonomous distributed (standalone) point control of each traffic light individually is better than the wide and/or line control of traffic lights from the perspective of realtime control. This paper describes a stochastic optimum control of crossroads and multiway traffic signals. First, a stochastic model of traffic flows and traffic jams is constructed by using a Bayesian network. Secondly, the probabilistic distributions of the traffic flows are estimated by using a cellular automaton, and then the probabilistic distributions of traffic jams are predicted. Thirdly, optimum traffic signals of crossroads and multiway intersection are searched by using a modified particle swarm optimization algorithm to realize realtime traffic control. Finally, simulations are carried out to confirm the effectiveness of the realtime stochastic optimum control of traffic signals.
I. INTRODUCTION
In accordance with the increase of vehicles recently, traffic congestion has become a serious problem. In urban areas, almost all traffic congestion occurs at intersections. Intersections can be classified into three types according to the number of roads meeting at the intersection: Tjunction (3way intersection), Crossroads (4way intersection), and Multiway intersection (more than 4 ways). The traffic signal phases are generally more complicated at multiway intersections and consequently traffic jams occur more easily. One of the ways to solve this problem is road expansion, but high costs and long construction periods make this option difficult in urban areas. In such cases, traffic signal control is a reasonable alternative method for reducing traffic jams.
Traffic signal controls can be classified into two types. One is an offline (pretimed) control and the other is an online (adaptive) control. In the pretimed control, Webster’s formula is used to calculate the traffic signals offline using historical traffic data, but it cannot handle variation in traffic flows. On the other hand, an adaptive control can overcome this limitation by adjusting the traffic signals online in the various traffic flows. SCOOT
[1]
, SCATS
[2]
, and OPAC
[3]
have been implemented on urban traffic networks using centralized systems. However, these centralized systems require extensive data processing and computational time for calculating adequate traffic signals. In an approach using a distributed control system, Kouvelas et al.
[4]
calculated adequate traffic signals according to traffic data and empirical rules. The saturated flow and traffic speed were changed according to environmental factors such as road structure and weather; therefore, the determination of appropriate parameters for the empirical rules is generally difficult. Lee et al.
[5]
and Dong et al.
[6]
calculated optimal traffic signals according to an optimal model for delay time. These methods use a mathematical traffic model to predict the future arrivals from neighborhood to intersections and to estimate the traffic delay time. However, if the road length between two intersections is very long or minor roads intersect along the road, it is difficult to precisely predict future arrivals. Recently, the various intelligence techniques such as fuzzy logic
[7

11]
, the neural network (NN) method
[12

17]
, and reinforcement learning (RL) method
[18

23]
have been used to implement distributed control systems. However, the appropriate fuzzy production rules and training data for the NN method are hard to obtain, and a long learning time is required for RL method.
This paper describes a stochastic optimum control of crossroads and multiway traffic signals developed in the system control laboratory of Waseda University. First, a stochastic model of traffic flows and traffic jams was constructed by using a Bayesian network (BN). Secondly, the probabilistic distributions of the traffic flows are estimated by using a cellular automaton, and then the probabilistic distributions of traffic jams are predicted. Thirdly, a search for the optimum traffic signals of crossroads and multiway intersections was performed by using a modified particle swarm optimization (PSO) algorithm to achieve realtime traffic control. Finally, simulations are carried out to confirm the effectiveness of the realtime stochastic optimum control of traffic signals.
II. TRAFIC SIGNALS AND CONTROLS
A traffic signal controls traffic by assigning rightofway to one traffic movement or several nonconflicting traffic movements at a time. The rightofway is assigned by tuning on a green signal for a certain length of time, or an interval. The rightofway is ended by a yellow change interval during which the yellow signal is displayed, followed by the display of a red signal.
The parameters of traffic signal control,
cycle
,
split
, and
offset
, are typically used as illustrated in
Fig.1
. The cycle is a total time of signal indication of a green light, a yellow light, and a red light; the split (phase) is the green and yellow lights for rightofway; the offset is a gap in the starting time of the green light between two traffic lights at a crossroad.
Parameters of traffic signal control.
The control methods of traffic signals are classified into a point control, a line control, and a wide control from the perspective of controlled objects. Wide controls and/or the line controls generally require an enormous quantity of transmission and a great deal of time. In addition, the adjustment of the parameters for traffic signals is classified into an actuated control and a pretimed control. The trafficactuated control of isolated intersections attempts to continuously adjust greentime. These adjustments occur in accordance with realtime measures of traffic demand obtained from vehicle detectors placed on one or more of the approaches to the intersection. On the other hand, the pretimed signal control assigns rightofway at an intersection according to a predetermined schedule. The sequence of rightofways (splits or phases), and the length of time interval for each signal indication in cycles is fixed based on historic traffic patterns.
In the actual situation, the traffic flow is changed randomly and its randomness makes the control of traffic signals difficult. An estimation of the traffic volume is, therefore, necessary and effective for reducing traffic jams. In addition, an autonomous distributed (standalone) point control for individual traffic lights is better than wide and/or line controls from the perspective of realtime control.
III. STOCHASTIC CONTROL OF CROSSROADS TRAFFIC SIGNALS
 A. Bayesian Network Stochastic Model of Traffic Flow at Crossroads
Traffic inflows and outflows at crossroads, and resulting traffic occur randomly, and their causeandeffect relationship can be represented by a stochastic model based on a BN
[24]
.
BN is a directed and acyclic graphical model. Each node represents the variables of given objects and their direct causal relationship is represented as an arc. The relationship between each variable is evaluated quantitatively using conditional probabilities.
Crossroads and random variables for traffic inflows, outflows, and standing vehicles.
The Bayesian network stochastic model of standing vehicle at crossroads.
Here, we consider two crossroads as shown in
Fig. 2
. The random variables of traffic inflows and outflows of the crossroad, and the standing vehicles between the two crossroads are represented as nodes. The BN model of the standing vehicles is shown in
Fig. 3
[25]
.
The number of standing vehicles of
k
th cycle can be calculated as Eq. (1).

Sk: Standing vehicles atk th cycle

Sk1: Standing vehicles at (k1)  th cycle

Fok: Outflowing straight vehicles atk th cycle

Lo:k: Outflowing left turn vehicles atk th cycle

Rok: Outflowing right turn vehicles atk th cycle

Fik: Inflowing straight vehicles atk th cycle

Lik: Inflowing left turn vehicles atk th cycle

Rik: Inflowing right turn vehicles atk th cycle
The probabilistic distribution of standing vehicles
S_{k}
at
k
th cycle is obtained by summing over all values of the other variables as follows,
Where
Following the chain rule, the joint probabilistic distribution is represented as the product of conditional probabilities as follows:
According to the Dseparation
[24]
and the standing vehicle
S_{k}
at
k
th cycle determined by Eq. (1), Eq. (2) can be represented as,
However, the probabilistic distributions of the outflows
P
(
F^{o}_{k}
),
P
(
L^{o}_{k}
),
P
(
R^{o}_{k}
) and the inflows
P
(
F^{i}_{k}
),
P
(
L^{i}_{k}
),
P
(
R^{i}_{k}
) are necessary to calculate the probabilistic distribution
P
(
S_{k}
) of the standing vehicles because we are now located at the point on the time axis illustrated in
Fig. 4
.
The probabilistic distributions of traffic outflows and inflows at
k
th cycle are estimated by their updating. The altered traffic signals will change the probabilities of the outflowing and inflowing vehicles. To treat this situation, two patterns are considered here.
Position for prediction of probabilities. G: green light, Y: yellow light, R: red light.
Updating of probabilistic distribution for traffic flow.
Pattern 1 is a shifting of the probabilistic distributions according to the fluctuation of greentime, and pattern 2 is an increase in the probability for neighboring expectation and a decrease of others (
Fig. 5
). Pattern 2 is adopted to update the probabilistic distributions of traffic flows based on simulations.
In order to deduce adequate traffic signals, the probabilistic distributions of standing vehicles are predicted to three cycles ahead as an example in this paper. The procedure of updating for prior probabilities and prediction for probabilistic distributions of standing vehicles is illustrated in
Fig. 6
. First, the prior probabilities of each variable are updated by previous data at cycle (
k1
). Then, the probabilistic distributions of standing vehicles at
k
th cycle are predicted using Eq. (4). Next, a rulebased algorithm, which will be described in the next section, is applied to deduce adequate traffic signals and it is used for updating the prior probability of the outflow. Finally, the probabilistic distribution of standing vehicles at
k
th cycle is calculated to predict the following cycles. The procedures of prediction at cycles (
k+1
) and (
k+2
) are the same as at
k
th cycle.
Procedure of updating for prior probabilities and prediction for standing vehicles.
 B. Traffic Signal Control Based on Predicted Probabilistic Distributions of Standing Vehicles
 1) RuleBased Control
Reduction of traffic jams for a major street (e.g., the eastwest direction of
Fig. 2
) can be achieved by extension of greentime to reduce the probabilistic distribution of the major street. However, in this case, the probability of traffic jams for a minor street (for example, the northsouth direction) will be increased by the long red time of the minor street. Therefore, the probabilities of an overstanding vehicle
S_{max}
(i.e., traffic jam) and an understanding vehicle
S_{min}
for the major street must be reduced all together for the reduction of traffic jams at crossroads as shown in
Fig. 7
.
According to the BN stochastic model, the probabilistic distribution of the standing vehicle, splits, and cycle time of traffic signals are controlled by using the predicted probabilistic distributions of standing vehicles. A rulebased control procedure is as follows:

Step 1:Predict probabilistic distribution of standing vehicles by using a BN stochastic model to three cycles ahead.

Step 2:Calculate probabilitiesSmaxor above andSminor below of standing vehicles.

Step 3:Compare these probabilities with the desired values.

Step 4:Adjust split and cycle time until probabilitiesSmaxor above andSminor below satisfy the desired values.
The flowchart of the procedure for traffic signal control is shown in
Fig. 8
.
 2) Back Propagation NN Control
Traffic signal control is composed of two procedures: online and offline processing. In the online processing, a back propagation neural network (BPNN) is used to calculate adequate traffic signals based on the result of a BN stochastic model for the prediction of standing vehicles. Then, the rulebased algorithm is applied to update the weight of the BPNN model in the offline processing.
Probabilistic distribution of standing vehicle for major street.
Flowchart of rulebased control.
The BPNN model has a powerful learning capability, and this model consists of an input layer, a hidden layer, and an output layer. The BPNN model for traffic signal control is shown in
Fig. 9
[26]
. The input values are the probabilities of standing vehicles, which are predicted by the BN model, and the output values are traffic signals.
In this BPNN model, the number of neurons for the input layer is 141, and the inputs are the probabilities of standing vehicles. The traffic signal comprises two parameters:
split time
and
cycle length
. Therefore, two neurons in the output layer are set up. The number of the hidden layer can be calculated by an empirical formula Eq. (5), where
n
,
m
, and
l
are the numbers of neurons in the input layer, hidden layer, and output layer, respectively.
The procedure of traffic signal control using the BPNN model is illustrated in
Fig. 10
.
Structure of back propagation neural network model.
Procedure of traffic signal control using back propagation neural network (BPNN) model.
 C. Stochastic Optimum Control of Crossroads Traffic Signals
 1) Formulation for Optimization of Traffic Congestion Problem
It is necessary to reduce traffic jams of a major street and a minor street both for the reduction of traffic volume at crossroads. However, when the greentime of the major street is extended to reduce the traffic jams of the major street, the traffic congestion of the minor street will be increased because the redtime of the minor street has been extended. Therefore, the traffic congestion problem at crossroads is a tradeoff between the length of greentime and redtime (i.e., greentime of the minor street) for the major street. An adequate method of the reduction of traffic volume at crossroads is a prediction of probabilistic distributions of traffic jams and reduction of probabilities for overstanding vehicles and understanding vehicles of the major street together.
As an optimization problem of traffic congestion at crossroads, a performance criterion is defined as follows
[25]
:
where
is a predicted probabilistic distribution of the major street when the traffic signals are
t^{i}_{m}
at the
m
th search, and weight coefficients
w_{1}
and
w_{2}
are set by the levels of importance for the major street and minor street as shown in
Fig. 7
.
 2) Construction of Traffic Flow MicroSimulator by Cellular Automaton
The probabilistic distribution of traffic outflows is necessary to predict the probabilistic distribution of standing vehicles at
k
th cycle.
Rules of vehicle movements in the microsimulator.
The traffic outflows are estimated by using an urban traffic flow microsimulator based on a cellular automaton (CA), which is an example of artificial life, built based on a model of a highway
[27]
. The rules of vehicles movements on roads are illustrated in
Fig. 11
, where the parameters
p0
,
p1
, and
p2
are determined by measured data.

Input to cell:According to the generation of a random number for an inflow rate, a vehicle is generated and the direction of travel to the next intersection is determined. The inflow rate of each road is determined by measured traffic data.

Movements:A vehicle can accelerate up to a maximum speed when a front cell is free of obstruction. Considering a mean speed in an urban area, the maximum speed is set at 2 cells/1 step (1 cell = 7.5 m; 1 step = 1 sec). According to the density of the traffic, the speed can change randomly. On multilane roads, vehicles can move in parallel lanes. When a vehicle turns right, the vehicle moves to a rightturnonly lane. (Following Japan’s traffic patterns, the model assumes driving on the left side of the street.)

Intersection:When a traffic signal is green, a vehicle is allowed to cross the intersection according to its direction of travel, and the direction of travel at the next intersection is reset.
 3) Searching for Traffic Signals by Using the PSO Method
The PSO method was introduced by Kennedy and Eberhart
[28]
. The PSO method is based on a simple mechanism, which mimics the swarming behavior in birds flocking and fish schooling to guide particles to search for optimal solutions. The PSO method is easy to implement and use with only a few parameters to adjust. In the PSO method, a swarm of particles is represented as potential solutions and each particle is associated with a velocity vector
v^{m}
and a position vector
x^{m}
.
During the evolutionary process, the velocity and position of a particle
i
on search number
m
are updated by Eqs. (7) and (8).
where
w
is an inertia weight,
c_{1}
and
c_{2}
are acceleration coefficients, and
rand
( ) is a random number within [0, 1]. In Eq. (7),
pbest
is the best position of a particle, and
gbest
is the best position of all particles with the best fitness during the evolutionary process, and then an optimum point is found by updating the positions and velocities of the particles as illustrated in
Fig. 12
. The structure of the stochastic optimum control for traffic jams at crossroads is shown in
Fig. 13
. The calculation procedure is as follows:

Step 1:Set the number of particles in the swarm, and an initial position and velocity of each particle. The initial position of a particlei:tio=(gio,yio,rio) represents the signal times of green, yellow, and red, respectively, and their initial times are produced randomly. Also, the initial velocity of the particlei:vio= (vgio,vyio,vrio) represents the initial updating of green, yellow, and red times, and their initial number of updates are produced randomly in [2, +2]. Set the number of searches tom= 0.

Step 2:Estimate the traffic inflowsÎkand outflowÔkof crossroads atkth cycle by using the CA microsimulator.

Step 3:Update the prior probabilistic distributions of traffic inflow
at
k
th cycle using the measured data at cycle (
k
1) and the estimated
Î_{k}
and
Ô_{k}
.

Step 4:Predict the probabilistic distribution of traffic jam

atkth cycle using the BN stochastic model.

Step 5:Calculate the performance criterionJmusing

Step 6:Updatepbestandgbestof the PSO algorithm.

Step 7:Ifm

Else, output the positions ofgbest(greenyellowred times).
Particle swarm optimization algorithm.
Structure of traffic signal control based on predicted probabilities of traffic jams. BN: Bayesian network, CA: cellular automaton, PSO: particle swarm optimization.
 D. Simulation
A simulation was carried out to confirm the effectiveness of stochastic control of traffic signals at crossroads using actual traffic flow data. The actual data was measured on 17 January 2008, 5:007:00 PM at Tutuimachi crossroads, Kitakyushu, Japan, as illustrated in
Fig. 14
. The traffic light of the Tutuimachi crossroads is a pretimed control, its cycle length is 150 seconds and 4 phases, and their traffic lighting times are shown in
Table 1
.
In addition, the set values are
S_{min}
= 30 (pcu),
S_{max}
= 60 (pcu); the probabilities equal or less than
S_{min}
and more than
S_{max}
are
P_{min}
=
P_{max}
= 0.15;
w_{1}
= 0.3,
w_{2}
= 0.7 in
Fig. 7
and Eq. (6), respectively.
The predicted probabilistic distribution of traffic jams four cycles ahead, and the prior probabilistic distributions at Cycle 3 and the updated one at Cycle 4 of traffic inflows and outflows are shown in
Figs. 15
and
16
, respectively.
Map of Tutuimachi crossroads.
Traffic signals of pretimed control and their adjustable range
Traffic signals of pretimed control and their adjustable range
Probabilistic distributions of standing vehicles. (a) Pretimed control, (b) rulebased control, and (c) particle swarm optimization control.
Prior and updated probabilistic distributions of inflows and outflows.
Convergence of 5 particles at Cycle 4.
Moreover, the convergence of 5 particles (of the total 30 particles) at Cycle 4 is illustrated in
Fig. 17
, where the initial positions (
g_{m}^{i}
= 86,
y_{m}^{i}
= 21,
r_{m}^{i}
= 61;
i
= 1) converged into an optimum point (76, 16, 52), and the convergences of fitness values for
pbest
and
gbest
are illustrated in
Fig. 18
.
Comparison of traffic signals.
Fitness values by particle swarm optimization control
The traffic signals by pretimed, rulebased, and PSO controls and the traffic jams at crossroads are shown in
Figs. 19
and
20
, respectively.
The number of standing vehicles on the major street and the total number of PSO controls was reduced by 12(%) and 8(%) compared with the pretimed control, respectively.
Traffic jams of crossroads. (a) Number of standing vehicles on the major street (eastwest direction), (b) total number of standing vehicles.
IV. REALTIME STOCHASTIC OPTIMUM CONTROL OF MULTIWAY TRAFFIC SIGNALS
 A. Construction of BN Stochastic Model for Traffic Flow at MultiWay Intersection
Here, we consider an
r
way intersection illustrated in
Fig. 21
. At a road
h
, the traffic inflows, outflows, and standing vehicles are represented as Eq. (9).
On the
r
way intersection, the casual relationship between traffic inflows, outflows, and standing vehicles can be represented by the BN model illustrated in
Fig. 22
. The probabilistic distribution of standing vehicles at
k
th cycle is obtained by summing over all values of the other variables as follows:
The rway intersection.
In consideration of
with the chain rule and Dseparation, Eq. (10) can be represented as
The Bayesian network stochastic model of rway intersection.
 B. RealTime Stochastic Optimum Control of rWay Traffic Signals
 1) Formulation for Optimization of Traffic Congestion Problem at rWay Intersection
For the
r
way intersection, the situation of traffic jams is regarded as that the standing vehicles for all roads are bigger than
S^{h}_{max}
(
h
= 1, 2, ...,
r
) in this paper. Therefore, the optimization problem of traffic congestion at
r
way intersections is formulated as follows
[29]
:
where
i
is the number of
n
signal phases,
h
(
h
=1,2,...,
r
) is the number of roads,
k
is the cycle number,
t^{i}
is the time length of the signal phase
i
,
t^{i}
_{min}
and
t^{i}
_{min}
are an adjustable range of the signal phase
i
,
w^{h}
is a weight coefficient,
S^{k}
_{max}
is a set value for traffic jams, and
p
(
S_{k}^{h}
) is a predicted probabilistic distribution of road
h
at
k
th cycle when the traffic signals are (
t
^{1}
,
t
^{2}
, Λ
t^{n}
^{1}
,
t^{n}
),, respectively.
 2) Traffic Flow MicroSimulator by CA Model for rWay Intersections
In order to predict the probabilistic distributions of standing vehicles, an updating rule for the prior probabilities of traffic inflows is indispensable. In this paper, Eq. (14) is used to update the prior probabilistic distributions as follows:
where
j
is the number of events for traffic flows at (
k
1) cycle,
η
is the number of total events,
γ
is an empirical value, and
Î_{k}
and
Ô_{k}
are the predicted traffic flows using the modified CA traffic microsimulator of the
r
way intersection.
An example illustrating the rules of movements for vehicles on a road network is shown in
Fig. 23
.

Input to cell:A vehicle is generated and its direction of travel on the intersection is determined according to the comparison of a random number [0, 1] with a set value.

Speed:A vehicle is accelerated up to a maximum speed, where maximum speed = 2 moves/cell; 1 cell = 7.5 m/1 step (1 second), when a front cell is free of obstruction. The speed is changes randomly according to the road conditions.

Intersection:A vehicle is allowed to cross the intersection according to the direction of travel when a traffic signal is green.

Multilane:A vehicle can move to parallel lanes. If the direction of travel is a rightturn, the vehicle moves to a rightturn exclusive lane.
 3) Search of Traffic Signals by Using the HGAPSO Algorithm
A fast algorithm is necessary to achieve realtime control for traffic control because the processing of the prediction and search to decide on the traffic signals of
k
th cycle has to finish within a minimum time
t^{1}_{minimum}
of the greensignal as shown in
Fig. 4
. In a global version of the PSO method, all particles tend to
gbest
; therefore, particles may fall into a local minimum point easily, as illustrated in
Fig. 24
, when the particle size or searching time is limited to realize realtime control.
Among the modified PSO methods are the Linearly Decreasing Inertia Weight Method (LDIWM)
[30]
and the Constriction Factor Method (CFM)
[31]
. The LDIWM method makes the coefficient
w
of particle velocity Eq. (7) smaller with an increase in the number of searches shown in Eq. (15), where
g
is the number of a search and
G
is the maximum value of
g
. In addition, the CFM method makes the coefficients of particle velocity greater compared with the coefficient of terms for
pbest
and
gbest
.
Rules of vehicle movements for cellular automaton microsimulator at rway intersection.
Convergence of globalversion particle swarm optimization.
These methods are expected to produce an improvement in the search; however, it is also possible for the particle to fall into a local minimum point when the particle size is small.
A hierarchical PSO (HPSO, local version) method
[32]
can overcome this local minimum problem. The HPSO method divides particles into several groups, and then the best particle in each group is located in a high hierarchy and the others are in a low hierarchy, illustrated in
Fig. 25
.
In the HPSO method, the particles in the low hierarchy are updated using Eqs. (20) and (21), and the particles in the high hierarchy are updated using Eqs. (22) and (23), respectively. In Eq. (20),
lbest
is a position with the best fitness in each group. This method, however, has the defect of slow convergence. The HPSO method is newly modified to achieve higher convergence as the term of
gbest
is added to Eq. (7) of the particle velocity for the groups in the low hierarchy as shown in Eq. (24).
At the same time, a genetic algorithm (GA) is newly introduced to update a selected particle position to avoid the local minimum problem. The number of chromosomes is 21; one chromosome represents one cycle of the traffic signal, and one gene is an integer from 4 to 9 seconds. An example of a chromosome is illustrated in
Fig. 26
. Crossover processing is used to exchange two particles between two groups, and mutation processing is used to reset a particle around
gbest
or
lbest
, illustrated in
Fig. 27
.
Structure of hierarchical particle swarm optimization.
Example of a chromosome.
Genetic algorithm of updating for position of particles.
Furthermore, a rule for the initial generation of particles is newly introduced to generate the next further particle for a distance L away from a particle as illustrated in
Fig. 28
. The procedure for the new HGAPSO algorithm, which combines HPSO with the modified velocities, GA operations, and the initial generation of particles, is shown in
Fig. 29
.
Initial generation of particles.
Procedure of HGAPSO algorithm. H: hierarchical, GA: genetic algorithm, PSO: particle swarm optimization.
 C. Simulation
A simulation was carried out to confirm the effectiveness of the realtime stochastic optimum control of traffic signals at an
r
way intersection based on the HGAPSO method using actual traffic flow data. The actual data was measured on 15 September 2010, 7:30–8:30 AM at Ijiri 6way intersection, Fukuoka, Japan, as shown in
Fig. 30
, and a frame of the CA traffic microsimulator is illustrated in
Fig. 31
. The phases of the traffic signals, conditions of traffic flows, and parameters of the CA microsimulator based on the actual measured data are shown in
Tables 2
and 3, respectively. Therefore, the minimum time
t^{1}_{minimum}
of the greensignal was determined to be 30 seconds.
Table 4
shows the parameters of fitness function Eq. (13).
Map of Ijiri 6way intersection.
A frame of cellular automaton traffic microsimulator.
Traffic signals of pretimed control at Ijiri 6way intersection
Traffic signals of pretimed control at Ijiri 6way intersection
Parameters of microsimulator
Parameters of microsimulator
Parameters of fitness function
Parameters of fitness function
In addition, the parameters of the HGAPSO algorithm are as follows:
w_{h}
= 0.729,
w_{i}
= 0.5,
c_{h1}
=
c_{h2}
= 1.49,
c_{i1}
= 1,
c_{i2}
= 1,
c_{i3}
= 0.5, particle size is 21, the number of groups is 3, and the maximum iteration is 25.
For an examination of traffic signal controls, a simulation was carried out using each of the GA, CFM, LDIWM, HPSO, and HGAPSO algorithms. There are three traffic congestion levels (normal, high, and very high), and their results from 20 times are shown in
Table 5
.
The convergence of fitness in the case of very high congestion, and the mean fitness values and their standard deviations are shown in
Figs. 32
and
33
, respectively.
Comparison of traffic signal controlsGA: genetic algorithm, CFM: constriction factor method, LDIWM: linearly decreasing inertia weight method, HPSO: hierarchical particle swarm optimization.
Comparison of traffic signal controls GA: genetic algorithm, CFM: constriction factor method, LDIWM: linearly decreasing inertia weight method, HPSO: hierarchical particle swarm optimization.
The searches by the GA and HPSO methods do not reach the minimum value by a limited number of searches, and the searches by the LDIWM and CFM methods might fall into a local minimum point. Moreover, the mean of the traffic queue length, total delay time, and velocity are shown in
Figs. 34
,
35
, and
36
, respectively.
Convergence of fitness in the case of very high congestion. GA: genetic algorithm, CFM: constriction factor method, LDIWM: linearly decreasing inertia weight method, HPSO: hierarchical particle swarm optimization.
Mean fitness and standard deviation of each method. GA: genetic algorithm, CFM: constriction factor method, LDIWM: linearly decreasing inertia weight method, HPSO: hierarchical particle swarm optimization.
The mean traffic queue by the HGAPSO control was reduced by 15 (%) compared with the pretimed control, and the total delay time was reduced by 20 (%) and 6 (%) compared with the pretimed and CFM methods, respectively. In addition, the mean velocity was accelerated 1.5% and 0.5% compared with the pretimed and CFM methods, respectively.
Mean traffic queue length (m). GA: genetic algorithm, CFM: constriction factor method, LDIWM: linearly decreasing inertia weight method, HPSO: hierarchical particle swarm optimization.
Total delay time (hr). GA: genetic algorithm, CFM: constriction factor method, LDIWM: linearly decreasing inertia weight method, HPSO: hierarchical particle swarm optimization.
Mean velocity. GA: genetic algorithm, CFM: constriction factor method, LDIWM: linearly decreasing inertia weight method, HPSO: hierarchical particle swarm optimization.
Traffic signals at Ijiri 6way intersection by HGAPSO control. H: hierarchical, GA: genetic algorithm, PSO: particle swarm optimization.
Finally, the traffic signals at Ijiri 6way intersection of
Fig. 30
by the HGAPSO algorithm are shown in
Fig. 37
.
V. CONCLUSIONS
Traffic congestion is a serious problem in modern cities, and traffic signal control is an effective method for reducing traffic jams. For actual random traffic flows, a stochastic model of traffic flows and traffic jams was constructed by using a BN, and then the probabilistic distributions of traffic jams were predicted by using a BN stochastic model and a cellular automaton model. In addition, a new HGAPSO algorithm was used to search for the optimum traffic signals of crossroads and multiway intersections to realize realtime control. The effectiveness of the realtime stochastic optimum control of traffic signals was confirmed by simulations based on actual traffic data.
Peck C.
,
Gorton P. T. W.
,
Liren D.
1990
“The application of SCOOTin developing countries”
in Proceedings of the 3rd International Conference on Road Traffic Control
London
104 
109
Sims A. G.
,
Dobinson K. W.
1980
“The Sydney coordinated adaptivetraffic (SCAT) system philosophy and benefits”
IEEE Transactions on Vehicular Technology
29
(2)
130 
137
DOI : 10.1109/TVT.1980.23833
Gartner N. H.
1983
“OPAC: a demandresponsive strategy for trafficsignal control”
Transportation Research Record
(906)
75 
81
Kouvelas A.
,
Aboudolas K.
,
Papageorgiou M.
,
Kosmatopoulos E. B.
2011
“A hybrid strategy for realtime traffic signalcontrol of urban road networks”
IEEE Transactions on Intelligent Transportation Systems
12
(3)
884 
894
DOI : 10.1109/TITS.2011.2116156
Lee J.
,
Abdulhai B.
,
Shalaby A.
,
Chung E. H.
2005
“Realtimeoptimization for adaptive traffic signal control using geneticalgorithms”
Journal of Intelligent Transportation Systems
9
(3)
111 
122
DOI : 10.1080/15472450500183649
Dong C.
,
Huang S.
,
Liu X.
2010
“Urban area traffic signal timingoptimization based on SaPSO”
in Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence
Sanya, China
80 
84
Murat Y. S.
,
Gedizlioglu E.
2005
“A fuzzy logic multiphased signalcontrol model for isolated junctions”
Transportation Research Part C: Emerging Technologies
13
(1)
19 
36
DOI : 10.1016/j.trc.2004.12.004
Cao Y. J.
,
Ireson N.
,
Bull L.
,
Miles R.
1999
“Design of a traffic junction controller using classifier system and fuzzy logic”
in Proceedings of the 6th International Conference on Computational Intelligence, Theory and Applications: Fuzzy Days
Dortmund, Germany
342 
353
Gokulan B. P.
,
Srinivasan D.
2010
“Distributed geometric fuzzymultiagent urban traffic signal control”
IEEE Transactions on Intelligent Transportation systems
11
(3)
714 
727
DOI : 10.1109/TITS.2010.2050688
Niittymaki J.
,
Kononen V.
2000
“Traffic signal controller based onfuzzy logic” vol. 5
in Proceedings of IEEE International Conference on Systems, Man, and Cybernetics
Nashville: TN
3578 
3581
Qiao J.
,
Yang N.
,
Gao J.
2011
“Twostage fuzzy logic controller forsignalized intersection”
IEEE Transactions on System, Man, and Cybernetics, Part A: Systems and Humans
41
(1)
178 
184
DOI : 10.1109/TSMCA.2010.2052606
Zang L.
,
Jia L.
,
Luo Y.
2006
“An intelligent control method for urban traffic signal based on fuzzy neural network”
in Proceedings of the 6th World Congress on Intelligent Control and Automation
Dalian, China
3430 
3434
Adeli H.
,
Samant A.
2000
“An adaptive conjugate gradient neuralnetwork–wavelet model for traffic incident detection”
ComputerAided Civil and Infrastructure Engineering
15
(4)
251 
260
DOI : 10.1111/08859507.00189
Chao K. H.
,
Lee R. H.
,
Wang M. H.
2008
“An intelligent traffic light control based on extension neural network”
in Proceedings of the 12th International Conference on KnowledgeBased Intelligent Information and Engineering Systems
Zagreb, Croatia
17 
24
Choy M. C.
,
Srinivasan D.
,
Cheu R. L.
2006
“Neural networks for continuous online learning and control”
IEEE Transactions on Neural Networks
17
(6)
1511 
1531
DOI : 10.1109/TNN.2006.881710
Srinivasan D.
,
Choy M. C.
,
Cheu R. L.
2006
“Neural networks for realtime traffic signal control”
IEEE Transactions on Intelligent Transportation Systems
7
(3)
261 
272
DOI : 10.1109/TITS.2006.874716
Wen K.
,
Yang W.
,
Qu S.
2010
“A stochastic adaptive traffic signal control model based on fuzzy reinforcement learning”
in Proceedings of the 2nd International Conference on Computer and Automation Engineering
Singapore
467 
465
Lu S.
,
Liu X.
,
Dai S.
2008
“Adaptive and coordinated traffic signal control based on Qlearning and multiband model”
in Proceedings of IEEE Conference on Cybernetics and Intelligent Systems
Chengdu, China
765 
770
Kuyer L.
,
Whiteson S.
,
Bakker B.
,
Vlassis N.
2008
“Multiagent reinforcement learning for urban traffic control using coordination graphs”
in Proceedings of the 19th European Conference on Machine Learning and Knowledge Discovery in Database
Antwerp, Belgium
656 
671
Arel I.
,
Liu C.
,
Urbanik T.
,
Kohls A. G.
2010
“Reinforcement learningbased multiagent system for network traffic signal control”
IET Intelligent Transportation Systems
4
(2)
128 
135
DOI : 10.1049/ietits.2009.0070
Balaji P. G.
,
German X.
,
Srinivasan D.
2010
“Urban traffic signalcontrol using reinforcement learning agents”
IET Intelligent Transportation Systems
4
(3)
177 
188
DOI : 10.1049/ietits.2009.0096
Neapolitan R. E.
2004
Learning Bayesian Networks
Pearson Prentice Hall
Upper Saddle, NJ
Cui C. Y.
,
Shin J. S.
,
Miyazaki M.
,
Lee H. H.
2012
“Realtimetraffic signal control for optimization of traffic jam probability”
IEEJ Transactions on Electrics, Information and Systems
132
(1)
21 
31
DOI : 10.1541/ieejeiss.132.21
Cui C. Y.
,
Shin J. S.
,
Lee H. H.
2010
“Realtime traffic signallearning control using BPNN based on predictions forprobabilistic distribution of standing vehicles”
Journal of Artificial Life and Robotics
15
(1)
58 
61
DOI : 10.1007/s1001501007689
Nagel K.
,
Schreckenberg M.
1992
“A cellular automaton model forfreeway traffic”
Journal de Physique I
2
(12)
2221 
2229
DOI : 10.1051/jp1:1992277
Kennedy J.
,
Eberhart R.
1995
“Particle swarm optimization”
in Proceedings of IEEE International Conference on Neural Networks
Perth: WA
1942 
1948
Cui C. Y.
2012
“Realtimetraffic signal control of multiway intersection using HGAPSOalgorithm based on optimization of traffic jam probability”
IEEJ Transactions on Electrics, Information and Systems
132
(12)
1982 
1991
DOI : 10.1541/ieejeiss.132.1982
Shi Y.
,
Eberhart R.
1998
“A modified particles swarm optimizer”
in Proceedings of the IEEE World Congress on Computational Intelligence
Anchorage: AK
69 
73
Clerc M.
,
Kennedy J.
2002
“The particle swarm  explosion,stability, and convergence in a multidimensional complex space”
IEEE Transactions on Evolutionary Computation
6
(1)
58 
73
DOI : 10.1109/4235.985692
Janson S.
,
Middendorf M.
2005
“A hierarchical particle swarmoptimizer and its adaptive variant”
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
35
(6)
1272 
1282
DOI : 10.1109/TSMCB.2005.850530