Next Article in Journal
Modeling the Mutual Enhancement of Regional Economy and Personal Quality of Life (QOL): A Case Study on the Mumbai–Ahmedabad High-Speed Rail Corridor in India
Previous Article in Journal
Tram Expansion Effects on Reaching the City Centres—Case Study of Tampere and Braunschweig
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Evaluating Real Time Ramp Meter Queue Length and Wait Time Estimation

by
Tanner J. Daines
,
Grant G. Schultz
* and
Gregory S. Macfarlane
Department of Civil and Construction Engineering, Brigham Young University, 430 Engineering Building, Provo, UT 84602, USA
*
Author to whom correspondence should be addressed.
Future Transp. 2022, 2(4), 807-827; https://doi.org/10.3390/futuretransp2040045
Submission received: 21 August 2022 / Revised: 13 September 2022 / Accepted: 22 September 2022 / Published: 1 October 2022

Abstract

:
Models to predict ramp meter queue length from traffic detector data are potentially useful tools in improving traffic operations and safety. Existing research, however, has been based on microscopic simulation or relied on extensive calibration of Kalman filter and related models to produce reliable queue length estimates. This research seeks to develop methodologies for improving and simplifying the calibration process of existing queue length models by applying loop detector data including volume, occupancy, and the metering rate data for ramp meters along I-15 in Utah. A conservation model and several variations of a Kalman filter model generated estimated queues that were compared to observed queue lengths in 60 s bins. A modified Kalman filter model and a new heuristic model derived from cluster analysis—the models that yielded the best results—provided queue length estimates that were generally within approximately eight vehicles of the observed queue length. Using the ramp metering rate, the queue length estimates were converted into wait times that were generally within approximately 30 s of the actual wait time, producing a viable method to predict wait time from up-to-the-minute traffic detection information with relatively little required calibration. The implementation of the ramp meter queue length and wait time estimation algorithms presented in this research will allow departments of transportation to better assess freeway and ramp conditions, which can then aid in reducing congestion throughout the freeway network.

1. Introduction

Ramp metering involves the deployment of a traffic signal on a freeway on-ramp to control the rate at which vehicles enter the freeway facility. Controlling the rate at which vehicles can enter the facility allows traffic to flow in a more consistent manner. Though the primary goal of ramp metering is to improve traffic flow on the freeway, the delay caused by the ramp meters is of interest to traffic operations as well [1,2,3,4,5,6,7,8,9,10].
The queue generated while the ramp is being metered can be counted in the field, however, very little research is known to have been done to date in developing a method to estimate queue length in real time without continuous calibration, monitoring, and field data collection [3,7,8,9]. Accurate real time estimation of queue length at metered on-ramps is of critical importance to freeway facility conditions, as metering rates could be modified in real time to optimize freeway performance while preserving adjacent arterial traffic conditions. Although some newer technologies have developed, many departments of transportation rely on loop detection systems in the roadways [3,7,8,9]. As such, it is critical to be able to use existing detection systems to produce these estimates or determine modifications that may be necessary to provide more robust estimates. This research uses data from the existing loop detection system to develop methodologies for improving and simplifying the calibration process of the existing queue length models. The results presented in this research allow ramp meter queue length and wait time estimates to be calculated in real time without the need for significant ongoing calibration.
This paper presents the background on ramp metering and a description of existing ramp meter queue length estimation algorithms in the form of a literature review, the analysis methodology for the research, the data collection methods, and the results of the application of this methodology to estimate queue lengths and wait times at ramps along I-15 operated by the Utah Department of Transportation (UDOT). The paper ends with general conclusions to the research, and a discussion on limitations and recommendations for future research.

2. Literature Review

Ramp meters have been employed in many urban locations in the United States and around the world as a means of mitigating congestion caused by growing demand [1,2,3,4,5,6,7,8,9,10]. By controlling the flow of traffic onto freeways—particularly around peak usage times—ramp meters allow freeways to operate at a higher volume while lowering the likelihood or severity of decreases in level of service. Additional observed benefits of ramp metering include decreases in crash rates, lower emissions, and reduced fuel consumption [1].
Over the past several years, multiple studies have been conducted that confirm the benefits of ramp metering. For example, in the Minneapolis–St. Paul region in Minnesota, a study comparing traffic operations with and without ramp metering showed that average travel speeds on the freeway increased from 23 miles per hour (mph) to 39 mph during peak travel times when the local freeway on-ramps were metered compared to no metering. In addition, overall travel delay decreased by over 20 percent in the study corridor [11]. On the Monash freeway in Melbourne, Australia, the implementation of ramp metering increased traffic flow by 4.7 percent and average speed by 24.5 percent during the morning peak hour; while during the afternoon peak hour, traffic flow increased by 8.4 percent and average speed by 58.6 percent [12].
Several approaches may be taken to implement a ramp metering program depending on transportation needs and the goals of the transportation agency. Meters are generally classified into two different types: pre-timed and traffic responsive. Pre-timed ramp meters are based on historical data, whereas traffic-responsive meters use real-time data to detect and react quickly to changing traffic conditions. Controls may be implemented at a local level based only on conditions immediately surrounding the ramp or on a systemwide level based on conditions of a freeway corridor including multiple on-ramps [1,4].
Pre-timed metering at both the local and systemwide level is determined based on historical data, making it simpler to implement than traffic-responsive metering. When congestion problems are predictable, pre-timed meters can generally meet needs for managing flow onto the freeway. However, pre-timed metering rates must be regularly monitored and periodically updated to accommodate changes in traffic patterns, which may result in additional long-term expenses. Furthermore, pre-timed meters cannot adjust to traffic conditions in real time, which may employ rates that are either too restrictive or too free for the actual conditions [1,6].
Traffic-responsive metering depends on real-time data collection. This often makes initial programming for the meters more difficult but reduces the number of required updates long-term once the meters have been tuned in the field. Local traffic-responsive metering can be used to mitigate congestion based on data collected on the freeway near the ramp. These meters rely on data collected via sensors to determine an acceptable rate at which vehicles can be released onto the freeway from a specific on-ramp. Systemwide traffic-responsive metering coordinates metering rates across the entire freeway section to effectively manage entry onto the freeway for optimal use [1,6].
Although ramp metering has proven to considerably improve freeway service, it also has some drawbacks. Ramp meters tend to favor those who commute longer distances on the freeway, as the time spent waiting on the on-ramp is more than made up for by the travel time saved on the freeway. Those who travel shorter distances may not benefit or may even be negatively affected by wait times at on-ramps, which may exceed time savings on the freeway. If queueing on the ramp is not properly managed, ramp metering can have negative effects on the larger road network. While freeway travel times may improve, ramp delay may become too high, and in some cases spillback onto arterial roads can lead to serious disruptions [3]. Public acceptance of ramp metering is valuable to its overall success; excessive wait times or slow metering rates may lead drivers to ignore the meters or lobby for other methods of traffic management [1].
Several algorithms are available for the setting of ramp metering rates. Though not discussed in detail in this paper, these approaches generally use a combination of local and systemwide traffic-responsive metering rates to optimize traffic flow during peak periods. Most algorithms seek to find a balance between achieving optimal traffic flow on the freeway system while preventing the queue along the on-ramp from causing spillback onto the local street network [12,13,14,15,16,17,18].
The overall performance of ramp metering algorithms is typically measured by assessing various conditions of freeway performance. While there are many performances measures that pertain to the freeway such as capacity, volume to capacity (v/c) ratio, level of service, and travel time, there are few that directly evaluate freeway ramp performance [1]. Additionally, research has been completed to estimate queue length and wait time at typical unsignalized and signalized intersections as well as at tollways. Much of the research done to assess queue length and wait time at those locations uses traffic queue theory, time-dependent models, and simulation data [19,20]. It is also recognized that the field of artificial intelligence and advanced optimization has been growing significantly in recent years, with applications including but not limited to online learning, scheduling, transportation, medicine, data classification, and ramp metering [21,22,23,24,25,26]. As the field of artificial intelligence continues to evolve, its application to traffic data analysis has become more prevalent. It is known that some research has been completed to date with respect to neural network algorithms and their applicability to optimizing traffic flow along a corridor with ramp metering [21]. These sources provide valuable information, similarities, and possibilities as they pertain to ramp metering, but they are not discussed thoroughly in this study based on the overall objectives of the research. These may be explored for future research.
Occupancy and traffic volume data are often gathered by loop detectors along an on-ramp. As shown in Figure 1, several sets of detectors are used in freeway ramp operations. Detectors 20 through 22 represent the passage queue detection (PQ), detectors 23 through 25 represent the intermediate queue detection (IQ), while detectors 26 through 28 represent the excessive queue detection (EQ) [27]. Although loop detectors are useful mechanisms that provide essential traffic data to transportation agencies, loop detection is known to be imperfect, may experience malfunctions, and the quality of the detector data can deteriorate over time [28,29]. Causes of loop detection failure and data quality deterioration can stem from multiple sources, which can include pavement cracking and movement, breakdown of wire insulation, poor sealants, inadequate splices and electrical connections, damage caused by construction, electronics unit failure, and electrical surges [28]. Data quality difficulties can also stem from vehicles passing over two detectors simultaneously as they change travel lanes, vehicles may be missed altogether, poor traffic lane pavement markings, traffic composition, and changes in traffic density [9,29].
Using the loop detector data, several ramp queue length estimation algorithms have been developed and analyzed, including a conservation model, a Kalman filter, and the Highway Capacity Manual (HCM) back of queue method [3,7,8,9]. For this research, the HCM back-of-queue method proved to be ineffective, as it substantially underestimated actual queue lengths, thus it will not be discussed in detail in this paper [9]. However, some variations of the conservation model and Kalman filter equation have been developed, which will be discussed in this section.
The conservation model for estimating queue length has been used for several decades but appears to have been first applied directly to metered on-ramps by Vigos et al. in 2006 [7]. The conservation equation developed in that research (with some minor naming modifications for clarity) is shown in Equation (1):
Q n = Q n 1 + T ( V i n V o u t )
where:
  • Q n = number of on-ramp queued vehicles in the current period (veh)
  • Q n 1 = number of on-ramp queued vehicles in the previous time period (veh)
  • T = time period (min)
  • V i n = number of vehicles entering the on-ramp during a given time period (veh/min)
  • V o u t = number of vehicles exiting the ramp during a given time period (veh/min).
