An optimal variable speed limits system to ameliorate traffic safety risk

Active Traffic Management (ATM) systems have been emerging in recent years in the US and Europe. They provide control strategies to improve traffic flow and reduce congestion on freeways. This study investigates the feasibility of utilizing a Variable Speed Limits (VSL) system, one key part of ATM, to improve traffic safety on freeways. A proactive traffic safety improvement VSL control algorithm is proposed. First, an extension of the METANET (METANET: A macroscopic simulation program for motorway networks) traffic flow model is employed to analyze VSL’s impact on traffic flow. Then, a real-time crash risk evaluation model is estimated for the purpose of quantifying crash risk. Finally, optimal VSL control strategies are achieved by employing an optimization technique to minimize the total crash risk along the VSL implementation corridor. Constraints are setup to limit the increase of average travel time and the differences of the posted speed limits temporarily and spatially. This novel VSL control algorithm can proactively reduce crash risk and therefore improve traffic safety. The proposed VSL control algorithm is implemented and tested for a mountainous freeway bottleneck area through the micro-simulation software VISSIM. Safety impacts of the VSL system are quantified as crash risk improvements and speed homogeneity improvements. Moreover, three different driver compliance levels are modeled in VISSIM to monitor the sensitivity of VSL effects on driver compliance. Conclusions demonstrated that the proposed VSL system could improve traffic safety by decreasing crash risk and enhancing speed homogeneity under both the high and moderate compliance levels; while the VSL system fails to significantly enhance traffic safety under the low compliance scenario. Finally, future implementation suggestions of the VSL control strategies and related research topics are also discussed.     

Feedback control speed harmonization algorithm: Methodology and preliminary testing

The capacity drop phenomenon, which reduces the maximum bottleneck discharge rate following the onset of congestion, is a critical restriction in transportation networks that produces additional traffic congestion. Consequently, preventing or reducing the occurrence of the capacity drop not only mitigates traffic congestion, but can also produce environmental and traffic safety benefits. In addressing this problem, the paper develops a novel bang-bang feedback control speed harmonization (SH) or Variable Speed Limit (VSL) algorithm, that attempts to prevent or delay the breakdown of a bottleneck and thus reduce traffic congestion. The novelty of the system lies in the fact that it is both proactive and reactive in responding to the dynamic stochastic nature of traffic. The system is proactive because it uses a calibrated fundamental diagram to initially identify the optimum throughput to maintain within the SH zone. Furthermore, the system is reactive (dynamic) because it monitors the traffic stream directly upstream of the bottleneck to adjustment the metering rate to capture the dynamic and stochastic nature of traffic. The steady-state traffic states in the vicinity of a lane-drop bottleneck before and after applying the SH algorithm is analyzed to demonstrate the effectiveness of the algorithm in alleviating the capacity drop. We demonstrate theoretically that the SH algorithm is effective in enhancing the bottleneck discharge rate. A microscopic simulation of the network using the INTEGRATION software further demonstrates the benefits of the algorithm in increasing the bottleneck discharge rate, decreasing vehicle delay, and reducing vehicle fuel consumption and CO₂ emission levels. Specifically, compared with the base case without the SH algorithm, the advisory speed limit increases the bottleneck discharge rate by approximately 7%, reduces the overall system delay by approximately 20%, and reduces the system-wide fuel consumption and CO₂ emission levels by 5%.     

A fuzzy logic‐based variable speed limit controller

Variable speed limit (VSL) is an emerging intelligent transportation system (ITS) measure to improve operational and safety performance of motorway systems. Rule‐based algorithms have been widely used in VSL applications because of their comprehensibility and ease of application. However, most of the algorithms proposed in the literature under this category are rather rough for the speed control. Pre‐specified rules show some difficulties in appropriately activating/deactivating control actions in real time because of non‐stationary and nonlinear nature of the traffic system. This paper proposes a fuzzy logic‐based VSL control algorithm as an alternative to the existing VSL control algorithms. The proposed algorithm uses fuzzy sets instead of crisp sets to allow the separation of attribute domains into several overlapping intervals. The discretization using fuzzy sets can help to overcome the sensitivity problem caused by crisp discretization used in the existing VSL algorithms. The proposed algorithm is assessed for a test bed in Auckland using AIMSUN micro‐simulator and verified against a well‐known VSL algorithm. The simulation results show that the proposed algorithm outperforms the existing one to improve the efficiency performance of the motorway system with the critical bottleneck capacity increased by 6.42% and total travel time reduced by 12.39% when compared to a no‐control scenario. Copyright © 2015 John Wiley & Sons, Ltd.     

