Search

• The paper proposes a traffic signal control method at a perimeter with time-varying geometry. • The geometry of the perimeter adapts to the spatio-temporal evolution of traffic congestion, modeled using percolation theory. • The proposed control effectively mitigates the spatial heterogeneity of congestion to boost the network-level traffic capacity. • The performance of the proposed control is compared with multiple well-established methods through simulation-based analysis. Perimeter control regulates the traffic flows between different regions of a road network by coordinating the signal timings at region boundaries with the aim of improving the overall network performance. The method is proved to be effective in optimizing urban road traffic and is a crucial component of the modern intelligent transportation systems. A possible shortcoming of classical perimeter control is its limiting perception of congestion propagation dynamics, viewing congestion only through aggregated or local properties, e.g., traffic accumulation within the perimeter or queue length at each intersection. Furthermore, restricting traffic via gating by conventional perimeter control may trigger formation of congested queues at the control boundary. In this work, we tackle this problem with control at a dynamic perimeter where the geometry of the boundary evolves over time according to the congestion propagation dynamics. The proposed dynamic perimeter control utilizes percolation theory, a well-established theory for studying statistical physics of spreading phenomena, to analyze the evolving congestion and adapt the shape of the perimeter accordingly. The percolation-based dynamic perimeter effectively adjusts to propagating congestion and prevent small congestion pockets from merging into a larger congested cluster. We demonstrate the performance of the proposed approach in a typical grid network. Our results show that i) the percolation analysis is able to effectively characterize the spatio-temporal evolution of the congestion for the purpose of traffic signal control, ii) adjusting the control dynamically according to percolation-based analysis of congestion successfully balances the traffic leading to boosting the flow capacity of the network, and iii) the percolation-based dynamic perimeter control significantly improves the network traffic performance, compared to the classic fixed perimeter control. This study applies percolation theory and for the first time incorporates an account for the geometrical properties of congestion propagation in traffic signal control, aiming at preventing the emergence of large-scale connected jams. [ABSTRACT FROM AUTHOR]

Traffic congestion in urban environment is one of the most critical issue for drivers and city planners for both environment and efficiency reasons. Traffic lights are one of the main tools used to regulate traffic by diverting the drivers between different paths. Rational drivers, in turn, react to the traffic light duration by evaluating their options and, if necessary, by changing direction in order to reach their destination quicker. In this paper, we introduce a macroscopic traffic model for urban intersections that incorporates this rational behavior of the drivers. Then, we exploit it to show that, by providing additional information about the expected red-time duration to the drivers, one can decrease the amount of congestion in the network and the overall length of the queues at the intersections. Additionally, we develop a control policy for the traffic lights that exploits the reaction of the drivers in order to divert them to a different route to further increase the performances. These claims are supported by extensive numerical simulations. • A traffic-flow macroscopic model of the drivers' rational decision-making. • It considers origin-destination pairs and the ability to show the red time duration. • Numerical simulations illustrate the effectiveness of showing the red time duration. • A novel control policy that exploit the drivers' reaction to the red time duration. • The increased efficiency of the controller is validated with extensive simulations. [ABSTRACT FROM AUTHOR]

• This work focuses on macroscopic traffic flow model calibration and validation of large freeway networks. • An intensive literature review is presented on the subject to determine the strengths and weaknesses of various technical paths, and figure out a viable roadmap for future studies. • The paper proposes a benchmarking framework concerning some of the key factors about macroscopic traffic flow model calibration and validation, which including congestion tracking, traffic flow inhomogeneity, adverse weather conditions and accidents, capacity drop, scattering, hysteresis, stop-and-go waves, and traffic heterogeneity. • The paper presents comprehensive results of model calibration and validation concerning key factors included in the benchmarking framework as stated above. • Works of the same focus were not reported before. Macroscopic traffic flow models are of paramount importance to traffic surveillance and control. Before their employments in applications, the models need to be calibrated and validated against real traffic data. The model calibration determines an optimal set of model parameters that minimizes the discrepancy between the modeling results and real traffic data. The model validation is furthermore performed to corroborate the accuracy of a calibrated model using data other than used for calibration. The model calibration aims to reflect traffic reality, while model validation focuses on the prediction of future traffic using calibrated models. This paper delivers a comprehensive review of state-of-the-art works on macroscopic model calibration and validation, proposes a benchmarking framework on traffic flow modeling, and has conducted a large number of case studies based on the framework using macroscopic traffic flow model METANET with respect to the urban expressway network in Shanghai. In comparison to previous works, quite more comprehensive results on model calibration have been presented in this paper, in consideration of congestion tracking, traffic flow inhomogeneity, capacity drop, stop-and-go waves, scattering, adverse weather conditions, and accidents. The paper has also reported many results of model validation with respect to the same field examples. The results demonstrate that METANET is able to model complex traffic flow dynamics in large-scale freeway networks with sufficient accuracy. The paper is closed with discussion on limitations and future works. [ABSTRACT FROM AUTHOR]

• A data-driven route flow estimation framework is proposed using data from automatic vehicle identification sensors and probe vehicle trajectories. • A prior-information-free objective function is constructed using the notion of flow probe vehicle route penetration rate and route travel time. • The information of observable route flow and observable route travel time is integrated into the estimation model. • The solution uniqueness is guaranteed though an iterative procedure under the entropy maximum principle. Accurate estimation of route flow is crucial to traffic control optimization. Existing route flow estimation models are typically built upon strong assumptions on traveler route choice behavior or turn to data-driven approaches which heavily rely on prior OD estimation and high sensor coverage rate. This study proposes a route flow estimation framework by fusing the probe vehicle trajectory and automated vehicle identification (AVI) data. The notion of probe vehicle route penetration rate (RPR) is utilized for the construction of a novel data-driven objective function. Sensor-OD flow and observable route flow penetration are formulated as model constraints. The solution uniqueness is guaranteed though an iterative procedure under the principle of entropy maximization. Numerical studies are conducted based on pNEUMA, a large-scale full sample trajectory dataset. Results show that the proposed model performs better than the traditional path flow estimation model, especially when the prior flow information is not available. Sensitivity analysis on AVI sensor coverage rate, probe vehicle route coverage rate and RPR distribution demonstrates the proposed model's applicability in practice. [ABSTRACT FROM AUTHOR]

Conventional reinforcement learning (RL) models of variable speed limit (VSL) control systems (and traffic control systems in general) cannot be trained in real traffic process because new control actions are usually explored randomly, which may result in high costs (delays) due to exploration and learning. For this reason, existing RL-based VSL control approaches need a traffic simulator for training. However, the performance of those approaches are dependent on the accuracy of the simulators. This paper proposes a new RL-based VSL control approach to overcome the aforementioned problems. The proposed VSL control approach is designed to improve traffic efficiency by using VSLs against freeway jam waves. It applies an iterative training framework, where the optimal control policy is updated by exploring new control actions both online and offline in each iteration. The explored control actions are evaluated in real traffic process, thus it avoids that the RL model learns only from a traffic simulator. The proposed VSL control approach is tested using a macroscopic traffic simulation model to represent real world traffic flow dynamics. By comparing with existing VSL control approaches, the proposed approach is demonstrated to have advantages in the following two aspects: (i) it alleviates the impact of model mismatch, which occurs in both model-based VSL control approaches and existing RL-based VSL control approaches, via replacing knowledge from the models by knowledge from the real process, and (ii) it significantly reduces the exploration and learning costs compared to existing RL-based VSL control approaches. • An RL-based VSL control approach against freeway jam waves is developed. • The proposed method alleviates model mismatch via online/offline learning. • The proposed method has less exploration and learning costs than random exploration. • The proposed method is compared with various of existing VSL approaches. [ABSTRACT FROM AUTHOR]

