# Link-Based Signalized Arterial Progression Optimization with Practical Travel Speed

Authors: Wu Xianyu; Hu Peifeng; Yuan Zhenzhou
Journal: Journal of Applied Mathematics
 (2013)

---

## Abstract

Bandwidth is defined as the maximum amount of green time for a designated movement as it passes through an arterial. In most previous studies, bandwidth has been referred to arterial bandwidth. In practice, a balance between link bandwidth and arterial bandwidth has proven to be important in optimizing coordinated signal timing plans, because not all drivers need to pass through all the intersections on an arterial. This study proposes an algorithm on how to obtain an optimal coordinated signal timing plan with both optimal link bandwidth and optimal arterial bandwidth considering practical vehicles’ speed. The weighted link bandwidth attainability is introduced as an additional measure of effectiveness for assessing the optimization results. The link bandwidth optimization is built based on the improvement of Messer’s algorithm about bandwidth optimization. The arterial bandwidth optimization algorithm takes into consideration the weighted link bandwidth attainability while selecting phase sequences. The proposed algorithm is demonstrated in a case study, and many improvements are archived when a balanced consideration is given to both link bandwidth and arterial bandwidth. Fine-tuning of initial signal timing plan is done using practical travel speed. The evaluation results show a rather significant improvement which is achieved.


---

## Body

## 1. Introduction

The objective of a signalized arterial progression is to provide continuous movement of vehicles and/or minimize the delay along an arterial. Bandwidth is defined as the maximum amount of green time for a designated movement as it passes through an arterial. It is an outcome of the signal timing plan that is determined by the offsets between intersections and the allotted green time for the coordinated phase at each intersection. Bandwidth (measured in seconds) can be defined in terms of two consecutive intersections (referred to as link bandwidth) or in terms of an entire arterial (referred to as arterial bandwidth). Bandwidth and with its associated measures of efficiency and attainability are measures that are often used to assess the effectiveness of a coordinated signal timing plan [1].A larger progression bandwidth implies that more traffic on an arterial can progress through the signals without stops [2, 3]. Furthermore, bandwidth-based signal timing is preferred because it better meets drivers’ expectations. A signal timing solution without a good progression band, no matter how well it may claim to minimize system delays and stops, may not be acceptable to traffic engineers and travelers [4]. A study conducted by Yang indicated that bandwidth-based solutions generally outperform delay-based solutions based on several field studies [5].From the late 1960s to the early 1980s, many researchers, including Little, Messer, and Brooks, made a significant progress and developed a series of bandwidth optimization algorithms [6]. Messer et al. developed a variable-sequence program to form the core of the PASSER software. They modified traditional green bandwidth method and added variable phase sequence operation in the software [7, 8]. Little et al. developed the MAXBAND, using a more complicated mixed integer linear programming model [9]. Besides MAXBAND and PASSER, there are several other models that have been introduced. Gartner et al. developed MULTIBAND to improve the original MAXBAND [10]. In 1996, they published MULTIBAND-96 to further improve the model and applied to realistic networks [11]. Efforts to improve bandwidth-based optimization models and their computing algorithms continued up to the late 1990s [12–15]. Feng [16] developed the projection algorithm (PA) to optimize signal offsets and cycle length while considering start-up delay, residual queues, and unbalanced traffic volumes.In these studies mentioned above, bandwidth is always defined in terms of an entire arterial. Arterial bandwidth is commonly used to describe capacity or maximized vehicle throughput. While arterial bandwidth is a good indicator for progression opportunities, it may not fully capture the overall arterial operation. For example, on an arterial with 10 signalized intersections, an arterial bandwidth solution allows vehicles to travel through the entire system. In reality, one must consider how many vehicles actually travel through all the intersections. In some cases, link bandwidth is more important than arterial bandwidth because of high volumes (especially in the case of high left-turn volumes) between some links. Therefore both link and arterial bandwidth should be considered in optimizing coordinated signal timing plans. In 2002, Gartner and Stamatiadis provided mathematical programming models for the development of optimal arterial-based progression schemes considering an individually weighted band that can be adapted to the prevailing traffic flows on that link [17]. Their models began to pay more attention to link bandwidth; however they did not consider the impact of speed variation and could not obtain the signal timing plan with both optimal arterial bandwidth and optimal link bandwidth. Although software tools, such as SYNCHRO and TRANSY7F, can depict both arterial bands and link bands, their optimization objective is network delay instead of bandwidth. A signal timing plan with both optimized link bandwidth and arterial bandwidth is normally difficult to be obtained [18]. To overcome the limitations of previous studies, this study focuses on an algorithm that can obtain a best signal timing plan with both optimal link bandwidth and optimal arterial bandwidth.In an ideal coordinated system with optimal bandwidth, platoons with desired travel speed from an upstream intersection at the start of green should arrive at downstream intersection near start of the green indication. In reality, vehicle’s speed might be lower or higher than the desired speed. Speed limit is generally used when the actual speed data are not available. Recently, transportation professionals have new technologies and instruments to collect traffic data. The use of Global Positioning Systems (GPS) has become a springboard for many transportation related projects. GPS tools can capture, store, and transfer real-time traffic data on the field. Vehicle counts, speed, time, and delay are the key components of information to develop proper signal coordination timing plan. The expanding Geographic Information System (GIS) and GPS technologies have made it easy to collect spatial data (latitude, longitude) with attributes of time and velocity [19–22]. Considering the impact of practical travel speed, Feng [16] has developed a corridor signal optimization method called projection algorithm (PA). It does not introduce the fine-tuning of initial signal timing plan with practical travel speed.This study proposes an arterial progression optimization approach using link-based bandwidth optimization algorithm and a GPS tool on an arterial. The rest of paper is organized as follows. Section2 introduces some notations of the bandwidth optimization methodology and provides a link bandwidth optimization algorithm with eight situations to calculate upper/lower interferences and six cases to calculate relative offset between two consecutive intersections. Section 3 presents the new link-based arterial bandwidth optimization algorithm. Section 4 presents a case study to demonstrate the proposed algorithm and compare the performance index of signal timing plans on different speeds, especially the practical vehicles’ speed, with simulation models. Finally, Section 5 provides the summary and conclusions.


## 2. Link Bandwidth Optimization

### 2.1. Notations

N: number of intersections on an arterial; C: signal cycle length; i: intersection; Li,i+1: the link between i and i+1; GIBT,i: inbound through movement green time of i; GIBL,i: inbound left-turn movement green time of i; GOBT,i: outbound through movement green time of i; GOBL,i: outbound left-turn movement green time of i; βi: phase sequence of i for left-turn in the arterial direction, whose value can be 1, 2, 3, and 4, in which (1) “Lead/Lead,” meaning IBL, is leading phase and OBL is leading phase, (2) “Lead/Lag,” (3) “Lag/Lead,” (4) “Lag/Lag”; Oi: offset of i, start of green time of outbound through movement; Oi,i+1: relative offset between i and i+1; ROi,βi: relative offset of GIBT,i with respect to GOBT,i at i with sequence βi. Figure 1 shows the calculation of ROi,βi.Figure 1
Relative offset ofGIBT,i with respect to GOBT,i.T
i
,
i
+
1: travel time from i to i+1; Ti+1,i: travel time from i+1 to i; LIβi,βi+1: lower interference between i and i+1; UIβi,βi+1: upper interference between i and i+1; VIβi,βi+1: valid interference between i and i+1; Osi,i+1—slack time between GOBT,i and GOBT,i+1, and Osi,i+1=GOBT,i-GOBT,i+1; Isi,i+1: slack time between GIBT,i and GIBT,i+1, and Isi,i+1=GIBT,i-GIBT,i+1; Bi: link bandwidth of Li,i+1; BOi: outbound link bandwidth of Li,i+1; BIi: inbound link bandwidth of Li,i+1; VOBT,i: traffic volume of outbound through movement at i; VIBT,i: traffic volume of inbound through movement at i.


### 2.2. Calculation of Upper/Lower Interference

