Non emergency patients transport - a mixed integer linear programming

This work presents a model and a heuristic to solve the non-emergency patients transport (NEPT) service issues given the new rules recently established in Portugal. The model follows the same principle of the Team Orienteering Problem by selecting the patients to be included in the routes attending the maximum reduction in costs when compared with individual transportation. This model establishes the best sets of patients to be transported together. The model was implemented in AMPL and a compact formulation was solved using NEOS Server. A heuristic procedure based on iteratively solving problems with one vehicle was presented, and this heuristic provides good results in terms of accuracy and computation time.

Otimização com restrições de complementaridade: algoritmos e aplicações

Tese de Doutoramento em Engenharia Industrial e de Sistemas (PDEIS)

The impact of poor power quality in solar photovoltaic microgeneration: technical problems and losses of revenue

This paper presents a critical and quantitative analysis of the influence of the Power Quality in grid connected solar photovoltaic microgeneration installations. First are introduced the main regulations and legislation related with the solar photovoltaic microgeneration, in Portugal and Europe. Next are presented Power Quality monitoring results obtained from two residential solar photovoltaic installations located in the north of Portugal, and is explained how the Power Quality events affect the operation of these installations. Afterwards, it is described a methodology to estimate the energy production losses and the impact in the revenue caused by the abnormal operation of the electrical installation. This is done by comparing the amount of energy that was injected into the power grid with the theoretical value of energy that could be injected in normal conditions. The performed analysis shows that Power Quality severally affects the solar photovoltaic installations operation. The losses of revenue in the two monitored installations M1 and M2 are estimated in about 27% and 22%, respectively.

The non-emergency patient transport modelled as a team orienteering problem

This work presents an improved model to solve the non-emergency patients transport (NEPT) service issues given the new rules recently established in Portugal. The model follows the same principle of the Team Orienteering Problem by selecting the patients to be included in the routes attending the maximum reduction in costs when compared with individual transportation. This model establishes the best sets of patients to be transported together. The model was implemented in AMPL and a compact formulation was solved using NEOS Server. A heuristic procedure based on iteratively solving Orienteering Problems is presented, and this heuristic provides good results in terms of accuracy and computation time. Euclidean instances as well as asymmetric real data gathered from Google maps were used, and the model has a promising performance mainly with asymmetric cost matrices.

Project management: evaluation of the problems in the portuguese construction industry

During recent decades it has been possible to identify several problems in construction industry project management, related with to systematic failures in terms of fulfilling its schedule, cost and quality targets, which highlight a need for an evaluation of the factors that may cause these failures. Therefore, it is important to understand how project managers plan the projects, so that the performance and the results can be improved. However, it is important to understand if other areas beyond cost and time management that are mentioned on several studies as the most critical areas, receive the necessary attention from construction project managers. Despite the cost and time are the most sensitive areas/fields, there are several other factors that may lead to project failure. This study aims at understand the reasons that may cause the deviation in terms of cost, time and quality, from the project management point of view, looking at the knowledge areas mentioned by PMI (Project Management Institute).

Parallel improved Schnorr-Euchner enumeration SE++ for the CVP and SVP

The Closest Vector Problem (CVP) and the Shortest Vector Problem (SVP) are prime problems in lattice-based cryptanalysis, since they underpin the security of many lattice-based cryptosystems. Despite the importance of these problems, there are only a few CVP-solvers publicly available, and their scalability was never studied. This paper presents a scalable implementation of an enumeration-based CVP-solver for multi-cores, which can be easily adapted to solve the SVP. In particular, it achieves super-linear speedups in some instances on up to 8 cores and almost linear speedups on 16 cores when solving the CVP on a 50-dimensional lattice. Our results show that enumeration-based CVP-solvers can be parallelized as effectively as enumeration-based solvers for the SVP, based on a comparison with a state of the art SVP-solver. In addition, we show that we can optimize the SVP variant of our solver in such a way that it becomes 35%-60% faster than the fastest enumeration-based SVP-solver to date.

Instrumentos de políticas públicas do turismo: uma análise empírica dos municípios portugueses

Tese de Doutoramento em Ciências da Administração

Electronic transport across linear defects in graphene

