Academic literature on the topic 'Origin and destination traffic survey Mathematical models'

Article is devoted to studying of traffic flows using the origin-destination matrix. The first paragraph of this article deals with the possibility of applying the origin-destination matrix when modeling load of transport network. The types of transportations, the factors that affect the loading of the transport network are described. The concept of a generalized path cost, interdistrict transportations and some others are considered. There are proposed several steps to create a origin-destination matrix. In the second paragraph of the paper is proposed the classification of mathematical models that can be applied in the simulation of traffic flow, as well as their features are marked. This will help in the processing of data for selection of a mathematical model that satisfies the requirements and objectives that have set themselves researchers. The conclusions on the application of mathematical models in the study of traffic flow are made.

Intersection movements carry more disaggregate information about origin–destination (O–D) flows than link counts in a traffic network. In this paper, a mathematical formulation is presented for O–D matrix estimation using intersection counts, which is based on an existing linear programming model employing link counts. The proposed model estimates static O–D flows for uncongested networks assuming no a priori information on the O–D matrix. Both models were tested in two hypothetical networks previously used in O–D matrix studies to monitor their performances assuming various numbers of count location and measurement errors. Two new measures were proposed to evaluate the model characteristics of O–D flow estimation using traffic counts. While both link count based and intersection count based models performed with the same success under complete data collection assumption, intersection count based formulation estimated the O–D flows more successfully under decreasing number of observation locations. Also, the results of the 30 measurement error scenarios revealed that it performs more robustly than the link count based one; thus, it better estimates the O–D flows.

The Origin–Destination (O–D) matrix, is an important information in transportation planning and traffic control. Rapid changes in land use, particularly in developing countries, have been and are on an increase, which makes the estimation and observation of this matrix more significant. The objective of this paper is to observe O–D matrix under two scenarios. In the first scenario, it is assumed that the traffic network is equipped with path-ID sensors. In this situation, the goal is to determine the optimal number and location of these sensors in the network, where by applying collected information through these sensors, the O–D matrix is observed. Because path-ID sensors are not available in many cities, in the second scenario the interview alternative is proposed in order to observe O–D matrix. The interview method has encountered some restrictions. Several mathematical programming models have been developed to overcome these restrictions. To illustrate these proposed methodologies, they are applied in the Nguyen–Dupuis transportation network and the results are analysed. By applying the model on the intercity road network in the Province of Isfahan (Iran), a large network, the efficiency of these proposed models is demonstrated. Finally, some conclusions and final recommendations are included.

A traffic assignment model is a critical tool for developing future transport systems, road policies, and evaluating future network upgrades. However, the development of the network and demand data is often highly intensive, which limits the number of cases where some form of the models are available on a global basis. These problems include licensing restrictions, bureaucracy, privacy, data availability, data quality, costs, transparency, and transferability. This paper introduces Rapidex, a novel origin–destination (OD) demand estimation and visualisation tool. Firstly, Rapidex enables the user to download and visualise road networks for any city using a capacity-based modification of OpenStreetMap. Secondly, the tool creates traffic analysis zones and centroids, as per the user-specified inputs. Next, it enables the fetching of travel time data from pervasive traffic data providers, such as TomTom and Google. With Rapidex, we tailor the genetic-algorithm (GA)-based metaheuristic approach to derive the OD demand pattern. The tool produces critical outputs such as link volumes, link travel times, OD travel times, average trip length and duration, and congestion level, which can also be used for validation. Finally, Rapidex enables the user to perform scenario evaluation, where changes to the network and/or demand data can be made and the subsequent impacts on performance metrics can be identified. In this article, we demonstrate the applicability of Rapidex on the network of Sydney, which has 15,646 directional links, 8708 nodes, and 178 zones. Further, the model was validated using the Household Travel Survey data of Sydney using the aggregated metrics and a novel project selection method. We observed that 88% of the time, the “estimated” and “observed” OD matrices identified the same project (i.e., the rapid process estimated the more intensive traditional approach in 88% of cases). This tool would help practitioners in rapid decision making for strategic long-term planning. Further, the tool would provide an opportunity for developing countries to better manage traffic congestion, as cities in these countries are prone to severe congestion and rapid urbanisation while often lacking the traditional models entirely.

