Validation of traffic models using PTV VISSIM 7

Size: px
Start display at page:

Download "Validation of traffic models using PTV VISSIM 7"

Transcription

1 Department of Mechanical Engineering Manufacturing Networks Research Group Validation of traffic models using PTV VISSIM 7 J.H.T. Hendriks Supervisors: Dr.ir. A.A.J. Lefeber Ir. S.T.G. Fleuren Eindhoven, April 2015

2 Table of contents Terminology 2 1 Introduction 3 2 Overview of literature Webster s equation Miller s equation Van den Broek s equation Other equations VISSIM Settings VISSIM s limits Simulation results Inter-arrival time Departure rate for different directions Diffusion over long distances Conclusion 16 6 Recommendations 17 References 18 TU/e 1

3 Terminology In this section we explain the used terminology for this report: Fixed-time traffic signal Intersection Queue length Mean waiting time Arrival rate Maximum arrival rate Inter-arrival time Departure rate Maximum departure rate Cycle time Effective green-time Effective red-time Traffic lights cycling in a fixed sequence of red and green lights. Junction with a fixed-time traffic-signal. Amount of cars waiting at an intersection. Average time E[D] a vehicle has to wait at an intersection in [s]. The average rate λ Arrival rate of vehicles at an intersection in [cars/s]. Maximum possible arrival rate in [cars/h] for the set speed-limit. Time between the arrival of two successive cars in a simulation in [s]. Departure rate µ of vehicles at an intersection in [cars/s]. The average rate with which traffic departs when the maximum queue is non-empty. Cycle time c of a traffic signal in [s]. In one cycle, all traffic lights of an intersection have been green at least once. Effective green time g of a traffic signal in [s], the time whereby vehicles are allowed to leave the queue. The time whereby vehicles are not allowed to leave the queue in [s]. Could also be expressed as c g. TU/e 2

4 1 Introduction Road transportation has always been an important method of travel. Over the last century, mobility has grown rapidly with a increasing demand for a higher travel distance. The need to travel longer distances also caused an increasing amount of road traffic over the years [1]. However, this increase in traffic also caused an increase of unwanted traffic congestions, which have a large negative impact on the average travel speed. To keep congestions at intersections at a minimum, one has to make thoughtful decisions on the scheduling of traffic lights: how long should the traffic lights stay green and how long should they be red, so that the amount of waiting vehicles stays at a minimum. The main goal of this report is to validate if an M/D/1-system is a reasonable assumption for traffic intersections, since traffic models are often based on this system. The validation is done using the traffic simulator PTV VISSIM 7. VISSIM is a microscopic traffic simulator, meaning that it simulates each vehicle individually. With VISSIM, it is possible to determine the distribution of the arrival rate λ and the departure rate µ of the road or intersection. Furthermore, one could also determine the diffusion and queues in a network of intersections or over longer distances using this simulator. VISSIM s settings and properties are based on real measurements performed in Germany [2]. Before we go to the simulations, we first look for existing formulas for the mean waiting time which are based on an M/D/1-system. This is done in Section 2. These formulas depend on the arrival rate λ, departure rate µ and the amount of red and green time of the traffic lights. To keep the simulations reliable and reproducible, we discuss all relevant settings, assumptions and the functionality of VISSIM in Section 3. After that, we move to the simulation results in Section 4. The simulations measure the distribution of the arrival rate and the departure rate, so that the assumption of an M/D/1-system in traffic is validated. Furthermore, the diffusion and congestions over longer distances is analysed. The analysing is done by simulating the effect of long distances on the mean time between each car and the mean distance between each car. Since a lot of literature about traffic models are based on an M/D/1-system, it is important to validate this via simulations, which is the main contribution of this report. So this report determines whether the arrival rate at a single intersection is exponential or not. It also determines the different possible departure rates at an intersection, using a maximum enter arrival rate and different speed limits due to the curves in the road. Furthermore, this report determines the diffusion over long distances. Thus the report also looks at the effect of so-called ghost traffic jams, traffic jams that appear due to sudden braking and speed differences. TU/e 3

5 2 Overview of literature Since the goal of this report is to validate whether an M/D/1-system is a reasonable assumption for traffic intersections, we first need to look at already published approximations for the mean waiting time at a traffic light. These approximations are a function of: ˆ λ = arrival rate in [cars/s] ˆ µ = departure rate in [cars/s] ˆ c = cycle time in [s] ˆ g = effective green time in [s] ˆ ρ = λ µ These terms are explained in more detail in the Terminology section. In this section we look at three different approximation formulas of Webster [3], Miller [3] and van den Broek [4]. After that, the assumptions on which these approaches are based are validated in Section 4. The choice of Webster s and Miller s formulas is based on the common use of these approximations in the past. These formulas are one of the earliest approximations about the mean waiting time at an intersection using an M/D/1-system, with Miller s paper only five years older than Webster s. Van den broek s formula is one of the fairly recent approximations. 2.1 Webster s equation The first equation is the oldest of the three equations, dating from Webster s approximation of the mean waiting time is [5]: E[D] = (c g)2 2c(1 ρ) + ρc 2 2g(µg λc) 0.65( c λ 2 )2 ( λc µg )2+5g/c. (2.1) This equation is based on an M/D/1-model and is compared with observations of London traffic. While the first two terms are determined theorically, the third term is a correction term based on simulation results [6]. 2.2 Miller s equation The second equation is from Miller [3]. We formulate this equation as was done in [6] and [4]: E[D] = c g 2c(1 ρ) + [(c g) + E[XBR ] + 1 λ µ (1 + 1 )], (2.2) 1 ρ where E[X BR ] is the number of waiting vehicles at the beginning of effective red time of the traffic signal, where E[X BR ] equals E[X BR ] = exp[ 1.33 µg(1 ρ )/ρ ] 2(1 ρ, (2.3) ) TU/e 4

6 where ρ = λc µg. (2.4) Equation (2.2) is based on results observed on several junctions in Birmingham. 2.3 Van den Broek s equation The last equation is from Van den Broek [6]: E[D] = l λ + (c g)2 2c(1 ρ) + (ρ ) 4 c g 2(1 ρ)(µg λc), (2.5) where l is the amount of vehicles that remain after the traffic signal goes from green to red light. l is given by: l = ρ + ρ 2(1 ρ). (2.6) Note that the third term of Equation Equation (2.5) is similar to the first term of Webster s equation, which is based on a theoretical consideration for a deterministic arrival rate, whereby the second term compensates for the stochastic behaviour of the arrival rate. This however, is noted differently in (2.5), setting different equations for E[X BR ] and a seperate term for a starting queue after green time. Van den Broek also states that (2.5) yields more accurate results than the approximations of Webster and Miller. 2.4 Other equations There are several more approximations regarding the mean waiting time at an intersection. While we won t name them all in this section, we name a few of them as example: Clayton [7] is one of the oldest approximations, even older than Webster s. However, the pattern of the arrival rate in Clayton s model differs from the other formulas. Rendering it unusable for an M/D/1-system. Winsten [8] used a binomial distribution for the arrival rate. The approximation of Winsten is slightly more accurate to practice when compared to Clayton s, but it is still not as accurate as the formulas of Webster, Newell [3] and van den Broek. Newell [9] developed the formula two years after Miller. However, since Miller s approximation yields better results and was used by van den Broek [6], we chose Miller s over Newell s formula. Akçelik [10] created an approximation that is also useful for overflowing queue lengths, since the formulas of Webster and Miller only assume steady-state conditions. Meaning that Akçelik s formula also takes the possibility of oversaturation into account. Now that the formulas about traffic queues in an M/D/1-system are discussed, we can validate the distribution of the arrival rate and the departure rate in these approximations using VISSIM. In the next section we discuss the relevant settings and functionalities of VISSIM. TU/e 5

