Um método primal-dual aplicado na resolução do problema de fluxo de potência ótimo

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Determinação da solução ótima do problema de fluxo de potência ótimo via análise de sensibilidade

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Um método eficiente para resolução do problema de Despacho Ótimo de Reativos com controle discreto do TAP dos transformadores

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico

The present essay shows strategies of improvement in a well succeded evolutionary metaheuristic to solve the Asymmetric Traveling Salesman Problem. Such steps consist in a Memetic Algorithm projected mainly to this problem. Basically this improvement applied optimizing techniques known as Path-Relinking and Vocabulary Building. Furthermore, this last one has being used in two different ways, in order to evaluate the effects of the improvement on the evolutionary metaheuristic. These methods were implemented in C++ code and the experiments were done under instances at TSPLIB library, being possible to observe that the procedures purposed reached success on the tests done

Controle ótimo H2 e H¥ com modificação de zeros para o problema de rastreamento usando LMI

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

O problema do caixeiro viajante alugador : um estudo algorítmico

The Car Rental Salesman Problem (CaRS) is a variant of the classical Traveling Salesman Problem which was not described in the literature where a tour of visits can be decomposed into contiguous paths that may be performed in different rental cars. The aim is to determine the Hamiltonian cycle that results in a final minimum cost, considering the cost of the route added to the cost of an expected penalty paid for each exchange of vehicles on the route. This penalty is due to the return of the car dropped to the base. This paper introduces the general problem and illustrates some examples, also featuring some of its associated variants. An overview of the complexity of this combinatorial problem is also outlined, to justify their classification in the NPhard class. A database of instances for the problem is presented, describing the methodology of its constitution. The presented problem is also the subject of a study based on experimental algorithmic implementation of six metaheuristic solutions, representing adaptations of the best of state-of-the-art heuristic programming. New neighborhoods, construction procedures, search operators, evolutionary agents, cooperation by multi-pheromone are created for this problem. Furtermore, computational experiments and comparative performance tests are conducted on a sample of 60 instances of the created database, aiming to offer a algorithm with an efficient solution for this problem. These results will illustrate the best performance reached by the transgenetic algorithm in all instances of the dataset

O problema biobjetivo da árvore geradora quadrática em adjacência de arestas

The Quadratic Minimum Spanning Tree Problem (QMST) is a version of the Minimum Spanning Tree Problem in which, besides the traditional linear costs, there is a quadratic structure of costs. This quadratic structure models interaction effects between pairs of edges. Linear and quadratic costs are added up to constitute the total cost of the spanning tree, which must be minimized. When these interactions are restricted to adjacent edges, the problem is named Adjacent Only Quadratic Minimum Spanning Tree (AQMST). AQMST and QMST are NP-hard problems that model several problems of transport and distribution networks design. In general, AQMST arises as a more suitable model for real problems. Although, in literature, linear and quadratic costs are added, in real applications, they may be conflicting. In this case, it may be interesting to consider these costs separately. In this sense, Multiobjective Optimization provides a more realistic model for QMST and AQMST. A review of the state-of-the-art, so far, was not able to find papers regarding these problems under a biobjective point of view. Thus, the objective of this Thesis is the development of exact and heuristic algorithms for the Biobjective Adjacent Only Quadratic Spanning Tree Problem (bi-AQST). In order to do so, as theoretical foundation, other NP-hard problems directly related to bi-AQST are discussed: the QMST and AQMST problems. Bracktracking and branch-and-bound exact algorithms are proposed to the target problem of this investigation. The heuristic algorithms developed are: Pareto Local Search, Tabu Search with ejection chain, Transgenetic Algorithm, NSGA-II and a hybridization of the two last-mentioned proposals called NSTA. The proposed algorithms are compared to each other through performance analysis regarding computational experiments with instances adapted from the QMST literature. With regard to exact algorithms, the analysis considers, in particular, the execution time. In case of the heuristic algorithms, besides execution time, the quality of the generated approximation sets is evaluated. Quality indicators are used to assess such information. Appropriate statistical tools are used to measure the performance of exact and heuristic algorithms. Considering the set of instances adopted as well as the criteria of execution time and quality of the generated approximation set, the experiments showed that the Tabu Search with ejection chain approach obtained the best results and the transgenetic algorithm ranked second. The PLS algorithm obtained good quality solutions, but at a very high computational time compared to the other (meta)heuristics, getting the third place. NSTA and NSGA-II algorithms got the last positions

Uma análise experimental de abordagens heurísticas aplicadas ao problema do caixeiro viajante

