Estimation of origin-destination matrices from link counts and sporadic routing data

Estimation of origin-destination (OD) matrices from link count data is a challenging problem because of the highly indeterminate relationship between the observations and the latent route flows. Conversely, estimation is straightforward if we observe the path taken by each vehicle. We consider an intermediate problem of increasing practical importance, in which link count data is supplemented by routing information for a fraction of vehicles on the network. We develop a statistical model for these combined data sources and derive some tractable normal approximations thereof. We examine likelihood-based inference for these normal models under the assumption that the probability of vehicle tracking is known. We show that the likelihood theory can be non-standard because of boundary effects, and provide conditions under which such irregular behaviour will be observed in practice. For regular cases we outline connections with existing generalised least squares methods. We then consider estimation of OD matrices under estimated and/or misspecified models for the probability of vehicle tracking. Theoretical developments are complemented by simulation experiments and an illustrative example using a section of road network from the English city of Leicester.     

Estimation of origin-destination matrices from link traffic counts on congested networks

Conventional methods for estimating origin-destination (O-D) trip matrices from link traffic counts assume that route choice proportions are given constants. In a network with realistic congestion levels, this assumption does not hold. This paper shows how existing methods such as the generalized least squares technique can be integrated with an equilibrium traffic assignment in the form of a convex bilevel optimization problem. The presence of measurement errors and time variations in the observed link flows are explicitly considered. The feasibility of the model is always guaranteed without a requirement for estimating consistent link flows from counts. A solution algorithm is provided and numerical simulation experiments are implemented in investigating the model's properties. Some related problems concerning O-D matrix estimation are also discussed.     

Link choice proportions from trip distribution and assignment models: An overview and comparison

A number of estimation procedures have been suggested for the situation where a prior estimate of an origin-destination matrix is to be updated on the basis of recently-acquired traffic counts. These procedures assume that both the link flows and the proportionate usage of each link made by each origin-destination flow (referred to collectively as the link choice proportions) are known. This paper examines the possibility and methods for estimating the link choice proportions. Three methods are presented: (1) using ad hoc iteration between trip distribution and traffic assignment; (2) combining trip distribution and assignment in one step; (3) solving a new optimization problem in which the path flows are directly considered as variables and its optimal solution is governed by a logit type formula. The algorithms, covergencies and computational efficiencies of these methods are investigated. Results of testing the three methods on example networks are discussed.     

Transport demand model estimation from traffic counts

Many problems in transport planning and management tasks require an origindestination (O-D) matrix to represent the travel pattern. However, O-D matrices obtained through a large scale survey such as home or roadside interviews, tend to be costly, labour intensive and time disruptive to trip makers. Therefore, the use of low cost and easily available data is particularly attractive.The need of low-cost methods to estimate current and future O-D matrices is even more valuable in developing countries because of the rapid changes in population, economic activity and land use. Models of transport demand have been used for many years to synthesize O-D matrices in study areas. A typical example of this 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. Three types of demand models have been used: gravity (GR), opportunity (OP) and gravity-opportunity (GO) models. Three estimation methods have been developed to calibrate these models from traffic counts, namely: non-linear-least-squares (NLLS), weighted-non-linear-least-squares (WNLLS) and maximumlikelihood (ML).The 1978 Ripon (urban vehicle movement) survey was used to test these methods. They were found to perform satisfactorily since each calibrated model reproduced the observed O-D matrix fairly closely. The tests were carried out using two assignment techniques, all-or-nothing and the stochastic method due to Burrell, in determining the routes taken through the network.requests for offprints     

Urban university campus transportation and parking planning through a dynamic traffic simulation and assignment approach

Abstract

Many urban university campuses are considered major trip attractors. Considering the multimodal and complex nature of university campus transportation planning and operation, this paper proposes a dynamic traffic simulation and assignment analysis approach and demonstrates how such a methodology can be successfully applied. Central to the research is the estimation of trip origin–destinations and the calibration of a parking lot choice model. Dynamic simulation is utilized to simulate multiple modes of transportation within the transportation network while further assigning these modes with respect to various mode-specific roadway accessibilities. A multiple vehicle-class simulation analysis for planning purposes becomes a critical capability to predict how faculty and staff who once parked within the campus core choose other nearby alternate parking lots. The results highlight the effectiveness of the proposed approach in providing integrated and reliable solutions for challenging questions that face urban university campus planners and local transportation jurisdictions.     

Flexible long range planning using low cost information

Contemporary transport planning requires a flexible modelling approach which can be used to monitor the implementation of a long term plan checking regularly its short term performance with easily available data; the original model is periodically updated using low cost information and this allows the evaluation of the changes to the plan which may be required. Such an approach requires models suited to regular updating and to the use of data from different sources. Models to update trip matrices from traffic counts have been available for some time; however, the estimation and/or updating of other model stages with low cost data has escaped analytical treatment. The paper discusses this idea and formulates the updating problem for an example involving a joint destination/mode choice model under various assumptions about the nature of the available data. Analytical solutions are proposed as well as some general conclusions.requests for offprints     

