Optimization on industrial problems focussing on multi-player strategies

Algorithms (EA) are useful optimization methods for exploration of the search space, but they usually have slowness problems to exploit and converge to the minimum with accuracy. On the other hand, gradient based methods converge faster to local minimums, although are not so robust (e.g., flat areas and discontinuities can cause problems) and they lack exploration capabilities. This thesis presents and analyze four versions of a hybrid optimization method trying to combine the virtues of Evolutionary Algorithms (EA) and gradient based algorithms, and to overcome their corresponding drawbacks. The proposed Hybrid Methods enables working with N optimization algorithms (called players), multiple objective functions and design variables, and define them differently for each player. The performance of the Hybrid Methods are compared against a gradient based method, two Genetic Algorithms (GA) and a Particle Swarm Optimization (PSO). Tests have been conducted with mathematical benchmark problems (synthetic tests designed to specifically test optimization methods) and an engineering application with high demanding computational resources, a Synthetic Jet actuator for Active Flow Control (AFC) over a 2D Selig-Donovan 7003 (SD7003) airfoil at Reynolds number 6 x 10^4 and a 14 degree angle of attack. The Active Flow control problem has been used in a single optimization problem and in a two objective optimization problemEls Algoritmes Evolutius (EA) són mètodes d'optimització útils per a l'exploració de l'espai de cerca, però solen tenir problemes de lentitud per explotar-ne el mínim i convergir amb precisió. D'altra banda, els mètodes basats en gradients convergeixen més ràpidament als mínims locals, encara que no són tan robusts (per exemple, les àrees planes i les discontinuïtats poden causar problemes) i no tenen capacitats d'exploració. Aquesta tesi presenta i analitza quatre versions d'un mètode d'optimització híbrid que intenta combinar les virtuts dels Algoritmes Evolutius (EA) i els algoritmes basats en gradients, i superar-ne els inconvenients corresponents. Els Mètodes Híbrids proposats permeten treballar amb N algoritmes d'optimització (anomenats jugadors), múltiples funcions objectiu i variables de disseny, i definir-les de manera diferent per a cada jugador. El rendiment dels mètodes híbrids es compara amb un mètode basat en gradient, dos Algoritmes Genètics (GA) i un mètode d'optimització d'eixam de partícules (PSO). S'han fet proves amb problemes matemàtics de referència (proves sintètiques dissenyades per provar específicament mètodes d'optimització) i una aplicació d'enginyeria amb recursos computacionals molt exigents, un actuador de jet sintètic per a control de flux actiu (AFC) sobre un perfil aerodinàmic 2D Selig -Donovan 7003 (SD7003) al número de Reynolds 6 x 104 i un angle d'atac de 14 graus. El problema de control de flux actiu s'ha utilitzat en un problema d'optimització monoobjectiu i en un problema d'optimització de dos objectius.Postprint (published version

Study of hybrid strategies for multi-objective optimization using gradient based methods and evolutionary algorithms

Most of the optimization problems encountered in engineering have conflicting objectives. In order to solve these problems, genetic algorithms (GAs) and gradient-based methods are widely used. GAs are relatively easy to implement, because these algorithms only require first-order information of the objectives and constraints. On the other hand, GAs do not have a standard termination condition and therefore they may not converge to the exact solutions. Gradient-based methods, on the other hand, are based on first- and higher-order information of the objectives and constraints. These algorithms converge faster to the exact solutions in solving single-objective optimization problems, but are inefficient for multi-objective optimization problems (MOOPs) and unable to solve those with non-convex objective spaces. The work in this dissertation focuses on developing a hybrid strategy for solving MOOPs based on feasible sequential quadratic programming (FSQP) and nondominated sorting genetic algorithm II (NSGA-II). The hybrid algorithms developed in this dissertation are tested using benchmark problems and evaluated based on solution distribution, solution accuracy, and execution time. Based on these performance factors, the best hybrid strategy is determined and found to be generally efficient with good solution distributions in most of the cases studied. The best hybrid algorithm is applied to the design of a crushing tube and is shown to have relatively well-distributed solutions and good efficiency compared to solutions obtained by NSGA-II and FSQP alone