Connected and automated vehicle (CAV) technology is widely recognized as a promising way to improve traffic safety, fuel efficiency and network throughput. However, at the early stage of CAV adoption, there will inevitably be a long period when both CAVs and regular vehicles coexist in the traffic system. To facilitate CAV functionalities in mixed traffic, providing dedicated rights of way for CAVs is necessary. In such scenarios, traffic control requires careful design in the weaving areas that allow CAVs to transfer between dedicated roads and ordinary roads for both safety and efficiency considerations. This paper proposes a dynamic programming approach for the coordinated trajectory planning of CAVs in mandatory lane-changing scenarios, in which CAVs have to switch from a dedicated CAV lane into parallel ordinary lanes with mixed traffic. For a group of CAVs that are poised to enter the ordinary road, the proposed method aims to provide each CAV with a suggested lane-changing gap and a reference trajectory in a coordinated manner. To solve the problem, we establish a dynamic programming formulation to determine the suggested gaps for all CAVs. We formulate a nonconvex quadratic-constrained quadratic programming (QCQP) problem to characterize the trajectory determination problem, and a relaxation-based approximate algorithm is developed to solve the QCQP. Simulation results show that, compared to the benchmark methods, the proposed method offers substantial benefits both in terms of traffic efficiency and in-vehicle passengers experiences. • Planning of lane-changing from dedicated CAV lanes to non-cooperative HDV traffic. • Coordinated optimization toward efficient and smooth lane-changing trajectories. • Novel algorithm to decompose optimization problems based on dynamic programming. [ABSTRACT FROM AUTHOR]

• The multi-objective optimization including EV energy consumption optimization has been specified and applied. • A comparison between the proposed multi-objective control strategy and the mixed (combining traffic control and speed optimization) strategy is performed. • All analyses are carried out for different powertrain vehicle categories, ICEVs, and EVs. • A link-based macroscopic energy consumption function for EVs was derived from microscopic data. • The VT-CPEM model was adopted to simulate consumption at a signalized intersection. • The model was thoroughly calibrated based on real-world individual trajectories at signalized intersections. Cooperative control in the presence of connected and automated vehicles has attracted substantial attention due to its pronounced benefits on the network compared with human-driven vehicles. They make possible a significant reduction of travel time/waiting time, energy consumption and emissions. In this context of new emerging technologies, traffic lights are still recognized as one of the most effective strategies in terms of energy and environmental benefits, which can be further improved by considering the integration with greener powertrains. The paper proposes a cooperative network traffic management framework for Electric Vehicles (EVs) based on a multi-objective optimization aimed at minimizing the total time spent (TTS) and energy consumption (EC) of EVs. Such framework is composed of i) a traffic control model that incorporates traffic lights design, ii) a traffic flow model to estimate TTS as a network performance indicator, and iii) an EVs model to estimate EC at the intersections. The EC function has been derived from a VT-CPEM model to simulate consumptions and thoroughly calibrated based on real-world individual trajectories. The optimization framework was implemented on a nine-node network and the results of the multi-criteria optimization (aiming at minimizing the TTS and EC of EV) are compared with results of the benchmark mono - criterion optimization (aiming at minimizing the TTS) and the mono-criterion optimization combined with the speed advisory (GLOSA; Green Light Optimized Speed Advisory). All the proposed analyses were carried out for different powertrain vehicle categories; ICEVs, and EVs. [ABSTRACT FROM AUTHOR]

Developing microscopic traffic simulation models requires the knowledge of probability distributions of microscopic traffic variables. Although previous studies have proposed extensive mathematical distributions for describing traffic variables (e.g., speed, headway, vehicle length, etc.), these studies usually consider microscopic traffic observations to be independent variables and distributions for these variables are investigated separately. As a result, some traditional approaches consider microscopic traffic variables as independent inputs to the traffic simulation process and these methods may ignore the possible dependence among different traffic variables. The objectives of this paper are to investigate the dependence structure among microscopic traffic variables and to examine the applicability of the copula approach to the joint modeling of these variables. Copulas are functions that relate multivariate distribution functions of random variables to their one-dimensional marginal distribution functions. The concept of copulas has been well recognized in the statistics field and recently has been introduced in transportation studies. The proposed copula approach is applied to the 24-h traffic data collected on IH-35 in Austin, Texas. The preliminary data analysis indicates that there exists dependence among microscopic traffic variables. Moreover, the modeling and simulation results suggest that copula models can adequately accommodate and accurately reproduce the dependence structure revealed by the traffic observations. Overall, the findings in this paper provide a framework for generating multiple microscopic traffic variables simultaneously by considering their dependence. [ABSTRACT FROM AUTHOR]

To estimate travel times through road networks, in this study, we assume a stochastic demand and formulate a stochastic network equilibrium model whose travel times, flows, and demands are stochastic. This model enables us to examine network reliability under stochastic circumstances and to evaluate the effect of providing traffic information on travel times. For traffic information, we focus on travel time information and propose methods to evaluate the effect of providing that information. To examine the feasibility and validity of the proposed model and methods, we apply them to a simple network and the real road network of Kanazawa, Japan. The results indicate that providing ambulance drivers in Kanazawa with travel time information leads to an average reduction in travel time of approximately three minutes. [ABSTRACT FROM AUTHOR]

We consider an analytical signal control problem on a signalized network whose traffic flow dynamic is described by the Lighthill–Whitham–Richards (LWR) model (Lighthill and Whitham, 1955; Richards, 1956). This problem explicitly addresses traffic-derived emissions as constraints or objectives. We seek to tackle this problem using a mixed integer mathematical programming approach. Such class of problems, which we call LWR-Emission (LWR-E), has been analyzed before to certain extent. Since mixed integer programs are practically efficient to solve in many cases (Bertsimas et al., 2011b), the mere fact of having integer variables is not the most significant challenge to solving LWR-E problems; rather, it is the presence of the potentially nonlinear and nonconvex emission-related constraints/objectives that render the program computationally expensive. To address this computational challenge, we proposed a novel reformulation of the LWR-E problem as a mixed integer linear program (MILP). This approach relies on the existence of a statistically valid macroscopic relationship between the aggregate emission rate and the vehicle occupancy on the same link. This relationship is approximated with certain functional forms and the associated uncertainties are handled explicitly using robust optimization (RO) techniques. The RO allows emissions-related constraints and/or objectives to be reformulated as linear forms under mild conditions. To further reduce the computational cost, we employ a link-based LWR model to describe traffic dynamics with the benefit of fewer (integer) variables and less potential traffic holding. The proposed MILP explicitly captures vehicle spillback, avoids traffic holding, and simultaneously minimizes travel delay and addresses emission-related concerns. [ABSTRACT FROM AUTHOR]

In this paper we propose an adaptive large neighborhood search heuristic for a ship routing and scheduling problem with voyage separation requirements. The voyage separation requirement is modeled as the minimum time elapsed between two consecutive sailings on a trade, and yields solutions with voyages fairly evenly spread over the planning horizon. Voyage separation requires the schedule of each ship to be synchronized with those of the others, since the start of service of a voyage could affect the feasible start time of another voyage. The proposed heuristic is compared with an exact algorithm on several instances, and yields good quality solutions within relatively short computation times. [ABSTRACT FROM AUTHOR]

