<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Community:</title>
    <link>http://hdl.handle.net/2117/3625</link>
    <description />
    <pubDate>Fri, 24 May 2013 19:17:07 GMT</pubDate>
    <dc:date>2013-05-24T19:17:07Z</dc:date>
    <itunes:owner>
      <itunes:email>webmaster.bupc@upc.edu</itunes:email>
      <itunes:name>Universitat Politècnica de Catalunya. Servei de Biblioteques i Documentació</itunes:name>
    </itunes:owner>
    <itunes:explicit>no</itunes:explicit>
    <itunes:keywords />
    <item>
      <title>ICT based estimation of time-dependent origin-destination matrices</title>
      <link>http://hdl.handle.net/2117/19209</link>
      <description>Title: ICT based estimation of time-dependent origin-destination matrices
Authors: Barceló Bugeda, Jaime; Montero Mercadé, Lídia; Marqués, Laura; Carmona, Carlos
Abstract: Time-Dependent Origin-Destination (OD) matrices are a key input to Dynamic Traffic Models, microscopic and mesoscopic traffic simulators are relevant examples of such models, traditionally used to assist in the design and evaluation of Traffic Management and Information Systems (ATMS/ATIS). Dynamic traffic models are also starting to be used to support real-time traffic management decisions. The typical approaches to the time-dependent OD estimation have been based either on ad hoc heuristics using mathematical programming approaches, or on Kalman-Filtering. The advent of the new Information and Communication Technologies (ICT), as for example Automatic Vehicle Location, License Plate Recognition, detection of mobile devices, Vehicle to Infrastructure (V2I) and so on, makes available new types of traffic data of higher quality and accuracy allowing for new modeling hypothesis leading to more computationally efficient algorithms. This paper extends the previous research on Kalman Filtering approaches for Freeway OD estimation using these data, to more complex topologies of urban networks were alternative path choices between origins and destinations are available. Ad hoc procedures based on Kalman Filtering have been designed and implemented successfully and the numerical results of the computational experiments are presented and discussed.</description>
      <pubDate>Tue, 14 May 2013 12:53:43 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19209</guid>
      <dc:date>2013-05-14T12:53:43Z</dc:date>
      <itunes:author>Barceló Bugeda, Jaime; Montero Mercadé, Lídia; Marqués, Laura; Carmona, Carlos</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>Time-Dependent Origin-Destination (OD) matrices are a key input to Dynamic Traffic Models, microscopic and mesoscopic traffic simulators are relevant examples of such models, traditionally used to assist in the design and evaluation of Traffic Management and Information Systems (ATMS/ATIS). Dynamic traffic models are also starting to be used to support real-time traffic management decisions. The typical approaches to the time-dependent OD estimation have been based either on ad hoc heuristics using mathematical programming approaches, or on Kalman-Filtering. The advent of the new Information and Communication Technologies (ICT), as for example Automatic Vehicle Location, License Plate Recognition, detection of mobile devices, Vehicle to Infrastructure (V2I) and so on, makes available new types of traffic data of higher quality and accuracy allowing for new modeling hypothesis leading to more computationally efficient algorithms. This paper extends the previous research on Kalman Filtering approaches for Freeway OD estimation using these data, to more complex topologies of urban networks were alternative path choices between origins and destinations are available. Ad hoc procedures based on Kalman Filtering have been designed and implemented successfully and the numerical results of the computational experiments are presented and discussed.</itunes:summary>
    </item>
    <item>
      <title>Análisis del NSGA-II para el TSALBP-1/3 cuando existe variación de demanda en una producción mixta</title>
      <link>http://hdl.handle.net/2117/18864</link>
      <description>Title: Análisis del NSGA-II para el TSALBP-1/3 cuando existe variación de demanda en una producción mixta