Equation (1) has since been used to predict queue length in several other research studies [3,8,9]. The original equation developed for the conservation model in Equation (1) required the volume entering and exiting the ramp to be equal, but errors were found in the detector-estimated volumes when compared with field recorded traffic volumes [9]. Many difficulties are introduced when relying solely on the detector data, particularly, as mentioned previously, that vehicles can be double-counted or missed altogether [9]. Because of this potential for error, the original conservation model equation was modified to balance the volumes entering and exiting the ramp which is shown by a volume-balancing ratio C in Equation (2) [9]:
Q n = Q n 1 + T C V i n V o u t
where:
  • C = volume-balancing ratio to account for miscounting of the detectors.
By using this volume-balancing ratio, it is presumed the conservation model will produce more accurate queue length estimates. The volume-balancing ratio has been calculated by balancing the counts in 15 min periods [3] or by setting it as a constant value calculated in real time [8,9]. Prior to incorporating this volume-balancing ratio in Equation (1) it was discovered that the correlation between the estimated queue length and the time occupancy was only 0.63 [8]. The relationship between volume data from the detector and the estimated number of vehicles was also found to be nonlinear, as the results gave a correlation coefficient of merely 0.18 between the two variables [8]. Therefore, it is likely that there are other factors outside the capability of this equation that affect queue length such as detector error, driver distraction, poor weather, and traffic incidents. However, in analyzing 20 data sets from ramp meters in Milwaukee, Wisconsin, it was found that the volume-balancing ratio improved the conservation model considerably in nearly every case. Therefore, it appears that the use of the volume-balancing ratio will improve the reliability of queue length estimates [8].
The Kalman filter model has also been used for estimating queue length at on-ramps [3,7,8,9]. A Kalman filter is an algorithm that can combine multiple data measurements to produce more accurate estimates. In the case of traffic flow, the conservation model presented in Equation (2) is enhanced by the addition of occupancy data and ramp characteristics as inputs that are also used to predict queue length as shown in Equation (3):
Q n = Q n 1 + T V i n V o u t + K Q ^ n 1 Q n 1
where:
  • K = Kalman filtering constant (generally 0 < K < 1)
  • Q ^ n 1 = number of on-ramp queued vehicles calculated from detector time occupancy data (veh)
  • Q ^ n 1 is calculated as outlined in Equation (4):
Q ^ n 1 = O n 1 L R × N L E
where:
  • O n 1 = time occupancy collected by loop detectors (%)
  • L R = length of the on-ramp (ft)
  • N = number of lanes
  • L E = effective vehicle length, (vehicle length + safety distance between vehicles) (ft).
With the inclusion of detector occupancy and ramp characteristics, such as the length of the on-ramp, the number of lanes, and the vehicle length, the Kalman filter algorithm uses these known measurements to estimate unknown parameters—the ramp queue length in this case—with greater accuracy. The Kalman filter constant K can update during each minute to account for “noise” in the data from the detectors. The Kalman filter equation can further be improved by the inclusion of the volume-balancing ratio C in Equation (5) [9]:
Q n = Q n 1 + T C V i n V o u t + K Q ^ n 1 Q n 1
By using the volume-balancing ratio, as occurred with the conservation model, the queue length estimates obtained by Wu et al. [9] improved significantly in nearly all cases, and in only a select few cases were slightly more errors introduced. These errors were found to occur in the Kalman filter models because when the volume-balancing ratio is close to 1 (the detector volume entering and exiting the ramp are nearly equal), the Kalman filter coefficient K is also close to zero, but the equation still adds queue length to the estimate from the coefficient K , which would introduce additional error. In contrast, when the volume-balancing ratio is not close to 1, the Kalman filter equation yields more reliable results than the conservation model. Overall, both the Kalman filter and conservation model, especially when using the volume-balancing ratio, provide generally accurate estimates of the actual queue length [9].
However, none of the research done previously proposes a simple and reliable method that can be used to estimate ramp meter queue length in real time. Initial ramp queue length estimation research relied solely on microscopic simulation to produce the Kalman filter algorithm [7], and later research suggested that the traffic engineering community has no reliable methodology to predict the on-ramp vehicle queue length [8]. In addition, no research has been found to date that attempts to predict ramp meter wait time in real time. All existing methods found during this research in relation to ramp meter wait times have simply been completed through visually observing ramp wait times or have required ongoing data collection and calibration on a ramp-by-ramp basis to estimate wait times [11,30]. This research will propose a method to estimate ramp meter wait times without ongoing data collection.

