Chaos enhanced differential evolution in the task of evolutionary control of selected set of discrete chaotic systems

Evolutionary technique differential evolution (DE) is used for the evolutionary tuning of controller parameters for the stabilization of set of different chaotic systems. The novelty of the approach is that the selected controlled discrete dissipative chaotic system is used also as the chaotic pseudorandom number generator to drive the mutation and crossover process in the DE. The idea was to utilize the hidden chaotic dynamics in pseudorandom sequences given by chaotic map to help differential evolution algorithm search for the best controller settings for the very same chaotic system. The optimizations were performed for three different chaotic systems, two types of case studies and developed cost functions.Web of Science2014art. no. 83648

Crosshair Optimizer

Metaheuristic optimization algorithms are heuristics that are capable of creating a good enough\u27\u27 solution to a computationally complex problem. Algorithms in this area of study are focused on the process of exploration and exploitation: exploration of the solution space and exploitation of the results that have been found during that exploration, with most resources going toward the former half of the process. The novel Crosshair optimizer developed in this thesis seeks to take advantage of the latter, exploiting the best possible result as much as possible by directly searching the area around that best result with a stochastic approach. This research seeks to prove that the Crosshair Optimizer is comparable, if not better in some aspects, to current established metaheuristics optimization algorithms, not only in obtaining optimal results, but usability in high performance computing, and versatility through the use of multiple randomizers and parameter tuning

Chaos enhanced differential evolution in the task of evolutionary control of selected set of discrete chaotic systems