7 3 VISSIM In the previous section we discussed relevant approximations for the mean waiting time at an intersection with traffic signals. Before we go to the simulations, we need to discuss all relevant settings, assumptions and the functionality of the simulation program, so that the simulations are reliable and reproducable. For the simulations we use PTV VISSIM 7, which is a microscopic traffic simulator developed by PTV Planung Transport Verkehr AG [2]. Furthermore, during the simulations VISSIM appears to have some limitations and uncertainties which are discussed at the end of this section. Once all relevant settings and limitations are known, we can validate the distribution of the arrival rate and the departure rate of the formulas of Section 2, which is done in the next section. 3.1 Settings The first relevant setting we discuss is the way how traffic density is defined. There are two different settings for the volume type of the vehicle input: exact and stochastic. For exact, the specified traffic volume will be reached exactly by the end of the simulation, though the inter-arrival time remains stochastic. For the other setting, stochastic fluctuations of the specified traffic volume may occur. The expectation is that the inter-arrival time has an exponential distribution. This is validated in Section 4.1 for both exact and stochastic. The default curves of the acceleration and deceleration of the vehicles are based on [11]. This traffic flow model is based on measurements in Germany in 1974 and assumes four different driving states: ˆ Free driving: Speed oscillates around the desired speed while there is no influence of other traffic. ˆ Approaching: Adapting its speed to the lower speed of the preceding vehicle, until it reaches its desired safety distance. ˆ Following: The difference in speed between its preceding car oscillates around zero. ˆ Braking: Medium to high deceleration if the safety distance becomes violated. All simulations are done with these default acceleration and deceleration settings, unless specified otherwise. Furthermore, all cars have a desired speed between 48 and 58 km/h, so in all simulations the roads are assumed to be areas with a maximum speed of 50 km/h. The desired speed is uniformly distributed over all vehicles in all simulations, unless specified otherwise. So in the end the average speed is 53 km/h. VISSIM assumes that vehicles tend to exceed the speed limit very slightly. Other relevant settings that are used for the simulations: ˆ Only cars are used during the simulation. Effects of busses, trucks and other type of vehicles are neglected. ˆ The vehicle inputs of all simulations are run on exact, unless specified otherwise. ˆ All simulations have been carried out 30 times, with each simulation having a simulation time of 600s, which is the maximum allowed simulation time for the student version of VISSIM. ˆ The step time of all simulations is 0.1s, meaning that VISSIM calculates the new situation for all cars every 0.1s. TU/e 6

8 3.2 VISSIM s limits Although PTV VISSIM 7 has a wide variety of options, there are some limits in terms of accuracy. One of the inaccuraties of VISSIM is the distribution of the inter-arrival time. While the time step of VISSIM is 0.1s, the vehicle inputs of VISSIM have a step time of roughly 0.5s. Due to this, it is necessary to round off all collected data times to 0.5s. This issue is discussed in more detail in Section 4.1. For followup simulations, one should keep in mind that VISSIM is not capable of spawning vehicles with the exact same speed, if wanted. VISSIM is only capable to spawn vehicles within a specified speed distribution. It is possible to set the spawning speed difference very low. The lowest speed difference possible is 0.01 m/s. Furthermore, it is advisable to avoid nodes as a data collection function within VISSIM. While you can define certain areas to collect a large variety of data using nodes, the nodes tend to skip vehicles during the collection of the data. This reduces the reliability of the data. Instead, the data collection for this report is done via vehicle input data, vehicle record and data collection (raw data) points. Now that the settings and limitations of VISSIM are known, we can continue with the simulations. This is done in the next section. TU/e 7

9 4 Simulation results Now that we discussed the relevant settings and functionalities of VISSIM, we validate in this section the distribution of the inter-arrival time and the departure rate of the formulas in Section 2. Since the formulas are based on an M/D/1-system, the approxmimations assume an inter-arrival time with an exponential distribution. After that, we determine the departure rates at an intersection in Section 4.2. This is done with a maximum arrival rate and different directions at an intersection, with each direction having its own speed limit. In Section 4.3, we analyse the effect of long distances on the distribution and diffusion of the time and distance in between cars. For this analysis there is a simulation done for both the maximum possible arrival rate and a moderate arrival rate. 4.1 Inter-arrival time To validate that the inter-arrival time has an exponential distribution in VISSIM, the time between each car entering the simulation is measured. There are 30 simulations for both exact and stochastic, of which the results are compared. The inserted arrival rate for this simulation is 900 cars/h. Figure 4.1: Inter-arrival time distribution withoutfigure 4.2: Inter-arrival time distribution with rounding off rounding off to 0.5s Figure 4.1 shows the distribution of the inter-arrival time for all simulations together. The first thing that is noticable are peaks on a constant interval of 0.5s, which is not a realistic occurence. The VISSIM manual does not mention these types of intervals for the vehicle input [2]. Nor is it possible that car speed and acceleration influences the inter-arrival time, since the measuring occurs on the moment that a car enters the simulation. A possibility is that the vehicle inputs spawn cars in an inter-arrival time of an interval of 0.5s, which causes a peak in the same interval. The amount of cars that each interval spawns decreases exponentially. Still this does not explain the small amount of cars beside the peaks. A possible explanation is that VISSIM creates a normal distribution within each 0.5s-interval. However, this all is still a hypothesis that has yet to be confirmed. One should round off to 0.5s for all simulations to overcome this uncertainty. Figure 4.2 visualizes the inter-arrival time distribution when rounded off to 0.5s. This time, the expected exponential distibution is visible. To valide the hypothesis of a exponential distribution, one could carry out a Lilliefors test in MATLAB. The results are shown in Table 4.1. In this table, k represents the test statistic of the plot, of which the value depends on the mean and variance compared to the expected distribution. In this section the expected distribution is exponen- TU/e 8

10 tial. The critical value of the plot c crit depends on the amount of data points in the plot. Since the critical value c is in both cases higher than the test statistic k, the null hypothesis for a exponential distribution is valid, using a significance level of 95%. Table 4.1: Results of a Lilliefors test for Figure 4.2 k c crit exact stochastic Figures 4.3 and 4.4 show the average and variance of the inter-arrival time for each simulation. As expected, the average for exact is almost always 4.0s, since this vehicle input always generates 150 cars per simulation. Since this is not the case for stochastic, a flatter normal distribution is visible. However, we want to know if this flatter normal distribution could be still considered a normal distribution. Figure 4.3: Average inter-arrival time for each simu-figurlation 4.4: Variance of the inter-arrival time for each simulation Testing the null hypothese for a normal distribution in figures 4.3 and 4.4 is done with a Lilliefors test in MATLAB. The results are displayed in Table 4.2. Table 4.2: Results of a Lilliefors test for figures 4.3 and 4.4 k c crit variance for exact variance for stochastic average for exact average for stochastic Apart from the average plot for stochastic, the critical value is in all cases higher than the test statistic, which means that the null hypotheses for a normal distribution is valid for the three plots, using a significance level of 95%. Table 4.3 represents the coefficient of variation of the inter-arrival times, together with the relevant average standard deviation σ and the average of all 30 simulations. As expected, the average interarrival time for both exact and stochastic is close to 4.0 seconds. According to the coefficient of variation, both settings are exponential. TU/e 9

