Evacuation traffic dynamics

Historically, evacuation models have relied on values of road capacity that are estimated based on Highway Capacity Manual methods or those observed during routine non-emergency conditions. The critical assumption in these models is that capacity values and traffic dynamics do not differ between emergency and non-emergency conditions. This study utilized data collected during Hurricanes Ivan (2004), Katrina (2005) and Gustav (2008) to compare traffic characteristics during mass evacuations with those observed during routine non-emergency operations. From these comparisons it was found that there exists a consistent and fundamental difference between traffic dynamics under evacuation conditions and those under routine non-emergency periods. Based on the analysis, two quantities are introduced: “maximum evacuation flow rates” (MEFR) and “maximum sustainable evacuation flow rates” (MSEFR). Based on observation, the flow rates during evacuations were found to reach a maximum value of MEFR followed by a drop in flow rate to a MSEFR that was able to be sustained over several hours, or until demand dropped below that necessary to completely saturate the section. It is suggested that MEFR represents the true measure of the “capacity”. These findings are important to a number of key policy-shaping factors that are critical to evacuation planning. Most important among these is the strong suggestion of policy changes that would shift away from the use of traditional capacity estimation techniques and toward values based on direct observation of traffic under evacuation conditions.     

A model of stoppings on urban bus routes

The amount of time required to pick up and discharge passengers is an important issue in the planning and modeling of urban bus systems. Several past studies have employed models of this component of bus travel time which are based, in part, on a model of the number of stoppings the bus makes to pick up or discharge passengers. Most past versions of this model have assumed that expected demand does not vary from stop to stop or from trip to trip, but that the number of passengers demanding service at any given stop during any given trip follows a Poisson distribution. An alternative model is derived, based on the assumption that expected demand varies among stops and times of day but is fixed from day to day at any given stop and time of day. Boarding and alighting survey data are used to verify that the “average-demand” Poisson model consistently overestimates the number of stoppings and to calibrate an approximate version of the alternative model. A stop-spacing optimization model previously developed by Kikuchi and Vuchic is reevaluated using the alternative stopping model in place of the average demand model used in the original version. The results are found to be considerably different, thus indicating that transit route optimization models are sensitive to the way in which stopping processes are modeled.     

The inverse power transformation logit and dogit mode choice models

This paper explores the properties of inverse Box-Cox and Box-Tukey transformations applied to the exponential functions of logit and dogit mode choice models. It is suggested that inverse power transformations allow for the introduction of modeler ignorance in the models and solve the “thin equal tails” problem of the logit model; it is also shown that they allow for asymmetry of response functions in both logit and dogit models by introducing alternative-specific parameters which make cross elasticities of demand among alternatives generally asymmetric. In the dogit model, modeler ignorance and consumer captivity remain conceptually distinct. Standard logit and dogit models appear as very special “perfect knowledge” cases in broad spectra of models which also include, among others, the reciprocal extreme value or log-Weibull variants. These improvements over the simple symmetric-thin-equal-tail-perfect-knowledge logit and the symmetric-pure-captivity dogit are achieved at the cost of introducing at the most two new parameters per alternative considered in the original logit and dogit mode choice models.     

Solution Methods for Robust Pricing of Transportation Networks under Uncertain Demand

Toll prices on traffic networks have been traditionally determined using a single expected demand value or deterministic demand supply relationships. Previous work by Gardner, Unnikrishnan, and Waller (2008) show that marginal social cost prices obtained using the expected value of demand can significantly deteriorate system performance especially when the actual system state deviates from the planned forecasted conditions. Determining the globally optimal tolls which are resilient to demand uncertainty entails a significantly high number of system performance evaluations which is a computationally intensive process. This work presents two practical methods to arrive at near optimal tolls – single point approximation methods and multiple point inflation/deflation approximation methods – and compares their performance in terms of computational efficiency and proximity to the optimal solution with two other commonly used meta-heuristics – Genetic Algorithm and Adaptive Simulated Annealing. Computational tests reveal that inflation/deflation methods can provide “near to optimal solutions” using a lower number of system performances in comparison to the meta-heuristics and single point approximation methods.     

