Based on certain phenomena from the human society and nature, we propose a binary affinity genetic algorithm (aGA) by adopting the following strategies: the population is adaptively updated to avoid stagnation; the newly generated individuals are guaranteed to survive for certain number of generations in order for them to have enough time to develop their good genes; new individuals and the old...

Proteins are vital components of living cells. A number of diseases such as Alzheimer's, Cystic fibrosis and Mad Cow diseases are shown to result from malfunctioning of proteins. Protein folding problem is the process of predicting the optimal 3D molecular structure of a protein, or tertiary structure, which is an indication of its proper function. An enhancement over Cellular Genetic Algorithm...

this paper investigates the problem of selecting and scheduling a set of projects among available projects. each project consists of several tasks and to perform each one some resource is required. the objective is to maximize total benefit. the paper constructs a mathematical formulation in form of mixed integer linear programming model. three effective metaheuristics in form of the imperialis...

multiple traveling salesman problem (mtsp) is one of the most popular operation research problem and is known as combinatorial optimization problems. mtsp is an extension version of the famous and widely used problem named traveling salesman problem (tsp). because of its benefices in various domains, many researchers have tried to solve that, and many methods have proposed so far. mtsp is a np-...

We present new methods of decomposition of an n ×m binary matrix I into a product A ∗ B of an n × k binary matrix A and a k×m binary matrix B. These decompositions are alternative to the usual one which is sought in Boolean factor analysis (BFA), where ∗ is a Boolean product of matrices. In the new decompositions, ∗ are the left and the right triangular products of Boolean matrices. In BFA, I i...

The social foraging behavior of Escherichia coli bacteria has been used to solve optimization problems. This paper proposes a hybrid approach involving genetic algorithms (GA) and bacterial foraging (BF) algorithms for function optimization problems. We first illustrate the proposed method using four test functions and the performance of the algorithm is studied with an emphasis on mutation, cr...

The Bacterial Foraging Optimization (BFO) is one of the metaheuristics algorithms that most widely used to solve optimization problems. The BFO is imitated from the behavior of the foraging bacteria group such as Ecoli. The main aim of algorithm is to eliminate those bacteria that have weak foraging methods and maintaining those bacteria that have strong foraging methods. In this extent, each b...

This paper proposes Bacteria Foraging Optimization Algorithm (BFOA) based Static Var Compensator (SVC) for the suppression of oscillations in a multimachine power system. The proposed design problem of SVC over a wide range of loading conditions is formulated as an optimization problem. BFOA is employed to search for optimal controller parameters by minimizing the time domain objective function...