11 Table 4.3: Coefficient of variation of the inter-arrival time for exact and stochastic σ [s] average [s] c v Exact Stochastic Now that we have verified an exponential distribution for the inter-arrival time, we verify a deterministic distribution for the departure rate in the next section. 4.2 Departure rate for different directions In this section we determine the departure rate for every direction at an intersection. This simulation shows the impact of the curve length and its speed limit on the departure rate. However, since VISSIM does not take reduction in speed for sharp turns into account, it is necessary to manually add the different speed limits for every direction. For the left turn we use a speed limit of 25 and 30 km/h, while for the right turn we use 15 and 20 km/h. Figure 4.5 shows the simulation that is modelled in VISSIM. Figure 4.5: Modelled simulation within VISSIM for calculating the departure rates To guarantee a steady-state of incoming cars over the detectors on the junctions, the first 80 seconds of the simulation time are not taken into account with the results. Red traffic lights are added for the first 60 seconds to create queues for a sufficient stream of cars. The 20 seconds of simulation time after red light are neglected due to the accelerations of the cars. Table 4.4: Departure rate for different directions speed limit [km/h] µ [cars/h] σ [cars/h] c v Straight left left right right Table 4.4 shows the departure rate for different directions on a junction, together with the standard deviation and the coefficient of variation. As expected, the departure rate for right is the lowest and for a straight line the highest, since curves generate a certain speed limit in terms of safety. And since TU/e 10

12 a right turn is a sharp curve, the speed limit is the lowest, which has a big impact on the departure rate. Furthermore, the departure rate of 2618 cars/h for a straight line also equals the arrival rate for this simulation and for Section 4.3, since the inserted arrival rate is set on maximum for a speed limit of 50 km/h. The standard deviations are very low and the coefficient of variations are almost zero. This means the distribution of the departure rate is deterministic. 4.3 Diffusion over long distances In this section we determine the effect of long distances on the results, before the traffic reaches an intersection with traffic lights. First we determine te distribution for the time between each car at a high arrival rate. After that we visualize the diffusion of the cars over a long distance. This vizualisation is done for a moderate arrival rate. High arrival rate This simulation visualises the effect of distance on the time between each car, especially due to congestions like ghost traffic jams with a high arrival rate. These traffic jams are caused by speed differences or sudden braking. A hypothesis is that the time between each car increases with a longer travel distance. While this section focusses more on delays due to heavy traffic congestions over a long road, Section 4.3 focusses on the diffusion of vehicles over a long distance with a lower arrival rate. To make sure to get a maximum amount of ghost traffic jams, the arrival rate is set on maximum, which is effectively about 3000 cars/h. All results are rounded off to 0.5s as discussed in Section 4.1. Figure 4.6: Time between each car on several distances Figure 4.6 shows the time between each car on several distances within the simulation. The amount of measured cars is about 9000 to for each distance. The expected increase of time between each car does not occur, it stays relatively the same. Ghost traffic jams occur on every distance of the simulation due to the high traffic volume, thus the effect of these traffic jams is the same for all distances. The shape of the plots represent a gamma distribution. As comparison a gamma distribution is added with α = 22.5 and β = TU/e 11

13 Figure 4.7: Average time between each car for eachfigure 4.8: Variance of time between each car for simulation each simulation Figures 4.7 and 4.8 show the average and variance of the time between each car for each simulation. The average time does seem to increase over an increasing distance, though at a minimum rate. This slightly increasing average time is also visible in Table 4.5. Table 4.5: Coefficient of variation of the time between each car distance [m] σ [s] average [s] c v However, the variance and thus the standard variation seems to vary heavily without any specific order, resulting in a fluctuating coefficient of variation c v. Expected is that the plots and variance become more constant for an increased amount of simulations. A possible cause of this fluctuation is that the amount of ghost traffic jams on each distance differs in each simulation. Furthermore, there is a slight difference of height in the peaks of Figure 4.6, which could also be caused by the different amount of ghost traffic jams. Despite the fluctuating coefficient of variation, all distances remain clearly low variant. Table 4.6 shows the relevant results of a Lilliefors test in MATLAB for a normal distribution. The criticle value c crit is in all cases , which means the null hypothesis for all plots in figures 4.7 and 4.8. Table 4.6: Results of a Lilliefors test for figures 4.7 and 4.8 distance [m] k average k variance TU/e 12

14 Moderate arrival rate In this simulation we want to visualize the diffusion over a long distance. To simulate the average distance between each car over time, one uses a long road on which the cars are at least 175 seconds present in the simulation. The goal is to see if time influences the average distance between cars. This is also done for multiple cars in between. To prevent that some cars have more influence on the results than other cars, every distance between each car is only used once. This is done for each amount of cars in between on each timestep. So for the measurement of two cars in between, we calculate the distance between car number 1 and 4, after that we do the same for car number 4 and 7. The arrival rate is set on 900 cars/h, which is equal to the simulations of Section 4.1. This arrival rate is high enough for a sufficient amount of cars in the simulation, but low enough to keep ghost traffic jams at a minimum, since the goal of this simulation is not to examine the effect of ghost traffic jams. Figure 4.9: Average distance between cars as function of time Figure 4.9 shows the average distance between cars over the time present in the simulation. During the simulations, the distance of some cars with its predecessor become bigger. However, this also means that the distance with the car in the back becomes smaller, since the average speed of all cars together is 53 km/h. This results in a constant overall distance between the cars, which is as expected with the VISSIM settings explained in Section 3.1. Looking at multiple cars in between gives similar results. The standard deviation however lineary increases over time, as shown in Figure The distance between cars varies more as they progress in the simulation, which results in an increasing standard deviation. TU/e 13

15 Figure 4.10: Standard deviation of the distance between cars as function of time Figure 4.11: Path of each of the about 3500 carsfigure 4.12: Maximum difference in distance of Figure through the simulation 4.11 Since VISSIM s vehicle record -function measures the travelled distance per timestep for each car, we can use this data to visualize the diffusion, Figure 4.11 shows the paths of all cars throughout the simulation. Calculating the maximum distance difference within this diffusion plot results in Figure This shows how the diffusion lineary increases. Furthermore, as wanted the effect of the very few ghost traffic jams is not visible. Figure 4.13: Histograms of the position of cars over time TU/e 14

16 Slicing the results of Figure 4.11 at fixed times gives us Figure 4.13, similar to [12]. This figure shows the histograms of the amount of cars as function of the position within the simulation. As expected due to the accelerations and decelerations, the distribution by the end is very similar to a gamma distribution. Furthermore, the distribution becomes wider over time due to the diffusion. Now that all the results of the simulations are discussed, we summarize these results in a conclusion in the next section, followed up by several recommendations. TU/e 15

