Self-organizing migrating algorithm in model predictive control: Case study on semi-batch chemical reactor

Control of complex nonlinear systems brings challenges in the controller design. One of methods how to cope with this challenge is the usage of advanced optimization methods. This work presents application of self-organizing migrating algorithm (SOMA) in control of the semi-batch reactor. The reactor is used in chromium recycling process in leather industry. Because of the complexity of this semi-batch reactor control, the model predictive control (MPC) approach is used. The MPC controller includes self-organizing migrating algorithm (SOMA) for the optimization of the control sequence

Explaining SOMA: The relation of stochastic perturbation to population diversity and parameter space coverage

The Self-Organizing Migrating Algorithm (SOMA) is enjoying a renewed interest of the research community, following recent achievements in various application areas and renowned performance competitions. In this paper, we focus on the importance and effect of the perturbation operator in SOMA as the perturbation is one of the fundamental inner principles of SOMA. In this in-depth study, we present data, visualizations, and analysis of the effect of the perturbation on the population, its diversity and average movement patterns. We provide evidence that there is a direct relation between the perturbation intensity (set by control parameter prt) and the rate of diversity loss. The perturbation setting further affects the exploratory ability of the algorithm, as is demonstrated here by analysing the parameter space coverage of the population. We aim to provide insight and explanation of the impact of perturbation in SOMA for future researchers and practitioners. © 2021 ACM.IGA/CebiaTech/2021/00

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms

Minimization Problems in Signalized Road Networks

In this study, we present a bilevel programming model in which upper level is defined as a biobjective problem and the lower level is considered as a stochastic user equilibrium assignment problem. It is clear that the biobjective problem has two objectives: the first maximizes the reserve capacity whereas the second minimizes performance index of a road network. We use a weighted-sum method to determine the Pareto optimal solutions of the biobjective problem by applying normalization approach for making the objective functions dimensionless. Following, a differential evolution based heuristic solution algorithm is introduced to overcome the problem presented by use of biobjective bilevel programming model. The first numerical test is conducted on two-junction network in order to represent the effect of the weighting on the solution of combined reserve capacity maximization and delay minimization problem. Allsop & Charlesworth's network, which is a widely preferred road network in the literature, is selected for the second numerical application in order to present the applicability of the proposed model on a medium-sized signalized road network. Results support authorities who should usually make a choice between two conflicting issues, namely, reserve capacity maximization and delay minimization. C1 [Baskan, Ozgur; Ceylan, Huseyin] Pamukkale Univ, Dept Civil Engn, Fac Engn, TR-20160 Denizli, Turkey. [Ozan, Cenk] Adnan Menderes Univ, Dept Civil Engn, Fac Engn, TR-09100 Aydin, Turkey. Document type: Articl

Simulated Annealing

The book contains 15 chapters presenting recent contributions of top researchers working with Simulated Annealing (SA). Although it represents a small sample of the research activity on SA, the book will certainly serve as a valuable tool for researchers interested in getting involved in this multidisciplinary field. In fact, one of the salient features is that the book is highly multidisciplinary in terms of application areas since it assembles experts from the fields of Biology, Telecommunications, Geology, Electronics and Medicine

Evolutionary Computation

This book presents several recent advances on Evolutionary Computation, specially evolution-based optimization methods and hybrid algorithms for several applications, from optimization and learning to pattern recognition and bioinformatics. This book also presents new algorithms based on several analogies and metafores, where one of them is based on philosophy, specifically on the philosophy of praxis and dialectics. In this book it is also presented interesting applications on bioinformatics, specially the use of particle swarms to discover gene expression patterns in DNA microarrays. Therefore, this book features representative work on the field of evolutionary computation and applied sciences. The intended audience is graduate, undergraduate, researchers, and anyone who wishes to become familiar with the latest research work on this field

SOMA - Application

Import 03/11/2016Práce se zabývá nalézáním optimálních řešení pomocí evolučních algoritmů. Byla vytvořena apli-kace, jejíž základ se skládá ze Samo-Organizující se ho Migračního Algoritmu. U evolučního algo-ritmu SOMA bylo naimplementováno pět druhů algoritmu – All to One, All to All, All to One Ran-dom, All to One Adaptive a All to All Adaptive. Všechny varianty SOMA algoritmu byly podrobeny testování na galerii zvolených funkcí. Aplikace nabízí možnost dále pracovat s nalezenými nejlep-šími hodnotami získaných jednotlivými druhy SOMA algoritmu. Za pomocí algoritmu Simulova-ného žíhání se aplikace snaží nalézt ještě lepší výsledky, než byly nalezeny algoritmem SOMA. Na závěr jsou zhodnoceny dosažené výsledky jednotlivých variant SOMA algoritmu a jeho experimen-tálního rozšíření o simulované žíhání.The work deals by the searching for optimal solutions using evolutionary algorithms. There is created an application, whose basis consists of Self-Organizing Migrating Algorithm. There were imple-mented five kinds of algorithm at the evolutionary algorithm SOMA– All to One, All to All, All to One Random, All to One Adaptive a All to All Adaptive. All these variants of SOMA algorithm were tested in the gallery of the selected functions. The application offers the possibility to work the more with the best values, which were obtained by different types of SOMA algorithm. Using simulated annealing algorithm, the application tries to find an even better results than were found by SOMA algorithm. In conclusion, the results of various options SOMA algorithm and its experimental exten-sion of simulated annealing are evaluated.460 - Katedra informatikydobř

2022 roadmap on neuromorphic computing and engineering

Modern computation based on von Neumann architecture is now a mature cutting-edge science. In the von Neumann architecture, processing and memory units are implemented as separate blocks interchanging data intensively and continuously. This data transfer is responsible for a large part of the power consumption. The next generation computer technology is expected to solve problems at the exascale with 10$^{18}$ calculations each second. Even though these future computers will be incredibly powerful, if they are based on von Neumann type architectures, they will consume between 20 and 30 megawatts of power and will not have intrinsic physically built-in capabilities to learn or deal with complex data as our brain does. These needs can be addressed by neuromorphic computing systems which are inspired by the biological concepts of the human brain. This new generation of computers has the potential to be used for the storage and processing of large amounts of digital information with much lower power consumption than conventional processors. Among their potential future applications, an important niche is moving the control from data centers to edge devices. The aim of this roadmap is to present a snapshot of the present state of neuromorphic technology and provide an opinion on the challenges and opportunities that the future holds in the major areas of neuromorphic technology, namely materials, devices, neuromorphic circuits, neuromorphic algorithms, applications, and ethics. The roadmap is a collection of perspectives where leading researchers in the neuromorphic community provide their own view about the current state and the future challenges for each research area. We hope that this roadmap will be a useful resource by providing a concise yet comprehensive introduction to readers outside this field, for those who are just entering the field, as well as providing future perspectives for those who are well established in the neuromorphic computing community