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...

In this paper, a novel genetic algorithm, including domain specific knowledge into the crossover operator and the local search mechanism for solving weapon-target assignment (WTA) problems is proposed. The WTA problem is a full assignment of weapons to hostile targets with the objective of minimizing the expected damage value to own-force assets. It is an NP-complete problem. In our study, a gr...

This paper proposes a genetic algorithm based on a new replacement strategy to solve the quadratic assignment problems, which are NP-hard. The new replacement strategy aims to improve the performance of the genetic algorithm through well balancing the convergence of the searching process and the diversity of the population. In order to test the performance of the algorithm, the instances in QAP...

Evaluating complex propositions requires evaluating truthvalues and assigning modal operators. Previous research suggested that evaluating truth-values may be the key to assigning modal operators. This study placed 111 third and fifth grade children in one of three training conditions: no training, training truth-value assignment, and training truthvalue and modal operator assignment. The resul...

Background We consider planning tasks Π = 〈V ,O, s0, G,Cost〉 captured by the standard SAS formalism (Bäckström and Klein 1991; Bäckström and Nebel 1995) with operator costs, extended by conditional effects. In such a task, V is a set of finite-domain state variables, each with domain D(v). Each complete assignment to V is called a state, and S = ∏ v∈V D(v) is the state space of Π. The state s0 ...

In this paper one of the fundamental problems of Shipbuilding Industry known as block assignment problem is modeled and solved. The irregular shape of blocks and the inherent intractability of this problem is the primary motivation to use the interactive genetic algorithms with a specialized chromosome level “repair” operator. Without loss of generality, some domain knowledge has been incorpora...

We are using bandit-based adaptive operator selection while autotuning parallel computer programs. The autotuning, which uses evolutionary algorithm-based stochastic sampling, takes place over an extended duration and occurs in situ as programs execute. The environment or context during tuning is either largely static in one scenario or dynamic in another. We rely upon adaptive operator selecti...

We propose a new swap operator on native types for incorporation into the C++1Y core language. For user-defined types, we propose that this new operator be treated as a special member function, and that, when viable, its presence provide an alternative to traditional memberwise implementation of defaulted assignment semantics.