Capacitated maximum covering location models: Formulations and solution procedures

This paper presents two formulations and two solution procedures for a capacitated maximum covering location problem. In the first formulation, the problem is presented as a mixed-interger linear programming model which maximizes covered demand. In the second model, the objective function maximizes the weighted covered demand while at the same time minimizing the average distance from the uncovered demands to the located facilities. The second formulation attempts to account for the assignment of the demand which is not “covered” to located facilities which have excess capacity. This assignment is very important, especially for locating emergency service facilities. Two heuristic procedures are proposed to solve these models. These are based on greedy adding technique and Lagrangian relaxation. At each iteration, the demands are allocated to the facilities using an out-of-kilter method. The performance of the solution techniques are compared to the optimal solutions in a variety of test problems.     

Prioritizing road extension projects with interdependent benefits under time constraint

Since transportation projects are costly and resources are limited, prioritizing or sequencing the projects is imperative. This study was inspired by a client who asked: “I have tens of approved road extension projects, but my financial resources are limited. I cannot construct all the projects simultaneously, so can you help me prioritize my projects?” To address this question, the benefits and costs of all the possible scenarios must be known. However, the impacts (or benefit) of road extension projects are highly interdependent, and in sizable cases cannot be specified thoroughly. We demonstrate that the problem is analogous to the Traveling Salesman Problem (TSP). Dynamic change in travel demand during construction is another aspect of the complexity of the problem. The literature is yet to provide efficient methods for large cases. To this end, we developed a heuristic methodology in which the variation of travel demand during the construction period is considered. We introduce a geometrical objective function for which a solution-finding policy based on “gradient maximization” is developed. To address the projects’ interdependency, a special neural network (NN) model was devised. We developed a search engine hybridized of Ant Colony and Genetic Algorithm to seek a solution to the TSP-like problem on the NN based on gradient maximization. The algorithm was calibrated and applied to real data from the city of Winnipeg, Canada, as well as two cases based on Sioux-Falls. The results were reliable and identification of the optimum solution was achievable within acceptable computational time.     

An integrated traffic-driving simulation framework: Design,implementation, and validation

This paper first describes the process of integrating two distinct transportation simulation platforms, Traffic Simulation models and Driving Simulators, so as to broaden the range of applications for which either type of simulator is applicable. To integrate the two distinct simulation platforms, several technical challenges needed to be overcome including reconciling differences in update frequency, coordinate systems, and the fidelity levels of the vehicle dynamics models and graphical rendering requirements of the two simulators. Following the successful integration, the integrated simulator was validated by having several human subjects drive a 2.5 mile long segment of a signalized arterial in both the virtual environment of the integrated simulator, and in the real-world during the evening “rush hour”. Several aspects of driving behavior were then compared between the human subjects’ driving in the “virtual” and the real world. The comparisons revealed generally similar behavior, in terms of average corridor-level travel time, deceleration/acceleration patterns, lane-changing behavior, as well as energy consumption and emissions production. The paper concludes by suggesting possible extensions of the developed prototype which the researchers are currently pursuing, including integration with a computer networking simulator, to facilitate Connected Vehicle (CV) and Vehicle Ad-hoc Network (VANET) related studies, and a multiple participant component that allows several human drivers to interact simultaneously within the integrated simulator.     

Practical modelling of trip re-scheduling under congested conditions

