Skip to main content

ROBUSTEZ, RECUPERACION Y ADAPTABILIDAD DE SISTEMAS DE TRANSPORTE PUBLICO

TRA2014-52530-C3-3-P

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2014
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 8
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

A stochastic version of the strategy-based congested transit assignment model and a technique by smoothing approximations

  • Codina Sancho, Esteve|||0000-0002-9431-6158
  • Rosell Camps, Francisca|||0000-0003-3935-9267
This paper develops a stochastic version for the strategybased congested transit assignment problem stated by Cominetti and Correa (Trans. Sci. 35(3):250-267, 2001). As a distinctive approach, this stochastic version takes into account stochastic mean waiting times of passengers at stops and in-vehicle travel times. The model is formulated as a stochastic variational inequality derived from the formulation of the deterministic version of the problem, also stated as a variational inequality problem, for which only a single solution method is known uptodate. Closely related with the stochastic model, and as a special case of it, a consistent smoothing approximation to the deterministic model is developed and it is shown that this approximation provides an alternative way of solving the deterministic model. It is also shown that both, the stochastic model and the smoothed approximation, can be solved by means of an adaptation of a path based method for the asymmetric traffic assignment problem. Computational tests have been carried out on several medium-large scale networks showing the viability of the method and its applicability to large scale transit models., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Towards a generic benchmarking platform for origin–destination flows estimation/updating algorithms: design, demonstration and validation

  • Antoniou, Constantinos
  • Barceló Bugeda, Jaime|||0000-0001-6195-6434
  • Breen, Martijn
  • Bullejos, Manuel
  • Casas, Jordi
  • Cipriani, Ernesto
  • Ciuffo, Biagio
  • Djukic, Tamara
  • Hoogendoorn, Serge
  • Marzano, Vittorio
  • Montero Mercadé, Lídia|||0000-0001-5722-138X
  • Nigro, Marialisa
  • Perarnau, Josep
  • Punzo, Vincenzo
  • Toledo, Tomer
  • van Lint, Hans
Estimation/updating of origin-destination (OD) flows and other traffic state parameters is a classical, widely adopted procedure in transport engineering, both in off-line and in on-line contexts. Notwithstanding numerous approaches proposed in the literature, there is still room for considerable improvements, also leveraging the unprecedented opportunity offered by information and communication technologies and big data. A key issue relates to the unobservability of OD flows in real networks – except from closed highway systems – thus leading to inherent difficulties in measuring performance of OD flows estimation/updating methods and algorithms. Starting from these premises, the paper proposes a common evaluation and benchmarking framework, providing a synthetic test bed, which enables implementation and comparison of OD estimation/updating algorithms and methodologies under “standardized” conditions. The framework, implemented in a platform available to interested parties upon request, has been flexibly designed and allows comparing a variety of approaches under various settings and conditions. Specifically, the structure and the key features of the framework are presented, along with a detailed experimental design for the application of different dynamic OD flow estimation algorithms. By way of example, applications to both off-line/planning and on-line algorithms are presented, together with a demonstration of the extensibility of the presented framework to accommodate additional data sources, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Case study on cooperative car data for estimating traffic states in an urban network

  • Montero Mercadé, Lídia|||0000-0001-5722-138X
  • Pacheco, Meritxell
  • Barceló Bugeda, Jaime|||0000-0001-6195-6434
  • Homoceanu, Silviu
  • Casanovas Garcia, Josep|||0000-0002-7026-0962
The use of floating car data as a particular case of probe vehicle data has been the object of extensive research for estimating traffic conditions, travel times, and origin-to-destination trip matrices. It is based on data collected from a GPS-equipped vehicle fleet or available cell phones. Cooperative cars with vehicle-to-vehicle and vehicle-to-infrastructure communication capabilities represent a step forward, as they also allow tracking of vehicles surrounding the equipped car. This paper presents the results of a limited experiment with a small fleet of cooperative cars in the central business district of Barcelona, Spain, known as L’Eixample District. Data collected from the experiment were used to build and calibrate the emulation of cooperative functions in a microscopic simulation model that captured the behavior of vehicle sensors in Barcelona’s central business district. Such a calibrated model allows emulating fleet data on a large scale that goes far beyond what a small fleet of cooperative vehicles could capture. To determine the traffic state, several approaches were developed for estimating traffic variables—whose accuracy depends on the penetration level of the technology—on the basis of extensions of Edie’s generalized definitions of the fundamental traffic variables with the emulated data., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

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

  • Codina Sancho, Esteve|||0000-0002-9431-6158
  • Rosell Camps, Francisca|||0000-0003-3935-9267
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 Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Case study on cooperative car data for estimating traffic states in an urban network

  • Montero Mercadé, Lídia
  • Pacheco, Meritxell
  • Barceló Bugeda, Jaime
  • Homoceanu, Silviu
  • Casanovas Garcia, Josep
