In this paper, the computationally intelligent modeling approach for fluidized bed combustion process is considered, as well as intelligent process control based on developed models and soft computing methodologies. Applied genetic optimization and fuzzy modeling approach are combined with proposed intelligent control strategies. Efficient fuzzy nonlinear FBC process modeling by combining sever...

In this paper, we proposed simplex crossover (SPX), a multiparent recombination operator for real-coded genetic algorithms. SPX generates offspring vector values by uniformly sampling values from simplex formed by m (2 ≤ m ≤ number of parameters + 1) parent vectors. The SPX features an independence from of coordinate systems. Experimental results using test functions, which are commonly used in...

In Genetic and Evolutionary Algorithms (GEAs) one is faced with a given number of parameters, whose possible values are coded in a binary alphabet. With Order Based Representations (OBRs) the genetic information is kept by the order of the genes and not by its value. The application of OBRs to the Traveling Salesman Problem (TSP) is a well known technique to the GEA community. In this work one ...

An inverse problem is considered to identify the geometry of discontinuities in a conductive material with anisotropic conductivity from Cauchy data measurements taken on the boundary. In this study we propose a real coded genetic algorithm in conjunction with a boundary element method to detect an anisotropic inclusion, such as a circle, by a single boundary measurement. Numerical results are ...

In this paper, we propose the genetic design of fuzzy neural networks with multi-output based on interval type-2 fuzzy set (IT2FSFNNm) for pattern recognition. IT2FSFNNm is the networks of combination between the fuzzy neural networks (FNNs) and interval type-2 fuzzy set with uncertainty. The premise part of the networks is composed of the fuzzy partition of respective input spaces and the cons...

Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...

This paper introduces a new Evolutionary Computation (EC) framework named Open BEAGLE, that we have been developing and improving since 1999. Coded in C++, this framework offers solid object oriented foundations based on design patterns. It contains a basic generic EC framework on which other specialized frameworks can easily be constructed. Release 1.0 of Open BEAGLE implements two specialized...