There is plenty of evidence that drivers may make small changes in their time of travel to take advantage of lower levels of congestion. However, progress in the practical modelling of such “micro” re-scheduling within peak period traffic remains slow. While there exist research papers describing theoretical solutions, techniques for practical use are not generally available. Most commonly used assignment programs are temporally aggregate, while packages which do allow some “dynamic assignment” typically assume a fixed demand profile.The aim of the paper is to present a more heuristic method which could at least be used on an interim basis. The assumption is that the demand profile can be segmented into a number of mutually exclusive “windows” in relation to the “preferred arrival time”, while on the assignment side, independently defined sequential “timeslices” are used in order to respect some of the dynamic processes relating to the build-up of queues. The demand process, whereby some drivers shift away from their preferred window, leads to an iterative procedure with the aim of achieving reasonable convergence.Using the well-known scheduling theory developed by Vickrey, Small, and Arnott, de Palma & Lindsey, the basic approach can be described, extending from the simple “bottleneck”, to which the theory was originally applied, to a general network. So far, insufficient research funds have been made available to test the approach properly. It is hoped that by bringing the ideas into the public domain, further research into this area may be stimulated.     

Dynamic process model of mass effects on travel demand

Whereas transportation planners commonly predict the negative impacts of mass transportation, there is increasing empirical evidence of the existence of positive mass effects, whereby increased use of a mode by the ‘mass’ will generally increase its attractiveness for future travellers. In this paper we consider the dynamic impact of such an effect on the problem of travel demand forecasting, with particular regards to social network effects. Our proposed modelling approach is inspired by literature from social physics, evolutionary game theory and marketing. For simplicity of exposition, our model is specified for a scenario in which (a) there is a binary choice between two mobility lifestyles, referred to as car-oriented and transit-oriented, and (b) there are two population groups, where one is the “leading” or “innovative” population group and the other the “following” or “imitating” population group. This latter distinction follows the rather well-known Bass model from the marketing literature (1969). We develop the transition probabilities and transition dynamics. We illustrate with a numerical case study that despite lower intrinsic utility for the transit lifestyle, significant changes towards this lifestyle can be achieved by considering congestion, service improvements and mass effects. We further illustrate that mass effects can be positive or negative. In all cases we explore the sensitivity of our conclusions to the assumed parameter values.     

Consistent formulation of network equilibrium with stochastic flows

Traffic flows in real-life transportation systems vary on a daily basis. According to traffic flow theory, such variability should induce a similar variability in travel times, but this “internal consistency” is generally not captured by existing network equilibrium models. We present an internally-consistent network equilibrium approach, which considers two potential sources of flow variability: (i) daily variation in route choice and (ii) daily variation in origin–destination demand. We particularly aspire to a flexible formulation that permits alternative statistical assumptions, which allows the best fit to be made to observed variability data in particular applications. Joint probability distributions of route—and therefore link—flows are derived under several assumptions concerning stochastic driver behavior. A stochastic network equilibrium model with stochastic demands and route choices is formulated as a fixed point problem. We explore limiting cases which allow an equivalent convex optimization problem to be defined, and finally apply this method to a real-life network of Kanazawa City, Japan.     

Dynamic diurnal social taxonomy of urban environments using data from a geocoded time use activity-travel diary and point-based business establishment inventory

In this paper, we explore the diurnal dynamics of joint activity participation in a small city in Pennsylvania, USA, using behavioral data and an inventory of business establishments. We account for the variation caused by the collective impact of social, temporal and spatial choices of individuals to produce predicted space–time visualizations of activity participation. The focus is on how social contexts of an activity impact the temporal and spatial decisions regarding the activity locations and how this impact varies depending on activity types. A comparison across activity types and social interaction types is made among spatial patterns during a day. The CentreSIM dataset, which is a household-based activity diary survey collected in Centre County (Pennsylvania, USA) in 2003, provides very detailed social interaction information enabling the analysis of social, spatial and temporal aspects of activity participation. In this paper we use this information to develop a spatio-temporal interpolation method and demonstration based on kriging. In this way, we extract the dynamic social taxonomy of places from the behavioral information in the dataset and suggest how urban and transportation models can be informed from the dynamics of places by observing “what is taking place” (activities being pursued in the context of this paper) combined with “what exists” (business establishments) or “what is available” (businesses that are open). The method here can also be used to improve the design of urban environments (e.g., filling gaps in desired activity locations), manage specific places (e.g., extending the opening and closing times of businesses), study transportation policies that are sensitive to time of day (e.g., pricing of parking to discourage crowding and traffic congestion), and modeling of spatio-temporal decisions of social activities in travel demand models (e.g., to guide the development of model specification and representation of the space in which behavioral models are applied).     