The bandwidth optimization algorithm developed by Brooks and Little establishes the primary principles of bandwidth optimization. The algorithm was originally developed for two-phase signals. Messer et al. [7] enhanced the original algorithm to handle multiphase signals with left-turn phases, which formed the core of PASSER II [8]. One major limitation of the algorithm is to get the optimal progression bandwidth for an arterial with high number of signalized intersections (e.g., >10). Messer’s paper did not include how to calculate relative offsets and did not consider the relative locations of intersections. This section provides detailed descriptions on all possible situations to calculate upper/lower interferences and offset for two consecutive intersections.Figure2 illustrates the basic concepts of bandwidth optimization algorithm for three signals with left-turn phases. The maximum progression bandwidth is the sum of outbound bandwidth and inbound bandwidth. The value of outbound bandwidth is a constant, which equals the minimum outbound through green time GOBT,min. And the inbound bandwidth is determined by minimum total valid interference from other intersections. In Figure 2, the second intersection is the master intersection, which has minimum inbound through green time GIBT,min. A valid upper interference is by the first intersection, UImax, and a valid lower interference is by the third intersection, LImax. Therefore the inbound bandwidth is GIBT,min-min(UImax+LImax).Figure 2
Illustration of bandwidth optimization algorithm.The bandwidth optimization principle reveals that the location ofi with respect to i+1 plays an important role in calculating upper and lower interferences for two consecutive intersections. On the other hand, according to comparison of inbound and outbound through movement green time, there are four situations that ensure correct upper and lower interference calculations.After calculating upper/lower interferences, there are four additional cases to adjust these upper/lower interferences and obtain the valid interferences, as shown in Table1. Figure 3 graphically illustrates the calculation of upper interference for the situation 4. In this situation, the intersection i has the minimum inbound through movement green time, meaning that the master intersection is on the left side of intersection i+1.Table 1
Calculation of upper/lower interference for link bandwidth.
Common situation
Upper interference
Lower interference
G
OBT
,
i
≤
G
OBT
,
i
+
1
G
IBT
,
i
+
1
>
G
IBT
,
i
U
I
β
i
,
β
i
+
1
=
G
I
B
T
,
i
-
(
-
R
O
i
,
β
i
+
T
i
,
i
+
1
+
R
O
i
+
1
,
β
i
+
1
+
G
IBT
,
i
+
1
+
T
i
+
1
,
i
)
mod
C
L
I
β
i
,
β
i
+
1
=
(
-
R
O
i
,
β
i
+
T
i
,
i
+
1
-
O
s
i
+
1
,
i
+
R
O
i
+
1
,
β
i
+
1
+
T
i
+
1
,
i
)
mod
C
G
OBT
,
i
>
G
OBT
,
i
+
1
G
IBT
,
i
+
1
>
G
IBT
,
i
+
1
U
I
β
i
,
β
i
+
1
=
(
G
IBT
,
i
-
(
-
R
O
i
,
β
i
+
G
OBT
,
i
-
G
OBT
,
i
+
1
+
T
i
,
i
+
1
+
R
O
i
+
1
,
β
i
+
1
+
G
IBT
,
i
+
1
+
T
i
+
1
,
i
)
mod
C
)
mod
C
L
I
β
i
,
β
i
+
1
=
(
-
R
O
i
,
β
i
+
T
i
,
i
+
1
-
O
s
i
+
1
,
i
+
R
O
i
+
1
,
β
i
+
1
+
T
i
+
1
,
i
)
mod
C
G
OBT
,
i
+
1
≤
G
OBT
,
i
G
IBT
,
i
+
1
≤
G
IBT
,
i
U
I
β
i
,
β
i
+
1
=
(
G
IBT
,
i
+
1
-
(
-
R
O
i
+
1
,
β
i
+
1
-
T
i
,
i
+
1
+
R
O
i
,
β
i
+
G
IBT
,
i
-
T
i
,
i
+
1
)
mod
C
)
mod
C
L
I
β
i
,
β
i
+
1
=
(
-
R
O
i
+
1
,
β
i
+
1
-
T
i
,
i
+
1
-
O
s
i
,
i
+
1
+
R
O
i
,
β
i
-
T
i
+
1
,
i
)
mod
C
G
OBT
,
i
+
1
>
G
OBT
,
i
G
OBT
,
i
+
1
≤
G
OBT
,
i
U
I
β
i
,
β
i
+
1
=
(
G
IBT
,
i
+
1
-
(
-
R
O
i
+
1
,
β
i
+
1
+
G
OBT
,
i
+
1
-
G
O
B
T
,
i
-
T
i
,
i
+
1
+
R
O
i
,
β
i
+
G
IBT
,
i
-
T
i
+
1
,
i
)
mod
C
)
mod
C
L
I
β
i
,
β
i
+
1
=
(
-
R
O
i
+
1
,
β
i
+
1
-
T
i
,
i
+
1
-
O
s
i
,
i
+
1
+
R
O
i
,
β
i
-
T
i
+
1
,
i
)
mod
C
Special situation
Upper/lower interfence
Interference adjustment
I
s
i
,
i
+
1
<
0
C
+
I
s
i
,
i
+
1
≤
L
I
β
i
,
β
i
+
1
≤
C
L
I
β
i
,
β
i
+
1
=
L
I
β
i
,
β
i
+
1
-
C
L
I
β
i
,
β
i
+
1
<
0
C
+
L
I
β
i
,
β
i
+
1
≤
min
{
G
IBT,i
,
G
IBT
,
i
+
1
}
L
I
β
i
,
β
i
+
1
=
L
I
β
i
,
β
i
+
1
+
C
I
s
i
,
i
+
1
<
0
C
+
I
s
i
,
i
+
1
≤
U
I
β
i
,
β
i
+
1
≤
C
U
I
β
i
,
β
i
+
1
=
U
I
β
i
,
β
i
+
1
-
C
U
I
β
i
,
β
i
+
1
<
0
C
+
U
I
β
i
,
β
i
+
1
≤
min
{
G
IBT
,
i
,
G
IBT
,
i
+
1
}
U
I
β
i
,
β
i
+
1
=
U
I
β
i
,
β
i
+
1
+
CFigure 3
The calculation of upper interference for situation 4.In Figure3, phase sequence of the first intersection no. i is “IBL:Lag/OBL:Lead,” βi=3, and phase sequence of the second intersection no. i+1 is “IBL:Lead/OBL:Lag,” βi+1=2. To calculate upper/lower interference between these two intersections, there are other 15 conditions with different combinations of phase sequences, as shown in Table 2.Table 2
Phase sequence combinations of two consecutive intersections.
Phase sequence combination
No.i intersection
No.i+1 intersection
IBL
OBL
β
IBL
OBL
β
1
Lead
Lead
β
i
=
1
Lead
Lead
β
i
+
1
=
1
2
Lead
Lag
β
i
+
1
=
2
3
Lag
Lead
β
i
+
1
=
3
4
Lag
Lag
β
i
+
1
=
4
5
Lead
Lag
β
i
=
2
Lead
Lead
β
i
+
1
=
1
6
Lead
Lag
β
i
+
1
=
2
7
Lag
Lead
β
i
+
1
=
3
8
Lag
Lag
β
i
+
1
=
4
9
Lag
Lead
β
i
=
3
Lead
Lead
β
i
+
1
=
1
10 (Figure2)
Lead
Lag
β
i
+
1
=
2
11
Lag
Lead
β
i
+
1
=
3
12
Lag
Lag
β
i
+
1
=
4
13
Lag
Lag
β
i
=
4
Lead
Lead
β
i
+
1
=
1
14
Lead
Lag
β
i
+
1
=
2
15
Lag
Lead
β
i
+
1
=
3
16
Lag
Lag
β
i
+
1
=
4


### 2.3. Valid Upper/Lower Interference and Link Bandwidth

All upper/lower interferences to be valid must be less than the minimum inbound through movement green time and greater than the slack time betweenGIBT,i and GIBT,i+1, as shown in
(1)Isi≤LIβi,βi+1≤min{GIBT,i,GIBT,i+1},Isi≤UIβi,βi+1≤min{GIBT,i,GIBT,i+1}.
Additionally, because the master intersection has the minimum green time, only one interference (cannot be both) could occur for one combination phase sequence at two intersections, as shown in
(2)VIβi,βi+1={UIβi,βi+1,LIβi,βi+1}.
Then, a link bandwidth can be gained using
(3)Bi=BOi+BIi=min{GOBT,i,GOBT,i+1}+min{GIBT,i,GIBT,i+1}-VIβi,βi+1.


### 2.4. Calculation of Relative Offset

Assume that the referencing phase is the start of green time of outbound through movement, there are six cases to calculate the relative offset of two consecutive intersections.Case 1.
ConsiderGOBT,i≤GOBT,i+1, GIBT,i+1>GIBT,i, and VIβi,βi+1=UIβi,βi+1, as shown in Figure 4(a).
Then(4)Oi=0,Oi+1=Ti,i+1modC.The calculation of relative offset.
(a)
Case1: upper interference
(b)
Case3: lower interferenceCase 2.
ConsiderGOBT,i>GOBT,i+1 and GIBT,i+1>GIBT,i.
Then(5)Oi=0,Oi+1=(Ti,i+1+GOBT,i-GOBT,i+1)modC.Case 3.
ConsiderGOBT,i≤GOBT,i+1, GIBT,i+1>GIBT,i, and VIβi,βi+1=LIβi,βi+1, as shown in Figure 4(b).
Then(6)Oi=0,Oi+1=(Ti,i+1+GOBT,i-GOBT,i+1+K*C)modC,
where K is an integer. If Ti,i+1+GOBT,i-GOBT,i+1<0, then K=1 or else K=0.Case 4.
ConsiderGOBT,i+1≤GOBT,i, GIBT,i+1≤GIBT,i, and VIβi,βi+1=UIβi,βi+1.
Then(7)Oi=K*C-Ti,i+1,Oi+1=0.Case 5.
ConsiderGOBT,i+1>GOBT,i and GIBT,i+1≤GIBT,i.
Then(8)Oi=K*C-Ti,i+1+GOBT,i+1-GOBT,i,Oi+1=0.Case 6.
ConsiderGOBT,i+1≤GOBT,i, GIBT,i+1≤GIBT,i, and VIβi,βi+1=LIβi,βi+1.Then(9)Oi=K*C-Ti,i+1+GOBT,i+1-GOBT,i,Oi+1=0.


### 2.5. Example of Link Bandwidth Optimization Algorithm

The signal timing plans of two intersections are shown below. The distance between them is 2015 ft, and the speed limit is 40 mph; then travel time is 34 s and cycle length is 130 s:(10)GIBT,i=51,GOBT,i=49,GIBL,i=20,GOBL,i=18,GIBT,i+1=45,GOBT,i+1=36,GIBL,i+1=29,GOBL,i+1=20.
Then, GOBT,i+1≤GOBT,i and GIBT,i+1≤GIBT,i are fit for common situation 3 in Table 1. Table 3 shows the results of upper/lower interference calculation, including 16 phase sequence combinations.Table 3
Upper/lower interferences of two consecutive intersections.
Phase sequence
Intersectioni+1
1
1
1
1
2
2
2
2
Intersectioni
1
2
3
4
1
2
3
4
Interference of intersectioni+1 from intersection i
Upper interference
55
Common:45-(-(20-29)-34+(-20)+51-34)=73
35
53
35
53
15
33
Lower interference
−74
Common:-(-9)-34-(49-36)+(-20)-34=-92Special:-92+130=38<45  valid interference
−54
−72
−54
−72
−34
−52
Link bandwidth
—
45
+
36
-
38
=
43
45
+
36
-
35
=
46
—
46
—
66
48
Offset of intersectioni
—
130
-
34
+
36
-
49
=
83
130
-
34
=
96
—
96
—
96
96
Phase sequence
Intersectioni+1
3
3
3
3
4
4
4
4
Intersectioni
1
2
3
4
1
2
3
4
Interference
Upper interference
84
102
64
82
64
82
44
62
Lower interference
27
9
−83
29
−83
29
−63
−81
Link bandwidth
54
72
—
52
—
52
37
—
Offset of intersectioni
83
83
—
83
—
83
96
—According to the rule of valid interference in Section2.3 and calculation of offset in Section 2.4, we can get the valid interference, link bandwidth, and offset relative to phase sequences, as shown in Table 3 (bold text), including 10 phase sequence combinations (not all 16 combinations have valid interference).