Ramp metering and freeway bottleneck capacity

This study aims to determine whether ramp meters increase the capacity of active freeway bottlenecks. The traffic flow characteristics at 27 active bottlenecks in the Twin Cities have been studied for seven weeks without ramp metering and seven weeks with ramp metering. A methodology for systematically identifying active freeway bottlenecks in a metropolitan area is proposed, which relies on two occupancy threshold values and is compared to an established diagnostic method – transformed cumulative count curves. A series of hypotheses regarding the relationships between ramp metering and the capacity of active bottlenecks are developed and tested against empirical traffic data. It is found that meters increase the bottleneck capacity by postponing and sometimes eliminating bottleneck activations, accommodating higher flows during the pre-queue transition period, and increasing queue discharge flow rates after breakdown. Results also suggest that flow drops after breakdown and the percentage flow drops at various bottlenecks follow a normal distribution. The implications of these findings on the design of efficient ramp control strategies, as well as future research directions, are discussed.     

Integrated feedback ramp metering and mainstream traffic flow control on motorways using variable speed limits

Ramp metering (RM) is the most direct and efficient tool for the motorway traffic flow management. However, because of the usually short length of the on-ramps, RM is typically deactivated to avoid interference of the created ramp queue with adjacent street traffic. By the integration of local RM with mainstream traffic flow control (MTFC) enabled via variable speed limits (VSL), control operation upstream of active bottlenecks could be continued even if the on-ramp is full or if the RM lower bound has been reached. Such integration is proposed via the extension of an existing local cascade feedback controller for MTFC-VSL by use of a split-range-like scheme that allows different control periods for RM and MTFC-VSL. The new integrated controller remains simple yet efficient and suitable for field implementation. The controller is evaluated in simulation for a real motorway infrastructure (a ring-road) fed with real (measured) demands and compared to stand-alone RM or MTFC-VSL, both with feedback and optimal control results. The controller’s performance is shown to meet the specifications and to approach the optimal control results for the investigated scenario.     

Effects of low speed limits on freeway traffic flow

Recent years have seen a renewed interest in Variable Speed Limit (VSL) strategies. New opportunities for VSL as a freeway metering mechanism or a homogenization scheme to reduce speed differences and lane changing maneuvers are being explored. This paper examines both the macroscopic and microscopic effects of different speed limits on a traffic stream, especially when adopting low speed limits. To that end, data from a VSL experiment carried out on a freeway in Spain are used. Data include vehicle counts, speeds and occupancy per lane, as well as lane changing rates for three days, each with a different fixed speed limit (80 km/h, 60 km/h, and 40 km/h). Results reveal some of the mechanisms through which VSL affects traffic performance, specifically the flow and speed distribution across lanes, as well as the ensuing lane changing maneuvers. It is confirmed that the lower the speed limit, the higher the occupancy to achieve a given flow. This result has been observed even for relatively high flows and low speed limits. For instance, a stable flow of 1942 veh/h/lane has been measured with the 40 km/h speed limit in force. The corresponding occupancy was 33%, doubling the typical occupancy for this flow in the absence of speed limits. This means that VSL strategies aiming to restrict the mainline flow on a freeway by using low speed limits will need to be applied carefully, avoiding conditions as the ones presented here, where speed limits have a reduced ability to limit flows. On the other hand, VSL strategies trying to get the most from the increased vehicle storage capacity of freeways under low speed limits might be rather promising. Additionally, results show that lower speed limits increase the speed differences across lanes for moderate demands. This, in turn, also increases the lane changing rate. This means that VSL strategies aiming to homogenize traffic and reduce lane changing activity might not be successful when adopting such low speed limits. In contrast, lower speed limits widen the range of flows under uniform lane flow distributions, so that, even for moderate to low demands, the under-utilization of any lane is avoided. These findings are useful for the development of better traffic models that are able to emulate these effects. Moreover, they are crucial for the implementation and assessment of VSL strategies and other traffic control algorithms.     

A dynamic traffic assignment model for the assessment of moving bottlenecks

