Multiple alignments of biological nucleic acid sequences are one of the most commonly used techniques in sequence analysis. These techniques demand a big computational load. We present a Genetic Algorithms (GA) that optimizes an objective function that is a measure of alignment quality (distance). Each individual in the population represents (in an efficient way) some underlying operations on t...

This paper proposes an extension of the Gravitational Search Algorithm (GSA) to multiobjective optimization problems. The new algorithm, called Non-dominated Sorting GSA (NSGSA), utilizes the non-dominated sorting concept to update the gravitational acceleration of the particles. An external archive is also used to store the Pareto optimal solutions and to provide some elitism. It also guides t...

In this paper, implementation of a genetic algorithm has been described to store and later, recall of some prototype patterns in Hopfield neural network associative memory. Various operators of genetic algorithm (mutation, cross-over, elitism etc) are used to evolve the population of optimal weight matrices for the purpose of storing the patterns and then recalling of the patterns with induced ...

SPICE is a widely used tool for simulation of analog circuits. Accurate models of devices are crucial for obtaining realistic results from the simulation. Many devices must still be modelled with subcircuit models in order to achieve sufficient accuracy. Parameter values for subcircuit elements are determined by optimisation. Use of SPICE OPUS optimisation capabilities for model parameter ident...

This paper proposes a generalized Hybrid Real-coded Quantum Evolutionary Algorithm (HRCQEA) for optimizing complex functions as well as combinatorial optimization. The main idea of HRCQEA is to devise a new technique for mutation and crossover operators. Using the evolutionary equation of PSO a Single-Multiple gene Mutation (SMM) is designed and the concept of Arithmetic Crossover (AC) is used ...

This paper proposes a real-coded predator-prey GA for multiobjective optimization (RCPPGA). The model takes its inspiration from the spatial predator-prey dynamics observed in nature. RCPPGA differs itself from previous similar work by placing a specific emphasis on introducing a dynamic spatial structure to the predator-prey population. RCPPGA allows dynamic changes of the prey population size...

This paper presents a niched genetic programming tool, called DMGeo, which uses elitism and another techniques designed to efficiently perform classification rule mining in geographic databases. The main contribution of this algorithm is to present a way to work with geographical and conventional data in data mining tasks. In our approach, each individual in the genetic programming represents a...

But it has its flaws. As early as the 1980's, the GIS community has been accused of elitism, archaism and being, in essence, “ivory tower geomancers.” Although not all of the GIS community deserved these pejoratives, the problem may have arisen because of the things we “fought” about, such as the use of mainline IT databases, the separation of geometry and “nongraphic” attributes, the effective...

Problem statement: Knapsack problem is a typical NP complete problem. During last few decades, Knapsack problem has been studied through different approaches, according to the theoretical development of combinatorial optimization. Approach: In this study, modified evolutionary algorithm was presented for 0/1 knapsack problem. Results: A new objective_func_evaluation operator was proposed which ...

In this paper, we consider the problem of frequency estimation of undamped superimposed exponential signals model. We propose two iterative techniques of frequency estimation using genetic algorithms. The proposed methods use an elitism based generational genetic algorithm for obtaining the least squares and the approximate least squares estimates. In the simulation studies, it is observed that...