ONLINE OFFSET OPTIMISATION IN URBAN NETWORKS BASED ON CELL TRANSMISSION MODEL

ONLINE OFFSET OPTIMISATION IN URBAN NETWORKS BASED ON CELL TRANSMISSION MODEL Essam Almasri, Bernhard Friedrich Ph.D. Student, Professor Institute of Transport, Road Engineering and Planning University of Hannover, Appelstr. 9A, 3067 Hannover, Germany E-mail: almasri@ivh.uni-hannover.de, friedrich@ivh.uni-hannover.de SUMMARY This study presents a heuristic approach for online offset optimisation in road networs. Traffic flow is modelled using the cell-transmission model (CTM), which is a discrete approximation to the hydrodynamic model of traffic flow. The optimisation employs a Genetic Algorithm (GA) and is applied to a two-way urban road with 3 signalized intersection and to a realistic small networ with 6 signalized intersections. This paper presents the theoretical formulation of the traffic model and the optimisation algorithm, shows up figures on performance measures in terms of travel time savings, and addresses computational issues lie CPU-time. INTRODUCTION Adaptive online traffic control in urban road networs requires information on the present and future traffic state. This information needs to be as complete and precise as possible. For this reason advanced control methods involve respective traffic models in order to complement local measurements and to derive criteria on the traffic state that cannot be measured. As criterion to be optimised most models calculate either the queue length (e.g. (5), (6), (8), and (9) ) or the number of vehicles per lin (e.g. (4) ). It is therefore the precise determination and short term forecast of the mentioned criteria which is a crucial prerequisite for any adaptive control strategy. For optimisation purposes in online traffic control methods either equilibrium queuing models or discrete models can be employed. Whereas equilibrium models can only be applied for macroscopic adaptation of split and cycle time at single intersections, discrete models also allow for microscopic adaptation and in particular for offset optimisation. However, the employment of models, discrete in time and space, is constrained by the run-time requirements of the solution of the NP-hard optimisation problem. In this context, the interaction of suitable heuristic optimisation algorithms and simple discrete queuing models is of particular interest. Given this context, the objective of the research presented in this paper is to investigate on the one hand the performance of the Cell Transmission Model (CTM) ((3) and (4)) compared to well nown continuous queuing model, e.g. () and (0), and on the other hand to prove the applicability of the CTM for online control purposes. ITS HANNOVER 2005

THE CELL TRANSMISSION MODEL As discretised version of the macroscopic modelling approach, the CTM has been developed by (2) and (3). The CTM provides a convergent approximation to the LWR model (() and (2)) and can be used to predict transient phenomena such as the build-up, propagation and dissipation of queues. The CTM employs a simplified version of fundamental diagram usually based on a trapezium form (see Figure ) assuming that a free-flow speed v f at low densities and a bacward wave speed -w for high densities are constant. Flow q q max q v f -w v Figure : The Flow Density Relationship for the CTM The following 5 sections, which are considered as the basis of CTM, summarize the essential results of Daganzo s wor. After that the determination of delay and then new model considerations are explained. Networ model and topologies. Density In the CTM, the roads of the networ are formed by the formation of successive sections or cells. The CTM uses the common modelling of traffic networs by directed graphs with nodes and lins. In the system, the cells are described as the nodes {I} and the possible vehicle transfers by a set of lins {}. To define the topology of the networ, a beginning (upstream) and an ending (downstream) cell for each lin is specified. The prefixes B and E are added to the lin label, so that the beginning and ending cells of lin become BK and EK respectively. CTM limits the number of lins connecting a cell to three. This results in the following three types of connections: The simple or normal connection shown in Figure 2a, where one lin enters a cell and one leaves it. The diverge connection shown in Figure 2b, where one normal lin enters a cell and two lins diverge from it. The merge connection shown in Figure 2c, where two lins merge to a cell and one normal lin leaves it. K jam ITS HANNOVER 2005 2