Parking demand and responsiveness to supply,pricing and location in the Sydney central business district

This paper investigates the role of parking pricing and supply by time of day in whether to drive and park in the central business district (CBD). A stated preference survey of car drivers and public transport users was undertaken at a number of parking locations, public transit interchanges, and shopping centres in Sydney CBD during 1998. In the context of a current trip to the CBD, respondents were asked to consider six alternatives, including three parking locations in the CBD, park outside of the CBD with public transport connection to the CBD, switch to public transport, or forego that trip to the CBD. The three parking locations were defined by hours of operation, a tariff schedule, and access time to the final destination from the parking station. Data from the survey were then used to estimate a nested logit model of mode and parking choices, which was then used to simulate the impacts of supply pricing scenarios on CBD parking share. The change in CBD parking share attributable to supply by time of day is less than 3%, compared to 97% attributable to parking prices.     

Dynamic network equilibrium for daily activity-trip chains of heterogeneous travelers: application to large-scale networks

Applications of dynamic network equilibrium models have, mostly, considered the unit of traffic demand either as one-way trip, or as multiple independent trips. However, individuals’ travel patterns typically follow a sequence of trips chained together. In this study we aim at developing a general simulation-based dynamic network equilibrium algorithm for assignment of activity-trip chain demand. The trip chain of each individual trip maker is defined by the departure time at origin, sequence of activity destination locations, including the location of their intermediate destinations and their final destination, and activity duration at each of the intermediate destinations. Spatial and temporal dependency of subsequent trips on each other necessitate time and memory consuming calculations and storage of node-to-node time-dependent least generalized cost path trees, which is not practical for very large metropolitan area networks. We first propose a reformulation of the trip-based demand gap function formulation for the variational inequality formulation of the Bi-criterion Dynamic User Equilibrium (BDUE) problem. Next, we propose a solution algorithm for solving the BDUE problem with daily chain of activity-trips. Implementation of the algorithm for very large networks circumvents the need to store memory-intensive node-to-node time-dependent shortest path trees by implementing a destination-based time-dependent least generalized cost path finding algorithm, while maintaining the spatial and temporal dependency of subsequent trips. Numerical results for a real-world large scale network suggest that recognizing the dependency of multiple trips of a chain, and maintaining the departure time consistency of subsequent trips provide sharper drops in gap values, hence, the convergence could be achieved faster (compared to when trips are considered independent of each other).     

The relationship between land use and intrazonal trip making behaviors: Evidence and implications

This paper addresses the relationship between land use, destination selection, and travel mode choice. Specifically, it focuses on intrazonal trips, a sub-category of trip making where both trip origin and trip destination are contained in the same geographic unit of analysis, using data from the 1994 Household Activity and Travel Diary Survey conducted by Portland Metro. Using multinomial logit and binary logistic models to measure travel mode choice and decision to internalize trips, the evidence supports the conclusions that (1) intrazonal trips characteristics suggest mode choice for these trips might be influenced by urban form, which in turn affects regional trip distribution; (2) there is a threshold effect in the ability of economic diversity/mixed use to alter travel behavior; and (3) greater emphasis to destinations within the area where an individual’s home is located needs to be given in trip distribution models.     

Simplified transport models based on traffic counts

Having accepted the need for the development of simpler and less cumbersome transport demand models, the paper concentrates on one possible line for simplification: estimation of trip matrices from link volume counts. Traffic counts are particularly attractive as a data basis for modelling because of their availability, low cost and nondisruptive character. It is first established that in normal conditions it may be possible to find more than one trip matrix which, when loaded onto a network, reproduces the observed link volumes. The paper then identifies three approaches to reduce this underspecification problem and produce a unique trip matrix consistent with the counts. The first approach consists of assuming that trip-making behaviour can be explained by a gravity model whose parameters can be calibrated from the traffic counts. Several forms of this gravity model have been put forward and they are discussed in Section 3. The second approach uses mathematical programming techniques associated to equilibrium assignment problems to estimate a trip matrix in congested areas. This method can also be supplemented by a special distribution model developed for small areas. The third approach relies on entropy and information theory considerations to estimate the most likely trip matrix consistent with the observed flows. A particular feature of this group is that they can include prior, perhaps outdated, information about the matrix.These three approaches are then compared and their likely areas for application identified. Problems for further research are discussed and finally an assessment is made of the possible role of these models vis-a-vis recent developments in transport planning.     

Modelling users’ behaviour in inter-urban carsharing program: A stated preference approach