Moving bottlenecks in highway traffic are defined as a situation in which a slow-moving vehicle, be it a truck hauling heavy equipment or an oversized vehicle, or a long convey, disrupts the continuous flow of the general traffic. The effect of moving bottlenecks on traffic flow is an important factor in the evaluation of network performance. This effect, though, cannot be assessed properly by existing transportation tools, especially when the bottleneck travels relatively long distances in the network.This paper develops a dynamic traffic assignment (DTA) model that can evaluate the effects of moving bottlenecks on network performance in terms of both travel times and traveling paths. The model assumes that the characteristics of the moving bottleneck, such as traveling path, physical dimensions, and desired speed, are predefined and, therefore, suitable for planned conveys.The DTA model is based on a mesoscopic simulation network-loading procedure with unique features that allow assessing the special dynamic characteristics of a moving bottleneck. By permitting traffic density and speed to vary along a link, the simulation can capture the queue caused by the moving bottleneck while preserving the causality principles of traffic dynamics.     

Using connected vehicle technology to improve the efficiency of intersections

Information from connected vehicles, such as the position and speed of individual vehicles, can be used to optimize traffic operations at an intersection. This paper proposes such an algorithm for two one-way-streets assuming that only a certain percentage of cars are equipped with this technology. The algorithm enumerates different sequences of cars discharging from the intersection to minimize the objective function. Benefits of platooning (multiple cars consecutively discharging from a queue) and signal flexibility (adaptability to demand) are also considered. The goal is to gain insights about the value (in terms of delay savings) of using connected vehicle technology for intersection control.Simulations are conducted for different total demand values and demand ratios to understand the effects of changing the minimum green time at the signal and the penetration rate of connected cars. Using autonomous vehicle control systems, the signal could rapidly change the direction of priority without relying on the reaction of drivers. However, without this technology a minimum green time is necessary. The results of the simulations show that a minimum green time increases the delay only for the low and balanced demand scenarios. Therefore, the value of using cars with autonomous vehicle control can only be seen at intersections with this kind of demand patterns, and could result in up to 7% decrease in delay. On the other hand, using information from connected vehicles to better adapt the traffic signal has proven to be indeed very valuable. Increases in the penetration rate from 0% up to 60% can significantly reduce the average delay (in low demand scenarios a decrease in delay of up to 60% can be observed). That being said, after a penetration rate of 60%, while the delays continue to decrease, the rate of reduction decreases and the marginal value of information from communication technologies diminishes. Overall, it is observed that connected vehicle technology could significantly improve the operation of traffic at signalized intersections, at least under the proposed algorithm.     

Real time queue length estimation for signalized intersections using travel times from mobile sensors

We study how to estimate real time queue lengths at signalized intersections using intersection travel times collected from mobile traffic sensors. The estimation is based on the observation that critical pattern changes of intersection travel times or delays, such as the discontinuities (i.e., sudden and dramatic increases in travel times) and non-smoothness (i.e., changes of slopes of travel times), indicate signal timing or queue length changes. By detecting these critical points in intersection travel times or delays, the real time queue length can be re-constructed. We first introduce the concept of Queue Rear No-delay Arrival Time which is related to the non-smoothness of queuing delay patterns and queue length changes. We then show how measured intersection travel times from mobile sensors can be processed to generate sample vehicle queuing delays. Under the uniform arrival assumption, the queuing delays reduce linearly within a cycle. The delay pattern can be estimated by a linear fitting method using sample queuing delays. Queue Rear No-delay Arrival Time can then be obtained from the delay pattern, and be used to estimate the maximum and minimum queue lengths of a cycle, based on which the real-time queue length curve can also be constructed. The model and algorithm are tested in a field experiment and in simulation.     

Unravelling effects of cooperative adaptive cruise control deactivation on traffic flow characteristics at merging bottlenecks

Cooperative Adaptive Cruise Control (CACC) systems have the potential to increase roadway capacity and mitigate traffic congestion thanks to the short following distance enabled by inter-vehicle communication. However, due to limitations in acceleration and deceleration capabilities of CACC systems, deactivation and switch to ACC or human-driven mode will take place when conditions are outside the operational design domain. Given the lack of elaborate models on this interaction, existing CACC traffic flow models have not yet been able to reproduce realistic CACC vehicle behaviour and pay little attention to the influence of system deactivation on traffic flow at bottlenecks. This study aims to gain insights into the influence of CACC on highway operations at merging bottlenecks by using a realistic CACC model that captures driver-system interactions and string length limits. We conduct systematic traffic simulations for various CACC market penetration rates (MPR) to derive free-flow capacity and queue discharge rate of the merging section and compare these to the capacity of a homogeneous pipeline section. The results show that an increased CACC MPR can indeed increase the roadway capacity. However, the resulting capacity in the merging bottleneck is much lower than the pipeline capacity and capacity drop persists in bottleneck scenarios at all CACC MPR levels. It is also found that CACC increases flow heterogeneity due to the switch among different operation modes. A microscopic investigation of the CACC operational mode and trajectories reveals a close relation between CACC deactivation, traffic congestion and flow heterogeneity.     