We investigate the low-energy electronic transport across grain boundaries in graphene ribbons and infinite flakes. Using the recursive Green’s function method, we calculate the electronic transmission across different types of grain boundaries in graphene ribbons. We show results for the charge density distribution and the current flow along the ribbon. We study linear defects at various angles with the ribbon direction, as well as overlaps of two monolayer ribbon domains forming a bilayer region. For a class of extended defect lines with periodicity 3, an analytic approach is developed to study transport in infinite flakes. This class of extended grain boundaries is particularly interesting, since the K and K0 Dirac points are superposed.

Solving large 0–1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm

The artificial fish swarm algorithm has recently been emerged in continuous global optimization. It uses points of a population in space to identify the position of fish in the school. Many real-world optimization problems are described by 0-1 multidimensional knapsack problems that are NP-hard. In the last decades several exact as well as heuristic methods have been proposed for solving these problems. In this paper, a new simpli ed binary version of the artificial fish swarm algorithm is presented, where a point/ fish is represented by a binary string of 0/1 bits. Trial points are created by using crossover and mutation in the different fi sh behavior that are randomly selected by using two user de ned probability values. In order to make the points feasible the presented algorithm uses a random heuristic drop item procedure followed by an add item procedure aiming to increase the profit throughout the adding of more items in the knapsack. A cyclic reinitialization of 50% of the population, and a simple local search that allows the progress of a small percentage of points towards optimality and after that refines the best point in the population greatly improve the quality of the solutions. The presented method is tested on a set of benchmark instances and a comparison with other methods available in literature is shown. The comparison shows that the proposed method can be an alternative method for solving these problems.

A firefly dynamic penalty approach for solving engineering design problems

Firefly Algorithm is a recent swarm intelligence method, inspired by the social behavior of fireflies, based on their flashing and attraction characteristics [1, 2]. In this paper, we analyze the implementation of a dynamic penalty approach combined with the Firefly algorithm for solving constrained global optimization problems. In order to assess the applicability and performance of the proposed method, some benchmark problems from engineering design optimization are considered.

Narrative innovations predict symptom improvement: Studying innovative moments in narrative therapy of depression

Objective:Innovative moments (IMs) are moments in the therapeutic dialog that constitute exceptions toward the client's problems. These narrative markers of meaning transformation are associated with change in different models of therapy and diverse diagnoses. Our goal is to test if IMs precede symptoms change, or, on the contrary, are a mere consequence of symptomatic 15 change. Method: For this purpose, IMs and symptomatology (Outcome Questionnaire-10.2) were assessed at every session in a sample of 10 cases of narrative therapy for depression. Hierarchical linear modeling was conducted to explore whether (i) IMs in a given session predict patients' symptoms in the following session and/or (ii) symptoms in a given session predict IMs in the next session. Results: Results suggested that IMs are better predictors of symptoms than the reverse. Conclusions: These results are discussed considering the contribution of meanings and narrative processes' changes to symptomatic improvement.

Wear of PEEK-Ti6Al4V systems under micro-abrasion and linear sliding conditions

Dissertação de mestrado integrado em Engenharia Biomédica

TP perturbation of TN matrices and totally positive directions

Here, we define and consider (linear) TP-directions and TP-paths for a totally nonnegative matrix, in an effort to more deeply understand perturbation of a TN matrix to a TP matrix. We give circumstances in which a TP-direction exists and an example to show that they do not always exist. A strategy to give (nonlinear) TP-paths is given (and applied to this example). A long term goal is to understand the sparsest TP-perturbation for application to completion problems.

Desenvolvimento e otimização do projeto mecatrónico para um Tribómetro Linear

Dissertação de mestrado integrado em Engenharia Mecânica

A linear algebra approach to OLAP

Inspired by the relational algebra of data processing, this paper addresses the foundations of data analytical processing from a linear algebra perspective. The paper investigates, in particular, how aggregation operations such as cross tabulations and data cubes essential to quantitative analysis of data can be expressed solely in terms of matrix multiplication, transposition and the Khatri–Rao variant of the Kronecker product. The approach offers a basis for deriving an algebraic theory of data consolidation, handling the quantitative as well as qualitative sides of data science in a natural, elegant and typed way. It also shows potential for parallel analytical processing, as the parallelization theory of such matrix operations is well acknowledged.