3. Methodology

Previous research has relied on microscopic simulation results or requires extensive calibration of the Kalman filter and related models to produce reliable queue length estimates and no known research has developed a method to predict ramp meter wait time in real time. This section presents the methodologies used in this research to predict ramp meter queue length and compare the predictions to observed queue lengths. A discussion on variations of a Kalman filtering algorithm that were used to predict queue lengths is presented. A method to predict ramp meter wait times in real time is also discussed.

3.1. Kalman Filter Variations

The methods described in this section were developed to compare ways that the Kalman filter equation could be used without relying on manual data collection and ongoing calibration. Each method described in this section uses the Kalman filter as its base and has different ways that the Kalman filter constant K is calculated:
  • Conservation model, which assumes K = 0,
  • Vigos model that assumes K = 0.22 (a theoretically determined value) [7],
  • Optimized K baseline comparison, which minimizes the root mean square error (RMSE) between the predicted and observed queue lengths in 15 min bins,
  • Linear regression models, which use the detector data measurements to create an equation for K at each ramp studied, and
  • Heuristic clustering, which places the detector data into three clusters and outputs one K value for each of the three clusters.

3.2. Conservation Model

A conservation model for estimating queue length on a ramp assumes that the queue length during a given period is equal to the number of vehicles entering the ramp during that period minus the number of vehicles exiting the ramp during that same period. If there was a queue on the ramp from the previous period, that queue length is added to the current period. If the detector data on the ramp were perfect, the conservation model would be the ideal method to use. The conservation equation, shown previously in Equation (2), forms the basis of the Kalman filter equation. The conservation model is the Kalman filter equation where K = 0. The detector data provided by UDOT (discussed in detail below) showed that the EQ detectors were more accurate than the PQ detectors at estimating volumes on the ramp, so the volume-balancing ratio C for the conservation model was placed on the V o u t term instead of V i n , as shown in Equation (6):
Q n = Q n 1 + T V i n C V o u t
As specified in the literature review, Q n represents the estimated queue length during the current time period n, whereas Q n 1 represents the estimated queue length during the previous minute n−1. T in Equation (6) represents the time period and is analyzed as 1 min in this research. V i n represents the estimated volume assumed to arrive at the on-ramp in the current time period based on the EQ detector data, while V o u t represents the estimated volume assumed to leave the on-ramp (entering the freeway) during the current time period based on the PQ detector data. C was calculated based on the balancing of volumes estimated to be entering and exiting the ramp in 15 min bins; for example, if 200 vehicles were estimated to arrive to the ramp ( V i n ) based on the EQ detectors between 4:00 and 4:15 p.m. and 250 vehicles were estimated to leave the ramp and enter the freeway ( V o u t ) based on the PQ detectors during that same time period, C would be calculated as shown in Equation (7):
C = V i n V o u t = 200   v e h 250   v e h = 0.80
This volume-balancing ratio of 0.80 would be applied to V o u t for that specified time period to balance the volume experienced between V i n and V o u t , which reduces some of the error and inconsistency produced by loop detectors.

3.3. Vigos Model

While a conservation model would be sufficient for estimating queue length on a ramp if the detectors on the ramp were error-free, many difficulties are introduced when relying solely on the volumes obtained from the detector data. The Kalman filter constant, K , is intended to improve the conservation model by removing undesired random noise that occurs on the ramp by including additional variables such as the detector occupancy, the length of the ramp, and the number of lanes [3,7,8,9].
The Vigos model proposed in this research modifies the value used for K . Similar to the conservation model, which uses a constant of 0 for K during all metering periods, the Vigos model uses a constant value of 0.22 for K for all periods based on calibration of K through microscopic simulation [7]. Although the simulations may not fully represent actual traffic conditions, the results provide crucial insight with respect to the behavior of the Kalman filter model because the tests that were created assessed various ramp scenarios and traffic conditions in the simulations. This research builds on the study performed by Vigos et al. [7] by using actual loop detector data compared against actual field-recorded queue length results rather than relying on microscopic simulation results.
As occurred with the conservation model, the Kalman filter equation was modified in this research to have the volume-balancing ratio C placed on the V o u t term instead of V i n as shown in Equation (8) [8]:
Q n = Q n 1 + T V i n C V o u t + 0.22 Q ^ n 1 Q n 1

3.4. Optimized Kalman Filter Baseline Comparison

The optimized Kalman filter equation is calibrated based on observed queue length data and thus cannot be used as a real-time predictive model independently. Rather, it is a useful comparison mechanism to assess the ability of the other Kalman filter models to represent the observed queue lengths. The optimized Kalman filter equation was previously introduced in Equation (5), and was modified with the volume-balancing ratio placed on V o u t rather than V i n , as shown in Equation (9):
Q n = Q n 1 + T V i n C V o u t + K Q ^ n 1 Q n 1
Rather than finding an optimum K for an entire metering period at each ramp as performed in previous research, the data were grouped into 15 min bins during each day to allow for more specific optimization of K and to provide additional observations that can be used to compare each K with traffic analysis parameters [3,7,8,9]. That is, the research attempts to determine any relationship between K and traffic density, volume, occupancy, and potentially other performance measures. The K for each 15 min period was found by minimizing the RMSE between the queue length from the field data and that estimated by the Kalman filter equation presented in Equation (9). The RMSE was calculated by computing the standard deviation of the residuals as shown in Equation (10). The RMSE can depict how closely concentrated data points are around the best-fit line; therefore, a more accurate model has an RMSE closer to 0.
R M S E = i = 1 N x p , i x o , i 2 N
where:
  • i = 1 N = summation of all observations in N , beginning at i = 1
  • N = number of observations
  • x p , i = predicted queue length value for observation i
  • x o , i = observed queue length value for observation i .
Because the data were grouped into 15 min bins, the volume-balancing ratio C was also calculated and used for each 15 min period. The result of Equation (9) is an estimated queue length for each minute based on the optimized K . As mentioned, this method relies on field data and therefore cannot be used in real time. The optimized K functions as the baseline for comparing the different models produced by variations of the K value used in Equations (6), (8) and (9).

3.5. Linear Regression Models