17 5 Conclusion In Section 2, several equations for the approximation of the mean waiting time are discussed. These equations are relevant in the scenario of a fixed traffic light cycle and a poisson arrival rate, thus for an M/D/1-system. Of the formulas, Van de Broek claims to be the most accurate [6]. For the simulations of PTV VISSIM 7, it is validated that the inter-arrival time has an exponential distribution for both the exact and stochastic setting. Furthermore, in Section 4.2 we validated the deterministic distribution of the departure rate, meaning that an M/D/1-system is a reasonable assumption for traffic intersections with traffic signals cycling in a fixed sequence. This result also confirmed the choice of an M/D/1-system in the approximation formulas in Section 2. Since exact is used for the remaining simulations, the relevant coefficient of variation equals However, due to a feature of VISSIM, this is only the case when rounded off to 0.5s. The difference between the exact and stochastic setting is explained in Section 3.1 The departure rate during effective green time is determined for all three travel directions on an intersection. This is done for different direction-decisions at an intersection and for different speed limits. The results are displayed in Table 4.4. These departure rates need to be used for the equations given in Section 2. Furthermore, the effect of ghost traffic jams on the time between each car has been determined, this is done at a maximum arrival rate to generate as many traffic jams as possible. The traffic jams seem to have very minimal impact on the average time between each car. The average time between each car only slightly increases over a longer distance. However, the increase is too small to validate this hypothesis and there is also a high fluctuation of variance between each measured distance. More simulations are needed to confirm the hypothesis and to gain a more constant variance between each distance. Lastly, the effect of long travel time on the distance between each car is determined. While the average distance between each car remains the same over time, the standard deviation increases. Thus it is possible to visualise the diffusion of the cars over time, as represented in Figure Cutting the diffusion plot at several times give histograms of the position of the cars. At longer travel times, the histograms show more similarities with a gamma distribution. Now that we concluded this report, we discuss several recommendations in the next section. TU/e 16

18 6 Recommendations To improve the current results of Section 4.3, it is advisable to run additional simulations next to the current 30 simulations, making sure the variance will fluctuate less due to a more constant amount of ghost traffic jams for each distance. To make sure the delays are independent of eachother, the average delay of 30 simulations has to be calculated. This needs to be done 30 times to get a normal distribution of the average delay, which means a total of 900 simulations are necessary. While doing the simulations, it is important to keep the limits of PTV VISSIM 7 in mind, as explained in Section 3.2. Furthermore, it is also recommended to analyse for longer distances than 990 m. This is necessary to valide whether the mean time between each car increases or not over longer distances. Advised is to simulate at least up to 5 km. To make sure the simulations match real-life situations as much as possible, one should look at the accelerations after red light, since this influences the departure rates. The departure rates of Section 4.2 are in reality slighty lower, since this simulation only measures the steady-state during greentime. Furthermore, not only cars drive on the roads. Therefore, it is important to look at the effects when busses, trucks and agricultural vehicles are included. Another way to minimize the mean waiting time, is to look at the time of clearing the junction, a moment where all traffic-lights are red. One could minimize the clearing time, while making sure it is not to short due to safety [13]. TU/e 17

19 References [1] A. Bleijenberg. The attractiveness of car use. In Cars and Carbon, pages Springer, [2] PTV Planung Transport Verkehr, Haid-und-Neu-Str. 15, Karlsruhe Germany. PTV VISSIM 7 User Manual, [3] A. Miller and J. Alan. Settings for fixed-cycle traffic signals. Operational Research Quarterly, pages , [4] M. S. van den Broek, J. S. H. Van Leeuwaarden, I. J. Adan, and O. J. Boxma. Bounds and approximations for the fixed-cycle traffic-light queue. Transportation Science, 40(4), [5] F. V. Webster. Traffic signal settings. Road Research Technical Paper, 39, [6] M. S. van den Broek. Traffic signals. Optimizing and analyzing traffic control systems. Master s thesis, Technische universiteit Eindhoven, [7] A. J. H. Clayton. Road traffic calculations. Journal of the ICE, 16(7): , [8] M. Beckmann, C. B. McGuire, and C. B. Winsten. Studies in the economics of transportation. (226), [9] G. F. Newell. Queues for a fixed-cycle traffic light. The Annals of Mathematical Statistics, 31(3): , [10] R. Akçelik. Time-dependent expressions for delay, stop rate and queue length at traffic signals. Australian Road Research Board, [11] R. Wiedemann. Simulation des Verkehrsflusses. Schriftenreihe des Instituts für Verkehrswesen, 8, [12] E. Lefeber and D. Armbruster. Aggregate modeling of manufacturing systems. In K.G. Kempf, P. Keskinocak, and R. Uzsoy, editors, Planning Production and Inventories in the Extended Enterprise: A State of the Art Handbook, Volume 1, chapter 17, pages Springer International Series in Operations Research and Management Science, Volume 151, [13] M. Van Der Heijden, A. Van Harten, and M. Ebben. Waiting times at periodically switched one-way traffic lanes. Probability in the engineering and informational sciences, 15(04): , TU/e 18

CE351 Transportation Systems: Planning and Design

CE351 Transportation Systems: Planning and Design CE351 Transportation Systems: Planning and Design TOPIC: Level of Service (LOS) at Traffic Signals 1 Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement

More information

Signalized Intersection Delay Models

Signalized Intersection Delay Models Chapter 35 Signalized Intersection Delay Models 35.1 Introduction Signalized intersections are the important points or nodes within a system of highways and streets. To describe some measure of effectiveness

More information

Introduction to Queueing Theory with Applications to Air Transportation Systems

Introduction to Queueing Theory with Applications to Air Transportation Systems Introduction to Queueing Theory with Applications to Air Transportation Systems John Shortle George Mason University February 28, 2018 Outline Why stochastic models matter M/M/1 queue Little s law Priority

More information

Analytical Delay Models for Signalized Intersections

Analytical Delay Models for Signalized Intersections Analytical Delay Models for Signalized Intersections Ali Payidar Akgungor and A. Graham R. Bullen INTRODUCTION Delay is the most important measure of effectiveness (MOE) at a signalized intersection because

More information

A Cellular Automaton Model for Heterogeneous and Incosistent Driver Behavior in Urban Traffic

A Cellular Automaton Model for Heterogeneous and Incosistent Driver Behavior in Urban Traffic Commun. Theor. Phys. 58 (202) 744 748 Vol. 58, No. 5, November 5, 202 A Cellular Automaton Model for Heterogeneous and Incosistent Driver Behavior in Urban Traffic LIU Ming-Zhe ( ), ZHAO Shi-Bo ( ô ),,

More information

Signalized Intersection Delay Models

Signalized Intersection Delay Models Signalized Intersection Delay Models Lecture Notes in Transportation Systems Engineering Prof. Tom V. Mathew Contents 1 Introduction 1 2 Types of delay 2 2.1 Stopped Time Delay................................

More information

CHAPTER 5 DELAY ESTIMATION FOR OVERSATURATED SIGNALIZED APPROACHES

CHAPTER 5 DELAY ESTIMATION FOR OVERSATURATED SIGNALIZED APPROACHES CHAPTER 5 DELAY ESTIMATION FOR OVERSATURATED SIGNALIZED APPROACHES Delay is an important measure of effectiveness in traffic studies, as it presents the direct cost of fuel consumption and indirect cost

More information

1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)

1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours) 1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours) Student Name: Alias: Instructions: 1. This exam is open-book 2. No cooperation is permitted 3. Please write down your name

More information

TRAFFIC FLOW SIMULATION USING MESOSCOPIC APPROACH

TRAFFIC FLOW SIMULATION USING MESOSCOPIC APPROACH TRAFFIC FLOW SIMULATION USING MESOSCOPIC APPROACH D R. S C. I N G. M I H A I L S S AV R A S O V S T R A N S P O R T A N D T E L E C O M M U N I C AT I O N I N S T I T U T E R I G A, L AT V I A I am from

