886 resultados para Optimization. Markov Chain. Genetic Algorithm. Fuzzy Controller
Resumo:
In this paper, an efficient genetic algorithm (GA) is presented to solve the problem of multistage and coordinated transmission expansion planning. This is a mixed integer nonlinear programming problem, difficult for systems of medium and large size and high complexity. The GA presented has a set of specialized genetic operators and an efficient form of generation of the initial population that finds high quality suboptimal topologies for large size and high complexity systems. In these systems, multistage and coordinated planning present a lower investment than static planning. Tests results are shown in one medium complexity system and one large size high complexity system.
Resumo:
Neste trabalho é proposta uma metodologia de rastreamento de sinais e rejeição de distúrbios aplicada a sistemas não-lineares. Para o projeto do sistema de rastreamento, projeta-se os controladores fuzzy M(a) e N(a) que minimizam o limitante superior da norma H∞ entre o sinal de referência r(t) e o sinal de erro de rastreamento e(t), sendo e(t) a diferença entre a entrada de referência e a saída do sistema z(t). No método de rejeição de distúrbio utiliza-se a realimentação dinâmica da saída através de um controlador fuzzy Kc(a) que minimiza o limitante superior da norma H∞ entre o sinal de entrada exógena w(t) e o sinal de saída z(t). O procedimento de projeto proposto considera as não-linearidades da planta através dos modelos fuzzy Takagi-Sugeno. Os métodos são equacionados utilizando-se inequações matriciais lineares (LMIs), que quando factíveis, podem ser facilmente solucionados por algoritmos de convergência polinomial. Por fim, um exemplo ilustra a viabilidade da metodologia proposta.
Resumo:
A constructive heuristic algorithm (CHA) to solve distribution system planning (DSP) problem is presented. The DSP is a very complex mixed binary nonlinear programming problem. A CHA is aimed at obtaining an excellent quality solution for the DSP problem. However, a local improvement phase and a branching technique were implemented in the CHA to improve its solution. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution system. This sensitivity index is obtained by solving the DSP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. Results of two tests systems and one real distribution system are presented in this paper in order to show the ability of the proposed algorithm.
Resumo:
A combinatorial mathematical model in tandem with a metaheuristic technique for solving transmission network expansion planning (TNEP) using an AC model associated with reactive power planning (RPP) is presented in this paper. AC-TNEP is handled through a prior DC model while additional lines as well as VAr-plants are used as reinforcements to cope with real network requirements. The solution of the reinforcement stage can be obtained by assuming all reactive demands are supplied locally to achieve a solution for AC-TNEP and by neglecting the local reactive sources, a reactive power planning (RPP) will be managed to find the minimum required reactive power sources. Binary GA as well as a real genetic algorithm (RCA) are employed as metaheuristic optimization techniques for solving this combinatorial TNEP as well as the RPP problem. High quality results related with lower investment costs through case studies on test systems show the usefulness of the proposal when working directly with the AC model in transmission network expansion planning, instead of relaxed models. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
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
Resumo:
This work performs an algorithmic study of optimization of a conformal radiotherapy plan treatment. Initially we show: an overview about cancer, radiotherapy and the physics of interaction of ionizing radiation with matery. A proposal for optimization of a plan of treatment in radiotherapy is developed in a systematic way. We show the paradigm of multicriteria problem, the concept of Pareto optimum and Pareto dominance. A generic optimization model for radioterapic treatment is proposed. We construct the input of the model, estimate the dose given by the radiation using the dose matrix, and show the objective function for the model. The complexity of optimization models in radiotherapy treatment is typically NP which justifyis the use of heuristic methods. We propose three distinct methods: MOGA, MOSA e MOTS. The project of these three metaheuristic procedures is shown. For each procedures follows: a brief motivation, the algorithm itself and the method for tuning its parameters. The three method are applied to a concrete case and we confront their performances. Finally it is analyzed for each method: the quality of the Pareto sets, some solutions and the respective Pareto curves
Resumo:
The distribution of petroleum products through pipeline networks is an important problem that arises in production planning of refineries. It consists in determining what will be done in each production stage given a time horizon, concerning the distribution of products from source nodes to demand nodes, passing through intermediate nodes. Constraints concerning storage limits, delivering time, sources availability, limits on sending or receiving, among others, have to be satisfied. This problem can be viewed as a biobjective problem that aims at minimizing the time needed to for transporting the set of packages through the network and the successive transmission of different products in the same pipe is called fragmentation. This work are developed three algorithms that are applied to this problem: the first algorithm is discrete and is based on Particle Swarm Optimization (PSO), with local search procedures and path-relinking proposed as velocity operators, the second and the third algorithms deal of two versions based on the Non-dominated Sorting Genetic Algorithm II (NSGA-II). The proposed algorithms are compared to other approaches for the same problem, in terms of the solution quality and computational time spent, so that the efficiency of the developed methods can be evaluated
Resumo:
Os Algoritmos Genético (AG) e o Simulated Annealing (SA) são algoritmos construídos para encontrar máximo ou mínimo de uma função que representa alguma característica do processo que está sendo modelado. Esses algoritmos possuem mecanismos que os fazem escapar de ótimos locais, entretanto, a evolução desses algoritmos no tempo se dá de forma completamente diferente. O SA no seu processo de busca trabalha com apenas um ponto, gerando a partir deste sempre um nova solução que é testada e que pode ser aceita ou não, já o AG trabalha com um conjunto de pontos, chamado população, da qual gera outra população que sempre é aceita. Em comum com esses dois algoritmos temos que a forma como o próximo ponto ou a próxima população é gerada obedece propriedades estocásticas. Nesse trabalho mostramos que a teoria matemática que descreve a evolução destes algoritmos é a teoria das cadeias de Markov. O AG é descrito por uma cadeia de Markov homogênea enquanto que o SA é descrito por uma cadeia de Markov não-homogênea, por fim serão feitos alguns exemplos computacionais comparando o desempenho desses dois algoritmos
Resumo:
In this work, we present a risk theory application in the following scenario: In each period of time we have a change in the capital of the ensurance company and the outcome of a two-state Markov chain stabilishs if the company pays a benece it heat to one of its policyholders or it receives a Hightimes c > 0 paid by someone buying a new policy. At the end we will determine once again by the recursive equation for expectation the time ruin for this company
Resumo:
In this work, we studied the strong consistency for a class of estimates for a transition density of a Markov chain with general state space E ⊂ Rd. The strong ergodicity of the estimates for the density transition is obtained from the strong consistency of the kernel estimates for both the marginal density p(:) of the chain and the joint density q(., .). In this work the Markov chain is supposed to be homogeneous, uniformly ergodic and possessing a stationary density p(.,.)
Resumo:
Foi utilizada uma análise de segregação com o uso da inferência Bayesiana para estimar componentes de variância e verificar a presença de genes de efeito principal (GEP) influenciando duas características de carcaça: gordura intramuscular (GIM), em %, e espessura de toucinho (ET), em mm; e uma de crescimento, ganho de peso (g/dia) dos 25 aos 90 kg de peso vivo (GP). Para este estudo, foram utilizadas informações de 1.257 animais provenientes de um delineamento de F2, obtidos do cruzamento de suínos machos Meishan e fêmeas Large White e Landrace. No melhoramento genético animal, os modelos poligênicos finitos (MPF) podem ser uma alternativa aos modelos poligênicos infinitesimais (MPI) para avaliação genética de características quantitativas usando pedigrees complexos. MPI, MPF e MPI combinado com MPF foram empiricamente testados para se estimar componentes de variâncias e número de genes no MPF. Para a estimação de médias marginais a posteriori de componentes de variância e de parâmetros, foi utilizada uma metodologia Bayesiana, por meio do uso da Cadeia de Markov, algoritmos de Monte Carlo (MCMC), via Amostrador de Gibbs e Reversible Jump Sampler (Metropolis-Hastings). em função dos resultados obtidos, pode-se evidenciar quatro GEP, sendo dois para GIM e dois para ET. Para ET, o GEP explicou a maior parte da variação genética, enquanto, para GIM, o GEP reduziu significativamente a variação poligênica. Para a variação do GP, não foi possível determinar a influência do GEP. As herdabilidades estimadas ajustando-se MPI para GIM, ET e GP foram de 0,37; 0,24 e 0,37, respectivamente. Estudos futuros com base neste experimento que usem marcadores moleculares para mapear os genes de efeito principal que afetem, principalmente GIM e ET, poderão lograr êxito.
Resumo:
O conhecimento do genoma pode auxiliar na identificação de regiões cromossômicas e, eventualmente, de genes que controlam características quantitativas (QTLs) de importância econômica. em um experimento com 1.129 suínos resultantes do cruzamento entre machos da raça Meishan e fêmeas Large White e Landrace, foram analisadas as características gordura intramuscular (GIM), em %, e ganho dos 25 aos 90 kg de peso vivo (GP), em g/dia, em 298 animais F1 e 831 F2, e espessura de toucinho (ET), em mm, em 324 F1 e 805 F2. Os animais das gerações F1 e F2 foram tipificados com 29 marcadores microsatélites. Estudou-se a ligação entre os cromossomos 4, 6 e 7 com GIM, ET e GP. Análises de QTL utilizando-se metodologia Bayesiana foram aplicadas mediante três modelos genéticos: modelo poligênico infinitesimal (MPI); modelo poligênico finito (MPF), considerando-se três locos; e MPF combinado com MPI. O número de QTLs, suas respectivas posições nos três cromossomos e o efeito fenotípico foram estimados simultaneamente. Os sumários dos parâmetros estimados foram baseados nas distribuições marginais a posteriori, obtidas por meio do uso da Cadeia de Markov, algoritmos de Monte Carlo (MCMC). Foi possível evidenciar dois QTLs relacionados a GIM nos cromossomos 4 e 6 e dois a ET nos cromossomos 4 e 7. Somente quando se ajustou o MPI, foram observados QTLs no cromossomo 4 para ET e GIM. Não foi possível detectar QTLs para a característica GP com a aplicação dessa metodologia, o que pode ter resultado do uso de marcadores não informativos ou da ausência de QTLs segregando nos cromossomos 4, 6 e 7 desta população. Foi evidenciada a vantagem de se analisar dados experimentais ajustando diferentes modelos genéticos; essas análises ilustram a utilidade e ampla aplicabilidade do método Bayesiano.