Fernando Paredes

Learn More
Set covering problem is the model for many important industrial applications. In this paper, we solve some benchmarks of this problem with ant colony optimization algorithms using a new transition rule. A look-ahead mechanism was incorporated to check constraint consistency in ant computing. Computational results are presented showing the advantages to use(More)
A Constraint Satisfaction Problem is defined by a set of variables and a set of constraints, each variable has a nonempty domain of possible values. Each constraint involves some subset of the variables and specifies the allowable combinations of values for that subset. A solution of the problem is defined by an assignment of values to some or all of the(More)
1 Escuela de Ingenierı́a Informática, Pontificia Universidad Católica de Valparaı́so, Valparaı́so 2362807, Chile 2 Department of Engineering Science, University of Auckland, Auckland 1020, New Zealand 3 Instituto de Estadı́stica, Pontificia Universidad Católica de Valparaı́so, Valparaı́so 2362807, Chile 4 CIMFAV Facultad de Ingenierı́a, Universidad de(More)
A reactive and hybrid constraint solver Eric Monfroy a b , Carlos Castro c , Broderick Crawford d , Ricardo Soto d e , Fernando Paredes f & Christian Figueroa g a Departemento de Informática , Universidad Técnica Federico Santa María , Av. España 1680, Valparaíso, Av. Chile b Département d'Informatique , Université de Nantes , France c Departemento de(More)
Cell formation consists in organizing a plant as a set of cells, each of them containing machines that process similar types or families of parts. The idea is to minimize the part flow among cells in order to reduce costs and increase productivity. The literature presents different approaches devoted to solve this problem, which are mainly based on(More)
The main goal concerning Constraint Satisfaction Problems is to determine a value assignment for variables satisfying a set of constraints, or otherwise, to conclude that such an assignment does not exist (the set of constraints is unsatisfiable). In the Constraint Programming resolution process, it is known that the order in which the variables are(More)
The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem. The artificial bee colony algorithm is(More)
a Pontificia Universidad Católica de Valparaíso, Av. Brasil 2950, Valparaíso, Chile Universidad Autónoma de Chile, Av. Pedro de Valdivia 641, Santiago, Chile Universidad Finis Terrae, Av. Pedro de Valdivia 1509, Santiago, Chile CNRS, LINA, University of Nantes, 2 rue de la Houssinière, Nantes, France e Escuela de Ingeniería Industrial, Universidad Diego(More)
The set cover problem, belongs to the branch of combinatorial optimization problems, whose complexity is exponential theoretically established as NP-complex problems. Consists in finding a subset of columns in a matrix of zeros and ones such that cover all rows of the matrix at a minimal cost. In this work, the problem is solved by binary Firefly algorithm,(More)