In this paper, a new rich Vehicle Routing Problem that could arise in a real life context is introduced and formalized: the Multi Depot Multi Period Vehicle Routing Problem with a Heterogeneous Fleet. The goal of the problem is to minimize the total delivery cost. A heterogeneous fleet composed of vehicles with different capacity, characteristics (i.e. refrigerated vehicles) and hourly costs is considered. A limit on the maximum route duration is imposed. Unlike what happens in classical multi-depot VRP, not every customer may/will be served by all the vehicles or from all the depots. The planning horizon, as in most real life applications, consists of multiple periods, and the period in which each route is performed is a variable of the problem. The set of periods, within the time horizon, in which the delivery may be carried out is known for each customer. A Mixed Integer Programming (MIP) formulation for MDMPVRPHF is presented in this paper, and an Adaptive Large Neighborhood Search (ALNS) based Matheuristic approach is proposed, in which different destroy operators are defined. Computational results, pertaining to realistic instances, which show the effectiveness of the proposed method, are provided. [ABSTRACT FROM AUTHOR]

This study explores an innovative framework for distributed traffic monitoring and information aggregation using vehicle-to-vehicle (V2V) communications alone. We envision the proposed framework as the foundation to an alternative or supplemental traffic operation and management system, which could be particularly helpful under abnormal traffic conditions caused by unforeseen disasters and special events. Each equipped vehicle, through the distributed protocols developed, keeps track of the average traffic density and speed within a certain range, flags itself as micro-discontinuity in traffic if appropriate, and cross-checks its flag status with its immediate up- and down-stream vehicles. The micro-discontinuity flags define vehicle groups with similar traffic states, for initiating and terminating traffic information aggregation. The framework is validated using a microscopic traffic simulation platform VISSIM and its built-in component object model. Vehicle groups are successfully identified and their average speed and density effectively estimated. The impact of market penetration rate (MPR) is also investigated with a new methodology for performance evaluation under multiple traffic scenarios. Our simulation results show that the proposed framework lends itself better to more congested traffic conditions for any given MPR. With 50% MPR, the framework is able to provide information coverage for at least 37.76% of the simulated roadway facility under various traffic scenarios. This indicates that proposed framework could be useful with an MPR as low as 50%. Even with an MRP of 20%, the coverage ratio, under relatively congested traffic, can still reach around 58.82%. The framework is able to provide accurate speed estimation at high spatial resolution for the simulated roadway facility. The maximum relative error is under 10% for relatively congested traffic even with MPR as low as 20%. When there is a wider range of speed distribution (less congested traffic), the worst-case maximum relative error is still under 15% when MPR = 20 % . The density estimation is more sensitive to MPR, and is more accurate under low demand and high MPR scenarios. As expected, the accuracy of both speed and density estimation increases with MPR for any given traffic scenario. [ABSTRACT FROM AUTHOR]

Traffic operations for new road layouts are often simulated using microscopic traffic simulation packages. These traffic simulation packages usually simulate traffic on freeways by a combination of a car-following model and a lane change model. The car-following models have gained attention of researchers and are well calibrated versus data. The proposed lane change models are often representations of assumed reasonable behavior, not necessarily corresponding to reality. The current simulation packages apply solely one specific type of model for car-following or lane changing for all vehicles during the simulation. This paper investigates the decision process of lane changing maneuvers for a variety of drivers based on a two-stage test-drive. Participants are asked to take a drive on a freeway in the Netherlands in a camera-equipped vehicle. Afterwards, the drivers are asked to comment on their choices related to lane and speed choice, while watching the video. This paper reveals that different drivers have completely different strategies to choose lanes, and the choices to change lane are related to their speed choice. Four distinct strategies are empirically found. These strategies differ not only in parameter values, as is currently being modeled in most simulation packages, but also in their reasoning. Most remarkably, all drivers perceive their strategy as an obvious behavior and expect all other drivers to drive in a similar way. In addition to the interviews of the participants in the test-drive, 11 people who did not take part in the experiment were interviewed and questioned on lane change decisions. Moreover, the findings of this study have been presented to various groups of audience with different backgrounds (about 150 people). Their comments and feedback on the derived driving strategies have added some value to this study. The findings in this paper form a starting point for developing a novel lane change model which considers four different driving strategies among the drivers on freeway. This is a significant contribution in the area of driving behavior modeling, since the existing microscopic simulators consider only one type of lane change models for all drivers during the simulation. This could lead to significant changes in the way lane changes on freeways are modeled. [ABSTRACT FROM AUTHOR]

Poor driving habits such as not using turn signals when changing lanes present a major challenge to advanced driver assistance systems that rely on turn signals. To address this problem, we propose a novel algorithm combining the hidden Markov model (HMM) and Bayesian filtering (BF) techniques to recognize a driver’s lane changing intention. In the HMM component, the grammar definition is inspired by speech recognition models, and the output is a preliminary behavior classification. As for the BF component, the final behavior classification is produced based on the current and preceding outputs of the HMMs. A naturalistic data set is used to train and validate the proposed algorithm. The results reveal that the proposed HMM–BF framework can achieve a recognition accuracy of 93.5% and 90.3% for right and left lane changing, respectively, which is a significant improvement compared with the HMM-only algorithm. The recognition time results show that the proposed algorithm can recognize a behavior correctly at an early stage. [ABSTRACT FROM AUTHOR]

The primary objective of the study was to evaluate the impacts of an unconventional left-turn treatment called contraflow left-turn lane (CLL) on the operational performance of left-turn movement at signalized intersections. An analytical model was developed for estimating the capacity of left-turn movement at signalized intersections with the CLL design. The capacity model was calibrated and validated using field data collected at six approaches at five signalized intersections in the city of Handan, China. The results of field data analyses showed that the use of CLL design improved the capacity of left-turn movements. However, the capacity gains with the CLL design were quite stochastic considering the randomness in the arrivals of left-turning vehicles. Analytical delay models were proposed for estimating the delay to left-turning vehicles at intersections with the CLL design. A procedure was also proposed for optimizing the location of the upstream median opening and the green interval of the pre-signal. Simulation analyses were conducted to compare the delay experienced by the left-turning and through vehicles at signalized intersections with the conventional left-turn lane, the CLL and another unconventional left-turn treatment entitled “tandem design”. The results showed that both CLL and tandem designs outperformed conventional left-turn lane design; and the CLL design generated less delay to both the left-turning and through vehicles as compared with the tandem design. [ABSTRACT FROM AUTHOR]

The traffic-restraint congestion-pricing scheme (TRCPS) aims to maintain traffic flow within a desirable threshold for some target links by levying the appropriate link tolls. In this study, we propose a trial-and-error method using observed link flows to implement the TRCPS with the day-to-day flow dynamics. Without resorting to the origin–destination (O–D) demand functions, link travel time functions and value of time (VOT), the proposed trial-and-error method works as follows: tolls for the traffic-restraint links are first implemented each time (trial) and they are subsequently updated using observed link flows in a disequilibrium state at any arbitrary time interval. The trial-and-error method has the practical significance because it is necessary only to observe traffic flows on those tolled links and it does not require to wait for the network flow pattern achieving the user equilibrium (UE) state. The global convergence of the trial-and-error method is rigorously demonstrated under mild conditions. We theoretically show the viability of the proposed trial-and-error method, and numerical experiments are conducted to evaluate its performance. The result of this study, without doubt, enhances the confidence of practitioners to adopt this method. [ABSTRACT FROM AUTHOR]