Evolutionary technique differential evolution (DE) is used for the evolutionary tuning of controller parameters for the stabilization of set of different chaotic systems. The novelty of the approach is that the selected controlled discrete dissipative chaotic system is used also as the chaotic pseudorandom number generator to drive the mutation and crossover process in the DE. The idea was to utilize the hidden chaotic dynamics in pseudorandom sequences given by chaotic map to help differential evolution algorithm search for the best controller settings for the very same chaotic system. The optimizations were performed for three different chaotic systems, two types of case studies and developed cost functions.Grant Agency of the Czech Republic [GACR P103/13/08195S]; Grant of SGS [SP2014/159, SP2014/170]; VSB-Technical University of Ostrava, Czech Republic; Development of Human Resources in Research and Development of Latest Soft Computing Methods and Their Application in Practice Project - Operational Programme Education for Competitiveness [CZ.1.07/2.3.00/20.0072]; ESF; budget of the Czech Republic; European Regional Development Fund under the Project CEBIA-Tech [CZ.1.05/2.1.00/03.0089]; Internal Grant Agency of Tomas Bata University [IGA/FAI/2014/010

Rámec pro plánování problémy

Import 22/07/2015Scheduling problems form an important subclass of combinatorial optimisation problems with many applications in manufacturing and logistics. Predominately these problems are NP-complete (decision based) and NP-hard (optimisation based), hence the main course of research in solving them concentrates on the design of efficient heuristic algorithms. Two main categories of these algorithms exist: deterministic algorithms and evolutionary metaheuristics. The deterministic algorithms comprise local improvement techniques, such as k-opt algorithm, which try to improve existing feasible solution, and constructive heuristics, such as NEH, which build a solution starting from scratch, adding one job at a time. Evolutionary metaheuristics have prospered in the past decades, owing to their efficiency and flexibility. Drawing inspiration from the theory of natural evolution or swarm behavioural patterns, the most popular of these algorithms in practice include for instance Genetic Algorithms, Differential Evolution, Particle Swarm Optimisation, amongst others. However, even though these heuristics provide in most cases close to optimal solution at reasonable execution time, this time is still impractically long for many applications. Therefore much effort has been dedicated to accelerating these algorithms. Since the development of hardware turns away from increasing the clock speed towards the parallel processing units, owing to reaching the limits of technology due to the increased power consumption and heat dissipation, this effort goes into parallelisation of the existing algorithms, to enable exploitation of the computing power of multi-core or many-core platforms. This is the goal of the first part of the thesis, accelerating two of the deterministic algorithms, NEH and 2-opt, with interesting results. Another approach has been taken in the second part, with the core premise of exploring the influence of stochasticity on the performance of an evolutionary algorithm, selecting the relatively recent and promising Discrete Artificial Bee Colony algorithm. The pseudo-random number generator has been replaced with the different types of dissipative chaos maps, with some of them improving the algorithm significantly. It has been shown that the population based evolutionary algorithms often form complex networks, taken from the point of view of the information exchange between individual solutions during the course of population development. The final part of this thesis puts this observation into practice by embedding the complex network analysis based self-adaptive mechanism into the ABC algorithm, a continuous optimisation problems solving evolutionary algorithm, which is however the basis for the afore mentioned DABC algorithm, and proving the effectiveness for some of the developed versions, currently on the standard continuous optimisation test functions, with the possibility to extend this modification to the combinatorial optimisations problems in the future being discussed in the conclusion.Rozvrhovací problémy jsou důležitou podtřídou úloh kombinatorické optimalizace s řadou aplikací ve výrobě a logistice. Většina těchto problémů je NP-úplných (rozhodovací forma) a NP-těžkých (optimalizační forma), proto se výzkum zaměřuje na návrh efektivních heuristických algoritmů. Dvě hlavní kategorie těchto algoritmů jsou deterministické algoritmy a evoluční metaheuristiky. Deterministické algoritmy zahrnují techniky lokálního prohledávání, například algoritmus k-opt, jejichž cílem je zlepšení existujícího přípustného řešení problému, dále pak konstruktivní heuristiky, jejichž příkladem je algoritmus NEH, které hledané řešení vytvářejí inkrementálně, bez potřeby znalosti vstupního bodu v prohledávaném prostoru řešení. Evoluční metaheuristiky mají za sebou historii úspěšného vývoje v posledních desetiletích, zejména díky jejich efektivitě a flexibilitě. Jejich inspirací jsou poznatky převzaté z biologie, teorie evoluce a inteligence hejna. Mezi nejpopulárnějšími z těchto algoritmů jsou, mimo jiné, genetické algoritmy, diferenciální evoluce, rojení částic (Particle Swarm Optimisation). Ačkoli tyto heuristiky nalézají ve většině případů řešení blížící se globálnímu optimu v přípustném výpočetním čase, pro řadu aplikací mohou být stále ještě nepřijatelně pomalé. Velké úsilí bylo věnováno zrychlení těchto algoritmů. Protože se vývoj hardware díky dosažení technologických limitů, vzhledem ke zvyšující se spotřebě energie a tepelnému vyzařování, obrací od zvyšování frekvence jednojádrového procesoru k vícejádrovým procesorům a paralelnímu zpracování, je tato snaha většinou orientovaná na paralelizaci existujících algoritmů, aby bylo umožněno využití výpočetní síly vícejádrových platforem (multi-core a many-core). Prvním cílem této práce je tudíž akcelerace dvou deterministických algoritmů, NEH a 2-opt, přičemž bylo dosaženo zajímavých výsledků. Jiný přístup byl zvolen ve druhé části, s hlavní myšlenkou prozkoumání vlivu náhodnosti na výkon evolučního algoritmu. Za tímto účelem byl zvolen relativně nový a slibný algoritmus Discrete Artificial Bee Colony. Generátor pseudonáhodných čísel byl nahrazen několika různými chaotickými mapami, z nichž některé znatelně zlepšily výsledky algoritmu. Bylo ukázáno, že evoluční algoritmy založené na populaci často formují komplexní sítě, vzato z pohledu výměny informací mezi jednotlivými řešeními v populaci během jejího vývoje. Závěrečná část práce aplikuje toto pozorování vložením samo přizpůsobivého mechanismu založeném na analýze komplexní sítě do algoritmu ABC, který je evolučním algoritmem pro spojitou optimalizaci a zároveň základem dříve zmíněného DABC algoritmu. Efektivita několika verzí algoritmu založeném na této myšlence je dokázána na standardní sadě testovacích funkcí pro spojitou optimalizaci. Možnost rozšíření této modifikace na kombinatorické optimalizační problémy je diskutována v závěru práce.460 - Katedra informatikyvýborn

Differential Evolution and Deterministic Chaotic Series: A Detailed Study

This research represents a detailed insight into the modern and popular hybridization of deterministic chaotic dynamics and evolutionary computation. It is aimed at the influence of chaotic sequences on the performance of four selected Differential Evolution (DE) variants. The variants of interest were: original DE/Rand/1/ and DE/Best/1/ mutation schemes, simple parameter adaptive jDE, and the recent state of the art version SHADE. Experiments are focused on the extensive investigation of the different randomization schemes for the selection of individuals in DE algorithm driven by the nine different two-dimensional discrete deterministic chaotic systems, as the chaotic pseudorandom number generators. The performances of DE variants and their chaotic/non-chaotic versions are recorded in the one-dimensional settings of 10D and 15 test functions from the CEC 2015 benchmark, further statistically analyzed

Visualization of Chaotic Attractors and Their Properties

Import 22/07/2015Cieľom tejto práce je vytvoriť funkčnú aplikáciu s grafickým uživateľským rozhraním, ktorá bude vykresľovať chaotické atraktory, pričom výsledný atraktor bude závisieť od parametrov zadaných uživateľom. V aplikácii bude možné zväčšiť vybranú časť pre detailnejší pohľad na danú oblasť. Čo je to atraktor a aké má spojenie s chaosom je náplňou teoretickej časti, ktorá tiež obsahuje stručný popis použitých atraktorov. Na začiatku praktickej časti je popísaná samotná implementácia aplikácie. Následuje grafické znázornenie možností uživateľa a nakoniec stručný prehľad základných metód aplikácie.The aim of this thesis is create usable application with graphical user interface, which will be draw a chaotic attractors. Resultant attractor depends on the parameters, which are entered by user. In application will be possible to zoom the selected section for detailed view. What is a attractor and how is connected with chaos is concern of teoretical part. Teoretical part also contains a brief description all attractors, which I use in thesis. At the beginning of practical part is described implementation of application. Followed by graphical representation of user options and finally a brief overview of the basic methods of application.460 - Katedra informatikyvelmi dobř

Graph-based Algorithms for Smart Mobility Planning and Large-scale Network Discovery

Graph theory has become a hot topic in the past two decades as evidenced by the increasing number of citations in research. Its applications are found in many fields, e.g. database, clustering, routing, etc. In this thesis, two novel graph-based algorithms are presented. The first algorithm finds itself in the thriving carsharing service, while the second algorithm is about large graph discovery to unearth the unknown graph before any analyses can be performed. In the first scenario, the automatisation of the fleet planning process in carsharing is proposed. The proposed work enhances the accuracy of the planning to the next level by taking an advantage of the open data movement such as street networks, building footprints, and demographic data. By using the street network (based on graph), it solves the questionable aspect in many previous works, feasibility as they tended to use rasterisation to simplify the map, but that comes with the price of accuracy and feasibility. A benchmark suite for further research in this problem is also provided. Along with it, two optimisation models with different sets of objectives and contexts are proposed. Through a series of experiment, a novel hybrid metaheuristic algorithm is proposed. The algorithm is called NGAP, which is based on Reference Point based Non-dominated Sorting genetic Algorithm (NSGA-III) and Pareto Local Search (PLS) and a novel problem specific local search operator designed for the fleet placement problem in carsharing called Extensible Neighbourhood Search (ENS). The designed local search operator exploits the graph structure of the street network and utilises the local knowledge to improve the exploration capability. The results show that the proposed hybrid algorithm outperforms the original NSGA-III in convergence under the same execution time. The work in smart mobility is done on city scale graphs which are considered to be medium size. However, the scale of the graphs in other fields in the real-world can be much larger than that which is why the large graph discovery algorithm is proposed as the second algorithm. To elaborate on the definition of large, some examples are required. The internet graph has over 30 billion nodes. Another one is a human brain network contains around 1011 nodes. Apart of the size, there is another aspect in real-world graph and that is the unknown. With the dynamic nature of the real-world graphs, it is almost impossible to have a complete knowledge of the graph to perform an analysis that is why graph traversal is crucial as the preparation process. I propose a novel memoryless chaos-based graph traversal algorithm called Chaotic Traversal (CHAT). CHAT is the first graph traversal algorithm that utilises the chaotic attractor directly. An experiment with two well-known chaotic attractors, Lozi map and Rössler system is conducted. The proposed algorithm is compared against the memoryless state-of-the-art algorithm, Random Walk. The results demonstrate the superior performance in coverage rate over Random Walk on five tested topologies; ring, small world, random, grid and power-law. In summary, the contribution of this research is twofold. Firstly, it contributes to the research society by introducing new study problems and novel approaches to propel the advance of the current state-of-the-art. And Secondly, it demonstrates a strong case for the conversion of research to the industrial sector to solve a real-world problem

Differencial Evolution and Its Application

Import 05/08/2014Cílem této diplomové práce je naimplementovat algoritmus diferenciální evoluce, na kterém jsou využity pseudonáhodné a chaotické generátory čísel. Poté analyzovat jednotlivé generátory v sadě experimentů.The thesis aims to implementation of differential evolution, using both standard and chaotic pseudo-random number generators. In another part of the thesis generators were tested by a set of experiments.460 - Katedra informatikyvýborn

Different fuzzy control configurations tuned by the Bees Algorithm for LFC of two-area power system

This study develops and implements a design of the Fuzzy Proportional Integral Derivative with filtered derivative mode (Fuzzy PIDF) for Load Frequency Control (LFC) of a two-area interconnected power system. To attain the optimal values of the proposed structure’s parameters which guarantee the best possible performance, the Bees Algorithm (BA) and other optimisation tools are used to accomplish this task. A Step Load Perturbation (SLP) of 0.2 pu is applied in area one to examine the dynamic performance of the system with the proposed controller employed as the LFC system. The supremacy of Fuzzy PIDF is proven by comparing the results with those of previous studies for the same power system. As the designed controller is required to provide reliable performance, this study is further extended to propose three different fuzzy control configurations that offer higher reliability, namely Fuzzy Cascade PI − PD, Fuzzy PI plus Fuzzy PD, and Fuzzy (PI + PD), optimized by the BA for the LFC for the same dual-area power system. Moreover, an extensive examination of the robustness of these structures towards the parametric uncertainties of the investigated power system, considering thirteen cases, is carried out. The simulation results indicate that the contribution of the BA tuned the proposed fuzzy control structures in alleviating the overshoot, undershoot, and the settling time of the frequency in both areas and the tie-line power oscillations. Based on the obtained results, it is revealed that the lowest drop of the frequency in area one is −0.0414 Hz, which is achieved by the proposed Fuzzy PIDF tuned by the BA. It is also divulged that the proposed techniques, as was evidenced by their performance, offer a good transient response, a considerable capability for disturbance rejection, and an insensitivity towards the parametric uncertainty of the controlled system