The artificial bee colony (ABC) algorithm, which was inspired by the foraging and dance behaviors of real honey bee colonies, was first introduced for solving numerical optimization problems. When the solution space of the optimization problem is binary-structured, the basic ABC algorithm should be modified for solving this class of problems. In this study, we propose XOR-based modification for...

Honey bee colonies depend on pollen and nectar from flowers for their feed. The act of searching this by the bees is called foraging. foraging behaviour depends profitability sources as well needs colony. This modeled into an algorithm Foraging Bee Optimization Algorithm (FBA). After initialization, loops through three phases based bees’ nature 3W: Waggle, Work, Withdraw. A large number are ini...

In this paper, we explain the social foraging behavior of E. coli and M. xanthus bacteria and develop simulation models based on the principles of foraging theory that view foraging as optimization. This provides us with novel models of their foraging behavior and with new methods for distributed nongradient optimization. Moreover, we show that the models of both species of bacteria exhibit the...

clustering is a widespread data analysis and data mining technique in many fields of study such as engineering, medicine, biology and the like. the aim of clustering is to collect data points. in this paper, a cultural algorithm (ca) is presented to optimize partition with n objects into k clusters. the ca is one of the effective methods for searching into the problem space in order to find a n...

we study the problem of reconstructing binary images from four projections data in a fuzzy environment. given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. we provide an iterative algorithm based on fuzzy integer programming and linear membership functions.

The bacterial foraging optimization (BFO) algorithm is a popular stochastic, population-based optimization technique that can be applied to a wide range of problems. Two are the major issues the BFO algorithm is confronted with: first, the foraging mechanism of BFO might in some cases induce the attraction of bacteria gathered near the global optimum by bacteria gathered to local optima, thus s...

Scheduling in Computational Grid (CG) is an important but complex task. It is done to schedule the submitted jobs onto the nodes of the grid so that some characteristic parameter is optimized. Makespan of the job is an important parameter and most often scheduling is done to optimize makespan. Genetic Algorithm (GA) is a search procedure based on the evolutionary technique that is able to solve...

the jamor purpose of the present research is to predict the total stock market index of tehran stock exchange, using a combined method of wavelet transforms, fuzzy genetics, and neural network in order to predict the active participations of finance market as well as macro decision makers.to do so, first the prediction was made by neural network, then a series of price index was decomposed by w...

Binary Factor Analysis (BFA, also known as Boolean Factor Analysis) may help with understanding collections of binary data. Since we can take collections of text documents as binary data too, the BFA can be used to analyse such collections. Unfortunately, exact solving of BFA is not easy. This article shows two BFA methods based on exact computing, boolean algebra and the theory of formal conce...