a) normal c C C c b) diverge c) merge Figure 2: Modelling of normal, diverge, and merge lins Traffic flow on normal lin Discretising the road into homogeneous sections (or cells) and time into intervals of duration T such that the cell length L is equal to the distance travelled by free-flowing traffic in one time interval, the LWR results are approximated by a set of recursive equations: n ' ' ( t + ) = n ( t + ) q ; n ( t + ) = n ( t + ) + q [] { n,min[ Q, Q ],( w/ v )( N n ( ))} q = min t [2] The variables n(t), N(t), q(t), and Q(t) denote the actual number of vehicles (occupancy), the maximum number of vehicles (or holding capacity), the actual inflow, and the inflow capacity that can be present in cell B or E at time t, respectively. With equation [2], the entire range of traffic densities described in Figure of the simplified fundamental diagram is considered in the calculation of traffic flow. Based on the value of traffic density, three cases of traffic conditions are considered: The first case occurs when the density is low (free flow condition), all vehicles can travel from cell BK to cell EK at time t. The second case occurs when the traffic demand becomes high resulting in increasing of density, then the traffic flow is limited by the smaller value of the capacities Q BK (t) or Q EK (t). The third case occurs when the density of the downstream cell is high, then not all of vehicles can travel from cell BK to cell EK. At this condition, the traffic flow is limited with the free space available (N (t)-n (t)) in the downstream cell EK. Equation [2] can be simplified by the following two equations: S BK = min{ QBK, nbk } and REK min{ QEK( t),( w/ vf )( NEK( t) nek( t)) } { S, R ( )} f = [3] q = min t [4] where the actual flow on lin q (t) is the minimum of sending S BK (t) and receiving S BK (t). ITS HANNOVER 2005 3