Platoons of connected vehicles can double throughput in urban roads

Intersections are the bottlenecks of the urban road system because an intersection’s capacity is only a fraction of the maximum flows that the roads connecting to the intersection can carry. This capacity can be increased if vehicles cross the intersections in platoons rather than one by one as they do today. Platoon formation is enabled by connected vehicle technology. This paper assesses the potential mobility benefits of platooning. It argues that saturation flow rates, and hence intersection capacity, can be doubled or tripled by platooning. The argument is supported by the analysis of three queuing models and by the simulation of a road network with 16 intersections and 73 links. The queuing analysis and the simulations reveal that a signalized network with fixed time control will support an increase in demand by a factor of (say) two or three if all saturation flows are increased by the same factor, with no change in the control. Furthermore, despite the increased demand vehicles will experience the same delay and travel time. The same scaling improvement is achieved when the fixed time control is replaced by the max pressure adaptive control. Part of the capacity increase can alternatively be used to reduce queue lengths and the associated queuing delay by decreasing the cycle time. Impediments to the control of connected vehicles to achieve platooning at intersections appear to be small.     

A continuous-flow-intersection-lite design and traffic control for oversaturated bottleneck intersections

Oversaturation has become a severe problem for urban intersections, especially the bottleneck intersections that cause queue spillover and network gridlock. Further improvement of oversaturated arterial traffic using traditional mitigation strategies, which aim to improve intersection capacity by merely adjusting signal control parameters, becomes challenging since exiting strategies may (or already) have reached their “theoretical” limits of optimum. Under such circumstance, several novel unconventional intersection designs, including the well-recognized continuous flow intersection (CFI) design, are originated to improve the capacity at bottleneck intersections. However, the requirement of installing extra sub-intersections in a CFI design would increase vehicular stops and, more critically, is unacceptable in tight urban areas with closed spaced intersections. To address these issues, this research proposes a simplified continuous flow intersection (called CFI-Lite) design that is ideal for arterials with short links. It benefits from the CFI concept to enable simultaneous move of left-turn and through traffic at bottleneck intersections, but does not need installation of sub-intersections. Instead, the upstream intersection is utilized to allocate left-turn traffic to the displaced left-turn lane. It is found that the CFI-Lite design performs superiorly to the conventional design and regular CFI design in terms of bottleneck capacity. Pareto capacity improvement for every traffic stream in an arterial system can be achieved under effortless conditions. Case study using data collected at Foothill Blvd in Los Angeles, CA, shows that the new design is beneficial in more than 90% of the 408 studied cycles. The testing also shows that the average improvements of green bandwidths for the synchronized phases are significant.     

A real-time adaptive signal control in a connected vehicle environment

The state of the practice traffic signal control strategies mainly rely on infrastructure based vehicle detector data as the input for the control logic. The infrastructure based detectors are generally point detectors which cannot directly provide measurement of vehicle location and speed. With the advances in wireless communication technology, vehicles are able to communicate with each other and with the infrastructure in the emerging connected vehicle system. Data collected from connected vehicles provides a much more complete picture of the traffic states near an intersection and can be utilized for signal control. This paper presents a real-time adaptive signal phase allocation algorithm using connected vehicle data. The proposed algorithm optimizes the phase sequence and duration by solving a two-level optimization problem. Two objective functions are considered: minimization of total vehicle delay and minimization of queue length. Due to the low penetration rate of the connected vehicles, an algorithm that estimates the states of unequipped vehicle based on connected vehicle data is developed to construct a complete arrival table for the phase allocation algorithm. A real-world intersection is modeled in VISSIM to validate the algorithms. Results with a variety of connected vehicle market penetration rates and demand levels are compared to well-tuned fully actuated control. In general, the proposed control algorithm outperforms actuated control by reducing total delay by as much as 16.33% in a high penetration rate case and similar delay in a low penetration rate case. Different objective functions result in different behaviors of signal timing. The minimization of total vehicle delay usually generates lower total vehicle delay, while minimization of queue length serves all phases in a more balanced way.     

Quasi-optimal feedback control for an isolated intersection under oversaturation