The real-time traffic signal control for intersection requires dynamic turning movements as the basic input data. It is impossible to detect dynamic turning movements directly through current traffic surveillance systems, but dynamic origin-destination (O-D) estimation can obtain it. However, the combined models of dynamic O-D estimation and real-time traffic signal control are rare in the literature. A framework for the multiobjective traffic signal control model for intersection based on dynamic O-D estimation (MSC-DODE) is presented. A state-space model using Kalman filtering is first formulated to estimate the dynamic turning movements; then a revised sequential Kalman filtering algorithm is designed to solve the model, and the root mean square error and mean percentage error are used to evaluate the accuracy of estimated dynamic turning proportions. Furthermore, a multiobjective traffic signal control model is put forward to achieve real-time signal control parameters and evaluation indices. Finally, based on practical survey data, the evaluation indices from MSC-DODE are compared with those from Webster method. The actual and estimated turning movements are further input into MSC-DODE, respectively, and results are also compared. Case studies show that results of MSC-DODE are better than those of Webster method and are very close to unavailable actual values.

The green-routing strategy instructing a vehicle to select a fuel-efficient route benefits the current transportation system with fuel-saving opportunities. This paper introduces a navigation application programming interface (API), route fuel-saving evaluation framework for estimating fuel advantages of alternative API routes based on large-scale, real-world travel data for conventional vehicles (CVs) and hybrid electric vehicles (HEVs). Navigation APIs, such as Google Directions API, integrate traffic conditions and provide feasible alternative routes for origin–destination pairs. This paper develops two link-based fuel-consumption models stratified by link-level speed, road grade, and functional class (local/non-local), one for CVs and the other for HEVs. The link-based fuel-consumption models are built by assigning travel from many global positioning system driving traces to the links in TomTom MultiNet and road grade data from the U.S. Geological Survey elevation data set. Fuel consumption on a link is computed by the proposed model. This paper envisions two kinds of applications: (1) identifying alternate routes that save fuel, and (2) quantifying the potential fuel savings for large amounts of travel. An experiment based on a large-scale California Household Travel Survey global positioning system trajectory data set is conducted. The fuel consumption and savings of CVs and HEVs are investigated. At the same time, the trade-off between fuel saving and travel time due to choosing different routes is also examined for both powertrains.

Geodesign is a participatory planning approach in which stakeholders use geographic information systems to develop and vet alternative design scenarios in a collaborative and iterative process. This study is based on a 2019 geodesign workshop in which 17 participants from industry, government, university, and non-profit sectors worked together to design an initial network of hydrogen refueling stations in the Hartford, Connecticut, metropolitan area. The workshop involved identifying relevant location factors, rapid prototyping of station network designs, and developing consensus on a final design. The geodesign platform, which was designed specifically for facility location problems, enables breakout groups to add or delete stations with a simple point-and-click operation, view and overlay different map layers, compute performance metrics, and compare their designs to those of other groups. By using these sources of information and their own expert local knowledge, participants recommended six locations for hydrogen refueling stations over two distinct phases of station installation. We quantitatively and qualitatively compared workshop recommendations to solutions of three optimal station location models that have been used to recommend station locations, which minimize travel times from stations to population and traffic or maximize trips that can be refueled on origin–destination routes. In a post-workshop survey, participants rated the workshop highly for facilitating mutual understanding and information sharing among stakeholders. To our knowledge, this workshop represents the first application of geodesign for hydrogen refueling station infrastructure planning.