More information

Minimizing Total Delay in Fixed-Time Controlled Traffic Networks

Minimizing Total Delay in Fixed-Time Controlled Traffic Networks Minimizing Total Delay in Fixed-Time Controlled Traffic Networks Ekkehard Köhler, Rolf H. Möhring, and Gregor Wünsch Technische Universität Berlin, Institut für Mathematik, MA 6-1, Straße des 17. Juni

More information

Signalized Intersection Delay Models

Signalized Intersection Delay Models Transportation System Engineering 56. Signalized Intersection Delay Models Chapter 56 Signalized Intersection Delay Models 56.1 Introduction Signalized intersections are the important points or nodes within

More information

Spontaneous Jam Formation

Spontaneous Jam Formation Highway Traffic Introduction Traffic = macroscopic system of interacting particles (driven or self-driven) Nonequilibrium physics: Driven systems far from equilibrium Collective phenomena physics! Empirical

More information

STANDING WAVES AND THE INFLUENCE OF SPEED LIMITS

STANDING WAVES AND THE INFLUENCE OF SPEED LIMITS STANDING WAVES AND THE INFLUENCE OF SPEED LIMITS H. Lenz, R. Sollacher *, M. Lang + Siemens AG, Corporate Technology, Information and Communications, Otto-Hahn-Ring 6, 8173 Munich, Germany fax: ++49/89/636-49767

More information

Performance Analysis of Delay Estimation Models for Signalized Intersection Networks

Performance Analysis of Delay Estimation Models for Signalized Intersection Networks Performance Analysis of Delay Estimation Models for Signalized Intersection Networks Hyung Jin Kim 1, Bongsoo Son 2, Soobeom Lee 3 1 Dept. of Urban Planning and Eng. Yonsei Univ,, Seoul, Korea {hyungkim,

More information

$QDO\]LQJ$UWHULDO6WUHHWVLQ1HDU&DSDFLW\ RU2YHUIORZ&RQGLWLRQV

$QDO\]LQJ$UWHULDO6WUHHWVLQ1HDU&DSDFLW\ RU2YHUIORZ&RQGLWLRQV Paper No. 001636 $QDO\]LQJ$UWHULDO6WUHHWVLQ1HDU&DSDFLW\ RU2YHUIORZ&RQGLWLRQV Duplication for publication or sale is strictly prohibited without prior written permission of the Transportation Research Board

More information

Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design

Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design Speed Studies - Project Traffic Queuing Intersections Level of Service in Highways and

More information

Eindhoven University of Technology MASTER. Traffic light prediction for Tom Tom devices. Krijger, P.G. Award date: 2013

Eindhoven University of Technology MASTER. Traffic light prediction for Tom Tom devices. Krijger, P.G. Award date: 2013 Eindhoven University of Technology MASTER Traffic light prediction for Tom Tom devices Krijger, P.G. Award date: 2013 Disclaimer This document contains a student thesis (bachelor's or master's), as authored

More information

Signalized Intersection Delay Models

Signalized Intersection Delay Models hapter 56 Signalized Intersection Delay Models 56.1 Introduction Signalized intersections are the important points or nodes within a system of highways and streets. To describe some measure of effectiveness

More information

14 Random Variables and Simulation

14 Random Variables and Simulation 14 Random Variables and Simulation In this lecture note we consider the relationship between random variables and simulation models. Random variables play two important roles in simulation models. We assume

More information

An improved CA model with anticipation for one-lane traffic flow

An improved CA model with anticipation for one-lane traffic flow An improved CA model with anticipation for one-lane traffic flow MARÍA ELENA. LÁRRAGA JESÚS ANTONIO DEL RÍ0 Facultad de Ciencias, Computer Science Dept. Universidad Autónoma del Estado de Morelos Av. Universidad

More information

Progression Factors in the HCM 2000 Queue and Delay Models for Traffic Signals

Progression Factors in the HCM 2000 Queue and Delay Models for Traffic Signals Akcelik & Associates Pty Ltd TECHNICAL NOTE Progression Factors in the HCM 2000 Queue and Delay Models for Traffic Signals Author: Rahmi Akçelik September 2001 Akcelik & Associates Pty Ltd DISCLAIMER:

More information

Roundabout Level of Service

Roundabout Level of Service Roundabout Level of Service Rahmi Akçelik Director Akcelik & Associates Pty Ltd email: rahmi.akcelik@sidrasolutions.com web: www.sidrasolutions.com 8 January 2009 Contents 1. Introduction... 1 2. Fundamental

More information

Variable Speed Approach for Congestion Alleviation on Boshporus Bridge Crossing

Variable Speed Approach for Congestion Alleviation on Boshporus Bridge Crossing Variable Speed Approach for Congestion Alleviation on Boshporus Bridge Crossing A. Akbas a,1, V. Topuz a,1, H.H. Celik b,2 and M. Ergun c,3 a University of Marmara, Vocational High School of Technical

More information

Traffic Flow Theory and Simulation

Traffic Flow Theory and Simulation Traffic Flow Theory and Simulation V.L. Knoop Lecture 2 Arrival patterns and cumulative curves Arrival patterns From microscopic to macroscopic 24-3-2014 Delft University of Technology Challenge the future

More information

Optimal Departure Advice

Optimal Departure Advice Master Thesis Mathematical Sciences Optimal Departure Advice Minimizing the waiting time and spreading the inflow at traffic lights Supervisors: Dr. Karma Dajani (UU) Dr. Sandjai Bhulai (VU) Dr. Rob van

More information

Cumulative Count Curve and Queueing Analysis

Cumulative Count Curve and Queueing Analysis Introduction Traffic flow theory (TFT) Zhengbing He, Ph.D., http://zhengbing.weebly.com School of traffic and transportation, Beijing Jiaotong University September 27, 2015 Introduction Outline 1 Introduction

More information

Shock wave analysis. Chapter 8. List of symbols. 8.1 Kinematic waves

Shock wave analysis. Chapter 8. List of symbols. 8.1 Kinematic waves Chapter 8 Shock wave analysis Summary of the chapter. Flow-speed-density states change over time and space. When these changes of state occur, a boundary is established that demarks the time-space domain

More information

Created by T. Madas KINEMATIC GRAPHS. Created by T. Madas

Created by T. Madas KINEMATIC GRAPHS. Created by T. Madas KINEMATIC GRAPHS SPEED TIME GRAPHS Question (**) A runner is running along a straight horizontal road. He starts from rest at point A, accelerating uniformly for 6 s, reaching a top speed of 7 ms. This

More information

Dr. Maddah ENMG 617 EM Statistics 10/15/12. Nonparametric Statistics (2) (Goodness of fit tests)

Dr. Maddah ENMG 617 EM Statistics 10/15/12. Nonparametric Statistics (2) (Goodness of fit tests) Dr. Maddah ENMG 617 EM Statistics 10/15/12 Nonparametric Statistics (2) (Goodness of fit tests) Introduction Probability models used in decision making (Operations Research) and other fields require fitting

More information

Real Time Traffic Control to Optimize Waiting Time of Vehicles at A Road Intersection

Real Time Traffic Control to Optimize Waiting Time of Vehicles at A Road Intersection International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 2320-9364, ISSN (Print): 2320-9356 w Volume 6 Issue 4 Ver. II ǁ 2018 ǁ PP. 25-33 Real Time Traffic Control to Optimize

More information