Authors: Chica, Manuel; Cordon, Oscar; Damas, Sergio; Bautista Valhondo, Joaquín
Abstract: En este trabajo introducimos la aplicación de un algoritmo genético multi-objetivo basado en el NSGA-II para resolver la variante más realista del equilibrado de líneas de montaje considerando tiempo y espacio, el TSALBP-1/3. El enfoque propuesto posee una composición y diseño de componentes avanzado que le permiten generar soluciones más óptimas al problema multi-objetivo. Además este algoritmo se aplica al estudio de distintos programas de producción de la línea de montaje de motores de Nissan en Barcelona. De esta manera, se pretende realizar un análisis de los resultados del algoritmo cuando tenemos escenarios de producción-demanda variables. En particular, como afectarían las soluciones generadas a la configuración de la línea final, respecto al número de puestos y estaciones de trabajo, y respecto al área de estas estaciones.
Description: Premio AEPIA al mejor artículo de carácter aplicado presentado en el congreso MAEB 2012, VIII Congreso Español sobre Metaheurísticas, Algoritmos Evolutivos y Bioinspirados, que atorga l’Asociación Española de Inteligencia Artificial (AEPIA)</description>
      <pubDate>Thu, 18 Apr 2013 10:56:27 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/18864</guid>
      <dc:date>2013-04-18T10:56:27Z</dc:date>
      <itunes:author>Chica, Manuel; Cordon, Oscar; Damas, Sergio; Bautista Valhondo, Joaquín</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>En este trabajo introducimos la aplicación de un algoritmo genético multi-objetivo basado en el NSGA-II para resolver la variante más realista del equilibrado de líneas de montaje considerando tiempo y espacio, el TSALBP-1/3. El enfoque propuesto posee una composición y diseño de componentes avanzado que le permiten generar soluciones más óptimas al problema multi-objetivo. Además este algoritmo se aplica al estudio de distintos programas de producción de la línea de montaje de motores de Nissan en Barcelona. De esta manera, se pretende realizar un análisis de los resultados del algoritmo cuando tenemos escenarios de producción-demanda variables. En particular, como afectarían las soluciones generadas a la configuración de la línea final, respecto al número de puestos y estaciones de trabajo, y respecto al área de estas estaciones.</itunes:summary>
    </item>
    <item>
      <title>Integrating bus stop modeling and simulation in public transport network design: a survey</title>
      <link>http://hdl.handle.net/2117/18469</link>
      <description>Title: Integrating bus stop modeling and simulation in public transport network design: a survey
Authors: Codina Sancho, Esteve; Fonseca Casas, Pau; Colls, Màxim; Montero Mercadé, Lídia
Abstract: In this paper a survey of public transportation network design and assignment models is presented with&#xD;
the purpose to analyze the level of detail that is considered regarding aspects such as congestion and&#xD;
interaction between bus lines and passengers at stops. After briefly reviewing the route design models&#xD;
in which these aspects are taken into account, a review of transit assignment models and frequency&#xD;
setting models is made in which these factors are considered. Simulation approaches oriented to the&#xD;
evaluation of complex configurations of bus stops used as evaluation tools for the design and planning&#xD;
of bus lines are also described. Because of its relevance, special attention is paid to the so called&#xD;
Advanced Public Transportation Systems.</description>
      <pubDate>Fri, 22 Mar 2013 09:55:28 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/18469</guid>
      <dc:date>2013-03-22T09:55:28Z</dc:date>
      <itunes:author>Codina Sancho, Esteve; Fonseca Casas, Pau; Colls, Màxim; Montero Mercadé, Lídia</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>In this paper a survey of public transportation network design and assignment models is presented with&#xD;
the purpose to analyze the level of detail that is considered regarding aspects such as congestion and&#xD;
interaction between bus lines and passengers at stops. After briefly reviewing the route design models&#xD;
in which these aspects are taken into account, a review of transit assignment models and frequency&#xD;
setting models is made in which these factors are considered. Simulation approaches oriented to the&#xD;
evaluation of complex configurations of bus stops used as evaluation tools for the design and planning&#xD;
of bus lines are also described. Because of its relevance, special attention is paid to the so called&#xD;
Advanced Public Transportation Systems.</itunes:summary>
    </item>
    <item>
      <title>Assessment of incident management strategies using aimsun</title>
      <link>http://hdl.handle.net/2117/18422</link>
      <description>Title: Assessment of incident management strategies using aimsun
Authors: Barceló Bugeda, Jaime; Ferrer, J.; Montero Mercadé, Lídia; Perarnau, Josep
Abstract: PRIME (Prediction of Congestion and Incidents in Real Time, for Intelligent Incident Management and Emergency Traffic Management) is a project of the 5ht Framework Program of the European Union which objectives are to develop: methods for estimating incident probability in real-time, which can activate traffic management strategies to reduce the likelihood of incidents, improved systems and algorithms for detecting incidents, an improved integration of incident verification to increase the reliability of incident management, and the integration of aspects of motorway and urban-network incident management strategies to increase the effectiveness of incident and traffic management strategies in urban / interurban areas. This paper deals with the use of microscopic simulation to assess the potential impacts of the incident management strategies. A methodological scheme on how to use simulation to achieve these objectives is presented and the experimental plan for the test site in Barcelona is described and the preliminary testing results are presented.</description>
      <pubDate>Tue, 19 Mar 2013 17:50:18 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/18422</guid>
      <dc:date>2013-03-19T17:50:18Z</dc:date>
      <itunes:author>Barceló Bugeda, Jaime; Ferrer, J.; Montero Mercadé, Lídia; Perarnau, Josep</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>PRIME (Prediction of Congestion and Incidents in Real Time, for Intelligent Incident Management and Emergency Traffic Management) is a project of the 5ht Framework Program of the European Union which objectives are to develop: methods for estimating incident probability in real-time, which can activate traffic management strategies to reduce the likelihood of incidents, improved systems and algorithms for detecting incidents, an improved integration of incident verification to increase the reliability of incident management, and the integration of aspects of motorway and urban-network incident management strategies to increase the effectiveness of incident and traffic management strategies in urban / interurban areas. This paper deals with the use of microscopic simulation to assess the potential impacts of the incident management strategies. A methodological scheme on how to use simulation to achieve these objectives is presented and the experimental plan for the test site in Barcelona is described and the preliminary testing results are presented.</itunes:summary>
    </item>
    <item>
      <title>Application to the proximal point algorithm to the general traffic assignment problem</title>
      <link>http://hdl.handle.net/2117/18028</link>
      <description>Title: Application to the proximal point algorithm to the general traffic assignment problem