The use of floating car data as a particular case of probe vehicle data has been the object of extensive research for estimating traffic conditions, travel times, and origin-to-destination trip matrices. It is based on data collected from a GPS-equipped vehicle fleet or available cell phones. Cooperative cars with vehicle-to-vehicle and vehicle-to-infrastructure communication capabilities represent a step forward, as they also allow tracking of vehicles surrounding the equipped car. This paper presents the results of a limited experiment with a small fleet of cooperative cars in the central business district of Barcelona, Spain, known as L’Eixample District. Data collected from the experiment were used to build and calibrate the emulation of cooperative functions in a microscopic simulation model that captured the behavior of vehicle sensors in Barcelona’s central business district. Such a calibrated model allows emulating fleet data on a large scale that goes far beyond what a small fleet of cooperative vehicles could capture. To determine the traffic state, several approaches were developed for estimating traffic variables—whose accuracy depends on the penetration level of the technology—on the basis of extensions of Edie’s generalized definitions of the fundamental traffic variables with the emulated data., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A stochastic version of the strategy-based congested transit assignment model and a technique by smoothing approximations

  • Codina Sancho, Esteve
  • Rosell Camps, Francisca
This paper develops a stochastic version for the strategybased congested transit assignment problem stated by Cominetti and Correa (Trans. Sci. 35(3):250-267, 2001). As a distinctive approach, this stochastic version takes into account stochastic mean waiting times of passengers at stops and in-vehicle travel times. The model is formulated as a stochastic variational inequality derived from the formulation of the deterministic version of the problem, also stated as a variational inequality problem, for which only a single solution method is known uptodate. Closely related with the stochastic model, and as a special case of it, a consistent smoothing approximation to the deterministic model is developed and it is shown that this approximation provides an alternative way of solving the deterministic model. It is also shown that both, the stochastic model and the smoothed approximation, can be solved by means of an adaptation of a path based method for the asymmetric traffic assignment problem. Computational tests have been carried out on several medium-large scale networks showing the viability of the method and its applicability to large scale transit models., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

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

  • Codina Sancho, Esteve
  • Rosell Camps, Francisca
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 Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Towards a generic benchmarking platform for origin–destination flows estimation/updating algorithms: design, demonstration and validation

  • Antoniou, Constantinos
  • Barceló Bugeda, Jaime
  • Breen, Martijn
  • Bullejos, Manuel
  • Casas, Jordi
  • Cipriani, Ernesto
  • Ciuffo, Biagio
  • Djukic, Tamara
  • Hoogendoorn, Serge
  • Marzano, Vittorio
  • Montero Mercadé, Lídia
  • Nigro, Marialisa
  • Perarnau, Josep
  • Punzo, Vincenzo
  • Toledo, Tomer
  • van Lint, Hans
Estimation/updating of origin-destination (OD) flows and other traffic state parameters is a classical, widely adopted procedure in transport engineering, both in off-line and in on-line contexts. Notwithstanding numerous approaches proposed in the literature, there is still room for considerable improvements, also leveraging the unprecedented opportunity offered by information and communication technologies and big data. A key issue relates to the unobservability of OD flows in real networks – except from closed highway systems – thus leading to inherent difficulties in measuring performance of OD flows estimation/updating methods and algorithms. Starting from these premises, the paper proposes a common evaluation and benchmarking framework, providing a synthetic test bed, which enables implementation and comparison of OD estimation/updating algorithms and methodologies under “standardized” conditions. The framework, implemented in a platform available to interested parties upon request, has been flexibly designed and allows comparing a variety of approaches under various settings and conditions. Specifically, the structure and the key features of the framework are presented, along with a detailed experimental design for the application of different dynamic OD flow estimation algorithms. By way of example, applications to both off-line/planning and on-line algorithms are presented, together with a demonstration of the extensibility of the presented framework to accommodate additional data sources, Peer Reviewed, Postprint (author's final draft)