Several linear regression models were developed to create an equation that could be used to predict K for any metering period based on traffic performance measures. Multiple data sources were used, such as the EQ, IQ, and PQ occupancies, the average vehicle density on the ramp, and a variable to distinguish from which ramp the data originated. In many regression models, log transformations of the data sources are used to represent marginally diminishing effects of performance measures and produces a more normalized dataset. More details on the linear regression models will be provided in the Analysis Results section.

3.6. Cluster Analysis and Heuristic Models

A cluster analysis was performed on the loop detector data to group data together into clusters based on how closely related the IQ and PQ occupancies are to each other. A cluster analysis helps prevent some biases that may exist, as no direct assumption is made about the data prior to the cluster analysis being completed. The benefit of cluster analysis is that it can take a large dataset where the data may exhibit similarities to each other in a certain range of values, and it allows the clusters to form and then produce a simpler, more comprehensible output.
A clustering method called the k -means algorithm was used in this research, which finds a centroid point of each cluster—the average of all data points within that cluster—and each centroid becomes the output of the analysis [31]. The steps used in the k-means algorithm are as follows:
  • Specify the number of clusters k to be used.
  • Randomly select k objects from the data set as the initial centroids.
  • Each data point is assigned to the closest centroid.
  • The centroid of each cluster is updated by calculating the new mean of the data points assigned to each cluster and assign that mean as the cluster center.
  • Iterations are performed of steps 3 and 4 until the cluster assignment of data points is halted or the maximum number of iterations used in the analysis is reached.

4. Data Collection

Four on-ramps to I-15 in Davis, Salt Lake, and Utah counties in Utah were chosen for data collection and analysis. These ramps include the northbound (NB) on-ramp at Layton Parkway in Davis County, the southbound (SB) on-ramp at Bangerter Highway in Salt Lake County, the SB on-ramp at Pleasant Grove Boulevard in Utah County, and the SB on-ramp at University Avenue in Utah County, as shown in Figure 2. Data were collected during several periods in April and July 2021. Five weekdays of data (Monday through Friday) were collected at the four on-ramps during the PM metering period.
This section describes the data collection process at each of the four ramps studied in the research. A discussion will be presented on the time periods analyzed, the lane configuration and general characteristics of each ramp, the location of the loop detectors along the ramp, the data collected by the loop detectors, and the manually collected data.

4.1. Layton Parkway Northbound On-Ramp

The Layton Parkway NB on-ramp is located in the city of Layton in Davis County, Utah. At the entrance of the ramp, there are three receiving lanes, with two of these lanes used for the dual eastbound left turn lanes onto the ramp. The Layton Parkway and I-15 interchange is a single-point urban interchange and the eastbound left turn lanes operate with protected-only left turn phasing. The third entry lane on the on-ramp is used for the westbound right turn lane, which operates with free turning movement along Layton Parkway. However, approximately 150 feet upstream, westbound right turning vehicles must yield to the two lanes used for eastbound left turning vehicles as the ramp merges to two lanes approaching the ramp meter signal.
During the data collection periods, this ramp was metered during the PM peak period from 4:00 to 6:30 p.m. As shown in Figure 2, there are EQ detectors in each of the three entry lanes located approximately 50 feet to the north of the ramp entrance. The IQ detectors are located in each lane shortly after the ramp merges from three to two lanes. Finally, PQ detectors are located immediately after the ramp meter signal, which is located approximately 540 feet to the north of the ramp entrance.

4.2. Bangerter Highway Southbound On-Ramp

The Bangerter Highway SB on-ramp is located in the city of Draper in Salt Lake County, Utah. At the entrance of the ramp, there are three receiving lanes, with two of these lanes used for the dual westbound left turn lanes onto the ramp. The Bangerter Highway and I-15 interchange is a single-point urban interchange and the westbound left turn lanes operate with protected-only left turn phasing. The third entry lane on the on-ramp is used for the eastbound right turn lane, which operates with free turning movement. These three entry lanes continue up through the ramp meter signal and then merge to two lanes shortly after the signal.
During the data collection periods, this ramp was metered during the PM peak period from 3:30 to 5:45 p.m. As shown in Figure 2, there are EQ detectors in each of the three entry lanes located approximately 50 feet to the south of the ramp entrance. The IQ detectors are located in each lane approximately 250 feet to the south of the EQ detectors. Finally, PQ detectors are located immediately after the ramp meter signal, which is located approximately 1000 feet to the south of the ramp entrance.

4.3. Pleasant Grove Boulevard Southbound On-Ramp

The Pleasant Grove Boulevard SB on-ramp is located in the city of Pleasant Grove in Utah County, Utah. At the entrance of the ramp, there are two receiving lanes. At the intersection of Pleasant Grove Boulevard and the I-15 SB ramps, there are dual westbound left turn lanes onto the ramp and a shared eastbound through/right turn lane. The Pleasant Grove Boulevard and I-15 interchange is a diamond interchange and the westbound left turn lanes operate with protected-only left turn phasing. Eastbound right turning vehicles are controlled by the signalized intersection and are permitted to turn right on red after a stop, but they may be restricted at times as right turning vehicles may be blocked by vehicles traveling in the eastbound through direction in this shared through/right turn lane. These two entry lanes continue up through the ramp meter signal.
During the data collection periods, this ramp was metered during the PM peak period from 4:00 to 6:00 p.m. As shown in Figure 2, there are EQ detectors in each of the entry lanes located approximately 50 feet to the south of the ramp entrance. The IQ detectors are located in each lane approximately 250 feet to the south of the EQ detectors. Finally, PQ detectors are located immediately after the ramp meter signal, which is located approximately 775 feet to the south of the ramp entrance.

4.4. University Avenue Southbound On-Ramp

The University Avenue SB on-ramp is located in the city of Provo in Utah County, Utah. The University Avenue and I-15 interchange is similar to what is typically known as a trumpet interchange. Of note, this interchange includes two different roadways, with University Avenue generally traveling in the north/south direction, and Lakeview Parkway/1860 South traveling in the east/west direction. The intersection prior to the ramp entrance includes a west leg known as Lakeview Parkway, the east leg known as 1860 South, the north leg stemming from University Avenue, and the south leg as the I-15 southbound on-ramp. As such, there are dual westbound left turn lanes on 1860 South, which operate with protected-only left turn phasing. There is an eastbound right turn lane on Lakeview Parkway from which vehicles may turn right on red after a stop. At the entrance of the ramp, there are three receiving lanes. These three entry lanes continue up through the ramp meter signal.
During the data collection periods, this ramp was metered during the PM peak period from 4:30 to 6:15 p.m. As shown in Figure 2, there are EQ detectors in each of the entry lanes located approximately 325 feet to the south of the ramp entrance. The IQ detectors are located in each lane approximately 550 feet to the south of the EQ detectors. Finally, PQ detectors are located immediately after the ramp meter signal, which is located approximately 1875 feet to the south of the ramp entrance.

4.5. Loop Detector Data Collection

