Estudio e implementación de metaheurísticas para solucionar el problema de la selección deseada

Abstract

Evolutionary algorithms are among the most successful approaches for solving a number of problems where systematic search in huge domains must be performed. One problem of practical interest that falls into this category is known as The Root Identification Problem in Geometric Constraint Solving, where one solution to the geometric problem must be selected among a number of possible solutions bounded by an exponential number. In this work we analize habilities and drawbacks of a series of metaheuristics in relation with the Root identification problem