No abstract

This article proposes a prototype of an urban traffic control system based on a prediction‐after‐classification approach. In an off‐line phase, a repository of traffic control strategies for a set of (dynamic) traffic patterns is constructed. The core of this stage is the k‐means algorithm for daily traffic pattern identification. The clustering method uses the input attributes flow, speed, and occupancy and it transforms the dynamic traffic data at network level in a pseudo‐covariance matrix, which collects the dynamic correlations between the road links. A desirable number of traffic patterns is provided by Bayesian Information Criterion and the ratio of change in dispersion measurements. In an on‐line phase, the current daily traffic pattern is predicted within the repository and its associated control strategy is implemented in the traffic network. The dynamic prediction scheme is constructed on the basis of an existing static prediction method by accumulating the trials on set of patterns in the repository. This proposal has been assessed in synthetic and real networks testing its effectiveness as a data mining tool for the analysis of traffic patterns. The approach promises to effectively detect the current daily traffic pattern and is open to being used in intelligent traffic management systems.

A model of traveller behaviour should recognise the exogenous and endogenous factors that limit the choice set of users. These factors impose constraints on the decision maker, which constraints may be considered implicitly, as soft constraints imposing thresholds on the perception of changes in attribute values, or explicitly as hard constraints. The purpose of this paper is twofold: (1) To present a constrained nested logit-type choice model to cope with hard constraints. This model is derived from the entropymaximizing framework. (2) To describe a general framework to deal with (dynamic) nonlinear utilities. This approach is based on Reproducing Kernel Hilbert Spaces. The resulting model allows the dynamic aspect and the constraints on the choice process to be represented simultaneously. A novel estimation procedure is introduced in which the utilities are viewed as the parameters of the proposed model instead of attribute weights as in the classical linear models. A discussion on over-specification of the proposed model is presented. This model is applied to a synthetic test problem and to a railway service choice problem in which users choose a service depending on the timetable, ticket price, travel time and seat availability (which imposes capacity constraints). Results show (1) the relevance of incorporating constraints into the choice models, (2) that the constrained models appear to be a better fit than the counterpart unconstrained choice models; and (3) the viability of the approach, in a real case study of railway services on the Madrid-Seville corridor (Spain).

No abstract

No abstract