Traffic breakdown to global gridlock occurring in congested traffic network makes the serious traffic congestion even much worse. This paper has proposed to use Network Operation Reliability (NOR) to quantitatively depict the probabilistic feature of traffic breakdown to global gridlock. The Nagel–Schreckenberg cellular automaton model has been used to simulate the traffic flow in a Manhattan-like urban network. A simple adaptive traffic light strategy has been proposed. It has been shown that if vehicles choose to use geometric shortest path, the adaptive traffic signals are able to remarkably enhance the NOR and sometimes the average velocity and the arrival rate as well. The vehicle distribution has been investigated, which has heuristically explained the enhancement of the NOR. A simple perimeter control strategy has been shown to fail to enhance the NOR. Finally, we show that if the time shortest path information could be provided and updated timely, then the NOR can be remarkably enhanced but the adaptive traffic signals have only trivial effect on NOR. [ABSTRACT FROM AUTHOR]

Connected Vehicles (CV) equipped with a Speed Advisory System (SAS) can obtain and utilize upcoming traffic signal information to manage their speed in advance, lower fuel consumption, and improve ride comfort by reducing idling at red lights. In this paper, a SAS for pre-timed traffic signals is proposed and the fuel minimal driving strategy is obtained as an analytical solution to a fuel consumption minimization problem. We show that the minimal fuel driving strategy may go against intuition of some people; in that it alternates between periods of maximum acceleration, engine shut down, and sometimes constant speed, known in optimal control as bang-singular-bang control. After presenting this analytical solution to the fuel minimization problem, we employ a sub-optimal solution such that drivability is not sacrificed and show fuel economy still improves significantly. Moreover this paper evaluates the influence of vehicles with SAS on the entire arterial traffic in micro-simulations. The results show that SAS-equipped vehicles not only improve their own fuel economy, but also benefit other conventional vehicles and the fleet fuel consumption decreases with the increment of percentage of SAS-equipped vehicles. We show that this improvement in fuel economy is achieved with a little compromise in average traffic flow and travel time. [ABSTRACT FROM AUTHOR]

In the considered automated container terminal (ACT) that is designed for Shanghai Yangsha Terminal, two automated stacking cranes (ASCs) are configured for each block and they interact with automated lifting vehicles (ALVs) at the two ends of a block individually. To increase the capacity, container yards with multiple rows of blocks perpendicular to the terminal’s shoreline are considered. To utilize the yard spaces, the twin ASCs are devised to share the same tracks installed at the two sides of a block, while interferences between the ASCs challenge the routing and sequencing operations. To isolate the control and simplify the coordination of the two ASCs, the interference between ASCs is formulated by analyzing the minimal temporal intervals between any two tasks. Three models are then established to sequence the container handling tasks under the minimization of the makespan. An exact algorithm and a genetic algorithm are designed to solve the problem. Numerical experiments show that the algorithms are competitive comparing to on-the-shelf solvers. Practical implications are investigated based on the formulations and experimental results. The managerial implications and technological aspects of applying the formulations and algorithms to practical situations to real-world ACTs are discussed. [ABSTRACT FROM AUTHOR]

How to calibrate the parameters of car-following models based on observed traffic data is a vital problem in traffic simulation. Usually, the core of calibration is cast into an optimization problem, in which the decision variables are car-following model parameters and the objective function usually characterizes the difference between empirical vehicle movements and their simulated correspondences. Since the objective function is usually nonlinear and non-convex, various greedy or stochastic algorithms had been proposed during the last two decades. However, the performance of these algorithms remains to be further examined. In this paper, we revisit this important problem with a special focus on the geometric feature of the objective function. First, we prove that, from a global perspective, most existing objective functions are Lipschitz continuous. Second, we show that, from a local perspective, many of these objective functions are relatively flat around the global optimal solution. Based on these two features, we propose a new global optimization algorithm that integrates global direct search and local gradient search to find the optimal solution in an efficient manner. We compare this new algorithm with several existing algorithms, including Nelder–Mead (NM) algorithm, sequential quadratic programming (SQP) algorithm, genetic algorithm (GA), and simultaneous perturbation stochastic approximation (SPSA) algorithm, on NGSIM trajectory datasets. Results demonstrate that the proposed algorithm has a fast convergence speed and a high probability of finding the global optimal solution. Moreover, it has only two major configuration parameters that can be easily determined in practice. [ABSTRACT FROM AUTHOR]

Traffic signals, even though crucial for safe operations of busy intersections, are one of the leading causes of travel delays in urban settings, as well as the reason why billions of gallons of fuel are burned, and tons of toxic pollutants released to the atmosphere each year by idling engines. Recent advances in cellular networks and dedicated short-range communications make Vehicle-to-Infrastructure (V2I) communications a reality, as individual cars and traffic signals can now be equipped with communication and computing devices. In this paper, we first presented an integrated simulator with V2I, a car-following model and an emission model to simulate the behavior of vehicles at signalized intersections and calculate travel delays in queues, vehicle emissions, and fuel consumption. We then present a hierarchical green driving strategy based on feedback control to smooth stop-and-go traffic in signalized networks, where signals can disseminate traffic signal information and loop detector data to connected vehicles through V2I communications. In this strategy, the control variable is an individual advisory speed limit for each equipped vehicle, which is calculated from its location, signal settings, and traffic conditions. Finally, we quantify the mobility and environment improvements of the green driving strategy with respect to market penetration rates of equipped vehicles, traffic conditions, communication characteristics, location accuracy, and the car-following model itself, both in isolated and non-isolated intersections. In particular, we demonstrate savings of around 15% in travel delays and around 8% in fuel consumption and greenhouse gas emissions. Different from many existing ecodriving strategies in signalized road networks, where vehicles’ speed profiles are totally controlled, our strategy is hierarchical, since only the speed limit is provided, and vehicles still have to follow their leaders. Such a strategy is crucial for maintaining safety with mixed vehicles. [ABSTRACT FROM AUTHOR]

Traditional pavement distress index such as the Pavement Condition Index (PCI) developed by U.S. Army Corps of Engineers determines coefficients of distresses based on subjective ratings. This study proposed an asphalt pavement distress condition index based on various types of distress data collected from the Long-Term Pavement Performance (LTPP) database through Structural Equation Modeling (SEM). The SEM method treated the overall distress index as a latent variable while various distresses were treated as endogenous and other influence factors such as age, layer thickness, material type, weather, environment and traffic, were exogenous observed variables. The SEM method modeled the contributions of various distresses as well as the influence of other factors on the overall pavement distress condition. Influences of age, layer thickness, material type, environment and traffic on the latent distress condition were in accordance with previous studies. Compared with previous attempts to model latent pavement condition index utilizing SEM method, more pavement condition measurements and influencing factors were included. Specifically, this study adopted the robust maximum likelihood estimator (MLR) to estimate parameters for non-normally distributed data and derived the explicit expression of latent variables with intercepts. A multiple regression prediction model was built to calculate an overall condition index utilizing those measured distress data. The established pavement distress index prediction model provided a rational estimation of weighting coefficients for each distress type. The prediction model showed that alligator cracking, longitudinal cracking in wheel path, non-wheel path longitudinal cracking, transverse cracking, block cracking, edge cracking, patch and bleeding were significant for the latent pavement distress index. [ABSTRACT FROM AUTHOR]