Due to great difficulty of accurate solution of Combinatorial Optimization Problems, some heuristic methods have been developed and during many years, the analysis of performance of these approaches was not carried through in a systematic way. The proposal of this work is to make a statistical analysis of heuristic approaches to the Traveling Salesman Problem (TSP). The focus of the analysis is to evaluate the performance of each approach in relation to the necessary computational time until the attainment of the optimal solution for one determined instance of the TSP. Survival Analysis, assisted by methods for the hypothesis test of the equality between survival functions was used. The evaluated approaches were divided in three classes: Lin-Kernighan Algorithms, Evolutionary Algorithms and Particle Swarm Optimization. Beyond those approaches, it was enclosed in the analysis, a memetic algorithm (for symmetric and asymmetric TSP instances) that utilizes the Lin-Kernighan heuristics as its local search procedure

A questão da experiência no ensino da filosofia: um problema contemporâneo

Os problemas que afetam a sociedade não estão mais centrados no âmbito da reflexão sobre a cultura, a política e em uma inflexão a si mesmos. A vida, um dos principais elementos da reflexão filosófica, tornou-se destituída de valor e passou a ser medida pelo desejo do mercado. Por isso, segundo Foucault, é difícil criar condições de resistência, uma vez que não se sabe de onde vem o poder, onde estamos e qual o nosso desejo: tudo o que pertencia ao sujeito está capturado pelo biopoder. Assim, vivemos (sobrevivemos, nos termos de Agamben) num momento de empobrecimento da experiência, da vida, dos valores e de nós mesmos. O problema que se coloca é, então, como resistir a esse empobrecimento? Pensamos que uma possível chave para pensar esse problema esteja na procura por compreender como nos tornamos empobrecidos dessa capacidade de fazer experiência. Nossa intenção é compreender como o ensino da filosofia se posiciona face à pobreza de experiência, apontada por Benjamin.

Notas sobre o problema da explicação e da experiência no ensino da Filosofia

Apesar do esforço dos defensores do ensino da Filosofia para que essa disciplina volte a fazer parte do Ensino Médio, observamos, atualmente, seu abandono nos cursos universitários. Notamos que hoje, na sociedade normalizada e no espaço educacional, não é mais valorizado o desenvolvimento integral do pensamento, mas a transmissão de uma série de conteúdos que, supostamente, dão condições para a integração do estudante no quadro do progresso tecnológico e proporcionam sua entrada no mercado de trabalho. Circunscrevendo-se nesse contexto, neste texto pretende-se investigar o espaço em que o ensino da Filosofia se desenvolve na atualidade. Delineando os contornos de um problema que emerge nos espaços institucionais universitários onde o ensino da Filosofia ainda persiste, procurou-se evidenciar em que bases a Filosofia é ensinada. Procurou-se, ainda, compreender quais consequências os modos de compreender o ensino da Filosofia trazem para o aprendizado do filosofar. Uma consideração a que se pode chegar, a partir deste estudo, é a de que o ensino da Filosofia além de não privilegiar, e muitas vezes negar, a experiência de pensamento que o aluno pode fazer e ter com o texto filosófico, contribui para o empobrecimento dessa mesma experiência do e com o filosofar.

Kant e o problema da origem das representações elementares: apontamentos

Il s'agit d'examiner l'origine des représentations fondamentales (formes de la réceptivité et formes intelectuelles )face à la critique faite par Kant des idées innées et abstraites.

Desempenho de escolares de 1ª série na bateria de identificação de erros de reversão e inversão na escrita: estudo preliminar

OBJETIVO: caracterizar o desempenho de escolares da 1ª série na bateria de identificação de erros de reversão e inversão na escrita. MÉTODOS: participaram deste estudo 30 escolares de 1ª série de ensino público do município da cidade de Marília-SP, de ambos os gêneros, na faixa etária de 7 anos a 7 anos e 11 meses de idade. Como procedimento foi realizada a adaptação brasileira da bateria de identificação dos erros de reversão e inversão na escrita. Esta bateria é composta por 3 testes: teste de desempenho contínuo, teste de memória de curto prazo e teste de controle de escrita. Cada teste é composto por subtestes que visam identificar a capacidade dos escolares em identificar as inversões e reversões de letras e números isolados e letras e números em sequências. RESULTADOS: os resultados revelaram que os escolares da 1ª série apresentaram desempenho superior para identificação de reversão e inversão de letras dentro de palavras do que isoladamente, identificação da reversão para letras e números com desempenho superior se comparado a inversão de letras na palavra. Além disso, os escolares deste estudo apresentaram menor tempo para identificação de reversão e inversão de letras e números isolados do que em sequência. CONCLUSÃO: a Bateria adaptada para este estudo permitiu conhecer o perfil dos escolares de 1ª série quanto a identificação dos erros de inversão e reversão, entretanto, é necessário novas aplicações para verificar a ocorrência de identificação destes erros em populações de diferentes fase de alfabetização.

