Operators of recombination by decomposition for pseudo-boolean optimization

• Grant number: 16/16769-0
• Support Opportunities: Scholarships in Brazil - Master
• Start date: November 01, 2016
• End date: May 31, 2018
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Computing Methodologies and Techniques
• Principal Investigator: Renato Tinós
• Grantee: Diogenes Laertius Silva de Oliveira Filho
• Host Institution: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto (FFCLRP). Universidade de São Paulo (USP). Ribeirão Preto , SP, Brazil

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 is the development of new operators of recombination by decomposition for all pseudo-Boolean optimization problems. For this purpose, it will be necessary to estimate the linkage between the decision variables by using procedures generally employed in estimation of distribution algorithms (also known as model-based evolutionary algorithms). (AU)

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

OLIVEIRA FILHO, Diogenes Laertius Silva de. Operators of recombination by decomposition for pseudo-Boolean optimization. 2019. Master's Dissertation - Universidade de São Paulo (USP). Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto (PCARP/BC) Ribeirão Preto.