The EQ, IQ, and PQ detectors in each lane along the four studied ramps collect both volume and occupancy data and are automatically recorded in 60 s increments in the TransSuite system used by UDOT. As an example, the Layton Parkway NB Ramp has three EQ detectors, two IQ detectors, and two PQ detectors, one for each lane at their respective locations. These detectors provide volume estimates in each 60 s increment based on the detector of a vehicle crossing over the detector. In like manner, occupancy estimates are also provided in 60 s increments at each detector based on the percentage of time during that increment in which a vehicle was sensed above the detector (e.g., if vehicles were detected to be above the detector during 30 of 60 s, the occupancy at that detector in that time period would be 50 percent).
In addition, the variable ramp meter discharge rate (in units of veh/h) for each minute is included with the detector data. This discharge rate is for the overall ramp rather than a lane-by-lane discharge rate (e.g., if the ramp metering rate if 800 veh/h and there are two lanes at the ramp meter signal, the ramp meter discharge rate per lane is 400 veh/h/lane). The ramp meter discharge rate is determined by the ramp metering algorithm used by UDOT, which can automatically modify the ramp metering rate in each minute as needed based on perceived freeway and ramp conditions.

4.6. Field Collected Data

The manual data collection was performed by recording the on-ramps during the PM metering periods using UDOT cameras accessed in the Brigham Young University Transportation Lab. To align with the loop detector data, the manual data collection was also performed in 60 s increments. The field-collected data include the number of vehicles entering and exiting the ramp in each lane, the total number of vehicles on the ramp, the number of lanes on the ramp, and the vehicles queued at the ramp meter signal each minute.

5. Analysis Results

This section includes a discussion on the results of the optimized K comparison, the linear regression models, and the cluster analysis based on their ability to estimate queue lengths as closely as the optimized K values are able to achieve using observed data.

5.1. Optimized K Comparison

As discussed in the methodology section, the optimized K analysis was performed to provide a baseline for the other Kalman filter equation variations. The K produced for each 15 min period was not restricted to the range of 0 < K < 1, as was done in previous research [8]. Rather, K was permitted to extend beyond this range of values based on the minimum RMSE found between the observed and modeled queue length estimates. The results of the optimized K variation is illustrated in Figure 3, which shows the frequency of different optimized K values for each 15 min period, organized by ramp. Although K does vary, the highest density of K values are between approximately 0 < K < 0.5.

5.2. Linear Regression Models

Linear regression models were used to develop an equation to predict K for any metering period. Many different linear regression models were tested, although just four primary models to predict K are shown in Table 1. In three of the four models, log transformations of the data were used to linearize the data. The variables that were log transformed included an additional factor of either 0.01 for the occupancy variables and 1 for the density variable to prevent these methods from producing errors if the occupancy or density were 0 at any point within the dataset, as log(0) is undefined.
The four linear regression models to predict K included in this analysis are as follows:
  • Ramp Control [Density]: the inputs of this model include the IQ occupancy, a log transformation of the density, and a variable for ramp control.
  • Ramp Control [Occ.]: the inputs of this model focus primarily on the three detector locations and include the IQ, EQ, and PQ occupancy, in addition to a variable for ramp control.
  • Ramp Control [Log Occ.]: this model used the same inputs as “Ramp Control [Occ.]” but used a log transformation of each occupancy value.
  • Log Occ. [No Ramp]: this model used only a log transformation of each occupancy value, with no variable for ramp control, in other words, the output equation would result in the same K value for each ramp.
The Ramp Control [Density] model was selected for use in comparison against the optimized K model, as this model yielded the best results with respect to the R2 value (closer to 1) and the log likelihood (closer to 0) versus the different linear regression models shown in Table 1. The equation for K that would be produced by the Ramp Control [Density] model is shown in Equations (11)–(14), which has a unique final term in each equation dependent on which ramp is being used. Equation (11) is for Bangerter Highway, Equation (12) for Layton Parkway, Equation (13) for Pleasant Grove Boulevard, and Equation (14) for University Avenue.
K = 2.568 0.052 I Q   O c c + 1.168 D e n s i t y
K = 2.568 0.052 I Q   O c c + 1.168 D e n s i t y 0.219 1
K = 2.568 0.052 I Q   O c c + 1.168 D e n s i t y 0.624 1
K = 2.568 0.052 I Q   O c c + 1.168 D e n s i t y 0.238 1
where:
  • I Q   O c c = intermediate queue detector occupancy (percent)
  • D e n s i t y = concentration of vehicles along the on-ramp (veh/mi).

5.3. Cluster Analysis and Heuristic Models

For the cluster analysis performed in this research, the PQ occupancy was compared to the IQ occupancy for each 15 min period. Each 15 min period represented one data point and had its own K value. Three clusters were used in the analysis, as the use of fewer or more clusters reduced its usefulness either in variability or prevented each cluster from having an adequate sample size to be reliable. From the cluster analysis, the average K of all data points within each cluster was calculated and then that K was applied across all data points for each respective cluster.
The average K , the number of observations (n), and the standard deviation (SD) of the data points were calculated for each cluster. Cluster 1, as it is designated in Figure 4, pertains to those time periods where there were both a low PQ and a low IQ occupancy. Cluster 2 represents data points with a high PQ occupancy and low IQ occupancy, while Cluster 3 captures data points that had a high IQ occupancy and either a high or low PQ occupancy.
From Figure 4, cutoff ranges were developed based on the cluster analysis that most approximately captured the data points within each of the three clusters, with the cutoff between Cluster 1 and Cluster 2 occurring at 13.5 percent PQ occupancy, while the cutoff between Clusters 1 and 2 versus Cluster 3 was set at 16.0 percent IQ occupancy. Therefore, any data point that fell within Cluster 1 would be given a uniform K of 0.189 (n = 93, SD = 0.400), while Cluster 2 would be assigned a K of 0.337 (n = 56, SD = 0.439), and Cluster 3 would have a K of 0.170 (n = 20, SD = 0.833). Figure 4 shows a plot of the cluster analysis with each of the clusters shown by color, while also having unique shapes to designate the ramp to which each data point belongs. With this information, a heuristic model was developed to predict the queue length of vehicles at the metered on-ramp based on the detector occupancy.

5.4. Queue Length Analysis