## 2.1. Notations

N: number of intersections on an arterial; C: signal cycle length; i: intersection; Li,i+1: the link between i and i+1; GIBT,i: inbound through movement green time of i; GIBL,i: inbound left-turn movement green time of i; GOBT,i: outbound through movement green time of i; GOBL,i: outbound left-turn movement green time of i; βi: phase sequence of i for left-turn in the arterial direction, whose value can be 1, 2, 3, and 4, in which (1) “Lead/Lead,” meaning IBL, is leading phase and OBL is leading phase, (2) “Lead/Lag,” (3) “Lag/Lead,” (4) “Lag/Lag”; Oi: offset of i, start of green time of outbound through movement; Oi,i+1: relative offset between i and i+1; ROi,βi: relative offset of GIBT,i with respect to GOBT,i at i with sequence βi. Figure 1 shows the calculation of ROi,βi.Figure 1
Relative offset ofGIBT,i with respect to GOBT,i.T
i
,
i
+
1: travel time from i to i+1; Ti+1,i: travel time from i+1 to i; LIβi,βi+1: lower interference between i and i+1; UIβi,βi+1: upper interference between i and i+1; VIβi,βi+1: valid interference between i and i+1; Osi,i+1—slack time between GOBT,i and GOBT,i+1, and Osi,i+1=GOBT,i-GOBT,i+1; Isi,i+1: slack time between GIBT,i and GIBT,i+1, and Isi,i+1=GIBT,i-GIBT,i+1; Bi: link bandwidth of Li,i+1; BOi: outbound link bandwidth of Li,i+1; BIi: inbound link bandwidth of Li,i+1; VOBT,i: traffic volume of outbound through movement at i; VIBT,i: traffic volume of inbound through movement at i.


## 2.2. Calculation of Upper/Lower Interference

The bandwidth optimization algorithm developed by Brooks and Little establishes the primary principles of bandwidth optimization. The algorithm was originally developed for two-phase signals. Messer et al. [7] enhanced the original algorithm to handle multiphase signals with left-turn phases, which formed the core of PASSER II [8]. One major limitation of the algorithm is to get the optimal progression bandwidth for an arterial with high number of signalized intersections (e.g., >10). Messer’s paper did not include how to calculate relative offsets and did not consider the relative locations of intersections. This section provides detailed descriptions on all possible situations to calculate upper/lower interferences and offset for two consecutive intersections.Figure2 illustrates the basic concepts of bandwidth optimization algorithm for three signals with left-turn phases. The maximum progression bandwidth is the sum of outbound bandwidth and inbound bandwidth. The value of outbound bandwidth is a constant, which equals the minimum outbound through green time GOBT,min. And the inbound bandwidth is determined by minimum total valid interference from other intersections. In Figure 2, the second intersection is the master intersection, which has minimum inbound through green time GIBT,min. A valid upper interference is by the first intersection, UImax, and a valid lower interference is by the third intersection, LImax. Therefore the inbound bandwidth is GIBT,min-min(UImax+LImax).Figure 2
Illustration of bandwidth optimization algorithm.The bandwidth optimization principle reveals that the location ofi with respect to i+1 plays an important role in calculating upper and lower interferences for two consecutive intersections. On the other hand, according to comparison of inbound and outbound through movement green time, there are four situations that ensure correct upper and lower interference calculations.After calculating upper/lower interferences, there are four additional cases to adjust these upper/lower interferences and obtain the valid interferences, as shown in Table1. Figure 3 graphically illustrates the calculation of upper interference for the situation 4. In this situation, the intersection i has the minimum inbound through movement green time, meaning that the master intersection is on the left side of intersection i+1.Table 1
Calculation of upper/lower interference for link bandwidth.
Common situation
Upper interference
Lower interference
G
OBT
,
i
≤
G
OBT
,
i
+
1
G
IBT
,
i
+
1
>
G
IBT
,
i
U
I
β
i
,
β
i
+
1
=
G
I
B
T
,
i
-
(
-
R
O
i
,
β
i
+
T
i
,
i
+
1
+
R
O
i
+
1
,
β
i
+
1
+
G
IBT
,
i
+
1
+
T
i
+
1
,
i
)
mod
C
L
I
β
i
,
β
i
+
1
=
(
-
R
O
i
,
β
i
+
T
i
,
i
+
1
-
O
s
i
+
1
,
i
+
R
O
i
+
1
,
β
i
+
1
+
T
i
+
1
,
i
)
mod
C
G
OBT
,
i
>
G
OBT
,
i
+
1
G
IBT
,
i
+
1
>
G
IBT
,
i
+
1
U
I
β
i
,
β
i
+
1
=
(
G
IBT
,
i
-
(
-
R
O
i
,
β
i
+
G
OBT
,
i
-
G
OBT
,
i
+
1
+
T
i
,
i
+
1
+
R
O
i
+
1
,
β
i
+
1
+
G
IBT
,
i
+
1
+
T
i
+
1
,
i
)
mod
C
)
mod
C
L
I
β
i
,
β
i
+
1
=
(
-
R
O
i
,
β
i
+
T
i
,
i
+
1
-
O
s
i
+
1
,
i
+
R
O
i
+
1
,
β
i
+
1
+
T
i
+
1
,
i
)
mod
C
G
OBT
,
i
+
1
≤
G
OBT
,
i
G
IBT
,
i
+
1
≤
G
IBT
,
i
U
I
β
i
,
β
i
+
1
=
(
G
IBT
,
i
+
1
-
(
-
R
O
i
+
1
,
β
i
+
1
-
T
i
,
i
+
1
+
R
O
i
,
β
i
+
G
IBT
,
i
-
T
i
,
i
+
1
)
mod
C
)
mod
C
L
I
β
i
,
β
i
+
1
=
(
-
R
O
i
+
1
,
β
i
+
1
-
T
i
,
i
+
1
-
O
s
i
,
i
+
1
+
R
O
i
,
β
i
-
T
i
+
1
,
i
)
mod
C
G
OBT
,
i
+
1
>
G
OBT
,
i
G
OBT
,
i
+
1
≤
G
OBT
,
i
U
I
β
i
,
β
i
+
1
=
(
G
IBT
,
i
+
1
-
(
-
R
O
i
+
1
,
β
i
+
1
+
G
OBT
,
i
+
1
-
G
O
B
T
,
i
-
T
i
,
i
+
1
+
R
O
i
,
β
i
+
G
IBT
,
i
-
T
i
+
1
,
i
)
mod
C
)
mod
C
L
I
β
i
,
β
i
+
1
=
(
-
R
O
i
+
1
,
β
i
+
1
-
T
i
,
i
+
1
-
O
s
i
,
i
+
1
+
R
O
i
,
β
i
-
T
i
+
1
,
i
)
mod
C
Special situation
Upper/lower interfence
Interference adjustment
I
s
i
,
i
+
1
<
0
C
+
I
s
i
,
i
+
1
≤
L
I
β
i
,
β
i
+
1
≤
C
L
I
β
i
,
β
i
+
1
=
L
I
β
i
,
β
i
+
1
-
C
L
I
β
i
,
β
i
+
1
<
0
C
+
L
I
β
i
,
β
i
+
1
≤
min
{
G
IBT,i
,
G
IBT
,
i
+
1
}
L
I
β
i
,
β
i
+
1
=
L
I
β
i
,
β
i
+
1
+
C
I
s
i
,
i
+
1
<
0
C
+
I
s
i
,
i
+
1
≤
U
I
β
i
,
β
i
+
1
≤
C
U
I
β
i
,
β
i
+
1
=
U
I
β
i
,
β
i
+
1
-
C
U
I
β
i
,
β
i
+
1
<
0
C
+
U
I
β
i
,
β
i
+
1
≤
min
{
G
IBT
,
i
,
G
IBT
,
i
+
1
}
U
I
β
i
,
β
i
+
1
=
U
I
β
i
,
β
i
+
1
+
CFigure 3
The calculation of upper interference for situation 4.In Figure3, phase sequence of the first intersection no. i is “IBL:Lag/OBL:Lead,” βi=3, and phase sequence of the second intersection no. i+1 is “IBL:Lead/OBL:Lag,” βi+1=2. To calculate upper/lower interference between these two intersections, there are other 15 conditions with different combinations of phase sequences, as shown in Table 2.Table 2
Phase sequence combinations of two consecutive intersections.
Phase sequence combination
No.i intersection
No.i+1 intersection
IBL
OBL
β
IBL
OBL
β
1
Lead
Lead
β
i
=
1
Lead
Lead
β
i
+
1
=
1
2
Lead
Lag
β
i
+
1
=
2
3
Lag
Lead
β
i
+
1
=
3
4
Lag
Lag
β
i
+
1
=
4
5
Lead
Lag
β
i
=
2
Lead
Lead
β
i
+
1
=
1
6
Lead
Lag
β
i
+
1
=
2
7
Lag
Lead
β
i
+
1
=
3
8
Lag
Lag
β
i
+
1
=
4
9
Lag
Lead
β
i
=
3
Lead
Lead
β
i
+
1
=
1
10 (Figure2)
Lead
Lag
β
i
+
1
=
2
11
Lag
Lead
β
i
+
1
=
3
12
Lag
Lag
β
i
+
1
=
4
13
Lag
Lag
β
i
=
4
Lead
Lead
β
i
+
1
=
1
14
Lead
Lag
β
i
+
1
=
2
15
Lag
Lead
β
i
+
1
=
3
16
Lag
Lag
β
i
+
1
=
4