After the flows have been determined for each cell for a specified time step, the occupancies can be easily updated with the conservation equation [] by taing the lin flows away from the beginning cells and adding them to the ending cells. The occupancies, n`(t+), are intermediate variables introduced; they can be eliminated during computer operation. Traffic flow on diverge lins In Figure 2b, cell BK is the start of diverge to either cell EK or cell CK. The maximum number of vehicles S(t) that can be send from cell BK and the maximum number of vehicles (R(t) and RC(t) ) that can be received by cells EK and CK respectively are determined using equation [3]. The proportions of vehicles β and β C leaving cell BK are assumed to be constant, where β + β C =. Since part of flow leaving cell BK is diverging to cell CK and part to cell EK, all flow is impeded if either one of the diverging lins is unable to accommodate its share of flow in order to maintain first-in-first-out queuing regime. This means that vehicles unable to exit will prevent all those behind, regardless of destination, to move. Considering these conditions, the flow that exits from BK can be determined by the following equation: q { S, R / β, R / β } = min [5] The flows on both diverging lins can be determined as follows: q = β q und qc t) = β Cq Traffic flow on merge lins C C ( [6] As shown in Figure 2c, cells B and C are the start of a merge to cell E. S BK and S CK are the outflows (Sending) that can be send from cells B and C respectively. R is the inflow (Receiving) ability of cell E. Depending on whether the receiving of BK is less or more than the sending of CK and EK, three cases must be distinguished to be able to build the equations for the flows on the two lins: Case : If the receiving R E is more than the sending of the two cells S B + S C, then the actual outflows are determined as follows: for R S + SC : q = S und q C = SC [7] Case 2: If the receiving is less than the sending of the two cells, then the actual outflows are determined as follows: for S > R p SC > R pc : q = p R and q C = pc R [8] The constant p is the proportion of vehicles comes from BK and the remainder p c from C, wher p +p c =, and p /p c = q /q c. These constants are the characteristics of merge junctions that describe any priority. Case 3: If the sending of one of two cells is limited by the receiving, then the actual outflows are determined as follows: for S < R p SC > R pc : q = S and qc = R S [9] for S < > R p SC R pc : q t) = R SC ( and q C = SC [0] For the cases 2 and 3, (3) has proved that on lins and c can be determined by following simple equations: ITS HANNOVER 2005 4

for R < S + S : [] C { S, R SC p R } { S, R S p R } q = mid, q C = mid C, C Traffic signal control The established characteristic quantities (Q, N, S, R, ß, p) were accepted as constant values till now, however, they also can be time variant. For example, a time variant capacity Q (t) can be used to model inflow controls. Traffic signal control can be shown by the restriction of the capacity in the controlling cells of the road junction or by the restriction of a time variant p(t). In this case p taes the value 0 or, depended whether the signal group is closed or released. The traffic flow equation is then for p = 0 : q = 0 [2] for = p : q t) min{ S, R } ( = [3] With the time and place discrete representation of the traffic signal control, one can quantify the effect of the variation of all control variables (cycle time, split, green time and offset). Delay Estimation In the flow density diagram shown in Figure, the slope of the line drawn from the origin represents the actual speed v I (t) in cell I at time t which is equal to the outflow divided by the density as follows: q vi = [4] I where: ni I = [5] L For simplicity, the relationship between the delay of one vehicle in cell I at time t and the actual speed v I (t) is assumed to be linear as shown in Figure 3: Delay d I (t) T Speed v I (t) Figure 3: The simplified delay-speed relationship v f ITS HANNOVER 2005 5

Based on this relationship, delay ranges from 0 when the actual speed is equal to v f to the duration of T (time step) when the vehicles are not moving. This delay times the number of vehicles n I (t) determines the total delay of all vehicles in cell I at time t: T di = T vi ni [6] v f where: L v f = [7] T By substituting equations [4], [5], and [7] in equation [6], the following equation results: [ n q ( t T ] di = T I ) [8] Once delay has been determined at the cell level, the total delay D lin can easily be estimated at the lin level by summing up all delays in all cells during the cycle time as follows: lin = t lin D d [9] I I COMPARISON BETWEEN CTM AND WELL KNOWN QUEUING MODEL To evaluate the delay estimation based on the CTM, a virtual environment was prepared by means of microscopic simulation (AIMSUN2) and was used as reference measurements of total delay in each cycle time. By different scenarios of traffic demand, tests and comparisons to well-nown models ( i.e () and (0) ) were performed. In defined intervals of 5 seconds for the CTM and 90 seconds (= cycle time) for the other models, the flow was counted by the detector. The total cyclic delay determined by the simulation, which was supposed to be the real one, was used for evaluation. The simulation time is at least hour in all the scenarios. An example of graphical presentation for one scenario is presented in Figure 4 which shows the comparison of the total vehicular delays (veh.s/90s) for different delay estimation models and the corresponding degree of saturation (x). It is shown from Figure 4 that, Kimber-Hollis (KH) for estimating the total delay give good results for relatively low degree of saturation, however when the degree of saturation increases the method overestimates the reference value. This problem is not seen in CTM. In contrast, Aceli s method gives good results for relatively low degree of saturation, however when the degree of saturation increases the method underestimates the reference value. This problem is also not seen in CTM. ITS HANNOVER 2005 6

Total delay [veh.s/90s] 8000 7000 6000 5000 4000 3000 2000 000 0 3 5 7 Real Kimber-Hollis Aceli CTM x 9 3 5 7 9 2 23 25 27 29 3 33 35 37 39 4 43 45 47 49.6.4.2 0.8 0.6 0.4 0.2 0 x - degree of saturation [-] intervals (90 s) Figure 4: An example of the comparison of the total vehicular cyclic delay for the different queuing models. ALGORITHMS FOR OFFSET OPTIMISATION As objective for the optimization, the minimisation of the total networ delay was chosen: f = min d j [20] t j where f is the sum of delays in all the cells throughout the planning horizon. The objective is to select the offset values for all intersections such that f is minimized. This minimization is subject to the constraint of the dynamic traffic demand. When one has fixed phase sequences, cycle times and green times for n signalized intersections in a road networ, then one can have a number of ct (n-) combinations (ct is the duration of the cycle time) for the solution space of offsets optimization. For small networ, the optimal solution can be determined exactly with an already high computation time by complete enumeration. For larger networs and particularly for online use, this is no longer possible because of the required CPU time. Since the objective function has an irregular shape in the solution space and therefore the classical search methods cannot be employed, two heuristic approaches based on genetic algorithm (GA) will be used (7). In the two approaches, each decision variable (offset) is coded as a seven-bit binary string (chromosome), allowing for a total of 28 (2 7 ) distinctive values. For offset optimization, offset values are typically defined in the unit of seconds and are not higher than 20 s (cycle time). Therefore, seven-bit binary strings are sufficient for practical applications. ITS HANNOVER 2005 7

The two methods used are different in the choice of the search direction. In the first approach, which is called here parallel genetic algorithm (PGA), a simultaneous search over all offset times by the process of variation of reproduction crossover mutation of the entire chromosome is performed. A convergence criterion or the computing time available ends the search. In the second approach, which is called serial genetic algorithm (SGA), only one offset value and therefore only a part of the chromosome is varied until the best solution is found. In the next step, the offset the next intersection is optimized. In such serial search, the order of treating the intersection and searching the offset has a great influence on the optimization results. For the following application examples, the search order has been fixed based on engineering practical experiences. For a further use of the SGA, a method should be found for the determination of the search order. PERFORMANCE ANALYSIS IN LABORATORY TESTS For laboratory test, the CTM was converted prototypically in a C++ program. The simulation system AIMSUN2 serves as a virtual test environment, in which under constant boundary conditions, the delays can be estimated quantitatively depending on the offset times at signals. With this test environment, a hypothetical two-way arterial with three junctions as well as a small real road networ with six road junctions were built. The considered time horizon is 900 s. This duration is considered for both the optimization by the CTM and the performance analysis in AIMSUN2.The traffic demand during this time period is assumed to be constant. The time is subdivided into discrete intervals of s in the CTM, whereby in connection with the free flow speed, the length of the cells was also fixed. As a comparison criterion for the quality of the optimization, the range of performance is traced out on one hand with a randomly selected set of offset values and on the other hand with an optimal set of offset determined by full enumeration. In addition, the offset values determined without using a computer program by the dominance method, see (3), are investigated, which is a nown method for engineering practice. The reference offset values determined by the mention methods are compared with the values which were obtained by the optimization based on PGA and SGA. Offset optimization in a hypothetical two-way arterial Figure 5 shows the CTM representation of the hypothetical two-way arterial with the required cells and lins. The three signalized intersections have a common cycle time of 70 s, each intersection in the main direction has a 20 s green time and the inter-green time is 5 s. For the simulation of this networ using the CTM with a time horizon of 90 s, one needs 400 ms on a PC (Athlon- GHz). For the optimization with the PGA, 25 generations were chosen with a population of 0 chromosomes, while with the SGA, 8 generations were chosen for each sequence with a population of 5 chromosomes. ITS HANNOVER 2005 8

22 53 54 22 84 58 8 83 63 59 7 82 80 64 60 6 20 86 85 8 79 78 74 77 73 76 72 75 7 70 67 65 6 66 62 52 5 50 49 48 47 46 45 22 2 5 9 4 3 2 0 09 08 07 06 22 02 0 3 4 5 6 90 89 88 87 8 82 83 84 2 22 8 9 0 2 3 22 34 35 36 37 38 49 22 73 74 75 76 77 78 79 80 99 00 26 30 39 40 4 42 94 98 25 29 43 45 93 97 24 28 44 46 92 96 23 27 47 9 95 22 48 90 22 22 8 86 7 85 Figure 5: CTM representation of the fictitious two-way arterial Table summarizes the results of optimization of the offsets based on different algorithms. It can clearly be seen from the results that there is a significant potential for optimization of 40% between the worst and the best solution. With both PGA and SGA the best solution could be found, whereas the SGA could reduce the CPU-time from 00 s to 20 s. With the dominance method one can obtain reasonable results, however, the absolute optimum could not be found. Method Exact optimum by full enumeration Random bad coordination Dominance method PGA SGA Offsets at intersections 2 3 Total delay Veh.s Relative changes % CPU time 0 37 4872 0.0% 5 min 0 58 46 20878 40% 5 min 0 8 40 6445 0.6% s 0 37 4872 0.0% 00s 0 37 4872 0.0% 30s Table : summary of results of performance analysis for the fictitious two-way arterial Offset optimization in a small road networ Figure 6 shows the CTM representation of a small networ that is a part of List district in Hannover city. The 6 signalized intersections of the networ have a common cycle time of 90s. For the simulation of this networ using the CTM with a time horizon of 900s, one needs 700ms on a PC (Athlon- GHz). For the optimization with the PGA, 20 generations were chosen with a population of 50 chromosomes, while with the SGA, 0 generations were chosen for each sequence with a population of 5 chromosomes. ITS HANNOVER 2005 9

2 K2 K4 K6 0 3 4 5 0 6 7 2 20 8 3 8 7 9 9 4 5 6 K K3 K5 0 0 Figure 6: CTM representation of the grid networ Table 2 summarizes the results of the offset optimization with the different methods. The results show that for the real networ, there is a potential for improvement of about 20% less delay than the existing coordination plan. With both the PGA and the SGA, a solution close to the absolute optimum could be found. Intersection 2 3 4 5 6 Total delay Veh.s % increase CPU time Existing Plan 0 7 0 3 83 86 4924.3 20.9% Worst plan 40 0 70 0 40 80 90704.5 22.9% Enumeration Algorithm 87 82 4 0 48 88 40695.9 0.0% 24 hr GA 0 8 8 0 33 2 4280.6 3.6% 700 s SGA 87 84 9 0 40 0 49.6.2% 75 s Table 2: Summary of results of performance analysis for the realistic networ Because of the low interdependencies within the chosen networ, the SGA performs as well as the PGA. However, it is assumed that with increasing multiple dependencies of the offsets lie in the case of larger grid networ, this will not be true. The duration of the optimization is influenced by the simulation time, which increases linearly with the networ size, and by the complexity of the optimization problem, which increase exponentially. The results with regard to the required CPU time mae clear that the limits of online adaptation are already reached for the comparatively small test networ. ITS HANNOVER 2005 0

CONCLUSION Offset optimization in networs represents a special difficulty since the discrete variables can not be represented lie the cycle time or the green time in the form of the relationship values and therefore cannot be modelled by efficient means of queuing theory. For the assessment of the single solutions in the optimization process, one needs the time and space discrete traffic flow models which must obtain very short calculation time because of the complexity of the optimization tas. For this purpose, the cell transmission model (CTM) provides a new approach with minimal computing time requirements, which in connection with heuristic optimization algorithms is presented in this paper. The nown model equations are introduced and extended by a formulation of the vehicular delay. It is shown in empirical examinations that the real flow of traffic and the performance criteria lie delay and queue lengths can be well simulated with the CTM. As optimization algorithms, two approaches are introduced on the basis of genetic algorithms. Besides the nown approach, which encodes all variable values in a chromosome and modifies the values in parallel, a serial procedure was introduced which optimizes variable by variable successively. This serial genetic algorithm is a first attempt to reduce the required optimization time, however, it requires further considerations for the determination of the order. The potential of the introduced optimization methods was checed with a short hypothetical two-way arterial as well as with a small real networ. It could clearly be shown that delay savings are obtainable, whereby the calculation speed on normal PCs permits an online use for small networs. ACKNOWLEDGEMENTS The software for this wor used the C++ GAlib (genetic algorithm library), written by Matthew Wall at the Massachusetts Institute of Technology. REFERENCES. Aceli, R. (980): Time-Dependent Expressions for Delay, Stop Rate and Queue Length and Traffic Signals, Australian Road Research Board, Internal Report, AIR 367-. 2. Daganzo, C. (994): The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theory, Transportation research B 28 (4), 269-287. 3. Daganzo, C. (995): The cell transmission model, Part II: Networ traffic, Transportation Research B 29 (2), 79-93. 4. Diaai, C., (999): Integrated Control of Traffic Flow in Corridor Networs, PhD Thesis, Technical University of Crete, Department of Production Engineering and Management, Chania. ITS HANNOVER 2005

5. Donati, F.; Mauro, V., Roncolini, G. and Vallauri, M. (984): A Hierarchical Decentralized Traffic Light Control System, The First Realisation: Progetto Torino. In: IFAC 9th World Congress, Vol II, G/A-. 6. Friedrich, B. and Keller, H. (994): BALANCE - A Method for Integrated Traffic Adaptive and Vehicle Actuated Signal Control, In: Proc. of the 7th IFAC Symposium, August 24-26, 994, Tianjin China. 7. Goldsberg, D. E. (989): Genetic algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Publiching Company, INC.. 8. Henry, J. J., Farges, J. L. and Tufal, J. (983): The PRODYN real time traffic algorithm, In: Proc. of the IFAC Symposium, Baden-Baden. 9. Hunt, P. B., Robertson, D. I., Bretherton, R. D. and Winton, R. I. (98): SCOOT - a traffic responsive method of coordinating signals, TRRL Laboratory Report 04. 0. Kimber, R. M. and Hollis, E. M. (979): Traffic queues and delays at road junctions, TRRL Laboratory Report 909.. Lighthill, m.j. and Whitham, j.b. (955): On inematic waves. I. Flow movement in long rivers. II. A theory of traffic flow on long crowded road, Proceedings of Royal Society,A229, 28-345. 2. Richards, P.I. (956): Shocwaves on the highway, Operations Research B 22, 8-0. 3. Schnabel, W. (98): Verehrstechnische Berechnung von lichtsignalgesteuerten Straßennetzen, Forschungsbericht, Zentrales Forschungsinstitut des Verehrswesen der DDR, Berlin. ITS HANNOVER 2005 2