Em direção a uma representação para equações algébricas :uma lógica equacional local

The intervalar arithmetic well-known as arithmetic of Moore, doesn't possess the same properties of the real numbers, and for this reason, it is confronted with a problem of operative nature, when we want to solve intervalar equations as extension of real equations by the usual equality and of the intervalar arithmetic, for this not to possess the inverse addictive, as well as, the property of the distributivity of the multiplication for the sum doesn t be valid for any triplet of intervals. The lack of those properties disables the use of equacional logic, so much for the resolution of an intervalar equation using the same, as for a representation of a real equation, and still, for the algebraic verification of properties of a computational system, whose data are real numbers represented by intervals. However, with the notion of order of information and of approach on intervals, introduced by Acióly[6] in 1991, the idea of an intervalar equation appears to represent a real equation satisfactorily, since the terms of the intervalar equation carry the information about the solution of the real equation. In 1999, Santiago proposed the notion of simple equality and, later on, local equality for intervals [8] and [33]. Based on that idea, this dissertation extends Santiago's local groups for local algebras, following the idea of Σ-algebras according to (Hennessy[31], 1988) and (Santiago[7], 1995). One of the contributions of this dissertation, is the theorem 5.1.3.2 that it guarantees that, when deducing a local Σ-equation E t t in the proposed system SDedLoc(E), the interpretations of t and t' will be locally the same in any local Σ-algebra that satisfies the group of fixed equations local E, whenever t and t have meaning in A. This assures to a kind of safety between the local equacional logic and the local algebras

CrossMDA2: Uma abordagem para minimizar o problema da fragilidade de pointcuts na evolução de sistemas orientados a aspectos

This work proposes a model based approach for pointcut management in the presence of evolution in aspect oriented systems. The proposed approach, called conceptual visions based pointcuts, is motivated by the observation of the shortcomings in traditional approaches pointcuts definition, which generally refer directly to software structure and/or behavior, thereby creating a strong coupling between pointcut definition and the base code. This coupling causes the problem known as pointcut fragility problem and hinders the evolution of aspect-oriented systems. This problem occurs when all the pointcuts of each aspect should be reviewed due to any software changes/evolution, to ensure that they remain valid even after the changes made in the software. Our approach is focused on the pointcuts definition based on a conceptual model, which has definitions of the system's structure in a more abstract level. The conceptual model consists of classifications (called conceptual views) on entities of the business model elements based on common characteristics, and relationships between these views. Thus the pointcuts definitions are created based on the conceptual model rather than directly referencing the base model. Moreover, the conceptual model contains a set of relationships that allows it to be automatically verified if the classifications in the conceptual model remain valid even after a software change. To this end, all the development using the conceptual views based pointcuts approach is supported by a conceptual framework called CrossMDA2 and a development process based on MDA, both also proposed in this work. As proof of concept, we present two versions of a case study, setting up a scenario of evolution that shows how the use of conceptual visions based pointcuts helps detecting and minimizing the pointcuts fragility. For the proposal evaluation the Goal/Question/Metric (GQM) technique is used together with metrics for efficiency analysis in the pointcuts definition

Algoritomos transgenéticos aplicados ao problema da árvore geradora biobjetivo

The Multiobjective Spanning Tree is a NP-hard Combinatorial Optimization problem whose application arises in several areas, especially networks design. In this work, we propose a solution to the biobjective version of the problem through a Transgenetic Algorithm named ATIS-NP. The Computational Transgenetic is a metaheuristic technique from Evolutionary Computation whose inspiration relies in the conception of cooperation (and not competition) as the factor of main influence to evolution. The algorithm outlined is the evolution of a work that has already yielded two other transgenetic algorithms. In this sense, the algorithms previously developed are also presented. This research also comprises an experimental analysis with the aim of obtaining information related to the performance of ATIS-NP when compared to other approaches. Thus, ATIS-NP is compared to the algorithms previously implemented and to other transgenetic already presented for the problem under consideration. The computational experiments also address the comparison to two recent approaches from literature that present good results, a GRASP and a genetic algorithms. The efficiency of the method described is evaluated with basis in metrics of solution quality and computational time spent. Considering the problem is within the context of Multiobjective Optimization, quality indicators are adopted to infer the criteria of solution quality. Statistical tests evaluate the significance of results obtained from computational experiments