In this paper, a novel mesoscopic multilane model is proposed to enable simultaneous simulation of mandatory and discretionary lane-changing behaviors to realistically capture multilane traffic dynamics. The model considers lane specific fundamental diagrams to simulate dynamic heterogeneous lane flow distributions on expressways. Moreover, different priority levels are identified according to different lane-changing motivations and the corresponding levels of urgency. Then, an algorithm is proposed to estimate the dynamic mandatory and discretionary lane-changing demands. Finally, the lane flow propagation is defined by the reaction law of the demand–supply functions, which can be regarded as an extension of the Incremental-Transfer and/or Priority Incremental-Transfer principles. The proposed mesoscopic multilane cell transmission model is calibrated and validated on a complex weaving section of the State Route 241 freeway in Orange County, California, showing both the positive and negative impact of lane changing maneuvers, e.g., balancing effect and capacity drop, respectively. Moreover, the empirical study verifies that the model requires no additional data other than the cell transmission model does. Thus, the proposed model can be deployed as a simple simulation tool for accessing dynamic mesoscopic multilane traffic state from data available to most management centers, and also the potential application in predicting the impact of traffic incident or lane control strategy. [ABSTRACT FROM AUTHOR]

Recent developments of information and communication technologies (ICT) have enabled vehicles to timely communicate with each other through wireless technologies, which will form future (intelligent) traffic systems (ITS) consisting of so-called connected vehicles. Cooperative driving with the connected vehicles is regarded as a promising driving pattern to significantly improve transportation efficiency and traffic safety. Nevertheless, unreliable vehicular communications also introduce packet loss and transmission delay when vehicular kinetic information or control commands are disseminated among vehicles, which brings more challenges in the system modeling and optimization. Currently, no data has been yet available for the calibration and validation of a model for ITS, and most research has been only conducted for a theoretical point of view. Along this line, this paper focuses on the (theoretical) development of a more general (microscopic) traffic model which enables the cooperative driving behavior via a so-called inter-vehicle communication (IVC). To this end, we design a consensus-based controller for the cooperative driving system (CDS) considering (intelligent) traffic flow that consists of many platoons moving together. More specifically, the IEEE 802.11p, the de facto vehicular networking standard required to support ITS applications, is selected as the IVC protocols of the CDS, in order to investigate how the vehicular communications affect the features of intelligent traffic flow. This study essentially explores the relationship between IVC and cooperative driving, which can be exploited as the reference for the CDS optimization and design. [ABSTRACT FROM AUTHOR]

Simulating driving behavior in high accuracy allows short-term prediction of traffic parameters, such as speeds and travel times, which are basic components of Advanced Traveler Information Systems (ATIS). Models with static parameters are often unable to respond to varying traffic conditions and simulate effectively the corresponding driving behavior. It has therefore been widely accepted that the model parameters vary in multiple dimensions, including across individual drivers, but also spatially across the network and temporally. While typically on-line, predictive models are macroscopic or mesoscopic, due to computational and data considerations, nowadays microscopic models are becoming increasingly practical for dynamic applications. In this research, we develop a methodology for online calibration of microscopic traffic simulation models for dynamic multi-step prediction of traffic measures, and apply it to car-following models, one of the key models in microscopic traffic simulation models. The methodology is illustrated using real trajectory data available from an experiment conducted in Naples, using a well-established car-following model. The performance of the application with the dynamic model parameters consistently outperforms the corresponding static calibrated model in all cases, and leads to less than 10% error in speed prediction even for ten steps into the future, in all considered data-sets. [ABSTRACT FROM AUTHOR]

Every day small delays occur in almost all railway networks. Such small delays are often called “disturbances” in literature. In order to deal with disturbances dispatchers reschedule and reroute trains, or break connections. We call this the railway management problem. In this paper we describe how the railway management problem can be solved using centralized model predictive control (MPC) and we propose several distributed model predictive control (DMPC) methods to solve the railway management problem for entire (national) railway networks. Furthermore, we propose an optimization method to determine a good partitioning of the network in an arbitrary number of sub-networks that is used for the DMPC methods. The DMPC methods are extensively tested in a case study using a model of the Dutch railway network and the trains of the Nederlandse Spoorwegen. From the case study it is clear that the DMPC methods can solve the railway traffic management problem, with the same reduction in delays, much faster than the centralized MPC method. [ABSTRACT FROM AUTHOR]

Many existing studies on the sensor health problem determine an individual sensor’s health status based on the statistical characteristics of collected data by the sensor. In this research, we study the sensor health problem at the network level, which is referred to as the network sensor health problem. First, based on the conservation principle of daily flows in a network, we separate all links into base links and non-base links, such that the flows on the latter can be calculated from those on the former. In reality, the network flow conservation principle can be violated due to the existence of unhealthy sensors. Then we define the least inconsistent base set of links as those that minimize the sum of squares of the differences between observed and calculated flows on non-base links. But such least inconsistent base sets may not be unique in a general road network. Finally we define the health index of an individual sensor as the frequency that it appears in all of the least inconsistent base sets. Intuitively, a lower health index suggests that the corresponding sensor is more likely to be unhealthy. We present the brute force method to find all least inconsistent base sets and calculate the health indices. We also propose a greedy search algorithm to calculate the approximate health indices more efficiently. We solve the network sensor health problem for a real-world example with 16 nodes and 30 links, among which 18 links are monitored with loop detectors. Using daily traffic count data from the Caltrans Performance Measurement System (PeMS) database, we use both the brute-force and greedy search methods to calculate the health indices for all the sensors. We find that all the four sensors flagged as unhealthy (high value) by PeMS have the lowest health indices. This confirms that a sensor with a lower health index is more likely to be unhealthy. Therefore, we can use such health indices to determine the relative reliability of different sensors’ data and prioritize the maintenance of sensors. [ABSTRACT FROM AUTHOR]

Advances in Information and Communication Technologies (ICT) allow the transportation community to foresee dramatic improvements for the incoming years in terms of a more efficient, environmental friendly and safe traffic management. In that context, new ITS paradigms like Cooperative Systems (C-ITS) enable an efficient traffic state estimation and traffic control. C-ITS refers to three levels of cooperation between vehicles and infrastructure: (i) equipped vehicles with Advanced Driver Assistance Systems (ADAS) adjusting their motion to surrounding traffic conditions; (ii) information exchange with the infrastructure; (iii) vehicle-to-vehicle communication. Therefore, C-ITS makes it possible to go a step further in providing real time information and tailored control strategies to specific drivers. As a response to an expected increasing penetration rate of these systems, traffic managers and researchers have to come up with new methodologies that override the classic methods of traffic modeling and control. In this paper, we discuss some potentialities of C-ITS for traffic management with the methodological issues following the expansion of such systems. Cooperative traffic models are introduced into an open-source traffic simulator. The resulting simulation framework is robust and able to assess potential benefits of cooperative traffic control strategies in different traffic configurations. [ABSTRACT FROM AUTHOR]

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%. [ABSTRACT FROM AUTHOR]

