Víctor Parada

Learn More
This work presents a parallel genetic algorithm (PGA) model to solve the set-covering problem (SCP). Experimental results obtained with a binary representation of the SCP, show that*in terms of the number of generations (computational time) needed to achieve solutions of an acceptable quality*PGA performs better than the sequential model. This comportment(More)
a Instituto de Computaçao, Universidade Federal de Fluminense, Rua Passo da Pátria 156, Bloco E, 3 andar, São Domingos, Niterói, RJ, CEP: 24210-240, Brazil Departamento de Ingeniería Informática, Universidad de Santiago de Chile, Av. Ecuador 3659, Santiago, Chile Departamento de Engenharia de Produção, Universidade Federal Fluminense, Rua Passo da Patria(More)
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a group of machines. The objective is to build manufacturing clusters by associating part families with machine cells, with the aim of minimizing the inter-cellular movements of parts(More)
Humans need to solve computationally intractable problems such as visual search, categorization, and simultaneous learning and acting, yet an increasing body of evidence suggests that their solutions to instantiations of these problems are near optimal. Computational complexity advances an explanation to this apparent paradox: (1) only a small portion of(More)
Delivery of efficient service through a web site makes it compulsory in the redesigning stage to take into account the behavior of the users, which can be studied by means of a web log file that partially records information about user visits. The reconstruction of all of the sequences of pages that are visited by users who browse a web site is known as the(More)
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which belong to the np-hard class of problems. Therefore, their resolution in real situations is generally addressed using heuristic methods. This paper considers the duty generation(More)
Victor Parada a,∗, Rodrigo Palma a, Daniel Sales b and Arlindo Gómes c a Departamento de Ingeniería Informática, Universidad de Santiago de Chile, Av. Ecuador 3659, Santiago, Chile E-mail: vparada@diinf.usach.cl b Departamento de Ingeniería Eléctrica, Universidad de Santiago de Chile, Av. Ecuador 3659, Santiago, Chile c Departamento de Informática,(More)
Genetic algorithms are powerful search methods inspired by Darwinian evolution. To date, they have been applied to the solution of many optimization problems because of the easy use of their properties and their robustness in finding good solutions to difficult problems. The good operation of genetic algorithms is due in part to its two main variation(More)