The queue length estimates were generated using several variations of the Kalman filter algorithm presented in the Analysis Methodology section, including an optimized K comparison, a conservation model, the Vigos model, a heuristic model, and a linear regression model. The optimized K comparison method was used as a baseline for the other models because it is the closest any Kalman filter model comes to the actual queue length.
The K value was calibrated for each 15 min period on each ramp and for each day by minimizing the RMSE between the field recorded queue length and the estimated queue length from the Kalman filter algorithm. Each of these models was then compared with the field recorded queue length to determine which model most closely resembled the actual queue length.
Each model was assigned a K value based on the criteria set for each model. The optimized K would have varied K values per ramp every 15 min, dependent on which K value produced the minimum RMSE between the observed and modeled queue length. The conservation model used a constant value of 0 for K for all time periods on all ramps. The Vigos model used a constant value of 0.22 for K for all time periods on all ramps. The heuristic model used a cluster analysis that produced three possible K values that could be selected per ramp for each 15 min period depending on where that period fit in the cluster analysis. Finally, the linear regression model produced an equation that calculated K for each 15 min period.
The queue length estimates compared against each other during the PM metering period are shown in Figure 5, Figure 6, Figure 7 and Figure 8 for Bangerter Highway SB, Layton Parkway NB, Pleasant Grove Boulevard SB, and University Avenue SB, respectively. The thicker line, called “Observed,” represents the field-recorded queue length, which is the target line that the modeled queue lengths seek to represent. Only one day of the five days that were collected for each ramp is shown for conciseness, but each ramp experienced similar patterns with respect to the accuracy of the models against the field recorded queue length throughout each day. Full model results can be found in the literature [32].
Because each of the models analyzed are variations of the same Kalman filter equation, the models generally follow each other along a similar path, with some variation occurring in the queue length estimates attributed to the variation in K . There is some variation in the quality of each model in reflecting the observed queue length. This is particularly evident in the linear regression and conservation models shown in Figure 5, Figure 6, Figure 7 and Figure 8, while the Vigos and heuristic models generally follow the observed queue length more closely.
Although not all ramps perform equally, the heuristic and Vigos models more closely follow the observed queue length and are within approximately 10 vehicles throughout each day. Table 2 shows the reported RMSE for each of the models that were analyzed for the entire dataset as well as the RMSE calculated for each ramp. The RMSE was calculated by comparing the modeled queue length against the observed queue length for each period. The optimized K method minimizes the RMSE between the field-recorded and the modeled queue lengths and is thus used as a baseline for comparison. Although recognizably the most accurate model at predicting the actual queue length at each ramp, the optimized K baseline cannot be used in practice without calibration through field data collection. As such, this method—the generally analyzed method used in previous research—does not provide usable results for continual use and application [3,7,8,9].
While the order of RMSE varies slightly by ramp, the heuristic model generally performs best when using the RMSE as the comparison mechanism. The heuristic model is based on a cluster analysis that yielded three possible values for K . However, the Vigos model, which uses a constant value of 0.22, performs nearly as well—if not sometimes better than—the heuristic model. The Vigos model was most closely aligned with the average K that was calculated for the four ramps used in this research, which was computed to be 0.22, matching the value found in the Vigos model.
The heuristic model and Vigos model have both proven to come close to the observed queue length at each ramp. These models are also able to capture the peaks and valleys of the queue that occur throughout the metering period by using the Kalman filter equation at each of the four ramps and from queue lengths ranging from as little as no queue to as many as approximately 70 vehicles.

5.5. Wait Time Analysis

To perform the wait time analysis at each ramp, the modeled and observed queue lengths (veh) were divided by the metering rate (veh/min) to generate the wait time in minutes as shown in Equation (15). This method was used because of its simplicity in using existing data that is provided by the detectors on each ramp.
W n = Q n R n
where:
  • W n = wait time (min)
  • Q n = queue length (veh)
  • R n = metering rate (veh/min).
A field verification was completed at Layton Parkway to ensure that this method was reliable by manually measuring the wait time in 60 s increments—measuring the time elapsed from when a vehicle entered the ramp until it passed the ramp meter signal. The field recorded queue length was divided by the metering rate to compute the calculated wait time. The field recorded wait times were then compared to the wait time estimates calculated from Equation (15), as shown in Figure 9.
Figure 9 shows that the calculated wait times follow the actual wait times quite well, as nearly every peak and valley throughout the day is captured, and the calculated wait times are generally never more than 30 s above or below the actual wait times during any given minute for this specific application. Therefore, it appears that using the metering rate to convert from queue length into wait time is a reasonable application. In estimating the wait times more broadly, most models used in this research across all ramps and periods throughout each day do tend to slightly underestimate the wait times produced by the conversion used in Equation (15).

6. Conclusions

This study proposes an algorithm that predicts queue length and wait time at metered on-ramps using existing loop detector data that could be applied across any metered on-ramp. Analyses were conducted on several methods of estimating ramp meter queue lengths. The feasibility of using these methods to calculate wait times was also evaluated in this research.
Queue and delay estimation algorithms used at signalized intersections have historically been difficult to apply to ramp metering, although there is some past research that analyzed methods to estimate queue lengths at metered on-ramps. The main methods of research that have been done include using a conservation model and a Kalman filter model to predict queue lengths, however, no research appears to have been able to definitively recommend a reliable method to predict ramp queue length in real time, much less produce wait time estimates. The Vigos model relied solely on microscopic simulation to predict K and had never been verified through field data collection. Previous research has suggested that using an optimized Kalman filter equation requires extensive calibration and cannot be reliably used in real time for queue length estimates [9]. No research prior to the results presented in this paper provided a reliable method to predict queue length and wait time along metered on-ramps in real time.
This paper assessed a conservation model and several variations of a Kalman filter model, such as the Vigos model [7], a heuristic model, and a linear regression model to analyze the queue length estimates. The queue length estimates’ accuracy varied by ramp, but it was found that the heuristic and Vigos model represented the observed queue lengths fairly well, while the linear regression and conservation models did not. While there is some variation, it was seen that the queue lengths estimated by the heuristic and Vigos models were generally within approximately 8 vehicles of the observed queue length. These models were also able to capture the fluctuation in queue length at each ramp throughout the metering period. Because of the simplicity of the Vigos model with only one value for K value of 0.22, this method can be applied in a simple manner to ramps while requiring little to no calibration. It also appears the queue length estimates produced by the Vigos model along with the metering rate from the detectors can be used to provide reasonable wait time estimates that were generally within approximately 30 s of the actual wait time at each of the ramps analyzed.

7. Limitations and Future Research

A primary difficulty in this research stems from the loop detection systems on the ramps, as the subject ramps provided mixed results when compared against field-collected data, suggesting that the detectors are not entirely accurate in their reporting of volume and occupancy data. This can be attributed to several factors, including, but not limited to, the following:
  • Vehicles passing over two detectors simultaneously,
  • Avoiding passing over a detector altogether,
  • Poor traffic lane pavement markings and pavement condition,
  • Traffic composition,
  • Changes in traffic density,
  • Other potential errors that can occur as the loop detection system ages [9,28,29].
If the detectors reported volumes perfectly, the conservation model should have been the most accurate model, however, it was the model that performed most poorly. For this reason, it was imperative that a Kalman filter model be used, as it is able to use other detector and ramp data to help account for what the volumes counted by the detectors cannot do. Nevertheless, were the data loop detector data more reliable, it is expected the results would be more aligned with actual queue lengths and wait times at metered on-ramps. As newer technologies continue to develop that will improve volume and occupancy detection, the following may be performed for future research:
  • An assessment of video detection systems to determine whether these queue length estimates from the Vigos model may be further improved, and
  • An evaluation of the possibility of using artificial intelligence systems to predict ramp meter queue length and wait time.

Author Contributions

Conceptualization, T.J.D., G.G.S. and G.S.M.; Methodology, T.J.D., G.G.S. and G.S.M.; Validation, T.J.D.; Formal Analysis, T.J.D.; Investigation, T.J.D.; Resources, T.J.D., G.G.S. and G.S.M.; Data Curation, T.J.D.; Writing—Original Draft Preparation, T.J.D.; Writing—Review and Editing, G.G.S. and G.S.M.; Visualization, T.J.D., G.G.S. and G.S.M.; Supervision, G.G.S. and G.S.M.; Project Administration, G.G.S.; Funding Acquisition, G.G.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Utah Department of Transportation grant number 208679.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Acknowledgments