In this paper, the effects of a inter-urban carsharing program on users’ mode choice behaviour were investigated and modelled through specification, calibration and validation of different modelling approaches founded on the behavioural paradigm of the random utility theory. To this end, switching models conditional on the usually chosen transport mode, unconditional switching models and holding models were investigated and compared. The aim was threefold: (i) to analyse the feasibility of a inter-urban carsharing program; (ii) to investigate the main determinants of the choice behaviour; (iii) to compare different approaches (switching vs. holding; conditional vs. unconditional); (iv) to investigate different modelling solutions within the random utility framework (homoscedastic, heteroscedastic and cross-correlated closed-form solutions). The set of models was calibrated on a stated preferences survey carried out on users commuting within the metropolitan area of Salerno, in particular with regard to the home-to-work trips from/to Salerno (the capital city of the Salerno province) to/from the three main municipalities belonging to the metropolitan area of Salerno. All of the involved municipalities significantly interact each other, the average trip length is about 30 km a day and all are served by public transport. The proposed carsharing program was a one-way service, working alongside public transport, with the possibility of sharing the same car among different users, with free parking slots and free access to the existent restricted traffic areas. Results indicated that the inter-urban carsharing service may be a substitute of the car transport mode, but also it could be a complementary alternative to the transit system in those time periods in which the service is not guaranteed or efficient. Estimation results highlighted that the conditional switching approach is the most effective one, whereas travel monetary cost, access time to carsharing parking slots, gender, age, trip frequency, car availability and the type of trip (home-based) were the most significant attributes. Elasticity results showed that access time to the parking slots predominantly influences choice probability for bus and carpool users; change in carsharing travel costs mainly affects carpool users; change in travel costs of the usually chosen transport mode mainly affects car and carpool users.     

A review of parking lot design models

The efficient design of parking lots is an important element in the development of the transport infrastructure. The design process often adopted is based on broad measures of parking demand, design manuals outlining the minimum size of the components and the experience of the designer. This process may not result in the best design. It is of particular concern that this process does not provide any quantitative information on the ‘level of service’ resulting from the choice of a parking layout. Models of parking systems provide this assistance. Existing models provide information on the utilization of the parking system, its capacity, the best distribution of parking space use and the delay experienced by parkers. Recent improvements in these models have been aided by rapid developments in computer and graphics technology. This paper reviews developments in models of parking lots.     

Maximum car ownership under constraints of road capacity and parking space

This paper presents a model for determining the maximum number of cars by zones in view of the capacity of the road network and the number of parking spaces available. In other words, the proposed model is to examine whether existing road network and parking supply is capable of accommodating future zonal car ownership growth (or the reserve capacity in each zone); i.e. the potential maximum zonal car ownership growth that generates the road traffic within the network capacity and parking space constraints. In the proposed model, the vehicular trip production and attraction are dependent on the car ownership, available parking spaces and the accessibility measures by traffic zones. The model is formulated as a bi-level programming problem. The lower-level problem is an equilibrium trip distribution/assignment problem, while the upper-level problem is to maximize the sum of zonal car ownership by considering travellers’ route and destination choice behaviour and satisfying the network capacity and parking space constraints. A sensitivity analysis based heuristic algorithm is developed to solve the proposed bi-level car ownership problem and is illustrated with a numerical example.     

Modeling and optimization of multimodal urban networks with limited parking and dynamic pricing

Cruising-for-parking constraints mobility in urban networks. Car-users may have to cruise for on-street parking before reaching their destinations. The accessibility and the cost of parking significantly influence people's travel behavior (such as mode choice, or parking facility choice between on-street and garage). The cruising flow causes delays eventually to everyone, even users with destinations outside limited parking areas. It is therefore important to understand the impact of parking limitation on mobility, and to identify efficient parking policies for travel cost reduction. Most existing studies on parking fall short in reproducing the dynamic spatiotemporal features of traffic congestion in general, lack the treatment of dynamics of the cruising-for-parking phenomenon, or require detailed input data that are typically costly and difficult to collect. In this paper, we propose an aggregated and dynamic approach for modeling multimodal traffic with the treatment on parking, and utilize the approach to design dynamic parking pricing strategies. The proposed approach is based on the Macroscopic Fundamental Diagram (MFD), which can capture congestion dynamics at network-level for single-mode and bi-modal (car and bus) systems. A parsimonious parking model is integrated into the MFD-based multimodal modeling framework, where the dynamics of vehicular and passenger flows are considered with a change in the aggregated behavior (e.g. mode choice and parking facility choice) caused by cruising and congestion. Pricing strategies are developed with the objective of reducing congestion, as well as lowering the total travel cost of all users. A case study is carried out for a bi-modal city network with a congested downtown region. An elegant feedback dynamic parking pricing strategy can effectively reduce travel delay of cruising and the generic congestion. Remarkably, such strategy, which is applicable in real-time management with limited available data, is fairly as efficient as a dynamic pricing scheme obtained from system optimum conditions and a global optimization with full information about the future states of the system. Stackelberg equilibrium is also investigated in a competitive behavior between different parking facility operators. Policy indications on on-street storage capacity management and pricing are provided.     

