This paper discusses choice set generation and route choice model estimation for large-scale urban networks. Evaluating the effectiveness of Advanced Traveler Information Systems (ATIS) requires accurate models of how drivers choose routes based on their awareness of the roadway network and their perceptions of travel time. Many of the route choice models presented in the literature pay little attention to empirical estimation and validation procedures. In this paper, a route choice data set collected in Boston is described and the ability of several different route generation algorithms to produce paths similar to those observed in the survey is analyzed. The paper also presents estimation results of some route choice models recently developed using the data set collected.

No abstract

A new link-nested logit model of route choice is presented. The model is derived as a particular case of the generalized-extreme-value class of discrete choice models. The model has a flexible correlation structure that allows for overcoming the route overlapping problem. The corresponding stochastic user equilibrium is formulated in two equivalent mathematical programming forms: as a particular case of the general Sheffi formulation and as a generalization of the logit-based Fisk formulation. A stochastic network loading procedure is proposed that obviates route enumeration. The proposed model is then compared with alternative assignment models by using numerical examples.

This article considers the stochastic user equilibrium (SUE) problem with the route choice model based on the C-logit function. The C-logit model has a simple closed-form analytical probability expression and requires relatively lower calibration efforts and represents a more realistic route choice behaviour compared with the multinomial logit model. This article proposes two versions of the C-logit SUE model that captures the route similarity using different attributes in the commonality factors. The two versions differ with respect to the independence assumption between cost and flow. The corresponding stochastic traffic equilibrium models are called the length-based and congestion-based C-logit SUE models, respectively. To formulate the length-based C-logit SUE model, an equivalent mathematical programming formulation is proposed. For the congestion-based C-logit SUE model, we provide two equivalent variational inequality formulations. To solve the proposed formulations, a new self-adaptive gradient projection algorithm is developed. The proposed formulations and new solution algorithm are tested in two well-known networks. Numerical results demonstrate the validity of the formulations and solution algorithm.

No abstract

SUMMARYLong-distance trips are generally under-reported in typical household surveys, because of relative low frequency of these trips. This paper proposes to utilize location data from cellular phone systems in order to study long-distance travel patterns. The proposed approach allows passive data collection on many travelers over a long period of time at low costs. The paper presents the results of a study that applies cellular phone technology to assess trips at the national level. The method was specifically designed to capture long distance trips, as part of the development of a national demand model conducted for the Economics and Planning Department of the Israel Ministry of Transport. The method allows the construction of origin-destination tables directly from the cellular phone positions. The paper presents selected results to illustrate the potential of the method for transportation planning and analysis.

The network loading process of stochastic traffic assignment is investigated. A central issue in the assignment problem is the behavioral assumption governing route choice, which concerns the definition of available routes and the choice model. These two problems are addressed and reviewed. Although the multinomial logit model can be implemented efficiently in stochastic network loading algorithms, the model suffers from theoretical drawbacks, some of them arising from the independence of irrelevant alternatives property. As a result, the stochastic loading on routes that share common links is overloaded at the overlapping parts of the routes. Other logit-family models recently have been proposed to overcome some of the theoretical problems while maintaining the convenient analytical structure. Three such models are investigated: the C-logit model, which was specifically defined for route choice; and two general discrete-choice models, the cross-nested logit model and the paired combinatorial logit model. The two latter models are adapted to route choice, and simple network examples are presented to illustrate the performance of the models with respect to the overlapping problem. The results indicate that all three models perform better than does the multinomial logit model. The cross-nested logit model has an advantage over the two other generalized models because it enables performing stochastic loading without route enumeration. The integration of this model with the stochastic equilibrium problem is discussed, and a specific algorithm using the cross-nest logit model is presented for the stochastic loading phase.

No abstract