Anticipatory signal control in traffic networks adapts the signal timings with the aim of controlling the resulting (equilibrium) flows and route choice patterns in the network. This study investigates a method to support control decisions for successful applications in real traffic systems that operate repeatedly, for instance from day to day, month to month, etc. The route choice response to signal control is usually predicted through models; however this leads to suboptimality because of unavoidable prediction errors between model and reality. This paper proposes an iterative optimizing control method to drive the traffic network towards the real optimal performance by observing modeling errors and correcting for them. Theoretical analysis of this Iterative Optimizing Control with Model Bias Correction (IOCMBC) on matching properties between the modeled optimal solution and the real optimum is presented, and the advantages over conventional iterative schemes are demonstrated. A local convergence analysis is also elaborated to investigate conditions required for a convergent scheme. The main innovation is the calculation of the sensitivity (Jacobian) information of the real route choice behavior with respect to signal control variables. To avoid performing additional perturbations, we introduce a measurement-based implementation method for estimating the operational Jacobian that is associated with the reality. Numerical tests confirm the effectiveness of the proposed IOCMBC method in tackling modeling errors, as well as the influence of the optimization step size on the reality-tracking convergence. [ABSTRACT FROM AUTHOR]

Estimation/updating of Origin–Destination (OD) flows and other traffic state parameters is a classical, widely adopted procedure in transport engineering, both in off-line and in on-line contexts. Notwithstanding numerous approaches proposed in the literature, there is still room for considerable improvements, also leveraging the unprecedented opportunity offered by information and communication technologies and big data. A key issue relates to the unobservability of OD flows in real networks – except from closed highway systems – thus leading to inherent difficulties in measuring performance of OD flows estimation/updating methods and algorithms. Starting from these premises, the paper proposes a common evaluation and benchmarking framework, providing a synthetic test bed, which enables implementation and comparison of OD estimation/updating algorithms and methodologies under “standardized” conditions. The framework, implemented in a platform available to interested parties upon request, has been flexibly designed and allows comparing a variety of approaches under various settings and conditions. Specifically, the structure and the key features of the framework are presented, along with a detailed experimental design for the application of different dynamic OD flow estimation algorithms. By way of example, applications to both off-line/planning and on-line algorithms are presented, together with a demonstration of the extensibility of the presented framework to accommodate additional data sources. [ABSTRACT FROM AUTHOR]

In recent years, rapid advances in information technology have led to various data collection systems which are enriching the sources of empirical data for use in transport systems. Currently, traffic data are collected through various sensors including loop detectors, probe vehicles, cell-phones, Bluetooth, video cameras, remote sensing and public transport smart cards. It has been argued that combining the complementary information from multiple sources will generally result in better accuracy, increased robustness and reduced ambiguity. Despite the fact that there have been substantial advances in data assimilation techniques to reconstruct and predict the traffic state from multiple data sources, such methods are generally data-driven and do not fully utilize the power of traffic models. Furthermore, the existing methods are still limited to freeway networks and are not yet applicable in the urban context due to the enhanced complexity of the flow behavior. The main traffic phenomena on urban links are generally caused by the boundary conditions at intersections, un-signalized or signalized, at which the switching of the traffic lights and the turning maneuvers of the road users lead to shock-wave phenomena that propagate upstream of the intersections. This paper develops a new model-based methodology to build up a real-time traffic prediction model for arterial corridors using data from multiple sources, particularly from loop detectors and partial observations from Bluetooth and GPS devices. [ABSTRACT FROM AUTHOR]

Anticipatory optimal network control is defined as the problem of determining the set of control actions that minimizes a network-wide objective function. This not only takes into account local consequences on the propagation of flows, but also the global network-wide routing behavior of the users. Such an objective function is, in general, defined in a centralized setting, as knowledge regarding the whole network is needed to correctly compute it. Reaching a level of centralization sufficient to attain network-wide control objectives is however rarely realistic in practice. Multiple authorities are influencing different portions the network, separated either hierarchically or geographically. The distributed nature of networks and traffic directly influences the complexity of the anticipatory control problem. This is our motivation for this work, in which we introduce a decomposition mechanism for the global anticipatory network traffic control problem, based on dynamic clustering of traffic controllers. Rather than solving the full centralized problem, or blindly performing a full controller-wise decomposition, this technique allows recognizing when and which controllers should be grouped in clusters, and when, instead, these can be optimized separately. The practical relevance with respect to our motivation is that our approach allows identification of those network traffic conditions in which multiple actors need to actively coordinate their actions, or when unilateral action suffices for still approximating global optimality. This clustering procedure is based on well-known algebraic and statistical tools that exploit the network’s sensitivity to control and its structure to deduce coupling behavior. We devise several case studies in order to assess our newly introduced procedure’s performances, in comparison with fully decomposed and fully centralized anticipatory optimal network control, and show that our approach is able to outperform both centralized and decomposed procedures. [ABSTRACT FROM AUTHOR]

The design and deployment of the majority of Management and Control Systems (MCS) for ITS involves a tedious, effort- and time-consuming manual tuning and calibration procedure not only during the initial design and deployment of the ITS but, in most cases, during its whole lifetime. Recently, we have developed and evaluated, both by means of theoretical analysis and extensive simulation experiments, a new methodology which fully automatically takes over the manual tuning and calibration procedure. Most importantly, this new methodology, called Adaptive Fine-Tuning (AFT), achieves to improve the performance of the system and compensate the effect of the continuous changes of its behavior that may be due to either internal or external factors. In this paper, we report results of implementing AFT to a real-life ITS MCS. More precisely, this paper reports and analyzes the results from implementing AFT to an urban traffic signal control application. The results from AFT real-life application demonstrate that it is capable of significantly improving the performance of the system in a safe and robust manner. Moreover, the real-life results exhibit the capability of AFT to efficiently adapt and compensate in cases of changes in the system behavior, even if these changes are significant. [ABSTRACT FROM AUTHOR]

The ability to timely and accurately forecast the evolution of traffic is very important in traffic management and control applications. This paper proposes a non-parametric and data-driven methodology for short-term traffic forecasting based on identifying similar traffic patterns using an enhanced K-nearest neighbor (K-NN) algorithm. Weighted Euclidean distance, which gives more weight to recent measurements, is used as a similarity measure for K-NN. Moreover, winsorization of the neighbors is implemented to dampen the effects of dominant candidates, and rank exponent is used to aggregate the candidate values. Robustness of the proposed method is demonstrated by implementing it on large datasets collected from different regions and by comparing it with advanced time series models, such as SARIMA and adaptive Kalman Filter models proposed by others. It is demonstrated that the proposed method reduces the mean absolute percent error by more than 25%. In addition, the effectiveness of the proposed enhanced K-NN algorithm is evaluated for multiple forecast steps and also its performance is tested under data with missing values. This research provides strong evidence suggesting that the proposed non-parametric and data-driven approach for short-term traffic forecasting provides promising results. Given the simplicity, accuracy, and robustness of the proposed approach, it can be easily incorporated with real-time traffic control for proactive freeway traffic management. [ABSTRACT FROM AUTHOR]

The paper focuses on Network Traffic Control based on aggregate traffic flow variables, aiming at signal settings which are consistent with within-day traffic flow dynamics. The proposed optimisation strategy is based on two successive steps: the first step refers to each single junction optimisation (green timings), the second to network coordination (offsets). Both of the optimisation problems are solved through meta-heuristic algorithms: the optimisation of green timings is carried out through a multi-criteria Genetic Algorithm whereas offset optimisation is achieved with the mono-criterion Hill Climbing algorithm. To guarantee proper queuing and spillback simulation, an advanced mesoscopic traffic flow model is embedded within the network optimisation method. The adopted mesoscopic traffic flow model also includes link horizontal queue modelling. The results attained through the proposed optimisation framework are compared with those obtained through benchmark tools. [ABSTRACT FROM AUTHOR]