Authors: Codina Sancho, Esteve; Montero Mercadé, Lídia
Abstract: An adaptation of the proximal algorithm for the traffic assignment problem under a user&#xD;
equilibrium formulation for a general asymmetric traffic network is presented in this&#xD;
paper, following the recently published results of Pennanen regarding convergence under&#xD;
nonmonotonicity. As is well known the problem can be formulated as a variational&#xD;
inequality and the algorithmic solutions developed uptodate guarantee convergence&#xD;
only under too restrictive conditions which are difficult to appear in practice. In this&#xD;
paper new conditions guaranteing convergence are developed and the possibility of&#xD;
including the algorithm on a bilevel scheme is discussed</description>
      <pubDate>Fri, 01 Mar 2013 10:25:37 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/18028</guid>
      <dc:date>2013-03-01T10:25:37Z</dc:date>
      <itunes:author>Codina Sancho, Esteve; Montero Mercadé, Lídia</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>An adaptation of the proximal algorithm for the traffic assignment problem under a user&#xD;
equilibrium formulation for a general asymmetric traffic network is presented in this&#xD;
paper, following the recently published results of Pennanen regarding convergence under&#xD;
nonmonotonicity. As is well known the problem can be formulated as a variational&#xD;
inequality and the algorithmic solutions developed uptodate guarantee convergence&#xD;
only under too restrictive conditions which are difficult to appear in practice. In this&#xD;
paper new conditions guaranteing convergence are developed and the possibility of&#xD;
including the algorithm on a bilevel scheme is discussed</itunes:summary>
    </item>
    <item>
      <title>Taxi planning: a multiobjective oriented network design model for on ground aircraft's routing management</title>
      <link>http://hdl.handle.net/2117/18027</link>
      <description>Title: Taxi planning: a multiobjective oriented network design model for on ground aircraft's routing management
Authors: Codina Sancho, Esteve; Marín, Ángel
Abstract: In this paper a network design model is presented for the problem&#xD;
of how to define an optimal airport topology in order to attend the conflicting&#xD;
movements of the aircrafts on ground during short to medium planning periods&#xD;
and taking into account the dynamic aspects of their interfering movements. Given&#xD;
a set of decision variables affecting the airport’s topology, the model balances a set&#xD;
of conflicting objectives or factors and their results are compared with the routing&#xD;
decisions taken from real data. The model is primarily solved using ”B&amp;B” and&#xD;
the multicriteria approach presented is investigated using real test networks.</description>
      <pubDate>Fri, 01 Mar 2013 10:05:43 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/18027</guid>
      <dc:date>2013-03-01T10:05:43Z</dc:date>
      <itunes:author>Codina Sancho, Esteve; Marín, Ángel</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>In this paper a network design model is presented for the problem&#xD;
of how to define an optimal airport topology in order to attend the conflicting&#xD;
movements of the aircrafts on ground during short to medium planning periods&#xD;
and taking into account the dynamic aspects of their interfering movements. Given&#xD;
a set of decision variables affecting the airport’s topology, the model balances a set&#xD;
of conflicting objectives or factors and their results are compared with the routing&#xD;
decisions taken from real data. The model is primarily solved using ”B&amp;B” and&#xD;
the multicriteria approach presented is investigated using real test networks.</itunes:summary>
    </item>
    <item>
      <title>A Kalman-filter approach for dynamic OD estimation in corridors based on bluetooth and wifi data collection</title>
      <link>http://hdl.handle.net/2117/17745</link>
      <description>Title: A Kalman-filter approach for dynamic OD estimation in corridors based on bluetooth and wifi data collection