The authors acknowledge the Utah Department of Transportation (UDOT) for funding this research and the following individuals on the UDOT Technical Advisory Committee for helping guide the research, Jamie Mackey, Scott Stevenson, Robert Chamberlain, Carrie Jacobson, Grant Farnsworth, and Tyler Laing; and from BYU, Cory Ward and James Umphress. The authors alone are responsible for the preparation and accuracy of the information, data, analysis, discussions, recommendations, and conclusions presented herein. The contents do not necessarily reflect the views, opinion, endorsements, or policies of the Utah Department of Transportation or the US Department of Transportation. The Utah Department of Transportation makes no representation or warranty of any kind, and therefore, assumes no liability.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Jacobson, L.N.; Stribiak, J.; Nelson, L.; Sallman, D. Ramp Management and Control Handbook; Federal Highway Administration: Washington, WA, USA, 2006; pp. 5-1–5-29.
  2. Jacobson, L.N.; Henry, K.C.; Mehyar, O. Real-Time Metering Algorithm for Centralized Control. Transp. Res. Rec. J. Transp. Res. Board 2009, 1232, 17–26. [Google Scholar]
  3. Liu, H.X.; Wu, X.; Michalopoulos, P.G. Improving Queue Size Estimation for Minnesota’s Stratified Zone Metering Strategy. Transp. Res. Rec. J. Transp. Res. Board 2007, 2012, 38–46. [Google Scholar] [CrossRef]
  4. Papageorgiou, M.; Kotsialos, A. Freeway Ramp Metering: An Overview. IEEE Trans. Intell. Transp. Syst. 2000, 00TH8493, 271–281. [Google Scholar]
  5. Papamichail, I.; Papageorgiou, M.; Vong, V.; Gaffney, J. Heuristic Ramp-Metering Coordination Strategy Implemented at Monash Freeway, Australia. Transp. Res. Rec. J. Transp. Res. Board 2010, 2178, 10–20. [Google Scholar] [CrossRef]
  6. Taylor, T.; Meldrum, D. Algorithm Design, User Interface, and Optimization Procedure for a Fuzzy Logic Ramp Metering Algorithm: A Training Manual for Freeway Operations Engineers; WA-RD 481.1; Washington State Department of Transportation (WSDOT): Washington, WA, USA, 2000; pp. 1–5.
  7. Vigos, G.; Papageorgiou, M.; Wang, Y. A Ramp Queue Length Estimation Algorithm. In Proceedings of the 2006 IEEE Intelligent Transportation Systems Conference, Toronto, ON, Canada, 17–20 September 2006. [Google Scholar]
  8. Wu, J.; Jin, X.; Horowitz, A.J. Methodologies for Estimating Vehicle Queue Length at Metered On-Ramps. Transp. Res. Rec. J. Transp. Res. Board 2008, 2047, 75–82. [Google Scholar] [CrossRef]
  9. Wu, J.; Jin, X.; Horowitz, A.J.; Gong, D. Experiment to Improve Estimation of Vehicle Queue Length at Metered On-Ramps. Transp. Res. Rec. J. Transp. Res. Board 2009, 2099, 30–38. [Google Scholar] [CrossRef] [Green Version]
  10. Han, Y.; Ramezani, M.; Hegyi, A.; Yuan, Y.; Hoogendoorn, S. Hierarchical Ramp Metering in Freeways: An Aggregated Modeling and Control Approach. Transp. Res. Part C 2020, 110, 1–19. [Google Scholar] [CrossRef]
  11. Levinson, D.; Zhang, L. Assessing the Benefits and Costs of ITS, Evaluating Effectiveness of Ramp Meters. Transportation Research, Economics and Policy; Springer: Boston, MA, USA, 2004; Volume 10, pp. 145–166. [Google Scholar]
  12. Bélisle, F.; Torres, L.; Volet, P.; Hale, D.K.; Avr, A. Evaluating the HERO Ramp-Metering Algorithm with San Diego’s Integrated Corridor Management System Model. Transp. Res. Rec. J. Transp. Res. Board 2019, 2673, 354–366. [Google Scholar] [CrossRef]
  13. Chen, L.L.; May, A.D.; Auslander, D.M. Freeway Ramp Control Using Fuzzy Set Theory for Inexact Reasoning. Transp. Res. Part A Gen. 1990, 24, 15–25. [Google Scholar] [CrossRef]
  14. Cho, H.; Chilukuri, B.R.; Laval, J.A.; Guin, A.; Suh, W.; Ko, J. Genetic Algorithm-Based Simulation Optimization of the ALINEA Ramp Metering System: A Case Study in Atlanta. Transp. Plan. Technol. 2020, 43, 475–487. [Google Scholar]
  15. Gaffney, J.; Burley, M.; Hall, M. Managed Motorway Design Guide Volume 2: Design Practice Part 2: Managed Motorway—Network Optimisation Tools; VicRoads: Victoria, VIC, Australia, 2019; pp. 11–44. [Google Scholar]
  16. Kondyli, A.; Shehada, M.K.H. Evaluation of Ramp Metering Impacts on Travel Time Reliability and Traffic Operations through Simulation. J. Adv. Transp. 2019, 2019, 1–12. [Google Scholar]
  17. Perrine, K.A.; Lao, Y.; Wang, J.; Wang, Y. Area-Wide Ramp Metering for Targeted Incidents: The Additive Increase, Multiplicative Decrease Method. J. Comput. Civ. Eng. 2015, 29, 04014038. [Google Scholar] [CrossRef]
  18. Xin, W.; Michalopoulos, P.G.; Hourdakis, J.; Lau, D. Minnesota’s New Ramp Control Strategy: Design Overview and Preliminary Assessment. Transp. Res. Rec. J. Transp. Res. Board 2004, 1867, 69–79. [Google Scholar] [CrossRef]
  19. Mauro, R.; Pompigna, A. State of the Art and Computational Aspects of Time-Dependent Waiting Models for Non-Signalised Intersections. J. Traffic Transp. Eng. 2019, 7, 808–831. [Google Scholar] [CrossRef]
  20. Pompigna, A.; Mauro, R. A Multi-Class Time-Dependent Model for the Analysis of Waiting Phenomena at a Motorway Tollgate. J. Traffic Transp. Eng. 2020, 8, 237–256. [Google Scholar] [CrossRef]
  21. Alexakis, T.; Peppes, N.; Adamapolou, E.; Demestichas, K. An Artificial Intelligence-Based Approach for the Controlled Access Ramp Metering Program. Vehicles 2021, 3, 63–83. [Google Scholar] [CrossRef]
  22. Zhao, H.; Zhang, C. An Online-Learning-Based Evolutionary Many-Objective Algorithm. Inf. Sci. 2020, 509, 1–21. [Google Scholar] [CrossRef]
  23. Pasha, J.; Nwodu, A.L.; Fatholollahi-Fard, A.M.; Tian, G.; Li, Z.; Wang, H.; Dulebenets, M.A. Exact and Metaheuristic Algorithms for the Vehicle Routing Problem with a Factory-in-a-box in Multi-Objective Settings. Adv. Eng. Inform. 2022, 52, 101623. [Google Scholar] [CrossRef]
  24. Kavoosi, M.; Dulebenets, M.A.; Abioye, O.F.; Pasha, J.; Wang, H.; Chi, H. An Augmented Self-Adaptive Parameter Control in Evolutionary Computation: A Case Study for the Berth Scheduling Problem. Adv. Eng. Inform. 2019, 42, 100972. [Google Scholar] [CrossRef]
  25. Dulebenets, M.A. A Comprehensive Evaluation of Weak and Strong Mutation Mechanisms in Evolutionary Algorithms for Truck Scheduling at Cross-Docking Terminals. IEEE Access 2018, 6, 65635–65650. [Google Scholar] [CrossRef]
  26. Rabbani, M.; Oladzad-Abbasabay, N.; Akbarian-Saravi, N. Ambulance Routing in Disaster Response Considering Variable Patient Condition: NSGA-II and MOPSO Algorithms. J. Ind. Manag. Optim. 2022, 18, 1035–1062. [Google Scholar] [CrossRef]
  27. Ramp Meter Detection Zone Number Assignment. Available online: https://www.udot.utah.gov/main/uconowner.gf?n=4577702613457026 (accessed on 20 May 2020).
  28. Briedis, P.; Trueman, H. The Accuracy of Inductive Loop Detectors. In Proceedings of the 24th ARRB Conference, Melbourne, VIC, Australia, 12–15 October 2010. [Google Scholar]
  29. Klein, L.A.; Mills, M.K.; Gibson, D. Traffic Detector Handbook: Third Edition—Volume II; Federal Highway Administration: Washington, WA, USA, 2006; pp. 6-1–6-21.
  30. Freeway Performance Measures. Available online: http://udottraffic.utah.gov/fpm (accessed on 10 August 2022).
  31. UC Business Analytics R Programming Guide. Available online: https://uc-r.github.io/kmeans_clustering (accessed on 10 August 2022).
  32. Schultz, G.G.; Macfarlane, G.S.; Daines, T.J.; Ward, C.K.; Umphress, J. Evaluating Ramp Meter Wait Time in Utah; Report UT-22.06; Utah Department of Transportation Research and Innovation Division: Salt Lake City, UT, USA, 2022.