## 2.3. Valid Upper/Lower Interference and Link Bandwidth

All upper/lower interferences to be valid must be less than the minimum inbound through movement green time and greater than the slack time betweenGIBT,i and GIBT,i+1, as shown in
(1)Isi≤LIβi,βi+1≤min{GIBT,i,GIBT,i+1},Isi≤UIβi,βi+1≤min{GIBT,i,GIBT,i+1}.
Additionally, because the master intersection has the minimum green time, only one interference (cannot be both) could occur for one combination phase sequence at two intersections, as shown in
(2)VIβi,βi+1={UIβi,βi+1,LIβi,βi+1}.
Then, a link bandwidth can be gained using
(3)Bi=BOi+BIi=min{GOBT,i,GOBT,i+1}+min{GIBT,i,GIBT,i+1}-VIβi,βi+1.


## 2.4. Calculation of Relative Offset

Assume that the referencing phase is the start of green time of outbound through movement, there are six cases to calculate the relative offset of two consecutive intersections.Case 1.
ConsiderGOBT,i≤GOBT,i+1, GIBT,i+1>GIBT,i, and VIβi,βi+1=UIβi,βi+1, as shown in Figure 4(a).
Then(4)Oi=0,Oi+1=Ti,i+1modC.The calculation of relative offset.
(a)
Case1: upper interference
(b)
Case3: lower interferenceCase 2.
ConsiderGOBT,i>GOBT,i+1 and GIBT,i+1>GIBT,i.
Then(5)Oi=0,Oi+1=(Ti,i+1+GOBT,i-GOBT,i+1)modC.Case 3.
ConsiderGOBT,i≤GOBT,i+1, GIBT,i+1>GIBT,i, and VIβi,βi+1=LIβi,βi+1, as shown in Figure 4(b).
Then(6)Oi=0,Oi+1=(Ti,i+1+GOBT,i-GOBT,i+1+K*C)modC,
where K is an integer. If Ti,i+1+GOBT,i-GOBT,i+1<0, then K=1 or else K=0.Case 4.
ConsiderGOBT,i+1≤GOBT,i, GIBT,i+1≤GIBT,i, and VIβi,βi+1=UIβi,βi+1.
Then(7)Oi=K*C-Ti,i+1,Oi+1=0.Case 5.
ConsiderGOBT,i+1>GOBT,i and GIBT,i+1≤GIBT,i.
Then(8)Oi=K*C-Ti,i+1+GOBT,i+1-GOBT,i,Oi+1=0.Case 6.
ConsiderGOBT,i+1≤GOBT,i, GIBT,i+1≤GIBT,i, and VIβi,βi+1=LIβi,βi+1.Then(9)Oi=K*C-Ti,i+1+GOBT,i+1-GOBT,i,Oi+1=0.


## 2.5. Example of Link Bandwidth Optimization Algorithm

The signal timing plans of two intersections are shown below. The distance between them is 2015 ft, and the speed limit is 40 mph; then travel time is 34 s and cycle length is 130 s:(10)GIBT,i=51,GOBT,i=49,GIBL,i=20,GOBL,i=18,GIBT,i+1=45,GOBT,i+1=36,GIBL,i+1=29,GOBL,i+1=20.
Then, GOBT,i+1≤GOBT,i and GIBT,i+1≤GIBT,i are fit for common situation 3 in Table 1. Table 3 shows the results of upper/lower interference calculation, including 16 phase sequence combinations.Table 3
Upper/lower interferences of two consecutive intersections.
Phase sequence
Intersectioni+1
1
1
1
1
2
2
2
2
Intersectioni
1
2
3
4
1
2
3
4
Interference of intersectioni+1 from intersection i
Upper interference
55
Common:45-(-(20-29)-34+(-20)+51-34)=73
35
53
35
53
15
33
Lower interference
−74
Common:-(-9)-34-(49-36)+(-20)-34=-92Special:-92+130=38<45  valid interference
−54
−72
−54
−72
−34
−52
Link bandwidth
—
45
+
36
-
38
=
43
45
+
36
-
35
=
46
—
46
—
66
48
Offset of intersectioni
—
130
-
34
+
36
-
49
=
83
130
-
34
=
96
—
96
—
96
96
Phase sequence
Intersectioni+1
3
3
3
3
4
4
4
4
Intersectioni
1
2
3
4
1
2
3
4
Interference
Upper interference
84
102
64
82
64
82
44
62
Lower interference
27
9
−83
29
−83
29
−63
−81
Link bandwidth
54
72
—
52
—
52
37
—
Offset of intersectioni
83
83
—
83
—
83
96
—According to the rule of valid interference in Section2.3 and calculation of offset in Section 2.4, we can get the valid interference, link bandwidth, and offset relative to phase sequences, as shown in Table 3 (bold text), including 10 phase sequence combinations (not all 16 combinations have valid interference).


## 3. Link-Based Arterial Bandwidth Optimization Algorithm

### 3.1. Measures of Effectiveness (MOE)

Bandwidth efficiency and attainability are two measures to describe the quality of a coordinated signal timing plan. Both are computed from a time-space diagram that represents the signal timing plan. The two parameters are first defined by Messer et al. [7, 8], as shown in
(11)EB=(Bout+Bin)2C×100%,Ac=Bout+BinGOBT,min+GIBT,min×100%,
where EB arterial bandwidth efficiency, Bout arterial bandwidth of outbound, Bin arterial bandwidth of inbound, and Ac the attainability for a given cycle length.Besides the arterial bandwidth efficiency and attainability, maximum link bandwidth, possible link bandwidth, and link bandwidth attainability are first proposed as additional measures of effectiveness in our research. Maximum link bandwidth is the maximum value of a link bandwidth obtained using link bandwidth optimization algorithm. Possible link bandwidth is the value of a link bandwidth when the signal system has the optimal arterial progression bandwidth. In this case, the link bandwidth may not be the best solution to get the arterial bandwidth. In Figure5, the maximum link bandwidth between the first and the second intersections is 72 seconds, while the possible link bandwidth is only 66 seconds to obtain the optimal arterial bandwidth (offset and phase sequence have been changed).Example of maximum and possible link bandwidth and arterial bandwidth.
(a)
Maximum link bandwidth
(b)
Possible link and arterial bandwidthB
max
i is maximum link bandwidth of Li, Bi possible link bandwidth of Li, and αi link bandwidth attainability, defined as ratio of Bi over Bmaxi, shown in
(12)αi=BiBmaxi.


### 3.2. Calculation of Link Bandwidth

After the outbound direction is determined, link bandwidthBi with phase sequence βi, βi+1, and offset Oi,i+1 can be calculated. The optimized results of Li,i+1 are shown in Table 4 and are sorted in a descending order by Bi. Both βi and βi+1 can be 1, 2, 3, and 4; therefore the total number of possible solutions is 16. It is noted that not all 16 solutions yield a valid upper or lower interference. Only 9 valid solutions are included in Table 4, using two intersecions on Kietzke Lane, Reno, NV, USA.Table 4
Optimized results forLi,i+1 on Kietzke Lane (GIBT,i+1<GIBT,i, 2nd Steet and Mill Street).
Timing parameter
Valid solutions
1
2
3
4
5
6
7
8
9
β
i
2
3
1
4
2
4
3
1
2
β
i
+
1
3
2
3
3
4
2
1
2
1
B
i
72
66
54
52
52
48
46
46
43
α
i
1.0
0.92
0.75
0.72
0.72
0.67
0.64
0.64
0.60
O
i
,
i
+
1
83
96
83
83
83
96
96
96
83Similarly, the link bandwidthBi+1 with phase sequence βi+1′(intermediate variable to differentiate it from βi+1), βi+2 and offset Oi+1,i+2 can be calculated. The optimized results of Li+1,i+2 are shown in Table 5 and sorted in a descending order by Bi+1.Table 5
Optimized results forLi+1,i+2 on Kietzke Lane (GIBT,i+2>GIBT,i+1, Mill Street and Vassar Street).
Timing parameter
Valid solutions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
β
i
+
1
′
1
1
1
2
2
2
4
4
4
2
3
1
4
3
3
β
i
+
2
1
3
4
1
2
4
3
1
4
3
3
2
2
1
4
B
i
+
1
81
81
81
81
81
81
81
73
72
71
70
64
55
53
52
α
i
+
1
1.0
1.0
1.0
1.0
1.0
1.0
1.0
0.90
0.89
0.88
0.86
0.79
0.68
0.65
0.64
O
i
+
1
,
i
+
2
56
56
56
37
56
37
56
56
56
37
56
56
56
56
56Using the same approach, the link bandwidthBi+2 with phase sequence βi+2′, βi+3 and offset Oi+2,i+3 can be calculated. The optimized results of Li+2,i+3 are shown in Table 6 and sorted in a descending order by Bi+2.Table 6
Optimized results forLi+2,i+3 on Kietzke Lane (GIBT,i+3<GIBT,i+2, Vassar Street and Plumb Lane).
Timing parameter
Valid solutions
1
2
3
4
5
6
7
8
9
10
11
12
β
i
+
2
′
2
4
1
2
2
3
4
1
4
1
2
3
β
i
+
3
3
3
3
1
4
3
1
1
4
4
2
2
B
i
+
2
98
83
82
80
78
65
63
62
61
60
58
54
α
i
+
2
1.0
0.85
0.84
0.82
0.80
0.63
0.64
0.63
0.62
0.61
0.59
0.55
O
i
+
2
,
i
+
3
81
81
81
81
81
81
81
81
81
81
81
86