Authors: Barceló Bugeda, Jaime; Montero Mercadé, Lídia; Marquès, Laura; Carmona, Carlos
Abstract: From the point of view of the information supplied by an ATIS to the motorists entering a&#xD;
freeway of one of the most relevant is the Forecasted Travel Time, that is the expected travel&#xD;
time that they will experience when traverse a freeway segment. From the point of view of&#xD;
ATMS, the dynamic estimates of time dependencies in OD matrices is a major input to&#xD;
dynamic traffic models used for estimating the current traffic state and forecasting its short&#xD;
term evolution. Travel Time Forecasting and Dynamic OD Estimation are thus two key&#xD;
components of ATIS/ATMS and the quality of the results that they could provide depend not&#xD;
only on the quality of the models but also on the accuracy and reliability of the&#xD;
measurements of traffic variables supplied by the detection technology.&#xD;
The quality and reliability of the measurements produced by traditional technologies, as&#xD;
inductive loop detectors, is not usually the required by real-time applications, therefore one&#xD;
wonders what could be expected from the new ICT technologies, as for example Automatic&#xD;
Vehicle Location, License Plate Recognition, detection of mobile devices and so on. A&#xD;
simulation experiment is proposed prior to deploy the technology for a pilot project. The&#xD;
simulation emulates the logging and time stamping of a sample of equipped vehicles&#xD;
providing real-time estimates of travel times for the whole population of vehicles and OD&#xD;
pattern of the equipped vehicles are considered real-time estimates of the dynamic OD&#xD;
pattern for the whole population of vehicles. The main objective of this paper is to explore the&#xD;
quality of the data produced by the Bluetooth and Wi-Fi detection of mobile devices equipping vehicles to estimate time dependent OD matrices. Ad hoc procedures based on&#xD;
Kalman Filtering have been designed and implemented successfully and the numerical&#xD;
results of the computational experiments are presented and discussed.</description>
      <pubDate>Wed, 13 Feb 2013 19:04:34 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/17745</guid>
      <dc:date>2013-02-13T19:04:34Z</dc:date>
      <itunes:author>Barceló Bugeda, Jaime; Montero Mercadé, Lídia; Marquès, Laura; Carmona, Carlos</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>From the point of view of the information supplied by an ATIS to the motorists entering a&#xD;
freeway of one of the most relevant is the Forecasted Travel Time, that is the expected travel&#xD;
time that they will experience when traverse a freeway segment. From the point of view of&#xD;
ATMS, the dynamic estimates of time dependencies in OD matrices is a major input to&#xD;
dynamic traffic models used for estimating the current traffic state and forecasting its short&#xD;
term evolution. Travel Time Forecasting and Dynamic OD Estimation are thus two key&#xD;
components of ATIS/ATMS and the quality of the results that they could provide depend not&#xD;
only on the quality of the models but also on the accuracy and reliability of the&#xD;
measurements of traffic variables supplied by the detection technology.&#xD;
The quality and reliability of the measurements produced by traditional technologies, as&#xD;
inductive loop detectors, is not usually the required by real-time applications, therefore one&#xD;
wonders what could be expected from the new ICT technologies, as for example Automatic&#xD;
Vehicle Location, License Plate Recognition, detection of mobile devices and so on. A&#xD;
simulation experiment is proposed prior to deploy the technology for a pilot project. The&#xD;
simulation emulates the logging and time stamping of a sample of equipped vehicles&#xD;
providing real-time estimates of travel times for the whole population of vehicles and OD&#xD;
pattern of the equipped vehicles are considered real-time estimates of the dynamic OD&#xD;
pattern for the whole population of vehicles. The main objective of this paper is to explore the&#xD;
quality of the data produced by the Bluetooth and Wi-Fi detection of mobile devices equipping vehicles to estimate time dependent OD matrices. Ad hoc procedures based on&#xD;
Kalman Filtering have been designed and implemented successfully and the numerical&#xD;
results of the computational experiments are presented and discussed.</itunes:summary>
    </item>
    <item>
      <title>Exploring the use of traffic data collected from new ICT based sensors to estimate time dependent OD matrices</title>
      <link>http://hdl.handle.net/2117/17744</link>
      <description>Title: Exploring the use of traffic data collected from new ICT based sensors to estimate time dependent OD matrices
Authors: Marquès, Laura; Montero Mercadé, Lídia; Carmona, Carlos; Barceló Bugeda, Jaime</description>
      <pubDate>Wed, 13 Feb 2013 18:42:15 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/17744</guid>
      <dc:date>2013-02-13T18:42:15Z</dc:date>
      <itunes:author>Marquès, Laura; Montero Mercadé, Lídia; Carmona, Carlos; Barceló Bugeda, Jaime</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
    </item>
    <item>
      <title>Dynamic OD matrix estimation exploiting bluetooth data in urban networkss</title>
      <link>http://hdl.handle.net/2117/17741</link>
      <description>Title: Dynamic OD matrix estimation exploiting bluetooth data in urban networkss