Figure 1. Ramp meter detection locations.
Figure 1. Ramp meter detection locations.
Futuretransp 02 00045 g001
Figure 2. Selected ramp and detector locations.
Figure 2. Selected ramp and detector locations.
Futuretransp 02 00045 g002
Figure 3. Variance of optimized K by ramp.
Figure 3. Variance of optimized K by ramp.
Futuretransp 02 00045 g003
Figure 4. Cluster analysis plot of PQ occupancy versus IQ occupancy.
Figure 4. Cluster analysis plot of PQ occupancy versus IQ occupancy.
Futuretransp 02 00045 g004
Figure 5. Queue length comparison: Bangerter Highway SB, 15 April 2021.
Figure 5. Queue length comparison: Bangerter Highway SB, 15 April 2021.
Futuretransp 02 00045 g005
Figure 6. Queue length comparison: Layton Parkway NB, 15 April 2021.
Figure 6. Queue length comparison: Layton Parkway NB, 15 April 2021.
Futuretransp 02 00045 g006
Figure 7. Queue length comparison: Pleasant Grove Boulevard SB, 28 July 2021.
Figure 7. Queue length comparison: Pleasant Grove Boulevard SB, 28 July 2021.
Futuretransp 02 00045 g007
Figure 8. Queue length comparison: University Avenue SB, 28 July 2021.
Figure 8. Queue length comparison: University Avenue SB, 28 July 2021.
Futuretransp 02 00045 g008
Figure 9. Wait time versus metering rate comparison: Layton Parkway NB, 15 April 2021.
Figure 9. Wait time versus metering rate comparison: Layton Parkway NB, 15 April 2021.
Futuretransp 02 00045 g009
Table 1. Linear Regression Models to Predict K.
Table 1. Linear Regression Models to Predict K.
Ramp ControlRamp ControlRamp ControlLog Occ.
[Density][Occ.][Log Occ.][No Ramp]
(Intercept)−2.568 (−3.178) **−0.211 (−0.802)−0.402 (−0.620)0.263 (0.557)
IQ Occ.−0.052 (−3.828) ***−0.012 (−1.787)
Log(Density)1.168 (3.571) ***
Ramp = Layton−0.219 (−2.026) *0.123 (1.044)0.086 (0.671)
Ramp = PG Blvd−0.624 (−2.489) *0.011 (0.070)−0.050 (−0.215)
Ramp = University−0.238 (−2.308) *−0.241 (−2.271) *−0.222 (−2.051) *
EQ Occ. 0.005 (0.324)
PQ Occ. 0.040 (1.938)
Log(IQ Occ) −0.079 (−0.894)−0.086 (−1.314)
Log(EQ Occ) 0.206 (0.813)0.281 (2.325) *
Log(PQ Occ) 0.184 (0.633)−0.131 (−0.563)
# Observations169169169169
R20.1530.1110.0880.051
R2 Adj.0.1270.0780.0540.034
F5.8903.3732.5952.952
t-statistics in parentheses, * p < 0.1, ** p < 0.05, *** p < 0.01.
Table 2. Queue Length RMSE Results.
Table 2. Queue Length RMSE Results.
ModelsRMSE (Vehicles)
OverallBangerterLaytonPG BlvdUniv Ave
Optimized K Baseline7.166.845.906.769.42
Heuristic8.287.317.029.1410.00
Vigos8.347.466.959.409.95
Linear Regression10.108.247.038.1216.30
Conservation10.808.907.4212.6014.50
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Daines, T.J.; Schultz, G.G.; Macfarlane, G.S. Evaluating Real Time Ramp Meter Queue Length and Wait Time Estimation. Future Transp. 2022, 2, 807-827. https://doi.org/10.3390/futuretransp2040045

AMA Style

Daines TJ, Schultz GG, Macfarlane GS. Evaluating Real Time Ramp Meter Queue Length and Wait Time Estimation. Future Transportation. 2022; 2(4):807-827. https://doi.org/10.3390/futuretransp2040045

Chicago/Turabian Style

Daines, Tanner J., Grant G. Schultz, and Gregory S. Macfarlane. 2022. "Evaluating Real Time Ramp Meter Queue Length and Wait Time Estimation" Future Transportation 2, no. 4: 807-827. https://doi.org/10.3390/futuretransp2040045

APA Style

Daines, T. J., Schultz, G. G., & Macfarlane, G. S. (2022). Evaluating Real Time Ramp Meter Queue Length and Wait Time Estimation. Future Transportation, 2(4), 807-827. https://doi.org/10.3390/futuretransp2040045

Article Metrics

Back to TopTop