Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

Publicações por Jorge Freire Sousa

1997

Setting the length of the planning horizon in the vehicle replacement problem

Autores
deSousa, JF; Guimaraes, RC;

Publicação
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Abstract
In some formulations of the vehicle replacement problem, in particular those leading to repair limit type models, the alternative policies are evaluated and compared over a fixed planning horizon. Although it has been widely recognised that the optimal policies derived under these formulations depend critically on the length of the horizon, no method has been presented so far to set appropriately this parameter. In this paper. the authors describe a method which overcomes this shortcoming. Once the best policy has been derived from a given finite horizon with length H, such a policy is repeated indefinitely over time and an equivalent annual rent is computed. The parametrisation of H leads to the definition of an annual rent function with a sequence of nearly equidistant local minima. It is suggested that in practice the second local minimum of this function leads to an adequate choice of the parameter H. The method can be applied both to stochastic and deterministic cost modelling situations. The method was tested using both real data from large samples of different types of passenger vehicles and artificially generated data. (C) 1997 Elsevier Science B.V.

2012

Bus Bunching detection: A sequence mining approach

Autores
Moreira Matias, L; Ferreira, C; Gama, J; Mendes Moreira, J; De Sousa, JF;

Publicação
CEUR Workshop Proceedings

Abstract
Mining public transportation networks is a growing and explosive challenge due to the increasing number of information available. In highly populated urban zones, the vehicles can often fail the schedule. Such fails cause headway deviations (HD) between high-frequency bus pairs. In this paper, we propose to identify systematic HD which usually provokes the phenomenon known as Bus Bunching (BB). We use the PrefixSpan algorithm to accurately mine sequences of bus stops where multiple HD frequently emerges, forcing two or more buses to clump. Our results are promising: 1) we demonstrated that the BB origin can be modeled like a sequence mining problem where 2) the discovered patterns can easily identify the route schedule points to adjust in order to mitigate such events.

2010

Validation of both number and coverage of bus schedules using AVL data

Autores
Matias, L; Gama, J; Moreira, JM; de Sousa, JF;

Publicação
13th International IEEE Conference on Intelligent Transportation Systems, Funchal, Madeira, Portugal, 19-22 September 2010

Abstract
It is well known that the definition of bus schedules is critical for the service reliability of public transports. Several proposals have been suggested, using data from Automatic Vehicle Location (AVL) systems, in order to enhance the reliability of public transports. In this paper we study the optimum number of schedules and the days covered by each one of them, in order to increase reliability. We use the Dynamic Time Warping distance in order to calculate the similarities between two different dimensioned irregularly spaced data sequences before the use of data clustering techniques. The application of this methodology with the K-Means for a specific bus route demonstrated that a new schedule for the weekends in non-scholar periods could be considered due to its distinct profile from the remaining days. For future work, we propose to apply this methodology to larger data sets in time and in number, corresponding to different bus routes, in order to find a consensual cluster between all the routes. ©2010 IEEE.

2012

Bus bunching detection by mining sequences of headway deviations

Autores
Moreira Matias, L; Ferreira, C; Gama, J; Mendes Moreira, J; De Sousa, JF;

Publicação
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract
In highly populated urban zones, it is common to notice headway deviations (HD) between pairs of buses. When these events occur in a bus stop, they often cause bus bunching (BB) in the following bus stops. Several proposals have been suggested to mitigate this problem. In this paper, we propose to find BBS (Bunching Black Spots) - sequences of bus stops where systematic HD events cause the formation of BB. We run a sequence mining algorithm, named PrefixSpan, to find interesting events available in time series. We prove that we can accurately model the BB trip usual pattern like a frequent sequence mining problem. The subsequences proved to be a promising way of identify the route' schedule points to adjust in order to mitigate such events. © 2012 Springer-Verlag.

2012

Comparing state-of-the-art regression methods for long term travel time prediction

Autores
Mendes Moreira, J; Jorge, AM; de Sousa, JF; Soares, C;

Publicação
INTELLIGENT DATA ANALYSIS

Abstract
Long-term travel time prediction (TTP) can be an important planning tool for both freight transport and public transport companies. In both cases it is expected that the use of long-term TTP can improve the quality of the planned services by reducing the error between the actual and the planned travel times. However, for reasons that we try to stretch out along this paper, long-term TTP is almost not mentioned in the scientific literature. In this paper we discuss the relevance of this study and compare three non-parametric state-of-the-art regression methods: Projection Pursuit Regression (PPR), Support Vector Machine (SVM) and Random Forests (RF). For each one of these methods we study the best combination of input parameters. We also study the impact of different methods for the pre-processing tasks (feature selection, example selection and domain values definition) in the accuracy of those algorithms. We use bus travel time's data from a bus dispatch system. From an off-the-shelf point-of-view, our experiments show that RF is the most promising approach from the three we have tested. However, it is possible to obtain more accurate results using PPR but with extra pre-processing work, namely on example selection and domain values definition.

2012

Ensemble Approaches for Regression: A Survey

Autores
Mendes Moreira, J; Soares, C; Jorge, AM; De Sousa, JF;

Publicação
ACM COMPUTING SURVEYS

Abstract
The goal of ensemble regression is to combine several models in order to improve the prediction accuracy in learning problems with a numerical target variable. The process of ensemble learning can be divided into three phases: the generation phase, the pruning phase, and the integration phase. We discuss different approaches to each of these phases that are able to deal with the regression problem, categorizing them in terms of their relevant characteristics and linking them to contributions from different fields. Furthermore, this work makes it possible to identify interesting areas for future research.

  • 7
  • 8