Traditionally, crossover operators are based on combination--an operator takes parts from two parents and combines them into an offspring. This paper presents a series of crossover operators based on commonality--an operator preserves the common parts from two parents and uses them as a base on which an offspring solution is built. Experiments on benchmark sequencing problems show that these ne...

We establish the entangling power of a unitary operator on a general finite-dimensional bipartite quantum system with and without ancillas, and give relations between the entangling power based on the von Neumann entropy and the entangling power based on the linear entropy. Significantly, we demonstrate that the entangling power of a general controlled unitary operator acting on two equal-dimen...

This paper describes a network crossover operator based on knowledge gathered from either prior problem-specific knowledge or linkage learning methods such as estimation of distribution algorithms (EDAs). This operator can be used in a genetic algorithm (GA) to incorporate linkage in recombination. The performance of GA with network crossover is compared to that of GA with uniform crossover and...

Uniform crossover for binary strings has a natural geometric interpretation that allows us to generalize it rigorously to any search space endowed with a notion of distance and any representation [6]. In this paper, we present an analogous characterization for one-point crossover and explicitly derive formally specific one-point crossovers for a number of well-known representations.

Ideally the character of an evolutionary search algorithm should be predicated on the shape of the underlying search landscape. Unfortunately, a number of operators used in evolutionary computation are very sensitive to rotation of the encoding space. The potential bias of the orientation of the encoding for these operators indicates that both the alignment of the encoding as well as the search...

We define an abstract normed vector space where the genetic operators are elements. This is used to define the disturbance of the generational operator G as the distance between the crossover and mutation operator (combined) and the identity. This quantity appears in a bound on the variance of fixed-point populations, and in a bound on the force //v - G(v)// that applies to the optimal populati...

Task scheduling in multiprocessor systems is one of the main factors of systems performance. In this paper, the problem of scheduling of tasks in Multiprocessor system is described as finding optimal sequence of the task (called schedule) such that makespan can be minimized. Finding the optimal solution of scheduling the tasks into the processors is NPComplete. Genetic Algorithm (GA) has been d...

Classification of microarray data requires the selection of a subset of relevant genes in order to achieve good classification performance. Several genetic algorithms have been devised to perform this search task. In this paper, we carry out a study on the role of crossover operator and in particular investigate the usefulness of a highly specialized crossover operator called GeSeX (GEne SElect...

A swap instruction, which exchanges a value in memory with a value of a register, is available on many architectures. The primary application of a swap instruction has been for process synchronization. In this paper we show that a swap instruction can often be used to coalesce loads and stores in a variety of applications. We describe the analysis necessary to detect opportunities to exploit a ...