Well-defined relationships between flow and density averaged spatially across urban traffic networks, more commonly known as Macroscopic Fundamental Diagrams (MFDs), have been recently verified to exist in reality. Researchers have proposed using MFDs to monitor the status of urban traffic networks and to inform the design of network-wide traffic control strategies. However, it is also well known that empirical MFDs are not easy to estimate in practice due to difficulties in obtaining the requisite data needed to construct them. Recent works have devised ways to estimate a network’s MFD using limited trajectory data that can be obtained from GPS-equipped mobile probe vehicles. These methods assume that the market penetration level of mobile probe vehicles is uniform across the entire set of OD pairs in the network; however, in reality the probe vehicle market penetration rate varies regionally within a network. When this variation is combined with the imbalance of probe trip lengths and travel times, the compound effects will further complicate the estimation of the MFD. To overcome this deficit, we propose a method to estimate a network’s MFD using mobile probe data when the market penetration rates are not necessarily the same across an entire network. This method relies on the determination of appropriate average probe penetration rates, which are weighted harmonic means using individual probe vehicle travel times and distances as the weights. The accuracy of this method is tested using synthetic data generated in the INTEGRATION micro-simulation environment by comparing the estimated MFDs to the ground truth MFD obtained using a 100% market penetration of probe vehicles. The results show that the weighted harmonic mean probe penetration rates outperform simple (arithmetic) average probe penetration rates, as expected. This especially holds true as the imbalance of demand and penetration level increases. Furthermore, as the probe penetration rates are generally not known, an algorithm to estimate the probe penetration rates of regional OD pairs is proposed. This algorithm links count data from sporadic fixed detectors in the network to information from probe vehicles that pass the detectors. The simulation results indicate that the proposed algorithm is very effective. Since the data needed to apply this algorithm are readily available and easy to collect, the proposed algorithm is practically feasible and offers a better approach for the estimation of the MFD using mobile probe data, which are becoming increasingly available in urban environments. [ABSTRACT FROM AUTHOR]

The purpose of this article is to present an optimization model to plan the deployment strategy for hydrogen refuelling stations in a city when Origin–Destination (OD) data are not available. This model considers two objectives: to maximize the traffic covered by the selected hydrogen refuelling stations and minimize the average distance of the city’s inhabitants to the nearest hydrogen refuelling station. As OD data are assumed to be unavailable, the clustering of stations in the highest traffic zones is prevented by a new constraint that takes into account information on the distribution of existing conventional refuelling stations. This model is applied to Seville, a city in Southern Spain of about 140 km 2 with a population of around 700,000. This application uses the results of a survey of more than 200 Sevillian drivers on their current refuelling tendencies, their willingness to use alternative fuel vehicles and their minimum requirements (regarding maximum distance to be travelled to refuel and number of stations in the city) when establishing a network of alternative refuelling stations. [ABSTRACT FROM AUTHOR]

Aiming to alleviate traffic jams, many traffic management strategies/policies are adopted to nudge travelers to re-arrange their departure time or switch from driving to public transit or non-motorized mode. Analytical travel behavior model is needed to predict travelers’ departure time choice and mode switch under such strategies. In this paper, we developed an agent-based model for travellers’ choices of mode and departure time. Departing from the traditional utility maximization theory, this model focuses on the decision-making process based on imperfect information, bounded and distinctive rationalities. In the modeling framework, travelers accumulate experiences and update their spatial and temporal knowledge through a Bayesian learning process. Before making a trip, travelers decide whether to search for alternative departure time and/or travel mode according to their expected search gain and cost. When an additional search happens, travelers decide whether or not to switch to the new departure time and travel mode according to a series of decision conditions. Both the search and decision processes are represented by production (if–then) rules derived from a joint revealed/stated-preference survey data collected in Beijing. Then the agent-based model is applied to evaluate congestion charge policies with various demand scenarios in the 2nd ring road of Beijing. Results suggest that the model can display the peak spreading and mode switch process practically. [ABSTRACT FROM AUTHOR]

The advancement of information and communication technology allows the use of more sophisticated information provision strategies for real-time congested traffic management in a congested network. This paper proposes an agent-based optimization modeling framework to provide personalized traffic information for heterogeneous travelers. Based on a space–time network, a time-dependent link flow based integer programming model is first formulated to optimize various information strategies, including elements of where and when to provide the information, to whom the information is given, and what alternative route information should be suggested. The analytical model can be solved efficiently using off-the-shelf commercial solvers for small-scale network. A Lagrangian Relaxation-based heuristic solution approach is developed for medium to large networks via the use of a mesoscopic dynamic traffic simulator. [ABSTRACT FROM AUTHOR]

Short-term forecasting of traffic characteristics, such as traffic flow, speed, travel time, and queue length, has gained considerable attention from transportation researchers and practitioners over past three decades. While past studies primarily focused on traffic characteristics on freeways or urban arterials this study places particular emphasis on modeling the crossing time over one of the busiest US–Canada bridges, the Ambassador Bridge. Using a month-long volume data from Remote Traffic Microwave Sensors and a yearlong Global Positioning System data for crossing time two sets of ANN models are designed, trained, and validated to perform short-term predictions of (1) the volume of trucks crossing the Ambassador Bridge and (2) the time it takes for the trucks to cross the bridge from one side to the other. The prediction of crossing time is contingent on truck volume on the bridge and therefore separate ANN models were trained to predict the volume. A multilayer feedforward neural network with backpropagation approach was used to train the ANN models. Predicted crossing times from the ANNs have a high correlation with the observed values. Evaluation indicators further confirmed the high forecasting capability of the trained ANN models. The ANN models from this study could be used for short-term forecasting of crossing time that would support operations of ITS technologies. [ABSTRACT FROM AUTHOR]

Automatic real-time control of traffic perturbations has recently become a central issue for many European railway infrastructure managers. The aim is to make use of mathematical algorithms to maintain the required service availability during unplanned disturbances to operations. In the literature many tools for real-time traffic control are proposed, but their effects on traffic have never been studied neither in real life nor in fully realistic simulation environments. We can mention only a few pilot tests and a unique installation in the Lötschberg Base tunnel in Switzerland, which uses a replanning framework that is generally applicable but does not consider a standard data communication format. Standardisation of railway data is instead one of the main requirements of the European Railway Traffic Management System (ERTMS) to enable traffic interoperability across different countries along the Trans-European Transport Network (TEN-T). Following this direction, this paper introduces one of the outputs of the European project ON-TIME: a framework for the automatic real-time management of railway traffic, designed for being standard and interoperable across different European railways. We make use of a web-based Service-Oriented Architecture to ensure scalability and flexibility of application. A standard railML interface is used for the input/output data of the modules, allowing immediate applicability of the framework to any network having a railML representation. A proof-of-concept is provided where the framework is tested in a closed-loop with the simulation environment HERMES for perturbed traffic scenarios on different networks in the UK, the Netherlands and Sweden. Tests are performed for two different replanning algorithms (ROMA and RECIFE) used for the automatic detection and optimised resolution of train conflicts. The two algorithms are compared on the test case in Sweden. Results show that the design of the proposed framework is effective in managing traffic perturbations and is extendible to real-life systems. [ABSTRACT FROM AUTHOR]