This work presents a tool for forecasting the spread of the new coronavirus in Mexico City, which is based on a mathematical model with a metapopulation structure that uses Bayesian statistics and is inspired by a data-driven approach. The daily mobility of people in Mexico City is mathematically represented by an origin-destination matrix using the open mobility data from Google and the Transportation Mexican Survey. This matrix is incorporated in a compartmental model. We calibrate the model against borough-level incidence data collected between 27 February 2020 and 27 October 2020, while using Bayesian inference to estimate critical epidemiological characteristics associated with the coronavirus spread. Given that working with metapopulation models leads to rather high computational time consumption, and parameter estimation of these models may lead to high memory RAM consumption, we do a clustering analysis that is based on mobility trends to work on these clusters of borough separately instead of taken all of the boroughs together at once. This clustering analysis can be implemented in smaller or larger scales in different parts of the world. In addition, this clustering analysis is divided into the phases that the government of Mexico City has set up to restrict individual movement in the city. We also calculate the reproductive number in Mexico City using the next generation operator method and the inferred model parameters obtaining that this threshold is in the interval (1.2713, 1.3054). Our analysis of mobility trends can be helpful when making public health decisions.

Traffic information condition is a very useful information for road user because road user can choose his best route for each trip from his origin to his destination. The final goal for this research is to develop real time traffic information system for road user using real time traffic volume. Main input for developing real time traffic information system is an origin-destination (O-D) matrix to represent the travel pattern. However, O-D matrices obtained through a large scale survey such as home or road side interviews, tend to be costly, labour intensive and time disruptive to trip makers. Therefore, the alternative of using traffic counts to estimate O-D matrices is particularly attractive. Models of transport demand have been used for many years to synthesize O-D matrices in study areas. A typical example of the approach is the gravity model; its functional form, plus the appropriate values for the parameters involved, is employed to produce acceptable matrices representing trip making behaviour for many trip purposes and time periods. The work reported in this paper has combined the advantages of acceptable travel demand models with the low cost and availability of traffic counts. Two types of demand models have been used: gravity (GR) and gravity-opportunity (GO) models. Four estimation methods have been analysed and tested to calibrate the transport demand models from traffic counts, namely: Non-Linear-Least-Squares (NLLS), Maximum-Likelihood (ML), Maximum-Entropy (ME) and Bayes-Inference (BI). The Bandung’s Urban Traffic Movement survey has been used to test the developed method. Based on several statistical tests, the estimation methods are found to perform satisfactorily since each calibrated model reproduced the observed matrix fairly closely. The tests were carried out using two assignment techniques, all-or-nothing and equilibrium assignment.

AbstractNetwork capacity, defined as the largest sum of origin–destination (O–D) flows that can be accommodated by the network based on link performance function and traffic equilibrium assignment, is a critical indicator of network-wide performance assessment in transportation planning and management. The typical modeling rationale of estimating network capacity is to formulate it as a mathematical programming (MP), and there are two main approaches: single-level MP formulation and bi-level programming (BLP) formulation. Although single-level MP is readily solvable, it treats the transportation network as a physical network without considering level of service (LOS). Albeit BLP explicitly models the capacity and link LOS, solving BLP in large-scale networks is challenging due to its non-convexity. Moreover, the inconsideration of trip LOS makes the existing models difficult to differentiate network capacity under various traffic states and to capture the impact of emerging trip-oriented technologies. Therefore, this paper proposes the α-max capacity model to estimate the maximum network capacity under trip or O–D LOS requirement α. The proposed model improves the existing models on three aspects: (a) it considers trip LOS, which can flexibly estimate the network capacity ranging from zero to the physical capacity including reserve, practical and ultimate capacities; (b) trip LOS can intuitively reflect users’ maximum acceptable O–D travel time or planners’ requirement of O–D travel time; and (c) it is a convex and tractable single-level MP. For practical use, we develop a modified gradient projection solution algorithm with soft constraint technique, and provide methods to obtain discrete trip LOS and network capacity under representative traffic states. Numerical examples are presented to demonstrate the features of the proposed model as well as the solution algorithm.