Numerical and Evolutionary Optimization 2020

This book was established after the 8th International Workshop on Numerical and Evolutionary Optimization (NEO), representing a collection of papers on the intersection of the two research areas covered at this workshop: numerical optimization and evolutionary search techniques. While focusing on the design of fast and reliable methods lying across these two paradigms, the resulting techniques are strongly applicable to a broad class of real-world problems, such as pattern recognition, routing, energy, lines of production, prediction, and modeling, among others. This volume is intended to serve as a useful reference for mathematicians, engineers, and computer scientists to explore current issues and solutions emerging from these mathematical and computational methods and their applications

A Novel Hybrid Moth Flame Optimization with Sequential Quadratic Programming Algorithm for Solving Economic Load Dispatch Problem

The insufficiency of energy resources, increased cost of generation and rising load demand necessitate optimized economic dispatch. The real world ED (Economic Dispatch) is highly non-convex, nonlinear and discontinuous problem with different equality and inequality constraints. In this research paper, a novel hybrid MFO-SQP (Moth Flame Optimization with Sequential Quadratic Programming) is proposed to solve the ED problem. The MFO is stochastic searching algorithm minimizes by random search and SQP is definite in nature that refines the local search in vicinity of local minima. Proposed technique has been implemented on 6, 15 and 40 units test system with different constraints like valve point loading effect, transmission loss, prohibited zones, generator capacity limits and power balance. Results, obtained from proposed technique are compared with those of the techniques reported in the literature, are proven better in terms of fuel cost and convergence

Non-Unique oligonucleotide probe selection heuristics

The non-unique probe selection problem consists of selecting both unique and nonunique oligonucleotide probes for oligonucleotide microarrays, which are widely used tools to identify viruses or bacteria in biological samples. The non-unique probes, designed to hybridize to at least one target, are used as alternatives when the design of unique probes is particularly difficult for the closely related target genes. The goal of the non-unique probe selection problem is to determine a smallest set of probes able to identify all targets present in a biological sample. This problem is known to be NP-hard. In this thesis, several novel heuristics are presented based on greedy strategy, genetic algorithms and evolutionary strategy respectively for the minimization problem arisen from the non-unique probe selection using the best-known ILP formulation. Experiment results show that our methods are capable of reducing the number of probes required over the state-of-the-art methods

Bio-inspired computation: where we stand and what's next

In recent years, the research community has witnessed an explosion of literature dealing with the adaptation of behavioral patterns and social phenomena observed in nature towards efficiently solving complex computational tasks. This trend has been especially dramatic in what relates to optimization problems, mainly due to the unprecedented complexity of problem instances, arising from a diverse spectrum of domains such as transportation, logistics, energy, climate, social networks, health and industry 4.0, among many others. Notwithstanding this upsurge of activity, research in this vibrant topic should be steered towards certain areas that, despite their eventual value and impact on the field of bio-inspired computation, still remain insufficiently explored to date. The main purpose of this paper is to outline the state of the art and to identify open challenges concerning the most relevant areas within bio-inspired optimization. An analysis and discussion are also carried out over the general trajectory followed in recent years by the community working in this field, thereby highlighting the need for reaching a consensus and joining forces towards achieving valuable insights into the understanding of this family of optimization techniques

Bio-inspired computation: where we stand and what's next

In recent years, the research community has witnessed an explosion of literature dealing with the adaptation of behavioral patterns and social phenomena observed in nature towards efficiently solving complex computational tasks. This trend has been especially dramatic in what relates to optimization problems, mainly due to the unprecedented complexity of problem instances, arising from a diverse spectrum of domains such as transportation, logistics, energy, climate, social networks, health and industry 4.0, among many others. Notwithstanding this upsurge of activity, research in this vibrant topic should be steered towards certain areas that, despite their eventual value and impact on the field of bio-inspired computation, still remain insufficiently explored to date. The main purpose of this paper is to outline the state of the art and to identify open challenges concerning the most relevant areas within bio-inspired optimization. An analysis and discussion are also carried out over the general trajectory followed in recent years by the community working in this field, thereby highlighting the need for reaching a consensus and joining forces towards achieving valuable insights into the understanding of this family of optimization techniques