### 3.3. Selection of Phase Sequence

Using the conditionsβi+1=βi+1′ and βi+2=βi+2′, one can get many solutions of phase sequences for the intersections on this arterial. Importance of each link bandwidth may be different from one another on an arterial. There are many factors that impact the value of the importance, such as traffic volumes (through movement, left-turn), road configuration, and passing pedestrians. If traffic volume of through movement from i and i+1 is more than others, then link bandwidth of Li,i+1 is more important than others. ωi is defined as a weighted factor that reflects the importance of link bandwidth attainability. Em is defined as the efficiency for solution m of a coordinated signal timing plan
(13)Em=∑iNωiαi,ωi=(VOBT,i+VIBT,i+1)∑i(VOBT,i+VIBT,i+1).
The best solution is the one that has the maximum efficiency Em. In this example,
(14)ω1=(VOBT,i+VIBT,i+1)∑i(VOBT,i+VIBT,i+1)=(820+492)(820+492)+(903+625)+(971+6483)=0.3055,ω2=0.3559,ω3=0.3386.
Table 7 shows five solutions of different phase sequences, based on the data in Tables 4, 5, and 6. The weighted factor of each link is calculated using through traffic volumes. As can be seen, solution 2 is the best solution, which has an efficiency of 0.9755. The number of solutions is dependent on the optimized result. Table 7 just shows five of the solutions.Table 7
Selected solutions of different phase sequences on Kietzke Lane (2nd Street → Plumb Lane).
m
1
2
3
4
5
I
i
β
i
α
i
β
i
α
i
β
i
α
i
β
i
α
i
β
i
α
i
1
2
1
3
0.92
3
0.92
3
0.92
1
0.75
2
3
0.86
2
1
2
1
2
1
3
0.86
3
3
0.63
2
1
4
0.85
1
0.84
3
0.63
4
3
—
3
—
3
—
3
—
3
—
E
m
—
0.8249
—
0.9755
—
0.9247
—
0.9214
—
0.7485


### 3.4. Calculation of Offset

The inbound through movement green time determines which intersection is the reference intersection for one link and how the relative offset of each intersection is calculated. According to the value of inbound through movement green time, there are four cases to calculate the offsets ofi, i+1, and i+2.Case 1.
ConsiderGIBT,i+1>GIBT,i and GIBT,i+2>GIBT,i+1; then
(15)Oi=0,Oi+1=Oi,i+1,Oi+2=Oi,i+1+Oi+1,i+2.Case 2.
ConsiderGIBT,i+1>GIBT,i and GIBT,i+2≤GIBT,i+1; then
(16)Oi=0,Oi+1=Oi,i+1,Oi+2=Oi,i+1-Oi+1,i+2+K*C,
where K is an integer. If Oi,i+1-Oi+1,i+2<0, then K=1 or else K=0.Case 3.
ConsiderGIBT,i+1≤GIBT,i and GIBT,i+2>GIBT,i+1; then
(17)Oi=Oi,i+1,Oi+1=0,Oi+2=Oi+1,i+2.Case 4.
ConsiderGIBT,i+1≤GIBT,i and GIBT,i+2≤GIBT,i+1; then
(18)Oi=Oi,i+1,Oi+1=0,Oi+2=C-Oi+1,i+2.
In Table 7, solution 2 is the best solution of phase sequences on this arterial. Using the algorithm of calculating the above offset, one can get the offset for each intersection.
(1) ConsiderGIBT,i+1<GIBT,i, GIBT,i+2>GIBT,i+1; then
(19)Oi=Oi,i+1=96,Oi+1=0,Oi+2=Oi+1,i+2=56.
(2) ConsiderGIBT,i+3<GIBT,i+2; then
(20)Oi+2=Oi+1,i+2=56,Oi+3=K*C+(Oi+1,i+2-Oi+2,i+3)=130+(56-81)=105.


## 3.1. Measures of Effectiveness (MOE)

Bandwidth efficiency and attainability are two measures to describe the quality of a coordinated signal timing plan. Both are computed from a time-space diagram that represents the signal timing plan. The two parameters are first defined by Messer et al. [7, 8], as shown in
(11)EB=(Bout+Bin)2C×100%,Ac=Bout+BinGOBT,min+GIBT,min×100%,
where EB arterial bandwidth efficiency, Bout arterial bandwidth of outbound, Bin arterial bandwidth of inbound, and Ac the attainability for a given cycle length.Besides the arterial bandwidth efficiency and attainability, maximum link bandwidth, possible link bandwidth, and link bandwidth attainability are first proposed as additional measures of effectiveness in our research. Maximum link bandwidth is the maximum value of a link bandwidth obtained using link bandwidth optimization algorithm. Possible link bandwidth is the value of a link bandwidth when the signal system has the optimal arterial progression bandwidth. In this case, the link bandwidth may not be the best solution to get the arterial bandwidth. In Figure5, the maximum link bandwidth between the first and the second intersections is 72 seconds, while the possible link bandwidth is only 66 seconds to obtain the optimal arterial bandwidth (offset and phase sequence have been changed).Example of maximum and possible link bandwidth and arterial bandwidth.
(a)
Maximum link bandwidth
(b)
Possible link and arterial bandwidthB
max
i is maximum link bandwidth of Li, Bi possible link bandwidth of Li, and αi link bandwidth attainability, defined as ratio of Bi over Bmaxi, shown in
(12)αi=BiBmaxi.


## 3.2. Calculation of Link Bandwidth

After the outbound direction is determined, link bandwidthBi with phase sequence βi, βi+1, and offset Oi,i+1 can be calculated. The optimized results of Li,i+1 are shown in Table 4 and are sorted in a descending order by Bi. Both βi and βi+1 can be 1, 2, 3, and 4; therefore the total number of possible solutions is 16. It is noted that not all 16 solutions yield a valid upper or lower interference. Only 9 valid solutions are included in Table 4, using two intersecions on Kietzke Lane, Reno, NV, USA.Table 4
Optimized results forLi,i+1 on Kietzke Lane (GIBT,i+1<GIBT,i, 2nd Steet and Mill Street).
Timing parameter
Valid solutions
1
2
3
4
5
6
7
8
9
β
i
2
3
1
4
2
4
3
1
2
β
i
+
1
3
2
3
3
4
2
1
2
1
B
i
72
66
54
52
52
48
46
46
43
α
i
1.0
0.92
0.75
0.72
0.72
0.67
0.64
0.64
0.60
O
i
,
i
+
1
83
96
83
83
83
96
96
96
83Similarly, the link bandwidthBi+1 with phase sequence βi+1′(intermediate variable to differentiate it from βi+1), βi+2 and offset Oi+1,i+2 can be calculated. The optimized results of Li+1,i+2 are shown in Table 5 and sorted in a descending order by Bi+1.Table 5
Optimized results forLi+1,i+2 on Kietzke Lane (GIBT,i+2>GIBT,i+1, Mill Street and Vassar Street).
Timing parameter
Valid solutions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
β
i
+
1
′
1
1
1
2
2
2
4
4
4
2
3
1
4
3
3
β
i
+
2
1
3
4
1
2
4
3
1
4
3
3
2
2
1
4
B
i
+
1
81
81
81
81
81
81
81
73
72
71
70
64
55
53
52
α
i
+
1
1.0
1.0
1.0
1.0
1.0
1.0
1.0
0.90
0.89
0.88
0.86
0.79
0.68
0.65
0.64
O
i
+
1
,
i
+
2
56
56
56
37
56
37
56
56
56
37
56
56
56
56
56Using the same approach, the link bandwidthBi+2 with phase sequence βi+2′, βi+3 and offset Oi+2,i+3 can be calculated. The optimized results of Li+2,i+3 are shown in Table 6 and sorted in a descending order by Bi+2.Table 6
Optimized results forLi+2,i+3 on Kietzke Lane (GIBT,i+3<GIBT,i+2, Vassar Street and Plumb Lane).
Timing parameter
Valid solutions
1
2
3
4
5
6
7
8
9
10
11
12
β
i
+
2
′
2
4
1
2
2
3
4
1
4
1
2
3
β
i
+
3
3
3
3
1
4
3
1
1
4
4
2
2
B
i
+
2
98
83
82
80
78
65
63
62
61
60
58
54
α
i
+
2
1.0
0.85
0.84
0.82
0.80
0.63
0.64
0.63
0.62
0.61
0.59
0.55
O
i
+
2
,
i
+
3
81
81
81
81
81
81
81
81
81
81
81
86


## 3.3. Selection of Phase Sequence