Estimation of Measures of Effectiveness Based on Connected Vehicle Data

Estimation of Measures of Effectiveness Based on Connected Vehicle Data Estimation of Measures of Effectiveness Based on Connected Vehicle Data Juan Argote, Eleni Christofa, Yiguang Xuan, and Alexander Skabardonis Abstract Vehicle-infrastructure cooperation via the Connected

More information

Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue

Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue Final project for ISYE 680: Queuing systems and Applications Hongtan Sun May 5, 05 Introduction As

More information

Modelling, Simulation & Computing Laboratory (msclab) Faculty of Engineering, Universiti Malaysia Sabah, Malaysia

Modelling, Simulation & Computing Laboratory (msclab) Faculty of Engineering, Universiti Malaysia Sabah, Malaysia 1.0 Introduction Intelligent Transportation Systems (ITS) Long term congestion solutions Advanced technologies Facilitate complex transportation systems Dynamic Modelling of transportation (on-road traffic):

More information

Topics in the Modeling, Analysis, and Optimisation of Signalised Road Intersections

Topics in the Modeling, Analysis, and Optimisation of Signalised Road Intersections Topics in the Modeling, Analysis, and Optimisation of Signalised Road Intersections A Project Report Submitted in partial fulfilment of the requirements for the Degree of Master of Engineering in Telecommunications

More information

Traffic Simulation Toolbox User s Manual

Traffic Simulation Toolbox User s Manual User s Manual Jesse Haber-Kucharsky Shreyas Sundaram University of Waterloo Department of Electrical and Computer Engineering May 31, 2011 Contents 1 Introduction 1 2 Basic Use 2 2.1 Quick-Start Example.......................

More information

Modelling and Simulation for Train Movement Control Using Car-Following Strategy

Modelling and Simulation for Train Movement Control Using Car-Following Strategy Commun. Theor. Phys. 55 (2011) 29 34 Vol. 55, No. 1, January 15, 2011 Modelling and Simulation for Train Movement Control Using Car-Following Strategy LI Ke-Ping (Ó ), GAO Zi-You (Ô Ð), and TANG Tao (»

More information

Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe

Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What

More information

Analytical investigation on the minimum traffic delay at a two-phase. intersection considering the dynamical evolution process of queues

Analytical investigation on the minimum traffic delay at a two-phase. intersection considering the dynamical evolution process of queues Analytical investigation on the minimum traffic delay at a two-phase intersection considering the dynamical evolution process of queues Hong-Ze Zhang 1, Rui Jiang 1,2, Mao-Bin Hu 1, Bin Jia 2 1 School

More information

Assessing the uncertainty in micro-simulation model outputs

Assessing the uncertainty in micro-simulation model outputs Assessing the uncertainty in micro-simulation model outputs S. Zhu 1 and L. Ferreira 2 1 School of Civil Engineering, Faculty of Engineering, Architecture and Information Technology, The University of

More information

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems  M/M/1  M/M/m  M/M/1/K Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals

More information

arxiv:cond-mat/ v3 [cond-mat.stat-mech] 18 Aug 2003

arxiv:cond-mat/ v3 [cond-mat.stat-mech] 18 Aug 2003 arxiv:cond-mat/0211684v3 [cond-mat.stat-mech] 18 Aug 2003 Three-Phase Traffic Theory and Highway Capacity Abstract Boris S. Kerner Daimler Chrysler AG, RIC/TS, T729, 70546 Stuttgart, Germany Hypotheses

More information

Anticipatory Pricing to Manage Flow Breakdown. Jonathan D. Hall University of Toronto and Ian Savage Northwestern University

Anticipatory Pricing to Manage Flow Breakdown. Jonathan D. Hall University of Toronto and Ian Savage Northwestern University Anticipatory Pricing to Manage Flow Breakdown Jonathan D. Hall University of Toronto and Ian Savage Northwestern University Flow = density x speed Fundamental diagram of traffic Flow (veh/hour) 2,500 2,000

More information

THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974

THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974 THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS by S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This note describes a simulation experiment involving

More information

Conceptual Physics 11 th Edition

Conceptual Physics 11 th Edition Conceptual Physics 11 th Edition Chapter 3: LINEAR MOTION This lecture will help you understand: Motion Is Relative Speed : Average and Instantaneous Velocity Acceleration Free Fall Motion Is Relative

More information

Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk

Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk ANSAPW University of Queensland 8-11 July, 2013 1 Outline (I) Fluid

More information

Speed-Flow and Bunching Relationships for Uninterrupted Flows

Speed-Flow and Bunching Relationships for Uninterrupted Flows 25th Conference of Australian Institutes of Transport Research (CAITR 2003), University of South Australia, Adelaide, Australia, 3-5 December 2003 First Version: 2 December 03 Speed-Flow and Bunching Relationships

More information

A MODIFIED CELLULAR AUTOMATON MODEL FOR RING ROAD TRAFFIC WITH VELOCITY GUIDANCE

A MODIFIED CELLULAR AUTOMATON MODEL FOR RING ROAD TRAFFIC WITH VELOCITY GUIDANCE International Journal of Modern Physics C Vol. 20, No. 5 (2009) 711 719 c World Scientific Publishing Company A MODIFIED CELLULAR AUTOMATON MODEL FOR RING ROAD TRAFFIC WITH VELOCITY GUIDANCE C. Q. MEI,,

More information

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017 CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer

More information

Linear Model Predictive Control for Queueing Networks in Manufacturing and Road Traffic

Linear Model Predictive Control for Queueing Networks in Manufacturing and Road Traffic Linear Model Predictive Control for ueueing Networks in Manufacturing and Road Traffic Yoni Nazarathy Swinburne University of Technology, Melbourne. Joint work with: Erjen Lefeber (manufacturing), Hai

More information

Research Article Individual Subjective Initiative Merge Model Based on Cellular Automaton

Research Article Individual Subjective Initiative Merge Model Based on Cellular Automaton Discrete Dynamics in Nature and Society Volume 23, Article ID 32943, 7 pages http://dx.doi.org/.55/23/32943 Research Article Individual Subjective Initiative Merge Model Based on Cellular Automaton Yin-Jie

More information

Recent Researches in Engineering and Automatic Control

Recent Researches in Engineering and Automatic Control Traffic Flow Problem Simulation in Jordan Abdul Hai Alami Mechanical Engineering Higher Colleges of Technology 17155 Al Ain United Arab Emirates abdul.alami@hct.ac.ae http://sites.google.com/site/alamihu

More information

CELLULAR AUTOMATA SIMULATION OF TRAFFIC LIGHT STRATEGIES IN OPTIMIZING THE TRAFFIC FLOW

CELLULAR AUTOMATA SIMULATION OF TRAFFIC LIGHT STRATEGIES IN OPTIMIZING THE TRAFFIC FLOW CELLULAR AUTOMATA SIMULATION OF TRAFFIC LIGHT STRATEGIES IN OPTIMIZING THE TRAFFIC FLOW ENDAR H. NUGRAHANI, RISWAN RAMDHANI Department of Mathematics, Faculty of Mathematics and Natural Sciences, Bogor

More information

CHAPTER 3. CAPACITY OF SIGNALIZED INTERSECTIONS

CHAPTER 3. CAPACITY OF SIGNALIZED INTERSECTIONS CHAPTER 3. CAPACITY OF SIGNALIZED INTERSECTIONS 1. Overview In this chapter we explore the models on which the HCM capacity analysis method for signalized intersections are based. While the method has

More information

Determining the minimum percentage of vehicles equipped with a ucan necessary to accurately estimate the traffic speed

Determining the minimum percentage of vehicles equipped with a ucan necessary to accurately estimate the traffic speed Delft University of Technology Faculty of Electrical Engineering, Mathematics and Computer Science Delft Institute of Applied Mathematics Determining the minimum percentage of vehicles equipped with a

More information

Research Article Headway Distributions Based on Empirical Erlang and Pearson Type III Time Methods Compared

Research Article Headway Distributions Based on Empirical Erlang and Pearson Type III Time Methods Compared Research Journal of Applied Sciences, Engineering and Technology 7(21): 4410-4414, 2014 DOI:10.19026/rjaset.7.817 ISSN: 2040-7459; e-issn: 2040-7467 2014 Maxwell Scientific Publication Corp. Submitted:

More information

"Modelling air quality in the city"

Modelling air quality in the city "Modelling air quality in the city" Diede Nijmeijer Master thesis University of Twente Applied Mathematics Specialization: Mathematical Physics and Computational Mechanics Chair: Multiscale Modelling and

More information

MECHANICS DESCRIBING MOVEMENT

MECHANICS DESCRIBING MOVEMENT MECHANICS DESCRIBING MOVEMENT Instantaneous speed & velocity Graphs of Motion Equations of Motion QUICK REVISION DISTANCE DISPLACEMENT VECTORS SCALARS SPEED VELOCITY ACCELERATION TICKER TIMERS THE DIFFERENCE

More information

EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran November 13, 2014.

EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran November 13, 2014. EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran November 13, 2014 Midterm Exam 2 Last name First name SID Rules. DO NOT open the exam until instructed

More information

Traffic Modelling for Moving-Block Train Control System

Traffic Modelling for Moving-Block Train Control System Commun. Theor. Phys. (Beijing, China) 47 (2007) pp. 601 606 c International Academic Publishers Vol. 47, No. 4, April 15, 2007 Traffic Modelling for Moving-Block Train Control System TANG Tao and LI Ke-Ping

More information

TRB Traffic Flow on Freeway Upgrades. By Werner Brilon and Andrea Bressler

TRB Traffic Flow on Freeway Upgrades. By Werner Brilon and Andrea Bressler TRB 4-2953 Traffic Flow on Freeway Upgrades By Werner Brilon and Andrea Bressler Ruhr University Bochum D-447 Bochum, Germany Phone: + 49 234 322 5936 ; Fax: +49 234 32 14 151 Email: verkehrswesen@rub.de

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes Midterm Quiz April 6, 2010 There are 5 questions, each with several parts.

More information

Session-Based Queueing Systems

Session-Based Queueing Systems Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the

More information

Cover Page. The handle holds various files of this Leiden University dissertation

Cover Page. The handle  holds various files of this Leiden University dissertation Cover Page The handle http://hdl.handle.net/1887/39637 holds various files of this Leiden University dissertation Author: Smit, Laurens Title: Steady-state analysis of large scale systems : the successive

More information

Network Simulation Chapter 5: Traffic Modeling. Chapter Overview

Network Simulation Chapter 5: Traffic Modeling. Chapter Overview Network Simulation Chapter 5: Traffic Modeling Prof. Dr. Jürgen Jasperneite 1 Chapter Overview 1. Basic Simulation Modeling 2. OPNET IT Guru - A Tool for Discrete Event Simulation 3. Review of Basic Probabilities

More information

SOME FACTORS INFLUENCING THE REGULARITY OF SHORT HEADWAY URBAN BUS OPERATION*

SOME FACTORS INFLUENCING THE REGULARITY OF SHORT HEADWAY URBAN BUS OPERATION* NZOR volume 4 number 2 July 1976 SOME FACTORS INFLUENCING THE REGULARITY OF SHORT HEADWAY URBAN BUS OPERATION* W.J, Frith M inistry of Transport W ellington S u m m a r y T h e i m p o r t a n c e o f

More information

Overall Plan of Simulation and Modeling I. Chapters

Overall Plan of Simulation and Modeling I. Chapters Overall Plan of Simulation and Modeling I Chapters Introduction to Simulation Discrete Simulation Analytical Modeling Modeling Paradigms Input Modeling Random Number Generation Output Analysis Continuous

More information

Queueing Theory and Simulation. Introduction

Queueing Theory and Simulation. Introduction Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University, Japan

More information

HWA CHONG INSTITUTION 2018 JC2 PRELIMINARY EXAMINATION. Monday 17 September hours

HWA CHONG INSTITUTION 2018 JC2 PRELIMINARY EXAMINATION. Monday 17 September hours HWA CHONG INSTITUTION 08 JC PRELIMINARY EXAMINATION MATHEMATICS Higher 9758/0 Paper Monday 7 September 08 hours Additional materials: Answer paper List of Formula (MF6) Cover Page READ THESE INSTRUCTIONS

More information

Figure 5.1: Force is the only action that has the ability to change motion. Without force, the motion of an object cannot be started or changed.

Figure 5.1: Force is the only action that has the ability to change motion. Without force, the motion of an object cannot be started or changed. 5.1 Newton s First Law Sir Isaac Newton, an English physicist and mathematician, was one of the most brilliant scientists in history. Before the age of thirty he had made many important discoveries in

More information

Network Equilibrium Models: Varied and Ambitious

Network Equilibrium Models: Varied and Ambitious Network Equilibrium Models: Varied and Ambitious Michael Florian Center for Research on Transportation University of Montreal INFORMS, November 2005 1 The applications of network equilibrium models are

More information

c) What are cumulative curves, and how are they constructed? (1 pt) A count of the number of vehicles over time at one location (1).

