Search

Multiple Sequence Alignment (MSA) is one of the main topics in the in bioinformatics domain, consists finding an optimal alignment for three or more biological sequences with the number maximum of conserved zones or totally aligned columns. Different scores to assess the quality of the alignments have been proposed, so the problem can be formulated and resolved as a Multi-Objective Optimization Problem (MOP). For this reason, in this paper we present a Multi- Objective approach applied to MSA. We have considered state-of-the-art optimization algorithms aimed at solving different formulations of the MSA: NSGAII, NSGA-III, SPEA2, MOCell, SMS-EMOA, MOEA/D and GWASF-GA. Furthermore we have considered some popular metrics as objectives to be optimized: The weighted Sum-Of-Pairs with a ne gap penalties (wSOP), the Totally Aligned Columns (TC), STRIKE and BaliScore. Finally we have described the main features of our software jMetalMSA, a Multi-Objective optimization software tool applied to MSA problem and illustrated a working example for experimentations purposes. [ABSTRACT FROM AUTHOR]

Proper management of projects has become an element of vital importance for the solution to problems of society. In this context, there are two main objectives to be solved: the construction of project plans which may comply with the constraints of the problem and the optimization in terms of cost and time of those plans. To this end, all activities of project must be organized in such way that the constraints related to the precedence among them and the availability of renewable and non-renewable resources at each instant of time are met. The aim of this paper is to present an Estimation of Distribution Algorithm (EDA), which incorporates the handling of the constraints in the probabilistic model, for the construction of optimal or quasi-optimal project plans. For the validation of the algorithm, authors used both the PSPLib database repository for the development of the scheduling research and the databases of projects of the Repository for Research in Project Management, University of Infomatic Sciences. [ABSTRACT FROM AUTHOR]

FuzzyPred is an unsupervised-learning data-mining algorithm, which allows extracting fuzzy predicates in normal forms from the data. This method is used to solve a descriptive task where it is not known the kind of relationships that are to be found. The goal is to find patterns that describe the data and their relationships. Due to the large set of solutions or search space that may have, it was modeled as an optimization problem, where metaheuristics are applied to find good solutions. FuzzyPred provides as a result a set of predicates, evaluated in each of the quality measures, in spite of the fact that only one of the measures is optimized (truth value). This paper introduces a multiobjective approach for FuzzyPred by using two of the most known multi-objective optimization techniques: Pareto technique (or pure multi-objective) and weighted factors. An experimental study is presented in order to compare the efficacy of both techniques in this problem. The results in several international databases show that better results are obtained by the pure multi-objective technique. [ABSTRACT FROM AUTHOR]

In this paper, we present a modification of the repetitive random search algorithm. In our proposal, we change the fixed parameters which values are set by the user, by deterministic values following a chaotic map. The proposed algorithm is used to optimize four well known test functions for 10, 20 and 30 dimensions. For all cases, our proposal converges to better points that the optimal points obtained using the traditional version with fixed values in the parameters. The obtained results encourage us to continue the development and testing of the proposal algorithm with a major suite of test functions, and to compare it with other well established heuristic algorithms. [ABSTRACT FROM AUTHOR]

In this paper an algorithm for the numerical solution of nonlinear equations systems is presented. For this purpose the system of equations becomes a function of real value which will be minimized, in the global sense, in a given initial domain (a box in n) using analysis of intervals. The designed algorithm has the ability to determine the existence or not of solutions to the system of equations in a given box. The solutions of the system of equations, if they exist inside the given box, are expressed by means of enclosures by sub-boxes whose size is smaller than the established accuracy. There is not restriction about the relationship between the number of equations and the number of unknowns of the system. It is also carried out an analysis of the convergence of the algorithm, and the results of their application are shown for some test problems. [ABSTRACT FROM AUTHOR]

This paper proposes a numerical method for the calibration of dynamic stochastic general equilibrium (DSGE) models. The method consists in the use of a hybrid algorithm, first to find the steady state, and then to minimize an objective function defined by the researcher according to the purposes of the calibration. The proposed method consists in the use of the Simulated Annealing algorithm followed by traditional optimization routines. The virtues of the algorithm are analyzed through Monte Carlo simulations, using a closed-economy model that has a steady state with no analytical solution. The results obtained in this exercise show that the proposed algorithm generates more precise results using less computational resources than traditional alternatives. Finally we present the calibration of a model for the Colombian economy, consisting of 179 equations and adjusted through 50 parameters to replicate 50 ratios. The maximum percent deviation of the steady-state ratios of the model with respect to the corresponding values in the Colombian economy is 7.9%, and in 29 of all the 50 cases this deviation is less than or equal to 1%. [ABSTRACT FROM AUTHOR]

ACO is a metaheuristic inspired in the behavior of natural ant colonies to solve combinatorial optimization problems, based on simple agents that work cooperatively communicating by artificial pheromone trails. In this paper a model to solve the municipal waste collection problem by containers is presented, which applies a concept of partial collection sequences that must be joined to minimize the total collection distance. The problem to join the partial collection sequences is represented as a TSP, which is solved by an ACO algorithm. Based on the literature, algorithm parameters are experimentally calibrated and range of variations that represents good average solutions are recommended. The model is applied to a waste collection sector of the San Pedro de la Paz commune in Chile, obtaining recollection routes with less total distance with respect to the actual route utilized and to the solution obtained by a previously developed approach. [ABSTRACT FROM AUTHOR]

In this paper, we develop a fuzzy analytical model, which solves a multiobjective problem in multicast transmission with static trees over GMPLS networks. A model proponed by Donoso [4] was used. The multiobjective problem is solved through metaheuristic wit h evolutionary algorithms, in this case SPEA2 solving a NP-Hard problem in polynomial time. Additionally, a Fuzzy Evolutionary Algorithm based on SPEA2 is implemented. Finally, the comparison between FSPEA2 and SPEA2 is realized and we are giving some conclusions. [ABSTRACT FROM AUTHOR]

In this paper, an analysis of evolutionary algorithms for multi objective optimization, Non-dominated Sorting Genetic Algorithm (NSGA-II) and Strength Pareto Evolutionary Algorithm (SPEA-II) is presented. For this analysis, is taken as reference an optimization problem in a multicast data network, which has as objective functions the hop count and transmission delay. The algorithms performance is compared in tree different networks. Moreover, the model for two of this topologies using GAMS tool is resolved and results are compared with the NSGA-II and SPEA-II algorithms proposed. Problem results show the algorithms performance in their solution. [ABSTRACT FROM AUTHOR]

In this paper, we compare, from a theoretical and a practical viewpoint, two settings of a certain tax-programming problem and the algorithms proposed for solving it. This problem may be modeled as a parametric quadratic-programming problem having lower and upper bounds on the variables. The objective function is a quadratic function whose Hessian matrix is diagonal and positive. A term is added that penalizes not to achieving a certain goal. This penalization can be formulated either as an absolute or as a quadratic deviation. [ABSTRACT FROM AUTHOR]