For a set T of rooted binary leaf-labelled trees, we present an algorithm that finds all of the minor-minimal trees that are compatible with T . The running time of this algorithm is polynomial up to the number of trees with this property. This type of problem arises in several areas of classification, particularly evolutionary biology.

Heuristic evolutionary optimization algorithms are the solutions to many engineering optimization problems. Differential evolution (DE) is a real stochastic evolutionary parameter optimization in current use.DE does not require more control parameters compared to other evolutionary algorithms. Master Production Scheduling (MPS) is posed as one of multi objective parameter optimization problems ...

This paper presents a new procedure for the nondominated sorting with constraint handling to be used in a multiobjective evolutionary algorithm. The strategy uses a sorting algorithm and binary search to classify the solutions in the correct level of the Pareto front. In a problem with m objective functions, using n solutions in the population, the original nondominated sorting algorithm, used ...

This work presents an analysis of the static Aging operator for different evolutionary algorithms: two immunological algorithms (OptIA and Clonalg), a standard genetic algorithm SGA, and Differential Evolution (DE) algorithm. The algorithms were tested against standard benchmarks in both unconstrained and dynamic optimisation problems. This work analyses whether the aging operator improves the ...

Discrete Tomography (DT) is concerned with the reconstruction of binary images from their horizontal and vertical projections. In this paper we consider an evolutionary algorithm for computing such reconstructions. We show that the famous Japanese puzzles are a special case of a more general DT problem and successfully apply our algorithm to such puzzles.

Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...

The population-based evolutionary algorithms have emerged as powerful mechanism for finding optimum solutions of complex optimization problems. A promising new evolutionary algorithm, differential evolution, has garnered significant attention in the engineering optimization research. Differential evolution has the advantage of incorporating a relatively simple and efficient form of mutation and...

In real life we are often confronted with dynamic optimization problems whose optima change over time. These problems challenge traditional optimization methods as well as conventional evolutionary optimization algorithms. In this paper, we propose an evolutionary model that combines the differential evolution algorithm with cellular automata to address dynamic optimization problems. In the pro...