Car following modeling framework seeks for a more realistic representation of car following behavior in complex driving situations to improve traffic safety and to better understand several puzzling traffic flow phenomena, such as stop-and-go oscillations. Calibration and validation techniques pave the way towards the descriptive power of car-following models and their applicability for analyzing traffic flow. However, calibrating these models is never a trivial task. This is caused by the fact that some parameters, such as reaction time, are generally not directly observable from traffic data. On the other hand, traffic data might be subject to various errors and noises. This contribution puts forward a Cross-Entropy Method (CEM) based approach to identify parameters of deterministic car-following models under noisy data by formulating it as a stochastic optimization problem. This approach allows for statistical analysis of the parameter estimations. Another challenge arising in the calibration of car following models concerns the selection of the most important parameters. This paper introduces a relative entropy based Probabilistic Sensitivity Analysis (PSA) algorithm to identify the important parameters so as to reduce the complexity, data requirement and computational effort of the calibration process. Since the CEM and the PSA are based on the Kullback–Leibler ( K – L ) distance, they can be simultaneously integrated into a unified framework to further reduce the computational burden. The proposed framework is applied to calibrate the intelligent driving model using vehicle trajectories data from the NGSIM project. Results confirm the great potential of this approach. [ABSTRACT FROM AUTHOR]

Automated driving is gaining increasing amounts of attention from both industry and academic communities because it is regarded as the most promising technology for improving road safety in the future. The ability to make an automated lane change is one of the most important parts of automated driving. However, there has been little research into automated lane change maneuvers, and current research has not identified a way to avoid potential collisions during lane changes, which result from the state variations of the other vehicles. One important reason is that the lane change vehicle cannot acquire accurate information regarding the other vehicles, especially the vehicles in the adjacent lane. However, vehicle-to-vehicle communication has the advantage of providing more information, and this information is more accurate than that obtained from other sensors, such as radars and lasers. Therefore, we propose a dynamic automated lane change maneuver based on vehicle-to-vehicle communication to accomplish an automated lane change and eliminate potential collisions during the lane change process. The key technologies for this maneuver are trajectory planning and trajectory tracking. Trajectory planning calculates a reference trajectory satisfying the demands of safety, comfort and traffic efficiency and updates it to avoid potential collisions until the lane change is complete. The trajectory planning method converts the planning problem into a constrained optimization problem using the lane change time and distance. This method is capable of planning a reference trajectory for a normal lane change, an emergency lane change and a change back to the original lane. A trajectory-tracking controller based on sliding mode control calculates the control inputs to make the host vehicle travel along the reference trajectory. Finally, simulations and experiments using a driving simulator are conducted. They demonstrate that the proposed dynamic automated lane change maneuver can avoid potential collisions during the lane change process effectively. [ABSTRACT FROM AUTHOR]

A widespread deployment of vehicle automation and communication systems (VACS) is expected in the next years. This may lead to improvements in traffic management efficiency because of the novel possibilities of using VACS both as sensors and as actuators, as well as of a variety of new communications channels (vehicle-to-vehicles, vehicle-to-infrastructure) and related opportunities. To achieve this traffic flow efficiency, appropriate studies, developing potential control strategies to exploit the VACS availability, are essential. This paper describes a hierarchical model predictive control framework that can be used for the coordinated and integrated control of a motorway system, considering that an amount of vehicles are equipped with specific VACS. The concept employs and exploits the synergistic (integrated) action of a number of old and new control measures, including ramp metering, vehicle speed control, and lane changing control at a macroscopic level. The effectiveness and the computational feasibility of the proposed approach are demonstrated via microscopic simulation for a variety of penetration rates of equipped vehicles. [ABSTRACT FROM AUTHOR]

Urban traffic light controllers are responsible for maintaining good performance within the transport network. Most existing and proposed controllers have design parameters that require some degree of tuning, with the sensitivity of the performance measure to the parameter often high. To date, tuning has been largely treated as a manual calibration exercise but ignores the effects of changes in traffic condition, such as demand profile evolution due to urban population growth. To address this potential shortcoming, we seek to use a newly developed extremum-seeker to calibrate the parameters of existing urban traffic light controllers in real-time such that a certain performance measure is optimised. The results are demonstrated for three categories of traffic controllers on a microscopic urban traffic simulation. It is demonstrated that the extremum-seeking scheme is able to seek the optimal parameters, with respect to a certain performance measure, for each of these traffic light controllers in an urban, uni-modal traffic environment. [ABSTRACT FROM AUTHOR]

This paper investigates evolutionary implementation of congestion pricing schemes to minimize the system cost and time, measured in monetary and time units, respectively, with the travelers’ day-to-day route adjustment behavior and their heterogeneity. The travelers’ heterogeneity is captured by their value-of-times. First, the multi-class flow dynamical system is proposed to model the travelers’ route adjustment behavior in a tolled transportation network with multiple user classes. Then, the stability condition and properties of equilibrium is examined. We further investigate the trajectory control problem via dynamic congestion pricing scheme to derive the system cost, time optimum, and generally, Pareto optimum in the sense of simultaneous minimization of system cost and time. The trajectory control problem is modeled by a differential–algebraic system with the differential sub-system capturing the flow dynamics and the algebraic one capturing the pricing constraint. The explicit Runge–Kutta method is proposed to calculate the dynamic flow trajectories and anonymous link tolls. The method allows the link tolls to be updated with any predetermined periods and forces the system cost and/or time to approach the optimum levels. Both analytical and numerical examples are adopted to examine the efficiency of the method. [ABSTRACT FROM AUTHOR]

In this paper an operation mode which is based on the stop-skipping approach is studied in urban railway lines under uncertainty. In this mode, each train follows a specific stop schedule. Trains are allowed to skip any intermediate stations to increase the commercial speed and to save energy consumption. As the commercial speed increases, the number of required trains in operation reduces and results eliminating unnecessary costs. To that end, a new mathematical model is proposed to reach the optimum stop schedule patterns. In the planning step, based on the traffic studies, the headway distributions are computed for different weekdays, and holidays. However, in practice, because of many unexpected events, the traffic may alter from what is planned. Therefore, in this condition, a robust plan is required that is optimized and immunized from uncertainty. In this paper, a new robust mathematical model, as well as two heuristic algorithms including (1) a decomposition-based algorithm and (2) a Simulated Annealing (SA) based algorithm is proposed. Finally, an Iranian metro line is studied and the optimum patterns are presented and analyzed. [ABSTRACT FROM AUTHOR]

The automotive industry is witnessing a revolution with the advent of advanced vehicular technologies, smart vehicle options, and fuel alternatives. However, there is very limited research on consumer preferences for such advanced vehicular technologies. The deployment and penetration of advanced vehicular technologies in the marketplace, and planning for possible market adoption scenarios, calls for the collection and analysis of consumer preference data related to these emerging technologies. This study aims to address this need, offering a detailed analysis of consumer preference for alternative fuel types and technology options using data collected in stated choice experiments conducted on a sample of consumers from six metropolitan cities in South Korea. The results indicate that there is considerable heterogeneity in consumer preferences for various smart technology options such as wireless internet, vehicle connectivity, and voice command features, but relatively less heterogeneity in the preference for smart vehicle applications such as real-time traveler information on parking and traffic conditions. [ABSTRACT FROM AUTHOR]