How to manage signalized intersections under oversaturated conditions is a long-standing problem in traffic science and engineering. However, although research works in this area date back to 1960s, an on-line control strategy with theoretically bounded performance is missing, even for the control of an isolated intersection under oversaturation. This paper makes one step further in this area by proposing a QUEUE-based quasi-optimal feedback control (abbreviated as QUEUE) strategy for an isolated oversaturated intersection. The QUEUE strategy is intuitive, simple, and proved to match the off-line optimum in the case of constant demand. More importantly, the bounds of sub-optimality of the QUEUE strategy can be specified quantitatively in general piece-wise constant demand cases. To better deal with the maximum queue constraints, the oversaturation period is divided into the queuing period and the dissipation period with two different objectives. In the queuing period, the primary objective is to keep the queue length within the maximum value; but for the dissipation period, the primary objective is to eliminate all queues at the earliest time. Interestingly, we found that both control objectives can be realized with the same QUEUE strategy. Numerical examples show that the QUEUE strategy approximates the off-line optimum very well. The average sub-optimality in comparison with the off-line optimum in the challenging conditions with Poisson distributed random demand is below 5%.     

Applications of wavelet transform for analysis of freeway traffic: Bottlenecks, transient traffic, and traffic oscillations

This paper demonstrates the capabilities of wavelet transform (WT) for analyzing important features related to bottleneck activations and traffic oscillations in congested traffic in a systematic manner. In particular, the analysis of loop detector data from a freeway shows that the use of wavelet-based energy can effectively identify the location of an active bottleneck, the arrival time of the resulting queue at each upstream sensor location, and the start and end of a transition during the onset of a queue. Vehicle trajectories were also analyzed using WT and our analysis shows that the wavelet-based energies of individual vehicles can effectively detect the origins of deceleration waves and shed light on possible triggers (e.g., lane-changing). The spatiotemporal propagations of oscillations identified by tracing wavelet-based energy peaks from vehicle to vehicle enable analysis of oscillation amplitude, duration and intensity.     

Network traffic flow optimization under performance constraints

In this paper, a model-based perimeter control policy for large-scale urban vehicular networks is proposed. Assuming a homogeneously loaded vehicle network and the existence of a well-posed Network Fundamental Diagram (NFD), we describe a protected network throughout its aggregated dynamics including nonlinear exit flow characteristics. Within this framework of constrained optimal boundary flow gating, two main performance metrics are considered: (a) first, connected to the NFD, the concept of average network travel time and delay as a performance metric is defined; (b) second, at boundaries, we take into account additional external network queue dynamics governed by uncontrolled inflow demands. External queue capacities in terms of finite-link lengths are used as the second performance metric. Hence, the corresponding performance requirement is an upper bound of external queues. While external queues represent vehicles waiting to enter the protected network, internal queue describes the protected network’s aggregated behavior.By controlling the number of vehicles joining the internal queue from the external ones, herewith a network traffic flow maximization solution subject to the internal and external dynamics and their performance constraints is developed. The originally non-convex optimization problem is transformed to a numerically efficiently convex one by relaxing the performance constraints into time-dependent state boundaries. The control solution can be interpreted as a mechanism which transforms the unknown arrival process governing the number of vehicles entering the network to a regulated process, such that prescribed performance requirements on travel time in the network and upper bound on the external queue are satisfied. Comparative numerical simulation studies on a microscopic traffic simulator are carried out to show the benefits of the proposed method.     

Integrated sequencing and merging aircraft to parallel runways with automated conflict resolution and advanced avionics capabilities

Congestion in Terminal Maneuvering Area (TMA) in hub airports is the main problem in Chinese air transportation. In this paper we propose a new system to integrated sequence and merge aircraft to parallel runways at Beijing Capital International Airport (BCIA). This system is based on the advanced avionics capabilities. Our methodology integrates a Multi-Level Point Merge (ML-PM) system, an economical descent approaches procedure, and a tailored heuristic algorithm to find a good, systematic, operationally-acceptable solution. First, Receding Horizontal Control (RHC) technique is applied to divide the entire 24 h of traffic into several sub-problems. Then in each sub-problem, it is optimized on given objectives (conflict, deviation from Estimated Time of Arrival (ETA) on the runway and makespan of the arrival flow). Four decision variables are designed to control the trajectory: the entry time, the entry speed, the turning time on the sequencing leg, and the landing runway allocation. Based on these variables, the real time trajectories are generated by the simulation module. Simulated Annealing (SA) algorithm is used to search the best solution for aircraft to execute. Finally, the conflict-free, least-delay, and user-preferred trajectories from the entry point of TMA to the landing runway are defined. Numerical results show that our optimization system has very stable de-conflict performance to handle continuously dense arrivals in transition airspace. It can also provide the decision support to assist flow controllers to handle the asymmetric arrival flows on different runways with less fuel consumption, and to assist tactical controllers to easily re-sequence aircraft with more relaxed position shifting. Moreover, our system can provide the fuel consumption prediction, and runway assignment information to assist airport and airlines managers for optimal decision making. Theoretically, it realizes an automated, cooperative and green control of routine arrival flows. Although the methodology defined here is applied to the airport BCIA, it could also be applied to other airports in the world.     