Assessment of schedule-based and frequency-based assignment models for strategic and operational planning of high-speed rail services

Despite some substantial limitations in the simulation of low-frequency scheduled services, frequency-based (FB) assignment models are by far the most widely used in practice. They are less expensive to build and less demanding from the computational viewpoint with respect to schedule-based (SB) models, as they require neither explicit simulation of the timetable (on the supply side), nor segmentation of OD matrices by desired departure/arrival time (on the demand side).The objective of this paper is to assess to what extent the lack of modeling capabilities of FB models is acceptable, and, on the other hand, the cases in which such approximations are substantial and more detailed SB models are needed. This is a first attempt to shed light on the trade-off between (frequency-based) model inaccuracy and (scheduled-based) model development costs in the field of long-distance (e.g. High-speed Rail, HSR) service modeling.To this aim, we considered two modeling specifications estimated using mixed Revealed Preferences (RP) and Stated Preferences (SP) surveys and validated with respect to the same case study. Starting from an observed (baseline) scenario, we artificially altered the demand distributions (uniform vs. time-varying demand) and the supply configuration (i.e. train departure times), and analyzed the differences in modal split estimates and flows on individual trains, using the two different model specifications.It resulted that when the demand distribution is uniform within the period of analysis, such differences are significant only when departure times of trains are strongly unevenly spaced in time. In such cases, the difference in modal shares, using FB w.r.t. SB, is in the range of [0%, +5%] meaning that FB models tend to overestimate HSR modal shares. When the demand distribution is not uniform, the difference in modal shares, using FB w.r.t. SB, is in the range of [−10%, +10%] meaning that FB models can overestimate or underestimate HSR modal shares, depending on timetable settings with respect to travelers’ desired departure times. The differences in on-board train flow estimates are more substantial in both cases of uniform and not uniform demand distribution.     

Profit-based maritime container assignment models for liner shipping networks

We propose the problem of profit-based container assignment (P-CA), in which the container shipment demand is dependent on the freight rate, similar to the “elastic demand” in the literature on urban transportation networks. The problem involves determining the optimal freight rates, the number of containers to transport and how to transport the containers in a liner shipping network to maximize the total profit. We first consider a tactical-level P-CA with known demand functions that are estimated based on historical data and formulate it as a nonlinear optimization model. The tactical-level P-CA can be used for evaluating and improving the container liner shipping network. We then address the operational-level P-CA with unknown demand functions, which aims to design a mechanism that adjusts the freight rates to maximize the profit. A theoretically convergent trial-and-error approach, and a practical trial-and-error approach, are developed. A numerical example is reported to illustrate the application of the models and approaches.     

Traveler delay costs and value of time with trip chains, flexible activity scheduling and information

The delay costs of traffic disruptions and congestion and the value of travel time reliability are typically evaluated using single trip scheduling models, which treat the trip in isolation of previous and subsequent trips and activities. In practice, however, when activity scheduling to some extent is flexible, the impact of delay on one trip will depend on the actual and predicted travel time on itself as well as other trips, which is important to consider for long-lasting disturbances and when assessing the value of travel information. In this paper we extend the single trip approach into a two trips chain and activity scheduling model. Preferences are represented as marginal activity utility functions that take scheduling flexibility into account. We analytically derive trip timing optimality conditions, the value of travel time and schedule adjustments in response to travel time increases. We show how the single trip models are special cases of the present model and can be generalized to a setting with trip chains and flexible scheduling. We investigate numerically how the delay cost depends on the delay duration and its distribution on different trips during the day, the accuracy of delay prediction and travel information, and the scheduling flexibility of work hours. The extension of the model framework to more complex schedules is discussed.     

On macroscopic freeway merge behavior: Estimation of merge ratios using asymmetric lane flow distribution

