• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • 1
  • Tagged with
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Optimal distribution network reconfiguration using meta-heuristic algorithms

Asrari, Arash 01 January 2015 (has links)
Finding optimal configuration of power distribution systems topology is an NP-hard combinatorial optimization problem. It becomes more complex when time varying nature of loads in large-scale distribution systems is taken into account. In the second chapter of this dissertation, a systematic approach is proposed to tackle the computational burden of the procedure. To solve the optimization problem, a novel adaptive fuzzy based parallel genetic algorithm (GA) is proposed that employs the concept of parallel computing in identifying the optimal configuration of the network. The integration of fuzzy logic into GA enhances the efficiency of the parallel GA by adaptively modifying the migration rates between different processors during the optimization process. A computationally efficient graph encoding method based on Dandelion coding strategy is developed which automatically generates radial topologies and prevents the construction of infeasible radial networks during the optimization process. The main shortcoming of the proposed algorithm in Chapter 2 is that it identifies only one single solution. It means that the system operator will not have any option but relying on the found solution. That is why a novel hybrid optimization algorithm is proposed in the third chapter of this dissertation that determines Pareto frontiers, as candidate solutions, for multi-objective distribution network reconfiguration problem. Implementing this model, the system operator will have more flexibility in choosing the best configuration among the alternative solutions. The proposed hybrid optimization algorithm combines the concept of fuzzy Pareto dominance (FPD) with shuffled frog leaping algorithm (SFLA) to recognize non-dominated suboptimal solutions identified by SFLA. The local search step of SFLA is also customized for power systems applications so that it automatically creates and analyzes only the feasible and radial configurations in its optimization procedure which significantly increases the convergence speed of the algorithm. In the fourth chapter, the problem of optimal network reconfiguration is solved for the case in which the system operator is going to employ an optimization algorithm that is automatically modifying its parameters during the optimization process. Defining three fuzzy functions, the probability of crossover and mutation will be adaptively tuned as the algorithm proceeds and the premature convergence will be avoided while the convergence speed of identifying the optimal configuration will not decrease. This modified genetic algorithm is considered a step towards making the parallel GA, presented in the second chapter of this dissertation, more robust in avoiding from getting stuck in local optimums. In the fifth chapter, the concentration will be on finding a potential smart grid solution to more high-quality suboptimal configurations of distribution networks. This chapter is considered an improvement for the third chapter of this dissertation for two reasons: (1) A fuzzy logic is used in the partitioning step of SFLA to improve the proposed optimization algorithm and to yield more accurate classification of frogs. (2) The problem of system reconfiguration is solved considering the presence of distributed generation (DG) units in the network. In order to study the new paradigm of integrating smart grids into power systems, it will be analyzed how the quality of suboptimal solutions can be affected when DG units are continuously added to the distribution network. The heuristic optimization algorithm which is proposed in Chapter 3 and is improved in Chapter 5 is implemented on a smaller case study in Chapter 6 to demonstrate that the identified solution through the optimization process is the same with the optimal solution found by an exhaustive search.
2

Adaptyvios genetinių algoritmų strategijos mechaninių struktūrų formai optimizuoti / Shape Optimization of Mechanical Structures Using Genetic Algorithm with Adaptive Strategies

Valackaitė, Laisvūnė 25 June 2014 (has links)
Šiame baigiamajame darbe optimizuojama plokščiojo kūno forma esant žinomai apkrovai ir kraštinėms sąlygoms. Aptariami pagrindiniai optimizavimo tipai, globaliojo optimizavimo ir kontinuumo diskretizavimo metodai. Forma optimizuojama trimis skirtingais neadaptyviais genetiniais algoritmais ir trimis adaptyviais, taikant migracijos strategijas. Poslinkiai ir von Mises įtempimai skaičiuojami baigtinių elementų metodu. Darbo užduotis realizuota C++ kalba. Darbą sudaro 9 dalys: įvadas, kūno formos modeliavimo metodų apžvalga, baigtinių elementų metodas, genetiniai algoritmai, kūno formos optimizavimo uždavinys, rezultatų palyginimas, išvados, literatūros sąrašas, priedai. Darbo apimtis - 62 p. teksto be priedų, 39 iliustr., 5 lent., 24 bibliografinių šaltinių. / The task of Master thesis is to optimize shape of plane body with given loading and boundary conditions. The classes of structural optimization problems, the methods of global optimization and discretization of continual structures are discussed. For shape optimization three different not adaptive and three adaptive genetic algorithms with migration strategy are used, displacements and von Mises stresses are calculated using finite element method. The program was created using C++ language. The work consists of 9 parts: introduction, overview of methods used for shape optimization, finite element method, genetic algorithms, shape optimization of plane body, results, conclusions, references, appendixes. Work consist of 62 p. text without appendixes, 39 pictures, 5 tables, 24 bibliographical entries. Appendixes are included.

Page generated in 0.1364 seconds