c) What are cumulative curves, and how are they constructed? (1 pt) A count of the number of vehicles over time at one location (1). Exam 4821 Duration 3 hours. Points are indicated for each question. The exam has 5 questions 54 can be obtained. Note that half of the points is not always suffcient for a 6. Use your time wisely! Remarks:

More information

Lecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking

Lecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov

More information

Recoverable Robustness in Scheduling Problems

Recoverable Robustness in Scheduling Problems Master Thesis Computing Science Recoverable Robustness in Scheduling Problems Author: J.M.J. Stoef (3470997) J.M.J.Stoef@uu.nl Supervisors: dr. J.A. Hoogeveen J.A.Hoogeveen@uu.nl dr. ir. J.M. van den Akker

More information

Link Models for Circuit Switching

Link Models for Circuit Switching Link Models for Circuit Switching The basis of traffic engineering for telecommunication networks is the Erlang loss function. It basically allows us to determine the amount of telephone traffic that can

More information

Transient situations in traffic flow: Modelling the Mexico City Cuernavaca Highway

Transient situations in traffic flow: Modelling the Mexico City Cuernavaca Highway arxiv:cond-mat/0501561v1 [cond-mat.other] 24 Jan 2005 Transient situations in traffic flow: Modelling the Mexico City Cuernavaca Highway J.A. del Río Centro de Investigación en Energía Universidad Nacional

More information

Traffic signal design-ii

Traffic signal design-ii CHAPTER 4. TRAFFIC SIGNAL DESIGN-II NPTEL May 3, 007 Chapter 4 Traffic signal design-ii 4.1 Overview In the previous chapter, a simple design of cycle time was discussed. Here we will discuss how the cycle

More information

A traffic lights approach to PD validation