Data from several freeway merges reveal that, contrary to some previous findings, merge ratio can vary within a site with respect to the merge outflow and that the existing merge ratio estimates based on lane counts are not able to predict this within-site variation. Furthermore, the merge ratios estimated based on two well-known merging principles, “fair-share” and “zipper,” are found to be inaccurate for merges where merging streams compete directly due to a lane drop. In light of these findings, we estimate merge ratios using lane flow distribution (LFD) to better predict between and within site variations of merge ratio. In addition, we propose a merging principle specific for merges with a single lane-drop. The model was developed to better represent observed non-uniform redistribution of merging flow not captured by the current merge ratio estimation methods and merging principles. Empirical observations show that the proposed methods are able to improve merge ratio estimates, reproduce within-site variations of merge ratio, and represent more accurately non-uniform redistribution of merging flow dependent on the merge geometry.     

Improved modeling of park‐and‐ride transfer time: Capturing the within‐day dynamics

An important factor that affects park‐and‐ride demand is transfer time. However, conventional park‐and‐ride demand models treat transfer time as a single value, without considering the time‐of‐day effect. Since early comers usually occupy spots closer to the entrance, their transfer times are shorter. Hence, there is a relationship between arrival time and transfer time. To analyze this relationship, a micro‐simulation model is developed. The model simulates the queuing system at the entrance and the pattern that parking spots are occupied in the parking lot over time. As expected, the model output illustrates an increasing relationship between arrival time and transfer time. This relationship has significant implication in mode choice models because it means that the attractiveness of park‐and‐ride depends on the time of arrival at the park‐and‐ride lot. This model of park‐and‐ride transfer time can potentially improve travel demand forecasting, as well as facilitate the operation and design of park‐and‐ride facilities.     

Development of destination choice model with pairwise district-level constants using taxi GPS data

In this paper, a destination choice model with pairwise district-level constants is proposed for trip distribution based on a nearly complete OD trip matrix in a region. It is found that the coefficients are weakly identified in a destination choice model with pairwise zone-level constants. Thus, a destination choice model with pairwise district-level constants is then proposed and an iterative algorithm is developed for model estimation. Herein, the “district” means a spatial aggregation of a number of zones. The proposed model is demonstrated through simulation experiments. Then, destination choice models with and without pairwise district-level constants are estimated based on GPS data of taxi passenger trips collected during morning peak hours within the Inner Ring Road of Shanghai, China. The datasets comprise 504,187 trip records and a sample of 10,000 taxi trips for model development. The zones used in the study are actually 961 residents’ committees while the districts are 52 residential districts that are spatial aggregations and upper-level administrative units of residents’ committees. It is found that the estimated value of time dramatically drops after the involvement of district-level constants, indicating that the traditional model tends to overestimate the value of time when ignoring pairwise associations between two zones in trip distribution. The proposed destination choice model can ensure its predicted trip OD matrix to match the observed one at district level. Thus, the proposed model has potential to be widely applied for trip distribution under the situation where a complete OD trip matrix can be observed.     

Trend analysis of activity generation attributes over time

Activity generation models are relatively poorly developed in activity-based travel demand modelling frameworks. This research investigates whether observed distributions of activity attributes (activity frequency, start time and duration) used as inputs in the activity generation component of an activity-based travel demand model have changed over time. This research empirically examines changes in the distributions of activity generation attributes over time in the Greater Montreal area (GMA), Quebec, Canada. It also focuses on how these attributes vary with peoples’ socio-demographic characteristics. This research relies on the 1998, 2003 and 2008 origin–destination (O–D) household travel surveys of the GMA. The comparative analysis at three time points in a 10-year period clearly reveals that distributions of activity attributes are significantly changing over time. Work and school activities show similar trends; frequency “1” has increased and frequency “2+” has decreased over time. The occurrence of shopping activity on weekdays is decreasing over time. Start time and duration distributions for each activity have also changed significantly over time. The research allows preparing activity attributes for the application of an activity-based model, TASHA, such that they reflect temporal changes in travel behaviour of the GMA.