Estimating gravity model parameters: A simplified approach based on the odds ratio

Two computationally simple methods for calibrating the gravity model are presented in this paper. The use of each is demonstrated on several origin-destination trip tables, and the results compared with those obtained from the UTP system gravity model calibration procedure. Our methods, based on the odds ratio, perform at least as well as that of UTP system by several standard criteria.     

The role of accessibility in basic transportation choice behavior

Accessibility measures reflect the level of service provided by transportation systems to various locations. Basic transportation choice behavior is defined to include those decisions of how many automobiles to own and how many trips to which destinations to make by automobile and by public transit. Here, these decisions are assumed to be made jointly by urban households and are conditional upon residential location decisions. It is the purpose of this paper to explore the role of accessibility as a causal factor in such basic transportation choice behavior.An economic utility theory model of choice behavior is postulated in which the benefits from making trips to specific destinations are reflected by measures of destination attraction. Through determination of utility-maximizing trip frequencies, indirect utility functions are developed which include accessibility concepts. Behavioral implications of these concepts are proposed and contrasts are drawn to accessibility measures used in conventional segregated models of trip distribution, modal choice, and automobile ownership.Sensitivity analyses of alternative empirical definitions of accessibility in the choice model are conducted using data from the Detroit Regional Transportation and Land Use Study — covering counties in southeastern Michigan. These analyses employ a multinomial logit estimation technique and focus on definitions of trip attraction. Results of these analyses indicate that more complicated attraction measures can be replaced by measures involving the proportion of either urban area population or urban area employment within a traffic analysis zone. Also, evidence is found that decision-makers in the case study area consider trips of up to 60 or even 90 minutes duration when evaluating accessibilities offered by alternative public and private transportation systems.     

Adaptive choice behaviour of motorists in congested shopping centre parking lots

Currently existing models of parking choice behaviour typically focus on the choice of types of parking spaces. Implicitly these models assume that motorists have a free choice in that spaces are available. The adaptive behaviour which they reveal when faced with congested parking spaces is not explicitly modelled. The aim of this paper is to contribute to the growing literature on parking choice modelling by developing and testing a stated choice model of adaptive behaviour of motorists who are faced with fully occupied parking lots. The findings of the analyses indicate that the model performs satisfactory as indicated by its goodness-of-fit and the fact that all significant parameters were in anticipated directions.     

Parking difficulty and parking information system technologies and costs

Before the implementation of a parking information system, it is necessary to evaluate the parking difficulty, technology choice, and system costs. In this study, the parking problem was quantified by asking parkers to express their parking difficulties in five scaled levels from the least to the most difficult. An ordered Probit model was developed to identify the factors that influence a parker to feel the parking difficulty. The results indicate that the amount of parking information parkers had before their trips was directly related to their parking search time, which in turn, influenced their perceptions of parking difficulty. Parkers' preferences to parking information technologies were identified based on developing binary and multinomial probit models. The results indicate that personal business trips and older persons would like to use the kiosk, while the more educated and males would not. Trips with shopping and social/recreation purposes and the drivers who had visited the destination areas frequently would like to choose roadside display. Drivers who had planned their parking and had Internet access would use in‐vehicle device. The system cost was estimated based on the cost for each component of the system. The results show that providing en‐route parking search information through roadside displays is more expensive than providing pre‐trip information through a web site.     

A robust method for estimating transit passenger trajectories using automated data

Development of an origin-destination demand matrix is crucial for transit planning. The development process is facilitated by automated transit smart card data, making it possible to mine boarding and alighting patterns on an individual basis. This research proposes a novel trip chaining method which uses Automatic Fare Collection (AFC) and General Transit Feed Specification (GTFS) data to infer the most likely trajectory of individual transit passengers. The method relaxes the assumptions on various parameters used in the existing trip chaining algorithms such as transfer walking distance threshold, buffer distance for selecting the boarding location, time window for selecting the vehicle trip, etc. The method also resolves issues related to errors in GPS location recorded by AFC systems or selection of incorrect sub-route from GTFS data. The proposed trip chaining method generates a set of candidate trajectories for each AFC tag to reach the next tag, calculates the probability of each trajectory, and selects the most likely trajectory to infer the boarding and alighting stops. The method is applied to transit data from the Twin Cities, MN, which has an open transit system where passengers tap smart cards only once when boarding (or when alighting on pay-exit buses). Based on the consecutive tags of the passenger, the proposed algorithm is also modified for pay-exit cases. The method is compared to previous methods developed by the researchers and shows improvement in the number of inferred cases. Finally, results are visualized to understand the route ridership and geographical pattern of trips.