A traffic lights approach to PD validation A traffic lights approach to PD validation Dirk Tasche May 2, 2003 Abstract As a consequence of the dependence experienced in loan portfolios, the standard binomial test which is based on the assumption

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes Midterm Quiz April 6, 2010 There are 5 questions, each with several parts.

More information

Chapter 2 Queueing Theory and Simulation

Chapter 2 Queueing Theory and Simulation Chapter 2 Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University,

More information

Traffic Flow Theory & Simulation

Traffic Flow Theory & Simulation Traffic Flow Theory & Simulation S.P. Hoogendoorn Lecture 4 Shockwave theory Shockwave theory I: Introduction Applications of the Fundamental Diagram February 14, 2010 1 Vermelding onderdeel organisatie

More information

Research on Heat Conduction Inverse Problem of Continuous Long Downhill Truck Brake

Research on Heat Conduction Inverse Problem of Continuous Long Downhill Truck Brake International Conference on Civil, Transportation and Environment (ICCTE 2016) Research on Heat Conduction Inverse Problem of Continuous Long Downhill Truck Brake Shun Zeng1, a,heng Zhang2,b,Yunwei Meng1,c

More information

NATCOR: Stochastic Modelling

NATCOR: Stochastic Modelling NATCOR: Stochastic Modelling Queueing Theory II Chris Kirkbride Management Science 2017 Overview of Today s Sessions I Introduction to Queueing Modelling II Multiclass Queueing Models III Queueing Control

More information

FIRST MIDTERM - REVIEW PROBLEMS

FIRST MIDTERM - REVIEW PROBLEMS Physics 10 Spring 009 George Williams FIRST MIDTERM - REVIEW PROBLEMS A data sheet is provided at the end. Problems labeled [Ch. 4] are relevant to the second midterm. 1. Convert 747 m to feet. Convert

More information

Chapter 11. Output Analysis for a Single Model Prof. Dr. Mesut Güneş Ch. 11 Output Analysis for a Single Model

Chapter 11. Output Analysis for a Single Model Prof. Dr. Mesut Güneş Ch. 11 Output Analysis for a Single Model Chapter Output Analysis for a Single Model. Contents Types of Simulation Stochastic Nature of Output Data Measures of Performance Output Analysis for Terminating Simulations Output Analysis for Steady-state

More information

Modeling and Performance Analysis with Discrete-Event Simulation

Modeling and Performance Analysis with Discrete-Event Simulation Simulation Modeling and Performance Analysis with Discrete-Event Simulation Chapter 9 Input Modeling Contents Data Collection Identifying the Distribution with Data Parameter Estimation Goodness-of-Fit

More information

arxiv: v1 [physics.soc-ph] 3 Dec 2009

arxiv: v1 [physics.soc-ph] 3 Dec 2009 A Modification of the Social Force Model by Foresight Preprint, to appear in the Proceedings of PED2008 arxiv:0912.0634v1 [physics.soc-ph] 3 Dec 2009 Bernhard Steffen Juelich Institute for Supercomputing,

More information

HOMEWORK ANALYSIS #2 - STOPPING DISTANCE

HOMEWORK ANALYSIS #2 - STOPPING DISTANCE HOMEWORK ANALYSIS #2 - STOPPING DISTANCE Total Points Possible: 35 1. In your own words, summarize the overarching problem and any specific questions that need to be answered using the stopping distance

More information

arxiv: v1 [cs.ds] 2 Jan 2019

arxiv: v1 [cs.ds] 2 Jan 2019 Platoon Forming Algorithms for Intelligent Street Intersections R.W. Timmerman a and M.A.A. Boon a a Eindhoven University of Technology, Eindhoven, The Netherlands arxiv:1901.04583v1 [cs.ds] 2 Jan 2019

More information

A Probability-Based Model of Traffic Flow

A Probability-Based Model of Traffic Flow A Probability-Based Model of Traffic Flow Richard Yi, Harker School Mentored by Gabriele La Nave, University of Illinois, Urbana-Champaign January 23, 2016 Abstract Describing the behavior of traffic via

More information

Chapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Chapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Chapter 6 Queueing Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing

More information

Analytical Approach to Evaluating Transit Signal Priority

Analytical Approach to Evaluating Transit Signal Priority JOURNAL OF TRANSPORTATION SYSTMS NGINRING AND INFORMATION TCHNOLOGY Volume 8, Issue, April 008 Online nglish edition of the Chinese language ournal Cite this paper as: J Transpn Sys ng & IT, 008, 8(, 4857.

More information

Data analysis and stochastic modeling

Data analysis and stochastic modeling Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt

More information

PBW 654 Applied Statistics - I Urban Operations Research

PBW 654 Applied Statistics - I Urban Operations Research PBW 654 Applied Statistics - I Urban Operations Research Lecture 2.I Queuing Systems An Introduction Operations Research Models Deterministic Models Linear Programming Integer Programming Network Optimization

More information

Using High-Resolution Detector and Signal Data to Support Crash Identification and Reconstruction. Indrajit Chatterjee Gary Davis May, 2011

Using High-Resolution Detector and Signal Data to Support Crash Identification and Reconstruction. Indrajit Chatterjee Gary Davis May, 2011 Using High-Resolution Detector and Signal Data to Support Crash Identification and Reconstruction Indrajit Chatterjee Gary Davis May, 2011 Introduction Road accidents are complex phenomenon. Causal factors

More information

ISE/OR 762 Stochastic Simulation Techniques

ISE/OR 762 Stochastic Simulation Techniques ISE/OR 762 Stochastic Simulation Techniques Topic 0: Introduction to Discrete Event Simulation Yunan Liu Department of Industrial and Systems Engineering NC State University January 9, 2018 Yunan Liu (NC

More information

CHAPTER 3 STOCHASTIC MODEL OF A GENERAL FEED BACK QUEUE NETWORK

CHAPTER 3 STOCHASTIC MODEL OF A GENERAL FEED BACK QUEUE NETWORK CHAPTER 3 STOCHASTIC MODEL OF A GENERAL FEED BACK QUEUE NETWORK 3. INTRODUCTION: Considerable work has been turned out by Mathematicians and operation researchers in the development of stochastic and simulation

More information

1 Basic concepts from probability theory

1 Basic concepts from probability theory Basic concepts from probability theory This chapter is devoted to some basic concepts from probability theory.. Random variable Random variables are denoted by capitals, X, Y, etc. The expected value or

More information

Safety of users in road evacuation: supply and demand-supply interaction models for users

Safety of users in road evacuation: supply and demand-supply interaction models for users Urban Transport XIII: Urban Transport and the Environment in the 21st Century 783 Safety of users in road evacuation: supply and demand-supply interaction models for users A. Vitetta, G. Musolino & F.

More information

Non Markovian Queues (contd.)

Non Markovian Queues (contd.) MODULE 7: RENEWAL PROCESSES 29 Lecture 5 Non Markovian Queues (contd) For the case where the service time is constant, V ar(b) = 0, then the P-K formula for M/D/ queue reduces to L s = ρ + ρ 2 2( ρ) where

More information

An Interruption in the Highway: New Approach to Modeling the Car-Traffic

An Interruption in the Highway: New Approach to Modeling the Car-Traffic EJTP 7, No. 23 (21) 123 136 Electronic Journal of Theoretical Physics An Interruption in the Highway: New Approach to Modeling the Car-Traffic Amin Rezaeezadeh Electrical Engineering Department, Sharif

More information