Ideally the character of an evolutionary search algorithm should be predicated on the shape of the underlying search landscape. Unfortunately, a number of operators used in evolutionary computation are very sensitive to rotation of the encoding space. The potential bias of the orientation of the encoding for these operators indicates that both the alignment of the encoding as well as the search...

The aim of this paper is to give a method for reducing the problem of getting trapped in local optima (cycling), which is a common problem in evolutionary algorithms. For solving this problem we are proposing to use a Tabu method for avoiding already visited regions, this in combination with a novel fuzzy method that can handle imperfect knowledge in a broader way than Intuitionistic fuzzy logi...

Mastermind is in essence a search problem in which a string of symbols that is kept secret must be found by sequentially playing strings that use the same alphabet, and using the responses that indicate how close are those other strings to the secret one as hints. Although it is commercialized as a game, it is a combinatorial problem of high complexity, with applications on fields that range fr...

Harmony Search metaheuristic is successfully used in several applications of science and engineering. However, its effectiveness in solving multiobjective optimization problems using the concepts of Pareto optimality, remains unproved. This paper presents two proposals of the Harmony Search metaheuristic for multiobjective optimization, using the ZDT functions as a test bed. Performance metrics...

In recent years, metaheuristics have been applied with some success to the Unit Commitment (UC) problem. Methods like Simulated Annealing, Tabu Search and Evolutionary Programming can be found in several papers, presenting results that are sufficiently interesting to justify further research in the area. In this paper, a new metaheuristic approach based on GRASP Greedy Randomized Adaptive Searc...