A variational inequality reformulation of a congested transit assignment model by Cominetti, Correa, Cepeda, and Florian

In the paper by Cominetti and Correa (2001) [Common-lines and passenger assignment in congested transit networks. Transportation Science 35 (3), pp 250-267], an extension to the common-lines problem for general multidestination networks under congestion is analyzed. Their transit equilibrium assignment model allows for a full representation of congestion effects caused by the variation of effective frequencies experienced by passengers at transit stops. This model is the first to address these characteristics consistently with the concept of strategies. In a subsequent paper by Cepeda et al. (2006) [Cepeda, M., Cominetti, and R. Florian, M. (2006) A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria. Trans. Res B 40, 437-459], the computation of equilibrium is performed heuristically by the minimization of a gap function, using the method of successive averages. In this paper, a reformulation of this congested transit equilibrium assignment model is performed, demonstrating that the problem can be expressed as an equivalent variational inequality. The case of strictly capacitated transit networks is explored under the scope of this new reformulation, and new, broader conditions for the existence of solutions to this congested transit assignment model are determined.Peer ReviewedPostprint (published version

A dynamic estimation of passenger OD matrices based on space-state models

Dynamic OD passenger matrices must be taken into account when designing robust public transport systems. The adjustment of these matrices is examined using passenger counts provided by a space-state model formulation in a demand-variable peak-period. The Kalman filter approach also incorporates ICT data, based on the detection of the electronic signature of on-board devices, thus providing a rich source of data that can be used in space-state models to simplify its formulation. It reduces the dimension of the state vector and allows a linear mapping between state variables and measurements.Peer ReviewedPostprint (author’s final draft

Dynamic OD transit matrix estimation: formulation and model-building environment

The aim of this paper is to provide a detailed description of a framework for the estimation of time-sliced origin-destination (OD) trip matrices in a transit network using counts and travel time data of Bluetooth Smartphone devices carried by passengers at equipped transit-stops. A Kalman filtering formulation defined by the authors has been included in the application. The definition of the input for building the space-state model is linked to network scenarios modeled with the transportation planning platform EMME. The transit assignment framework is optimal strategy-based, which determines the subset of paths related to the optimal strategies between all OD pairsPeer ReviewedPostprint (author’s final draft

A computational comparison of two simplicial decomposition approaches for the separable traffic assignment problems : RSDTA and RSDVI

Draft pel 4th Meeting del Euro Working Group on Transportation (Newcastle 9-11 setembre de 1.996)The class of simplicial decomposition methods has shown to constitute efficient tools for the solution of the variational inequality formulation of the general traffic assignment problem. The paper presents a particular implementation of such an algorithm, called RSDVI, and a restricted simplicial decomposition algorithm, developed adhoc for diagonal, separable, problems named RSDTA. Both computer codes are compared for large scale separable traffic assignment problems. Some meaningful figures are shown for general problems with several levels of asymmetry.Preprin

The general traffic assignment problem: a proximal point method for equilibrium computation with applications to the demand adjustment problem

An adaptation of the proximal algorithm for the traffic assignment problem under a user equilibrium formulation for a general asymmetric traffic network is presented in this paper. It follows the recently published results of Pennanen regarding convergence under non monotonicity. As it is well known the problem can be formulated as a variational inequality and the algorithmic solutions developed up to date guarantee convergence only under too restrictive conditions which are difficult to appear in practice. In this paper it is also discussed the possibility of including the algorithm on a demand adjustment problem formulated as a bilevel program with lower level traffic equilibrium constraints expressed as a variational inequality.Peer ReviewedPostprint (published version

A heuristic method for a congested capacitated transit assignment model with strategies

This paper addresses the problem of solving the congested transit assignment problem with strict capacities. The model under consideration is the extension made by Cominetti and Correa (2001), for which the only solution method capable of resolving large transit networks is the one proposed by Cepeda et al. (2006). This transit assignment model was recently formulated by the authors as both a variational inequality problem and a fixed point inclusion problem. As a consequence of these results, this paper proposes an algo- rithm for solving the congested transit assignment problem with strict line capacities. The proposed method consists of using an MSA-based heuristic for finding a solution for the fixed point inclusion formulation. Additionally, it offers the advantage of always obtain- ing capacity-feasible flows with equal computational performance in cases of moderate congestion and with greater computational performance in cases of highly congested net- works. A set of computational tests on realistic small- and large-scale transit networks un- der various congestion levels are reported, and the characteristics of the proposed method are analyzed.Peer ReviewedPostprint (author's final draft

Dynamic user equilibrium on traffic networks. An analysis and a discretized model

This paper formulates a discretized version of the Dynamic User Equilibrium problem on traffic networks as a variational inequality problem with special emphasys on the traffic dynamics. A finite difference approximation to the simple continuum model is generalized to the case of a multidestination network, giving to the resulting model a bilivel programming structure and an heuristic algorithm is outlined to solve the model.Peer ReviewedPostprint (published version

Diseño de Servicios Auxiliares de Líneas de autobuses en interrupciones de metro y cercanías

En la ponencia se aborda el problema del soporte de líneas auxiliares de autobús en el caso de interrupción de servicio de los servicios de metro y de trenes de cercanías en redes de transporte de ámbito urbano y/o metropolitano. Las líneas de metro y de cercanías permiten transportar enormes cantidades de viajeros en las áreas metropolitanas y en las grandes ciudades de forma efectiva y sostenible medioambientalmente. De hecho, constituyen la columna vertebral del sistema de transporte urbano y posibilitan una gran parte de las actividades humanas en estos entornos. Es por tanto así que la confianza de los usuarios en estos sistemas de transporte resulta clave tanto para la economía como para la sostenibilidad y que un factor clave para el sostenimiento de dicha confianza es la regularidad de estos servicios de transporte

An heuristic algorithm for dynamic network loading

This paper describes an heuristic procedure for the problem of determining the time evolution of traffic flows and routes on a road net work with the key requirement that its computational costs must be appealing so as to include it as part of a real time Traffic Management System.Peer ReviewedPostprint (published version

A stochastic congested strategy-based transit assignment model with hard capacity constraints

This paper expands on the stochastic version of the strategy-based congested transit assignment problem described in Codina and Rosell (2017b), specifically by extending it to cases dealing with explicit line capacities. Following this previous work, the stochastic model with explicit line capacities takes into account the stochastic mean waiting times and in-vehicle travel times of passengers at stops during the standard scenario journey of the planning period. This slightly modified model is formulated also as a stochastic variational inequality derived from the deterministic version of the problem with similar properties and characteristics, formulated by the authors in a previous work. For this stochastic capacitated model, two algorithms are presented which may take advantage of simplified simulation models for the bus stops in order to provide realistic mean waiting times for passengers at stops. Both algorithms can be easily adapted to the case of the model with non-strict capacities by Codina and Rosell (2017b)Peer ReviewedPostprint (published version