Full text
| |
| Author(s): |
Diogenes Laertius Silva de Oliveira Filho
Total Authors: 1
|
| Document type: | Master's Dissertation |
| Press: | Ribeirão Preto. |
| Institution: | Universidade de São Paulo (USP). Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto (PCARP/BC) |
| Defense date: | 2019-01-24 |
| Examining board members: |
Renato Tinós;
André Carlos Ponce de Leon Ferreira de Carvalho;
Alexandre Cláudio Botazzo Delbem;
Danilo Sipoli Sanches
|
| Advisor: | Renato Tinós |
| Abstract | |
The recombination of solutions is important for most of the population meta- heuristics. Recombination by decomposition partitions the decision variables of the problem in order to allow the decomposition of the evaluation function. In this way, it allows to find, with computational cost proportional to the cost of evaluating one solution of the problem, the best solution among a number of offspring solutions that grows exponentially with the number of partitions found by the recombination operator. Recombination by decomposition has been so far used only in problems where the information about the linkage between the decision variables is known. The main objective of this project was the development of new operators of recombination by decomposition for all pseudo-Boolean optimization problems. For this purpose, was necessary to estimate the linkage between the decision variables by using procedures generally employed in estimation of distribution algorithms. Our results show that the new recombination operator obtained significant results for the problems chosen relate to the generation of new solutions by recombination, in comparison to the other recombination operators used (AU) | |
| FAPESP's process: | 16/16769-0 - Operators of recombination by decomposition for pseudo-boolean optimization |
| Grantee: | Diogenes Laertius Silva de Oliveira Filho |
| Support Opportunities: | Scholarships in Brazil - Master |