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 LIAAD

2015

Proceedings of the ECML/PKDD 2015 Discovery Challenges co-located with European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2015), Porto, Portugal, September 7-11, 2015

Autores
Usó, AM; Moreira, JM; Matias, LM; Kull, M; Lachiche, N;

Publicação
DC@ECML/PKDD

Abstract

2015

Taxi Service Trajectory - Prediction Challenge, ECML PKDD 2015

Autores
Matias, LM; Ferreira, M; Moreira, JM;

Publicação

Abstract

2015

The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach

Autores
Monteiro, MSR; Fontes, DBMM; Fontes, FACC;

Publicação
OPTIMIZATION LETTERS

Abstract
In this work we address the Hop-Constrained Minimum cost Flow Spanning Tree (HMFST) problem with nonlinear costs. The HMFST problem is an extension of the Hop-Constrained Minimum Spanning Tree problem since it considers flow requirements other than unit flows. We propose a hybrid heuristic, based on ant colony optimization and on local search, to solve this class of problems given its combinatorial nature and also that the total costs are nonlinearly flow dependent with a fixed-charge component. We solve a set of benchmark problems available online and compare the results obtained with the ones reported in the literature for a Multi-Population hybrid biased random key Genetic Algorithm (MPGA). Our algorithm proved to be able to find an optimum solution in more than 75 % of the runs, for each problem instance solved, and was also able to improve on many results reported for the MPGA. Furthermore, for every single problem instance we were able to find a feasible solution, which was not the case for the MPGA. Regarding running times, our algorithm improves upon the computational time used by CPLEX and was always lower than that of the MPGA.

2015

A Genetic Algorithm for Scheduling Alternative Tasks Subject to Technical Failure

Autores
Fontes, DBMM; Goncalves, JF;

Publicação
OPTIMIZATION, CONTROL, AND APPLICATIONS IN THE INFORMATION AGE: IN HONOR OF PANOS M. PARDALOS'S 60TH BIRTHDAY

Abstract
Nowadays, organizations are often faced with the development of complex and innovative projects. This type of projects often involves performing tasks which are subject to failure. Thus, in many such projects several possible alternative actions are considered and performed simultaneously. Each alternative is characterized by cost, duration, and probability of technical success. The cost of each alternative is paid at the beginning of the alternative and the project payoff is obtained whenever an alternative has been completed successfully. For this problem one wishes to find the optimal schedule, i.e., the starting time of each alternative, such that the expected net present value is maximized. This problem has been recently proposed in Ranjbar (Int Trans Oper Res 20(2):251-266, 2013), where a branch-and-bound approach is reported. Since the problem is NP-Hard, here we propose to solve the problem using genetic algorithms.

2015

MCDA APPLIED TO PERFORMANCE APPRAISAL OF SHORT-HAUL TRUCK DRIVERS: A CASE STUDY IN A PORTUGUESE TRUCKING COMPANY

Autores
Morte, R; Pereira, T; Fontes, DBMM;

Publicação
INTERNATIONAL JOURNAL FOR QUALITY RESEARCH

Abstract
Performance appraisal increasingly assumes a more important role in any organizational environment. In the trucking industry, drivers are the company's image and for this reason it is important to develop and increase their performance and commitment to the company's goals. This paper aims to create a performance appraisal model for trucking drivers, based on a multi-criteria decision aid methodology. The PROMETHEE and MMASSI methodologies were adapted using the criteria used for performance appraisal by the trucking company studied. The appraisal involved all the truck drivers, their supervisors and the company's Managing Director. The final output is a ranking of the drivers, based on their performance, for each one of the scenarios used. The results are to be used as a decision-making tool to allocate drivers to the domestic haul service.

2015

Approximate equilibria for a T cell and treg model

Autores
Oliveira, BMPM; Figueiredo, IP; Burroughs, NJ; Pinto, AA;

Publicação
Applied Mathematics and Information Sciences

Abstract
We analyse a model of immune response by T cells (CD4), where regulatory T cells (Tregs) act by inhibiting IL-2 secretion. We introduced an asymmetry reflecting that the difference between the growth and death rates can be higher for the active T cells and the active Tregs than for the inactive T cells and inactive Tregs. This asymmetry mimics the presence of memory T cells. In this paper we start by analysing the model in the absence of Tregs. We obtain an explicit formula that gives approximately the antigenic stimulation of T cells from the concentration of Tregs. Afterwards, we present an explicit formula that describes approximately the balance between the concentration of T cells and the concentration of Tregs; and an explicit formula that relates approximately the antigenic stimulation of T cells, the concentration of T cells and the concentration of Tregs. For our parameter values, the relation between the antigenic stimulation of T cells and the concentration of T cells is an hysteresis that is unfold when some of the parameters are changed. We also consider a linear tuning between the antigenic stimulation of T cells and the antigenic stimulation of Tregs. Again, we have obtained an explicit formula relating approximately the antigenic stimulation of T cells, the concentration of T cells and the concentration of Tregs. With it, we can explain the appearance of an isola and a transcritical bifurcation. © 2015 NSP Natural Sciences Publishing Cor.

  • 247
  • 430