Authors: Barceló Bugeda, Jaime; Montero Mercadé, Lídia; Bullejos, Manuel; Serch, Oriol; Carmona, Carlos
Abstract: Time-Dependent Origin-Destination (OD) matrices are a key input to Dynamic Traffic Models.&#xD;
Microscopic and Mesoscopic traffic simulators are relevant examples of such models, traditionally used to&#xD;
assist in the design and evaluation of Traffic Management and Information Systems (ATMS/ATIS). Dynamic&#xD;
traffic models can also be used to support real-time traffic management decisions. The typical approaches to&#xD;
time-dependent OD estimation have been based either on Kalman-Filtering or on bi-level mathematical&#xD;
programming approaches that can be considered in most cases as ad hoc heuristics. The advent of the new&#xD;
Information and Communication Technologies (ICT) makes available new types of traffic data with higher&#xD;
quality and accuracy, allowing new modeling hypotheses which lead to more computationally efficient&#xD;
algorithms. This paper presents a Kalman Filtering approach, that explicitly exploit traffic data available from&#xD;
Bluetooth sensors, and reports computational experiments for networks and corridors.</description>
      <pubDate>Wed, 13 Feb 2013 18:07:10 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/17741</guid>
      <dc:date>2013-02-13T18:07:10Z</dc:date>
      <itunes:author>Barceló Bugeda, Jaime; Montero Mercadé, Lídia; Bullejos, Manuel; Serch, Oriol; Carmona, Carlos</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Dynamic OD matrix, Kalman filter, Advanced traffic management, Data collection</itunes:keywords>
      <itunes:summary>Time-Dependent Origin-Destination (OD) matrices are a key input to Dynamic Traffic Models.&#xD;
Microscopic and Mesoscopic traffic simulators are relevant examples of such models, traditionally used to&#xD;
assist in the design and evaluation of Traffic Management and Information Systems (ATMS/ATIS). Dynamic&#xD;
traffic models can also be used to support real-time traffic management decisions. The typical approaches to&#xD;
time-dependent OD estimation have been based either on Kalman-Filtering or on bi-level mathematical&#xD;
programming approaches that can be considered in most cases as ad hoc heuristics. The advent of the new&#xD;
Information and Communication Technologies (ICT) makes available new types of traffic data with higher&#xD;
quality and accuracy, allowing new modeling hypotheses which lead to more computationally efficient&#xD;
algorithms. This paper presents a Kalman Filtering approach, that explicitly exploit traffic data available from&#xD;
Bluetooth sensors, and reports computational experiments for networks and corridors.</itunes:summary>
    </item>
    <item>
      <title>A use of information and communication technologies in the framework of advanced management of transportation systems: dynamic OD matrix estimation</title>
      <link>http://hdl.handle.net/2117/17738</link>
      <description>Title: A use of information and communication technologies in the framework of advanced management of transportation systems: dynamic OD matrix estimation
Authors: Montero Mercadé, Lídia; Barceló Bugeda, Jaime; Bullejos, Manuel
Abstract: Origin-Destination (OD) trip matrices are the primary&#xD;
data input used in principal traffic and transit models, which&#xD;
describe the patterns of trips/passengers across the area of study.&#xD;
In this way, OD matrices become a critical requirement in&#xD;
Advanced Transport Management and/or Information Systems&#xD;
that are supported by Dynamic Assignment models. In the&#xD;
future, once combined dynamic traffic and transit assignment&#xD;
tools will be available to practitioners, the problem of estimating&#xD;
the time-dependent number of trips/passengers between&#xD;
transportation zones would be a critical aspect for real&#xD;
applications. However, because OD matrices are not directly&#xD;
observable, the current practice consists of adjusting an initial or&#xD;
seed matrix from link/segment counts which are provided by an&#xD;
existing layout of traffic counting stations or data gathering in&#xD;
the field (detection layout) for non-dynamic models. The typical&#xD;
approaches to time-dependent OD estimation have been based&#xD;
either on Kalman-Filtering or on bi-level mathematical&#xD;
programming approaches that can be considered in most cases as&#xD;
ad hoc heuristics. The advent of the new Information and&#xD;
Communication Technologies (ICT) makes available new types of&#xD;
real-time traffic and passenger data with higher quality and&#xD;
accuracy, allowing new modeling hypotheses which lead to more&#xD;
computationally efficient algorithms. This paper presents a&#xD;
Kalman Filtering approach that explicitly exploits data available&#xD;
from Bluetooth sensors to simplify an underlying space-state&#xD;
model, and describes the validation of the proposal through a set&#xD;
of simulation experiments, either on networks or corridors.&#xD;
Those involve car data provided by the detection of the electronic&#xD;
signature of on-board devices. Finally, an extension of the&#xD;
framework to the estimation of passenger matrices is addressed&#xD;
when data from passenger’s electronic signature devices are&#xD;
available.</description>
      <pubDate>Wed, 13 Feb 2013 17:42:17 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/17738</guid>
      <dc:date>2013-02-13T17:42:17Z</dc:date>
      <itunes:author>Montero Mercadé, Lídia; Barceló Bugeda, Jaime; Bullejos, Manuel</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Luz/8/febre/2013: Information Systems, Advanced traffic management, Dynamic OD matrix, Linear Kalman-filtering</itunes:keywords>
      <itunes:summary>Origin-Destination (OD) trip matrices are the primary&#xD;
