Otávio Noura Teixeira

PSO-GPU: accelerating particle swarm optimization in CUDA-based graphics processing units

This work presents a PSO implemention in CUDA architecture, aiming to speed up the algorithm on problems which has large amounts of data. PSO-GPU algorithm was designed to customization, in order to adapt for any problem that can be solved by a PSO algorithm. By implementing PSO using CUDA architecture, each processing core of the GPU will be responsible for a portion of the overall processing operation, where each one of these pieces are handled and executed in a massive parallel enviroment, opening the possibility for solving problems that require a large processing load in considerably less time. In order to evaluate the performance of PSO-GPU algorithm two functions were used, both global optimization problems, where without constraints (Griewank function) and other considering constraints, the Welded Beam Design (WBD).

A New Cooperative Evolutionary Multi-Swarm Optimizer Algorithm Based on CUDA Architecture Applied to Engineering Optimization

This paper presents a new Cooperative Evolutionary Multi-Swarm Optimization Algorithm (CEMSO-GPU) based on CUDA parallel architecture applied to solve engineering problems. The focus of this approach is: the use of the concept of master/slave swarm with a mechanism of data sharing; and, the parallelism method based on the paradigm of General Purpose Computing on Graphics Processing Units (GPGPU) with CUDA architecture, brought by NVIDIA corporation. All these improvements were made aiming to produce better solutions in fewer iterations of the algorithm and to improve the search for best results. The algorithm was tested for some well-known engineering problems (WBD, ATD, MWTCS, SRD-11) and the results compared to other approaches.

Game theory as a new paradigm for phenotype characterization of genetic algorithms

In this paper, it is presented a new way to characterize the phenotype in the context of Genetic Algorithms through the use of Game Theory as a theoretical foundation to define a new phase in the algorithm, named Social Interaction. It is executed before the reproduction phase and allows individuals to fight for their own survival improving their fitness according to the rules of a game. Thereby, a new algorithm is presented and some good results were produced for Traveling Salesman Problem an improvement in Genetic Algorithm execution.

ABC+ES: Combining Artificial Bee Colony Algorithm and Evolution Strategies on Engineering Design Problems and Benchmark Functions

The following paper introduces a hybrid algorithm that combines Artificial Bee Colony Algorithm (ABC) and a model of Evolution Strategies (ES) found in the Evolutionary Particle Swarm Optimization (EPSO), another hybrid metaheuristic. The goal of this approach is to incorporate the effectiveness and simplicity of the ABC with the thorough local search mechanism of the Evolution Strategies in order to devise an algorithm that is able to achieve better optimality in less time than the original ABC applied to function optimization problems. With the intention of assessing this novel algorithm performance and reliability, several unconstrained benchmark functions as well as four large-scale constrained optimization-engineering problems (WBD, DPV, SRD-11 and MWTCS) act as an evaluation environment. The results obtained by the ABC+ES are compared to original ABC and several other optimization techniques.

ABC+ES: a novel hybrid artificial bee colony algorithm with evolution strategies

This paper has the purpose of presenting a new hybridization of the Artificial Bee Colony Algorithm (ABC) based on the evolutionary strategies (ES) found on the Evolutionary Particle Swarm Optimization (EPSO). The main motivation of this approach is to augment the original ABC in a way that combines the effectiveness and simplicity of the ABC with the robustness and increased exploitation of the Evolution Strategies. The algorithm is intended to be tested on two large-scale engineering design problem and its results compared to other optimization techniques.

A Novel Competitive Quantum-Behaviour Evolutionary Multi-Swarm Optimizer Algorithm Based on CUDA Architecture Applied to Constrained Engineering Design

This paper presents a new bio-inspired algorithm named Competitive Quantum-Behaviour Evolutionary Multi-Swarm Optimization (CQEMSO) based on CUDA parallel architecture applied to solve engineering problems, using the concept of master/slave swarm working under a competitive scheme and being executed over the paradigm of General Purpose Computing on Graphics Processing Units (GPGPU). The efforts on implementing the CQEMSO algorithm are focused at generating a solution which includes greater quality of search and higher speed of convergence by using mechanisms of evolutionary strategies with the procedures of search and optimization found in the classic QPSO. For performance analysis, the proposed solution was submitted to some well-known engineering problems (WBD, DPV) and its results compared to other solutions found on scientific literature.

Fuzzy social interaction genetic algorithm

This work has the purpose to present a new hybrid metaheuristic developed based on three fundamentals pillars extremely well known: Genetic Algorithms, Game Theory and Fuzzy Systems. This new approach tries to mimic a little bit more closer how a population of individuals evolves along time, like human social evolution emphasizing the social interaction between individuals and the non-binary behavior of human decision making against the classical cooperate-defect behavior present in the Prisoners Dilemma. In this way it is also presented the SIGA Algorithm [9], the approach of an individual more complex with a genotype composed of two chromosomes, one for the solution of the problem and the other representing its strategy, a binary or fuzzy. Finally some results are presented to an instance of the Traveling Salesman Problem.

SIACO: a novel algorithm based on ant colony optimization and game theory for travelling salesman problem

The following paper demonstrates the possibilities of adapting the Ant Colony Algorithm with Social Interaction coming from Game Theory. This novel algorithm, named Social Interaction Ant Colony Optimization (SIACO), were based on the Ant System Algorithm developed by Dorigo and Social Interaction created by Otávio Teixeira in Genetic Algorithm. A new phase was inserted in the Ant System and the game is performed by two ants inside the colony. Four instances of Travelling Salesman Problem (TSP) were used to validate the approach and its results shows that the proposed can be a rival of other algorithms when applied to this class of problems.

Evolutionary Quick Artificial Bee Colony for Constrained Engineering Design Problems

The Artificial Bee Colony (ABC) is a well-known simple and efficient bee inspired metaheuristic that has been showed to achieve good performance on real valued optimization problems. Inspired by such, a Quick Artificial Bee Colony (QABC) was proposed by Karaboga to enhance the global search and bring better analogy to the dynamic of bees. To improve its local search capabilities, a modified version of it, called Evolutionary Quick Artificial Bee Colony (EQABC), is proposed. The novel algorithm employs the mutation operators found in Evolutionary Strategies (ES) that was applied in ABC from Evolutionary Particle Swarm Optimization (EPSO). In order to test the performance of the new algorithm, it was applied in four large-scale constrained optimization structural engineering problems. The results obtained by EQABC are compared to original ABC, QABC, and ABC + ES, one of the algorithms inspired for the development of EQABC.

Analyzing Genetic Algorithm with Game Theory and Adjusted Crossover Approach on Engineering Problems

This paper has the purpose to show game theory (GT) applied to genetic algorithms (GA) as a new type of interaction between individuals of GA. The game theory increases the exploration potential of the genetic algorithm by changing the fitness with social interaction between individuals, avoiding the algorithm to fall in a local optimum. To increase the exploitation potential of this approach, this work will present the adjusted crossover operator and compare results to other crossover methods.