Researchers in multiple areas have shown that characterizing and accounting for the uncertainty inherent in decision support models is critical for developing more efficient planning and operational strategies. This is particularly applicable for the transportation engineering domain as most strategic decisions involve a significant investment of money and resources across multiple stakeholders and has a considerable impact on the society. Moreover, most inputs to transportation models such as travel demand depend on a number of social, economic and political factors and cannot be predicted with certainty. Therefore, in recent times there has been an increasing emphasis being placed on identifying and quantifying this uncertainty and developing models which account for the same. This dissertation contributes to the growing body of literature in tackling uncertainty in transportation models by developing methodologies which address the uncertainty in input parameters in traffic assignment models. One of the primary sources of uncertainty in traffic assignment models is uncertainty in origin destination demand. This uncertainty can be classified into long term and short term demand uncertainty. Accounting for long term demand uncertainty is vital when traffic assignment models are used to make planning decisions like where to add capacity. This dissertation quantifies the impact of long term demand uncertainty by assigning multi-variate probability distributions to the demand. In order to arrive at accurate estimates of the expected future system performance, several statistical sampling techniques are then compared through extensive numerical testing to determine the most "efficient" sampling techniques for network assignment models. Two applications of assignment models, network design and network pricing are studied to illustrate the importance of considering long term demand uncertainty in transportation networks. Short term demand uncertainty such as the day-to-day variation in demand affect traffic assignment models when used to make operational decisions like tolling. This dissertation presents a novel new definition of equilibrium when the short term demand is assumed to follow a probability distribution. Various properties of the equilibrium such as existence, uniqueness and presence of a mathematical programming formulation are investigated. Apart from demand uncertainty, operating capacity in real world networks can also vary from day to day depending on various factors like weather conditions and incidents. With increasing deployment of Intelligent Transportation Systems, users get information about the impact of capacity or the state of the roads through various dissemination devices like dynamic message signs. This dissertation presents a new equilibrium formulation termed user equilibrium with recourse to model information provision and capacity uncertainty, where users learn the state or capacity of the link when they arrive at the upstream node of that link. Depending on the information received about the state of the upstream links, users make different route choice decisions. In this work, the capacity of the links in the network is assumed to follow a discrete probability distribution. A mathematical programming formulation of the user equilibrium with recourse model is presented along with solution algorithm. This model can be extended to analytically model network flows under information provision where the arcs have different cost functional form depending on the state of the arc. The corresponding system optimal with recourse model is also presented where the objective is minimize the total system cost. The network design problem where users are routed according to the user equilibrium with recourse principle is studied. The focus of this study is to show that planning decisions for networks users have access to information is significantly different from the no-information scenario.
text

Children are an often overlooked and understudied population group, whose travel needs are responsible for a significant number of trips made by a household. In addition, children’s travel and activity participation have direct implication for adults’ activity-travel patterns. A better understanding of children’s activity-travel patterns and the linkages between parents and children’s activity-travel needs is necessary for accurate prediction and forecasting of activity-based travel demand modeling systems. In contrast to the need to examine and model children’s activity-travel patterns, existing activity-based research and modeling systems have almost exclusively focused their attention on the activity-travel patterns of adults. Therefore, the goal of this research effort is to contribute to the area of activity-based travel demand analysis by comprehensively examining children’s activity-travel patterns, and by developing a framework for incorporating children within activity-based travel demand modeling systems. This dissertation provides a comprehensive review of previous research on children’s activity engagement and travel by focusing on the dimensions characterizing children’s activity-travel patterns and the factors affecting these dimensions. Further, an exploratory analysis examines the weekday and weekend activity participation characteristics of school-going children. The study focuses on the overall time-use of children in different types of activities, as well as on several dimensions characterizing the context of participation in activities. In addition, the dissertation discusses the treatment of children within current activity-based travel demand modeling systems and conceptualizes an alternative framework for simulating the daily activity-travel patterns of children. An empirical analysis is undertaken of the post-school out-of-home activity-location engagement patterns of children aged 5 to 17 years. Specifically, this research effort utilizes a multinomial logit model to analyze children’s post-school location patterns, and employs a multiple discrete-continuous extreme value (MDCEV) model to study the propensity of children to participate in, and allocate time to, multiple activity episode purpose-location types during the after-school period. Finally, the paper identifies the need and opportunities for further research in the field of children’s travel behavior analysis.
text