data input used in principal traffic and transit models, which&#xD;
describe the patterns of trips/passengers across the area of study.&#xD;
In this way, OD matrices become a critical requirement in&#xD;
Advanced Transport Management and/or Information Systems&#xD;
that are supported by Dynamic Assignment models. In the&#xD;
future, once combined dynamic traffic and transit assignment&#xD;
tools will be available to practitioners, the problem of estimating&#xD;
the time-dependent number of trips/passengers between&#xD;
transportation zones would be a critical aspect for real&#xD;
applications. However, because OD matrices are not directly&#xD;
observable, the current practice consists of adjusting an initial or&#xD;
seed matrix from link/segment counts which are provided by an&#xD;
existing layout of traffic counting stations or data gathering in&#xD;
the field (detection layout) for non-dynamic models. The typical&#xD;
approaches to time-dependent OD estimation have been based&#xD;
either on Kalman-Filtering or on bi-level mathematical&#xD;
programming approaches that can be considered in most cases as&#xD;
ad hoc heuristics. The advent of the new Information and&#xD;
Communication Technologies (ICT) makes available new types of&#xD;
real-time traffic and passenger data with higher quality and&#xD;
accuracy, allowing new modeling hypotheses which lead to more&#xD;
computationally efficient algorithms. This paper presents a&#xD;
Kalman Filtering approach that explicitly exploits data available&#xD;
from Bluetooth sensors to simplify an underlying space-state&#xD;
model, and describes the validation of the proposal through a set&#xD;
of simulation experiments, either on networks or corridors.&#xD;
Those involve car data provided by the detection of the electronic&#xD;
signature of on-board devices. Finally, an extension of the&#xD;
framework to the estimation of passenger matrices is addressed&#xD;
when data from passenger’s electronic signature devices are&#xD;
available.</itunes:summary>
    </item>
    <item>
      <title>Adapting a dynamic OD matrix estimation approach for private traffic based on bluetooth data to passenger OD matrices</title>
      <link>http://hdl.handle.net/2117/17737</link>
      <description>Title: Adapting a dynamic OD matrix estimation approach for private traffic based on bluetooth data to passenger OD matrices
Authors: Montero Mercadé, Lídia; Barceló Bugeda, Jaime; Codina Sancho, Esteve
Abstract: The primary data input used in principal traffic models comes from Origin-Destination (OD) trip matrices, which describe the patterns of commuters across the network. In this way, OD matrices become a critical requirement in Advanced Transport Control and Management and/or Information Systems that are supported by Dynamic Traffic Assignment models (DTA models). Dynamic Transit Assignment models are a research topic, but once a dynamic transit assignment be available to practitioners, the problem of estimating the time-dependent number of trips between transportation zones shall be a critical aspect for real applications. However, OD matrices are not directly observable, neither for private nor public transport, and the current practice consists on adjusting an initial or seed matrix from link/segment counts which are provided by counting stations or data gathering in the field (detection layout). The emerging Information and Communication Technologies, especially those based on the detection of the electronic signature of on-board devices provide a rich source of data that can be used in space-state models for dynamic matrix estimation. We present a linear Kalman filter approach that makes use of counts of passengers and travel times provided by Bluetooth devices to simplify an underlying space-state model. The formulation for dynamic passenger OD matrix estimation proposed was originally developed for auto trip matrices, but in this paper, we explore the possibility of adapting the approach to the estimation of OD matrices in public transport networks.</description>
      <pubDate>Wed, 13 Feb 2013 17:28:22 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/17737</guid>
      <dc:date>2013-02-13T17:28:22Z</dc:date>
      <itunes:author>Montero Mercadé, Lídia; Barceló Bugeda, Jaime; Codina Sancho, Esteve</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Luz/febrer/2012: Applied Science, Information Systems, Advanced traffic management, Kalman Filtering</itunes:keywords>
      <itunes:summary>The primary data input used in principal traffic models comes from Origin-Destination (OD) trip matrices, which describe the patterns of commuters across the network. In this way, OD matrices become a critical requirement in Advanced Transport Control and Management and/or Information Systems that are supported by Dynamic Traffic Assignment models (DTA models). Dynamic Transit Assignment models are a research topic, but once a dynamic transit assignment be available to practitioners, the problem of estimating the time-dependent number of trips between transportation zones shall be a critical aspect for real applications. However, OD matrices are not directly observable, neither for private nor public transport, and the current practice consists on adjusting an initial or seed matrix from link/segment counts which are provided by counting stations or data gathering in the field (detection layout). The emerging Information and Communication Technologies, especially those based on the detection of the electronic signature of on-board devices provide a rich source of data that can be used in space-state models for dynamic matrix estimation. We present a linear Kalman filter approach that makes use of counts of passengers and travel times provided by Bluetooth devices to simplify an underlying space-state model. The formulation for dynamic passenger OD matrix estimation proposed was originally developed for auto trip matrices, but in this paper, we explore the possibility of adapting the approach to the estimation of OD matrices in public transport networks.</itunes:summary>
    </item>
    <item>
      <title>The detection layout problem</title>
      <link>http://hdl.handle.net/2117/17644</link>
      <description>Title: The detection layout problem