Using the conditionsβi+1=βi+1′ and βi+2=βi+2′, one can get many solutions of phase sequences for the intersections on this arterial. Importance of each link bandwidth may be different from one another on an arterial. There are many factors that impact the value of the importance, such as traffic volumes (through movement, left-turn), road configuration, and passing pedestrians. If traffic volume of through movement from i and i+1 is more than others, then link bandwidth of Li,i+1 is more important than others. ωi is defined as a weighted factor that reflects the importance of link bandwidth attainability. Em is defined as the efficiency for solution m of a coordinated signal timing plan
(13)Em=∑iNωiαi,ωi=(VOBT,i+VIBT,i+1)∑i(VOBT,i+VIBT,i+1).
The best solution is the one that has the maximum efficiency Em. In this example,
(14)ω1=(VOBT,i+VIBT,i+1)∑i(VOBT,i+VIBT,i+1)=(820+492)(820+492)+(903+625)+(971+6483)=0.3055,ω2=0.3559,ω3=0.3386.
Table 7 shows five solutions of different phase sequences, based on the data in Tables 4, 5, and 6. The weighted factor of each link is calculated using through traffic volumes. As can be seen, solution 2 is the best solution, which has an efficiency of 0.9755. The number of solutions is dependent on the optimized result. Table 7 just shows five of the solutions.Table 7
Selected solutions of different phase sequences on Kietzke Lane (2nd Street → Plumb Lane).
m
1
2
3
4
5
I
i
β
i
α
i
β
i
α
i
β
i
α
i
β
i
α
i
β
i
α
i
1
2
1
3
0.92
3
0.92
3
0.92
1
0.75
2
3
0.86
2
1
2
1
2
1
3
0.86
3
3
0.63
2
1
4
0.85
1
0.84
3
0.63
4
3
—
3
—
3
—
3
—
3
—
E
m
—
0.8249
—
0.9755
—
0.9247
—
0.9214
—
0.7485


## 3.4. Calculation of Offset

The inbound through movement green time determines which intersection is the reference intersection for one link and how the relative offset of each intersection is calculated. According to the value of inbound through movement green time, there are four cases to calculate the offsets ofi, i+1, and i+2.Case 1.
ConsiderGIBT,i+1>GIBT,i and GIBT,i+2>GIBT,i+1; then
(15)Oi=0,Oi+1=Oi,i+1,Oi+2=Oi,i+1+Oi+1,i+2.Case 2.
ConsiderGIBT,i+1>GIBT,i and GIBT,i+2≤GIBT,i+1; then
(16)Oi=0,Oi+1=Oi,i+1,Oi+2=Oi,i+1-Oi+1,i+2+K*C,
where K is an integer. If Oi,i+1-Oi+1,i+2<0, then K=1 or else K=0.Case 3.
ConsiderGIBT,i+1≤GIBT,i and GIBT,i+2>GIBT,i+1; then
(17)Oi=Oi,i+1,Oi+1=0,Oi+2=Oi+1,i+2.Case 4.
ConsiderGIBT,i+1≤GIBT,i and GIBT,i+2≤GIBT,i+1; then
(18)Oi=Oi,i+1,Oi+1=0,Oi+2=C-Oi+1,i+2.
In Table 7, solution 2 is the best solution of phase sequences on this arterial. Using the algorithm of calculating the above offset, one can get the offset for each intersection.
(1) ConsiderGIBT,i+1<GIBT,i, GIBT,i+2>GIBT,i+1; then
(19)Oi=Oi,i+1=96,Oi+1=0,Oi+2=Oi+1,i+2=56.
(2) ConsiderGIBT,i+3<GIBT,i+2; then
(20)Oi+2=Oi+1,i+2=56,Oi+3=K*C+(Oi+1,i+2-Oi+2,i+3)=130+(56-81)=105.


## 4. Case Study

### 4.1. Site Description

A Windows program bandwidth optimization and time space diagram (BOTSD) was developed based on the proposed algorithm. Time-space diagrams can be produced by BOTSD with additional information to show the start and end of each phase. This information is useful for field implementation of signal timing plans, providing easiness of verifying that the current plan is running.Kietzke Lane, an arterial in Reno, NV, USA, is selected as a case study to check the performance of the proposed bandwidth optimization algorithm. There are eight intersections (E 2nd Street no. 1, Mill Street no. 2, Vassar Street no. 3, Plumb Lane no. 4, Grove Street no. 5, Gentry Way no. 6, Moana Lane no. 7, and Peckham Lane no. 8) on the Kietzke Lane selected in this study. The coordinated cycle length of this arterial is 130 seconds (16:00 pm–18:00 pm) and speed limit is 40 mph. Table8 shows lengths of phase split in the initial signal timing plan of Kietzke Lane. This plan is suitable for real traffic volumes of each isolated intersection, shown in Table 9, not fit for the whole arterial. Left-turn traffic volumes were much lower than through movement traffic volumes, so the optimal arterial progression bandwidth can enable more drivers pass through the arterial systems without stops. In this case study, based on this timing plan, we optimized phase sequences and offsets to obtain best solution of signal timing plan with optimal link bandwidth and arterial bandwidth.Table 8
Phase splits in the initial signal timing plan of Kietzke Lane (2nd Street → Peckham Lane).
INTID
SBL
NBT
WBL
EBT
NBL
SBT
EBL
WBT
Distance (ft)
1
18
51
20
41
20
49
30
31
2
20
45
25
40
29
36
25
40
2015
3
18
54
23
35
17
55
18
40
3294
4
22
48
18
42
20
50
22
38
2600
5
16
79
—
35
16
79
—
35
1841
6
15
80
—
35
18
77
—
—
2180
7
22
40
20
48
18
44
19
49
724
8
36
41
21
32
16
61
19
34
2168Table 9
Traffic volumes of every intersection in the Kietzke Lane from field data.
INTID
NBL
NBT
NBR
SBL
SBT
SBR
EBL
EBT
EBR
WBL
WBT
WBR
1
226
820
169
56
430
54
248
585
143
160
418
63
2
220
903
259
120
492
121
166
684
134
318
742
146
3
96
971
120
109
625
146
149
238
100
200
408
256
4
253
780
313
299
483
143
230
870
244
282
757
168
5
89
1193
72
6
800
148
113
71
70
128
98
30
6
119
1143
51
30
883
79
170
56
170
61
66
46
7
166
897
168
296
738
140
250
631
111
257
681
176
8
71
845
249
305
633
168
81
419
19
—
514
300
Total
1240
7552
1401
1221
5084
999
1407
3554
991
1406
3684
1185


### 4.2. Optimized Results Using Messer’s Algorithm

Figure6 shows time-space diagram of Kietzke Lane drawn by BOTSD, using Messer’s algorithm when southbound is the outbound direction. The outbound arterial bandwidth is 36 seconds and 14 seconds for the inbound. If northbound is selected as the outbound direction, then the second intersection is the master intersection, which has the minimum through movement green time. The outbound arterial bandwidth is 40 seconds and 13 seconds for the inbound. If a vehicle arrives at intersection no. 1 at the beginning of outbound through movement, it will stop and wait at intersection no. 1 and the offset of intersection no. 1 can be adjusted, as shown in Figure 6.Figure 6
TSD of signal timing plan with Messer’s algorithm.


### 4.3. Optimized Results Using the Proposed Algorithm

Southbound is the outbound direction. Figure7 shows time-space diagram for this arterial drawn by BOTSD using the new proposed method in southbound. The arterial outbound bandwidth is 30 seconds, and 28 seconds for the inbound. Arterial bandwidth efficiency is 22.31%, and bandwidth attainability is 75.32%, which means a fair progression according to the guidelines of bandwidth efficiency [1].Figure 7
TSD of signal timing plan with proposed algorithm.Using the same method of fine-tuning, we have got time-space diagrams with other travel speeds, which are less than the speed limit and same for every link. In this case study, the speed limit is 40 mph; we can use 38 mph, 35 mph, and 32 mph to design the signal timing plans with the proposed bandwidth optimization algorithm and get the TSD with maximum progression of arterial bandwidth and link bandwidth for comparison.


### 4.4. Fine-Tuning of Signal Timing Plan with Practical Travel Speed

#### 4.4.1. Travel Time Data Collection with GPS Tool

We have collected more than ten study runs of GPS data at the PM peak hours, using GPS receiver and GPS2LT [23]. Then, the actual travel time and speed can be obtained by the PC travel for Windows [24]. Based on the results of the actual travel time and speed for links shown in Figure 8, the actual travel speeds for most links are less than speed limit. Additionally, all the standard deviations of travel speed for ten runs are less than 3 mph.Average practical travel speeds for links.
(a)
Southbound
(b)
Northbound


#### 4.4.2. Analysis of Initial Signal Timing

Using the GPS and TS tool and the collected GPS data, we have drawn the GPS trajectory on the TSD for three types of study runs for PM peak hours (16:00 pm–18:00 pm). In Figure9, the arterial road progression bandwidth of southbound is 12 seconds and 29 seconds in northbound. The car can go through all the 8 intersections on the TSD with the speed of 40 mph in the southbound for just two of ten runs. However, on the northbound, the car must stop at least one time no matter when it entered the system.Figure 9
GPS trajectory on initial TSD on the speed of 40 mph.


#### 4.4.3. Signal Timing with Practical Speed

According to the results of fine-tuning of initial signal timing plan link by link, we have got the best solution of TSD for the arterial. The arterial progression bandwidth of southbound is 28 seconds, and 39 seconds in northbound. The bandwidth efficiency is 25.8%. Attainability of every link is more than 85% and three of them are equal to 100%, as shown in Figure10.Figure 10
TSD of signal timing plan with practical travel speed.


### 4.5. Comparison of Results

#### 4.5.1. MOE Results