Increasing the capacity of an isolated merge by metering its on-ramp

Measurements taken downstream of freeway/on-ramp merges have previously shown that discharge flow diminishes when a merge becomes an isolated bottleneck. By means of observation and experiment, we show here that metering an on-ramp can recover the higher discharge flow at a merge and thereby increase the merge capacity. Detailed observations were collected at a single merge using video. These data revealed that the reductions in discharge flow are triggered by a queue that forms near the merge in the freeway shoulder lane and then spreads laterally, as drivers change lanes to maneuver around slow traffic. Our experiments show that once restrictive metering mitigated this shoulder lane queue, high outflows often returned to the median lane. High merge outflows could be restored in all freeway lanes by then relaxing the metering rate so that inflows from the on-ramp increased. Although outflows recovered in this fashion were not sustained for periods greater than 13 min, the findings are the first real evidence that ramp metering can favorably affect the capacity of an isolated merge. Furthermore, these findings point to control strategies that might generate higher outflows for more prolonged periods and increase merge capacity even more. Finally, the findings uncover details of merge operation that are essential for developing realistic theories of merging traffic.     

Accounting for dynamic speed limit control in a stochastic traffic environment: A reinforcement learning approach

This paper proposes a novel dynamic speed limit control model accounting for uncertain traffic demand and supply in a stochastic traffic network. First, a link based dynamic network loading model is developed to simulate the traffic flow propagation allowing the change of speed limits. Shockwave propagation is well defined and captured by checking the difference between the queue forming end and the dissipation end. Second, the dynamic speed limit problem is formulated as a Markov Decision Process (MDP) problem and solved by a real time control mechanism. The speed limit controller is modeled as an intelligent agent interacting with the stochastic network environment stochastic network environment to assign time dependent link based speed limits. Based on different metrics, e.g. total network throughput, delay time, vehicular emissions are optimized in the modeling framework, the optimal speed limit scheme is obtained by applying the R-Markov Average Reward Technique (R-MART) based reinforcement learning algorithm. A case study of the Sioux Falls network is constructed to test the performance of the model. Results show that the total travel time and emissions (in terms of CO) are reduced by around 18% and 20% compared with the base case of non-speed limit control.     

Methods to reduce dimensionality and identify candidate solutions in multi-objective signal timing problems

Adjusting traffic signal timings is a practical way for agencies to manage urban traffic without the need for significant infrastructure investments. Signal timings are generally selected to minimize the total control delay vehicles experience at an intersection, particularly when the intersection is isolated or undersaturated. However, in practice, there are many other potential objectives that might be considered in signal timing design, including: total passenger delay, pedestrian delays, delay inequity among competing movements, total number of stopping maneuvers, among others. These objectives do not tend to share the same relationships with signal timing plans and some of these objectives may be in direct conflict. The research proposes the use of a new multi-objective optimization (MOO) visualization technique—the mosaic plot—to easily quantify and identify significant tradeoffs between competing objectives using the set of Pareto optimal solutions that are normally provided by MOO algorithms. Using this tool, methods are also proposed to identify and remove potentially redundant or unnecessary objectives that do not have any significant tradeoffs with others in an effort to reduce problem dimensionality. Since MOO procedures will still be needed if more than one objective remains and MOO algorithms generally provide a set of candidate solutions instead of a single final solution, two methods are proposed to rank the set of Pareto optimal solutions based on how well they balance between the competing objectives to provide a final recommendation. These methods rely on converting the objectives to dimensionless values based on the optimal value for each specific objectives, which allows for direct comparison between and weighting of each. The proposed methods are demonstrated using a simple numerical example of an undersaturated intersection where all objectives can be analytically obtained. However, they can be readily applied to other signal timing problems where objectives can be obtained using simulation outputs to help identify the signal timing plan that provides the most reasonable tradeoff between competing objectives.