Authors: Barceló Bugeda, Jaime; Gilliéron, F; Linares Herreros, Mª Paz; Serch, Oriol; Montero Mercadé, Lídia
Abstract: The main traffic models, either for planning or operational purposes, use as major data input Origin-Destination (OD) trip matrices describing the patterns of traffic behavior across the network. OD matrices become in this way a critical requirement of Advanced Traffic Management or Information Systems supported by Dynamic Traffic Assignment models. However, as far as OD matrices are not directly observable, the current practice consist of adjusting an initial or seed matrix from link flow counts provided by an existing layout of traffic counting stations. The adequacy of the detection layout strongly determines the quality of the adjusted OD. Usual approaches to the Detection Layout problem assume that detectors are located at network links but some of the Information and Communication Technologies specially those based on the detection of the electronic signature of on board devices, as for example Bluetooth devices, allow the location of sensor at intersections. This paper proposes a reformulation of the link detection layout problem adapting the classical set covering approaches with side constraints and solving it efficiently by a tabu search metaheuristic. For the intersection layout covering problem a reformulation is proposed in terms of a node covering problem with side constraints that for practical purposes can be efficiently solved with standard professional solvers.</description>
      <pubDate>Mon, 11 Feb 2013 19:00:09 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/17644</guid>
      <dc:date>2013-02-11T19:00:09Z</dc:date>
      <itunes:author>Barceló Bugeda, Jaime; Gilliéron, F; Linares Herreros, Mª Paz; Serch, Oriol; Montero Mercadé, Lídia</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>OD Estimation, Dynamic User Equilibrium, Traffic Detector Location, Link Covering, Node Covering, Integer Programming, Location Theory</itunes:keywords>
      <itunes:summary>The main traffic models, either for planning or operational purposes, use as major data input Origin-Destination (OD) trip matrices describing the patterns of traffic behavior across the network. OD matrices become in this way a critical requirement of Advanced Traffic Management or Information Systems supported by Dynamic Traffic Assignment models. However, as far as OD matrices are not directly observable, the current practice consist of adjusting an initial or seed matrix from link flow counts provided by an existing layout of traffic counting stations. The adequacy of the detection layout strongly determines the quality of the adjusted OD. Usual approaches to the Detection Layout problem assume that detectors are located at network links but some of the Information and Communication Technologies specially those based on the detection of the electronic signature of on board devices, as for example Bluetooth devices, allow the location of sensor at intersections. This paper proposes a reformulation of the link detection layout problem adapting the classical set covering approaches with side constraints and solving it efficiently by a tabu search metaheuristic. For the intersection layout covering problem a reformulation is proposed in terms of a node covering problem with side constraints that for practical purposes can be efficiently solved with standard professional solvers.</itunes:summary>
    </item>
    <item>
      <title>A Kalman filter approach for the estimation of time dependent OD matrices exploiting bluetooth traffic data collection</title>
      <link>http://hdl.handle.net/2117/17642</link>
      <description>Title: A Kalman filter approach for the estimation of time dependent OD matrices exploiting bluetooth traffic data collection