Table10 shows the link bandwidth attainability and arterial bandwidth efficiency of eight intersections on Kietzke Lane with Messer’s algorithm and the proposed algorithm.Table 10
Attainability of link bandwidth on Kietzke Lane with two algorithms.
Link
1
2
3
4
5
6
7
Arterial MOE
Max link bandwidth (s)
72
81
98
98
134
84
84
Weighted factor of link
0.1155
0.1345
0.1280
0.1391
0.1827
0.1656
0.1347
Link bandwidth attainability
Algorithm
Outbound
α
1
α
2
α
3
α
4
α
5
α
6
α
7
E
m
E
b
A
c
Proposed
SB
0.89
1.00
1.00
1.00
1.00
1.00
0.99
0.9855
0.2231
0.7532
NB
0.89
1.00
1.00
1.00
1.00
1.00
0.99
0.9856
Messer
SB
0.81
0.94
0.96
0.94
0.84
0.99
0.77
0.8903
0.1923
0.6494
NB
0.89
0.99
0.85
0.97
0.83
0.99
0.73
0.8915
0.2038
0.6883According to arterial bandwidth efficiency and attainability in Figures9 and 10, and link bandwidth attainability in Table 10, the solution of coordinated signal timing plan from the proposed algorithm is much better than that from Messer’s algorithm whether the outbound direction is southbound or northbound. If a vehicle arrives at intersection no. 1 at the beginning of outbound through movement, it will stop and wait at intersection no. 1, the offset of intersection no. 1 can be adjusted, as shown in Figure 9. However, the time-space diagrams in Figure 10 have improved these problems.In the other way, simulation results from SYNCHRO show that the proposed algorithm is better than Messer’s algorithm. Total intersection control delay of 8 intersections with optimized signal timing plan with proposed algorithm is 266.2 s, less than that of Messer’s algorithm 288 s. Total Link delay in arterial direction with proposed algorithm is 401.3 s, less than that of Messer’s algorithm 445.2 s.Additionally, when the number of signals in a system increases, it becomes more difficult to obtain a good bandwidth solution using Messer’s algorithm. In some cases there is no valid solution with arterial bandwidth. However, the new proposed algorithm can be used to obtain an optimal solution of coordinated signal timing plan with both optimal link bandwidth and optimal arterial bandwidth.


#### 4.5.2. Simulation Results Comparison of Speed Limit and Practical Speed

The simulation model of this arterial is built up in VISSIM 5.30. Individual parameters in VISSIM 5.30 were adjusted and tuned with model calibration and validation. To reduce stochastic variation, ten random-seeded runs were conducted in VISSIM 5.30 for the case study. At the same time, the signal timing plan has been input into SYNCHRO 7.0 to get the control delay for the intersections and links on the arterial and check the traffic flow lines on the TSD. Average speed and delay per vehicle for the whole network, average delay and queue length for the nodes, and average delay for the links are the main simulation results, shown in Table11.Table 11
Performance index of signal timing plans with different speeds.
Type
Index
32
Practical speed
35
38
40 (speed limit)
Network performance
Average speed (mph)
18.01
19.12
17.95
17.9
17.69
Average delay (s)
57.25
53.2
57.91
58.29
61.83
Nodes
Total average delay (s)
210.7
190.6
209.1
213.2
221.4
Total average queue (ft)
519.8
505.1
527.6
532.8
548.2
Total intersection control delay
257.2
235.8
260.6
267.2
266.2
Links
Delay from VISSIM
378.7
350.6
370.3
382.1
392.7
Delay from SYNCHRO
378.3
364.3
382.6
397.6
401.3The results show that a rather significant improvement is achieved after the fine-tuning of signal timing plan with practical travel speed data is done.


## 4.1. Site Description

A Windows program bandwidth optimization and time space diagram (BOTSD) was developed based on the proposed algorithm. Time-space diagrams can be produced by BOTSD with additional information to show the start and end of each phase. This information is useful for field implementation of signal timing plans, providing easiness of verifying that the current plan is running.Kietzke Lane, an arterial in Reno, NV, USA, is selected as a case study to check the performance of the proposed bandwidth optimization algorithm. There are eight intersections (E 2nd Street no. 1, Mill Street no. 2, Vassar Street no. 3, Plumb Lane no. 4, Grove Street no. 5, Gentry Way no. 6, Moana Lane no. 7, and Peckham Lane no. 8) on the Kietzke Lane selected in this study. The coordinated cycle length of this arterial is 130 seconds (16:00 pm–18:00 pm) and speed limit is 40 mph. Table8 shows lengths of phase split in the initial signal timing plan of Kietzke Lane. This plan is suitable for real traffic volumes of each isolated intersection, shown in Table 9, not fit for the whole arterial. Left-turn traffic volumes were much lower than through movement traffic volumes, so the optimal arterial progression bandwidth can enable more drivers pass through the arterial systems without stops. In this case study, based on this timing plan, we optimized phase sequences and offsets to obtain best solution of signal timing plan with optimal link bandwidth and arterial bandwidth.Table 8
Phase splits in the initial signal timing plan of Kietzke Lane (2nd Street → Peckham Lane).
INTID
SBL
NBT
WBL
EBT
NBL
SBT
EBL
WBT
Distance (ft)
1
18
51
20
41
20
49
30
31
2
20
45
25
40
29
36
25
40
2015
3
18
54
23
35
17
55
18
40
3294
4
22
48
18
42
20
50
22
38
2600
5
16
79
—
35
16
79
—
35
1841
6
15
80
—
35
18
77
—
—
2180
7
22
40
20
48
18
44
19
49
724
8
36
41
21
32
16
61
19
34
2168Table 9
Traffic volumes of every intersection in the Kietzke Lane from field data.
INTID
NBL
NBT
NBR
SBL
SBT
SBR
EBL
EBT
EBR
WBL
WBT
WBR
1
226
820
169
56
430
54
248
585
143
160
418
63
2
220
903
259
120
492
121
166
684
134
318
742
146
3
96
971
120
109
625
146
149
238
100
200
408
256
4
253
780
313
299
483
143
230
870
244
282
757
168
5
89
1193
72
6
800
148
113
71
70
128
98
30
6
119
1143
51
30
883
79
170
56
170
61
66
46
7
166
897
168
296
738
140
250
631
111
257
681
176
8
71
845
249
305
633
168
81
419
19
—
514
300
Total
1240
7552
1401
1221
5084
999
1407
3554
991
1406
3684
1185


## 4.2. Optimized Results Using Messer’s Algorithm

Figure6 shows time-space diagram of Kietzke Lane drawn by BOTSD, using Messer’s algorithm when southbound is the outbound direction. The outbound arterial bandwidth is 36 seconds and 14 seconds for the inbound. If northbound is selected as the outbound direction, then the second intersection is the master intersection, which has the minimum through movement green time. The outbound arterial bandwidth is 40 seconds and 13 seconds for the inbound. If a vehicle arrives at intersection no. 1 at the beginning of outbound through movement, it will stop and wait at intersection no. 1 and the offset of intersection no. 1 can be adjusted, as shown in Figure 6.Figure 6
TSD of signal timing plan with Messer’s algorithm.


## 4.3. Optimized Results Using the Proposed Algorithm

Southbound is the outbound direction. Figure7 shows time-space diagram for this arterial drawn by BOTSD using the new proposed method in southbound. The arterial outbound bandwidth is 30 seconds, and 28 seconds for the inbound. Arterial bandwidth efficiency is 22.31%, and bandwidth attainability is 75.32%, which means a fair progression according to the guidelines of bandwidth efficiency [1].Figure 7
TSD of signal timing plan with proposed algorithm.Using the same method of fine-tuning, we have got time-space diagrams with other travel speeds, which are less than the speed limit and same for every link. In this case study, the speed limit is 40 mph; we can use 38 mph, 35 mph, and 32 mph to design the signal timing plans with the proposed bandwidth optimization algorithm and get the TSD with maximum progression of arterial bandwidth and link bandwidth for comparison.


## 4.4. Fine-Tuning of Signal Timing Plan with Practical Travel Speed

### 4.4.1. Travel Time Data Collection with GPS Tool

We have collected more than ten study runs of GPS data at the PM peak hours, using GPS receiver and GPS2LT [23]. Then, the actual travel time and speed can be obtained by the PC travel for Windows [24]. Based on the results of the actual travel time and speed for links shown in Figure 8, the actual travel speeds for most links are less than speed limit. Additionally, all the standard deviations of travel speed for ten runs are less than 3 mph.Average practical travel speeds for links.
(a)
Southbound
(b)
Northbound


### 4.4.2. Analysis of Initial Signal Timing

Using the GPS and TS tool and the collected GPS data, we have drawn the GPS trajectory on the TSD for three types of study runs for PM peak hours (16:00 pm–18:00 pm). In Figure9, the arterial road progression bandwidth of southbound is 12 seconds and 29 seconds in northbound. The car can go through all the 8 intersections on the TSD with the speed of 40 mph in the southbound for just two of ten runs. However, on the northbound, the car must stop at least one time no matter when it entered the system.Figure 9
GPS trajectory on initial TSD on the speed of 40 mph.


### 4.4.3. Signal Timing with Practical Speed

According to the results of fine-tuning of initial signal timing plan link by link, we have got the best solution of TSD for the arterial. The arterial progression bandwidth of southbound is 28 seconds, and 39 seconds in northbound. The bandwidth efficiency is 25.8%. Attainability of every link is more than 85% and three of them are equal to 100%, as shown in Figure10.Figure 10
TSD of signal timing plan with practical travel speed.


## 4.4.1. Travel Time Data Collection with GPS Tool

We have collected more than ten study runs of GPS data at the PM peak hours, using GPS receiver and GPS2LT [23]. Then, the actual travel time and speed can be obtained by the PC travel for Windows [24]. Based on the results of the actual travel time and speed for links shown in Figure 8, the actual travel speeds for most links are less than speed limit. Additionally, all the standard deviations of travel speed for ten runs are less than 3 mph.Average practical travel speeds for links.
(a)
Southbound
(b)
Northbound


## 4.4.2. Analysis of Initial Signal Timing

Using the GPS and TS tool and the collected GPS data, we have drawn the GPS trajectory on the TSD for three types of study runs for PM peak hours (16:00 pm–18:00 pm). In Figure9, the arterial road progression bandwidth of southbound is 12 seconds and 29 seconds in northbound. The car can go through all the 8 intersections on the TSD with the speed of 40 mph in the southbound for just two of ten runs. However, on the northbound, the car must stop at least one time no matter when it entered the system.Figure 9
GPS trajectory on initial TSD on the speed of 40 mph.