Authors: Barceló Bugeda, Jaime; Montero Mercadé, Lídia; Bullejos, Manuel; Serch, Oriol; Carmona, Carlos
Abstract: Time-Dependent Origin-Destination (OD) matrices are a key input to Dynamic Traffic Models, microscopic and mesoscopic traffic simulators are relevant examples of such models, traditionally used to assist in the design and evaluation of Traffic Management and Information Systems (ATMS/ATIS). Dynamic traffic models can also be used to support real-time traffic management decisions. The typical approaches to the time-dependent OD estimation have been based either on ad hoc heuristics using mathematical programming approaches, or on Kalman-Filtering. The advent of the new Information and Communication Technologies (ICT), makes available new types of traffic data of higher quality and accuracy allowing for new modeling hypothesis leading to more computationally efficient algorithms. Ad hoc procedures based on Kalman Filtering, explicitly exploiting traffic data available from Bluetooth sensors, have been designed and implemented successfully and the numerical results of the computational experiments are discussed for freeway and network test sites.</description>
      <pubDate>Mon, 11 Feb 2013 18:40:49 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/17642</guid>
      <dc:date>2013-02-11T18:40:49Z</dc:date>
      <itunes:author>Barceló Bugeda, Jaime; Montero Mercadé, Lídia; Bullejos, Manuel; Serch, Oriol; Carmona, Carlos</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Bluetooth technology, Data collection, Dynamic traffic assignment, Kalman filtering, Origin and destination, Real time information, Time dependence, Traffic data, Traffic models</itunes:keywords>
      <itunes:summary>Time-Dependent Origin-Destination (OD) matrices are a key input to Dynamic Traffic Models, microscopic and mesoscopic traffic simulators are relevant examples of such models, traditionally used to assist in the design and evaluation of Traffic Management and Information Systems (ATMS/ATIS). Dynamic traffic models can also be used to support real-time traffic management decisions. The typical approaches to the time-dependent OD estimation have been based either on ad hoc heuristics using mathematical programming approaches, or on Kalman-Filtering. The advent of the new Information and Communication Technologies (ICT), makes available new types of traffic data of higher quality and accuracy allowing for new modeling hypothesis leading to more computationally efficient algorithms. Ad hoc procedures based on Kalman Filtering, explicitly exploiting traffic data available from Bluetooth sensors, have been designed and implemented successfully and the numerical results of the computational experiments are discussed for freeway and network test sites.</itunes:summary>
    </item>
    <item>
      <title>A tool for the design of public transportation services</title>
      <link>http://hdl.handle.net/2117/17194</link>
      <description>Title: A tool for the design of public transportation services
Authors: Codina Sancho, Esteve; Marín, Ángel; Montero Mercadé, Lídia
Abstract: In this paper a model is described in order to&#xD;
determine the number of lines of a public transportation service,&#xD;
the layout of their lines amongst a set of candidates, their service&#xD;
capacity, and the resulting assignment of passengers to these&#xD;
facilities so as to minimize the total costs of the system. The&#xD;
model takes into account the delays for passengers that queue at&#xD;
the stations reflecting congestion effects of the transport service&#xD;
system and also, the abandonment of waiting queues at stations&#xD;
by passengers. Passengers are assumed to choose the lines they&#xD;
ride on by selecting the most convenient service line following a&#xD;
user equilibrium formulation.</description>
      <pubDate>Mon, 07 Jan 2013 10:31:26 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/17194</guid>
      <dc:date>2013-01-07T10:31:26Z</dc:date>
      <itunes:author>Codina Sancho, Esteve; Marín, Ángel; Montero Mercadé, Lídia</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>In this paper a model is described in order to&#xD;
determine the number of lines of a public transportation service,&#xD;
the layout of their lines amongst a set of candidates, their service&#xD;
capacity, and the resulting assignment of passengers to these&#xD;
facilities so as to minimize the total costs of the system. The&#xD;
model takes into account the delays for passengers that queue at&#xD;
the stations reflecting congestion effects of the transport service&#xD;
system and also, the abandonment of waiting queues at stations&#xD;
by passengers. Passengers are assumed to choose the lines they&#xD;
ride on by selecting the most convenient service line following a&#xD;
user equilibrium formulation.</itunes:summary>
    </item>
    <item>
      <title>Multiperiod location-routing with decoupled time scales</title>
      <link>http://hdl.handle.net/2117/17129</link>
      <description>Title: Multiperiod location-routing with decoupled time scales
Authors: Albareda Sambola, Maria; Fernández Aréizaga, Elena; Nickel, Stefan
Abstract: This paper focuses on a multiperiod discrete facility location problem where transportation costs are considered together with location costs to design the operating facility pattern along a time horizon. The problem captures the difference in the scope of the location and routing decisions by considering different scales within the time horizon. Thus, solutions to this problem reflect the stability of locational decisions along time. The high complexity of this problem makes it impossible to be solved in practice with commercial software. For this reason, an approximation based on replacing vehicle routes by spanning trees is proposed, and its capability for providing good quality solutions is assessed in a series of computational experiments.</description>
      <pubDate>Thu, 13 Dec 2012 16:16:36 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/17129</guid>
      <dc:date>2012-12-13T16:16:36Z</dc:date>
      <itunes:author>Albareda Sambola, Maria; Fernández Aréizaga, Elena; Nickel, Stefan</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Location, Routing, Multiperiod</itunes:keywords>
      <itunes:summary>This paper focuses on a multiperiod discrete facility location problem where transportation costs are considered together with location costs to design the operating facility pattern along a time horizon. The problem captures the difference in the scope of the location and routing decisions by considering different scales within the time horizon. Thus, solutions to this problem reflect the stability of locational decisions along time. The high complexity of this problem makes it impossible to be solved in practice with commercial software. For this reason, an approximation based on replacing vehicle routes by spanning trees is proposed, and its capability for providing good quality solutions is assessed in a series of computational experiments.</itunes:summary>
    </item>
  </channel>
</rss>