## 4.4.3. Signal Timing with Practical Speed

According to the results of fine-tuning of initial signal timing plan link by link, we have got the best solution of TSD for the arterial. The arterial progression bandwidth of southbound is 28 seconds, and 39 seconds in northbound. The bandwidth efficiency is 25.8%. Attainability of every link is more than 85% and three of them are equal to 100%, as shown in Figure10.Figure 10
TSD of signal timing plan with practical travel speed.


## 4.5. Comparison of Results

### 4.5.1. MOE Results

Table10 shows the link bandwidth attainability and arterial bandwidth efficiency of eight intersections on Kietzke Lane with Messer’s algorithm and the proposed algorithm.Table 10
Attainability of link bandwidth on Kietzke Lane with two algorithms.
Link
1
2
3
4
5
6
7
Arterial MOE
Max link bandwidth (s)
72
81
98
98
134
84
84
Weighted factor of link
0.1155
0.1345
0.1280
0.1391
0.1827
0.1656
0.1347
Link bandwidth attainability
Algorithm
Outbound
α
1
α
2
α
3
α
4
α
5
α
6
α
7
E
m
E
b
A
c
Proposed
SB
0.89
1.00
1.00
1.00
1.00
1.00
0.99
0.9855
0.2231
0.7532
NB
0.89
1.00
1.00
1.00
1.00
1.00
0.99
0.9856
Messer
SB
0.81
0.94
0.96
0.94
0.84
0.99
0.77
0.8903
0.1923
0.6494
NB
0.89
0.99
0.85
0.97
0.83
0.99
0.73
0.8915
0.2038
0.6883According to arterial bandwidth efficiency and attainability in Figures9 and 10, and link bandwidth attainability in Table 10, the solution of coordinated signal timing plan from the proposed algorithm is much better than that from Messer’s algorithm whether the outbound direction is southbound or northbound. If a vehicle arrives at intersection no. 1 at the beginning of outbound through movement, it will stop and wait at intersection no. 1, the offset of intersection no. 1 can be adjusted, as shown in Figure 9. However, the time-space diagrams in Figure 10 have improved these problems.In the other way, simulation results from SYNCHRO show that the proposed algorithm is better than Messer’s algorithm. Total intersection control delay of 8 intersections with optimized signal timing plan with proposed algorithm is 266.2 s, less than that of Messer’s algorithm 288 s. Total Link delay in arterial direction with proposed algorithm is 401.3 s, less than that of Messer’s algorithm 445.2 s.Additionally, when the number of signals in a system increases, it becomes more difficult to obtain a good bandwidth solution using Messer’s algorithm. In some cases there is no valid solution with arterial bandwidth. However, the new proposed algorithm can be used to obtain an optimal solution of coordinated signal timing plan with both optimal link bandwidth and optimal arterial bandwidth.


### 4.5.2. Simulation Results Comparison of Speed Limit and Practical Speed

The simulation model of this arterial is built up in VISSIM 5.30. Individual parameters in VISSIM 5.30 were adjusted and tuned with model calibration and validation. To reduce stochastic variation, ten random-seeded runs were conducted in VISSIM 5.30 for the case study. At the same time, the signal timing plan has been input into SYNCHRO 7.0 to get the control delay for the intersections and links on the arterial and check the traffic flow lines on the TSD. Average speed and delay per vehicle for the whole network, average delay and queue length for the nodes, and average delay for the links are the main simulation results, shown in Table11.Table 11
Performance index of signal timing plans with different speeds.
Type
Index
32
Practical speed
35
38
40 (speed limit)
Network performance
Average speed (mph)
18.01
19.12
17.95
17.9
17.69
Average delay (s)
57.25
53.2
57.91
58.29
61.83
Nodes
Total average delay (s)
210.7
190.6
209.1
213.2
221.4
Total average queue (ft)
519.8
505.1
527.6
532.8
548.2
Total intersection control delay
257.2
235.8
260.6
267.2
266.2
Links
Delay from VISSIM
378.7
350.6
370.3
382.1
392.7
Delay from SYNCHRO
378.3
364.3
382.6
397.6
401.3The results show that a rather significant improvement is achieved after the fine-tuning of signal timing plan with practical travel speed data is done.


## 4.5.1. MOE Results

Table10 shows the link bandwidth attainability and arterial bandwidth efficiency of eight intersections on Kietzke Lane with Messer’s algorithm and the proposed algorithm.Table 10
Attainability of link bandwidth on Kietzke Lane with two algorithms.
Link
1
2
3
4
5
6
7
Arterial MOE
Max link bandwidth (s)
72
81
98
98
134
84
84
Weighted factor of link
0.1155
0.1345
0.1280
0.1391
0.1827
0.1656
0.1347
Link bandwidth attainability
Algorithm
Outbound
α
1
α
2
α
3
α
4
α
5
α
6
α
7
E
m
E
b
A
c
Proposed
SB
0.89
1.00
1.00
1.00
1.00
1.00
0.99
0.9855
0.2231
0.7532
NB
0.89
1.00
1.00
1.00
1.00
1.00
0.99
0.9856
Messer
SB
0.81
0.94
0.96
0.94
0.84
0.99
0.77
0.8903
0.1923
0.6494
NB
0.89
0.99
0.85
0.97
0.83
0.99
0.73
0.8915
0.2038
0.6883According to arterial bandwidth efficiency and attainability in Figures9 and 10, and link bandwidth attainability in Table 10, the solution of coordinated signal timing plan from the proposed algorithm is much better than that from Messer’s algorithm whether the outbound direction is southbound or northbound. If a vehicle arrives at intersection no. 1 at the beginning of outbound through movement, it will stop and wait at intersection no. 1, the offset of intersection no. 1 can be adjusted, as shown in Figure 9. However, the time-space diagrams in Figure 10 have improved these problems.In the other way, simulation results from SYNCHRO show that the proposed algorithm is better than Messer’s algorithm. Total intersection control delay of 8 intersections with optimized signal timing plan with proposed algorithm is 266.2 s, less than that of Messer’s algorithm 288 s. Total Link delay in arterial direction with proposed algorithm is 401.3 s, less than that of Messer’s algorithm 445.2 s.Additionally, when the number of signals in a system increases, it becomes more difficult to obtain a good bandwidth solution using Messer’s algorithm. In some cases there is no valid solution with arterial bandwidth. However, the new proposed algorithm can be used to obtain an optimal solution of coordinated signal timing plan with both optimal link bandwidth and optimal arterial bandwidth.


## 4.5.2. Simulation Results Comparison of Speed Limit and Practical Speed

The simulation model of this arterial is built up in VISSIM 5.30. Individual parameters in VISSIM 5.30 were adjusted and tuned with model calibration and validation. To reduce stochastic variation, ten random-seeded runs were conducted in VISSIM 5.30 for the case study. At the same time, the signal timing plan has been input into SYNCHRO 7.0 to get the control delay for the intersections and links on the arterial and check the traffic flow lines on the TSD. Average speed and delay per vehicle for the whole network, average delay and queue length for the nodes, and average delay for the links are the main simulation results, shown in Table11.Table 11
Performance index of signal timing plans with different speeds.
Type
Index
32
Practical speed
35
38
40 (speed limit)
Network performance
Average speed (mph)
18.01
19.12
17.95
17.9
17.69
Average delay (s)
57.25
53.2
57.91
58.29
61.83
Nodes
Total average delay (s)
210.7
190.6
209.1
213.2
221.4
Total average queue (ft)
519.8
505.1
527.6
532.8
548.2
Total intersection control delay
257.2
235.8
260.6
267.2
266.2
Links
Delay from VISSIM
378.7
350.6
370.3
382.1
392.7
Delay from SYNCHRO
378.3
364.3
382.6
397.6
401.3The results show that a rather significant improvement is achieved after the fine-tuning of signal timing plan with practical travel speed data is done.


## 5. Conclusion

Bandwidth can be defined in terms of two consecutive intersections (link bandwidth) or in terms of an entire arterial (arterial bandwidth). In most previous studies, bandwidth is always referred to as arterial bandwidth. In practice, a balance between link bandwidth and arterial bandwidth has proven to be important in optimizing coordinated signal timing plans, because not all drivers need to pass through all the intersections on an arterial. This paper proposes an algorithm on how to obtain an optimal coordinated signal timing plan with both optimized link and arterial bandwidth. The proposed algorithm has two parts: link bandwidth optimization and arterial bandwidth optimization. Link bandwidth attainability is defined as an additional measure of effectiveness for assessing the optimized results. In the link bandwidth optimization, there are eight cases to calculate upper/lower interference and six cases to calculate offset between two consecutive intersections, based on the improvement of Messer’s research. The arterial bandwidth optimization has 3-fold processes, such as calculation of link bandwidth, selection of phase sequence, and calculation of offset, generally link by link. Weighted means of link bandwidth attainability is defined as another measure of effectiveness for selecting the best solution of different phase sequences. The results in the case study show that the proposed algorithm can be used to get a much better signal timing plan than that from Messer’s algorithm. Additionally when the number of signals in a system increases, it becomes more difficult to obtain a good bandwidth solution with Messer’s algorithm. There is no valid solution of arterial bandwidth using Messer’s algorithm when the number of signals is very high. However, the proposed algorithm of this paper can be used to obtain an optimal coordinated signal timing plan with both optimal link bandwidth and arterial bandwidth. Fine-tuning of initial signal timing plan is done to improve link and arterial progression bandwidth using practical travel speed compared to speed limit. The evaluation results show that a rather significant improvement is achieved. In future, we will continue our research on optimizing coordinated signal timing plans under the consideration of the traffic volumes of left-turns and earlier release of left-turn phase.



---

*Source: 197313-2013-11-14.xml*