Displaying similar documents to “A formal analysis of the computational dynamics in GIGANTEC.”

The island model as a Markov dynamic system

Robert Schaefer, Aleksander Byrski, Maciej Smołka (2012)

International Journal of Applied Mathematics and Computer Science

Similarity:

Parallel multi-deme genetic algorithms are especially advantageous because they allow reducing the time of computations and can perform a much broader search than single-population ones. However, their formal analysis does not seem to have been studied exhaustively enough. In this paper we propose a mathematical framework describing a wide class of island-like strategies as a stationary Markov chain. Our approach uses extensively the modeling principles introduced by Vose, Rudolph and...

Parameter Identification of a Fed-Batch Cultivation of S. Cerevisiae using Genetic Algorithms

Angelova, Maria, Tzonkov, Stoyan, Pencheva, Tania (2010)

Serdica Journal of Computing

Similarity:

Fermentation processes as objects of modelling and high-quality control are characterized with interdependence and time-varying of process variables that lead to non-linear models with a very complex structure. This is why the conventional optimization methods cannot lead to a satisfied solution. As an alternative, genetic algorithms, like the stochastic global optimization method, can be applied to overcome these limitations. The application of genetic algorithms is a precondition for...

Theoretical analysis of steady state genetic algorithms

Alexandru Agapie, Alden H. Wright (2014)

Applications of Mathematics

Similarity:

Evolutionary Algorithms, also known as Genetic Algorithms in a former terminology, are probabilistic algorithms for optimization, which mimic operators from natural selection and genetics. The paper analyses the convergence of the heuristic associated to a special type of Genetic Algorithm, namely the Steady State Genetic Algorithm (SSGA), considered as a discrete-time dynamical system non-generational model. Inspired by the Markov chain results in finite Evolutionary Algorithms, conditions...

A hybrid evolutionary approach to intelligent system design.

Amr Badr, Ibrahim Farag, Saad Eid (1999)

Mathware and Soft Computing

Similarity:

The problem of developing a general methodology for system design has always been demanding. For this purpose, an evolutionary algorithm, adapted with design-specific representation data structures is devised. The representation modeling the system to be designed, is composed of three levels of abstraction: the first, is an 'abstract brain' layer - mainly a number of competing finite state machines, which in turn control the second level composed of fuzzy Petri nets; the third level...

Asymptotic behaviour of a discrete dynamical system generated by a simple evolutionary process

Iwona Karcz-Dulęba (2004)

International Journal of Applied Mathematics and Computer Science

Similarity:

A simple model of phenotypic evolution is introduced and analysed in a space of population states. The expected values of the population states generate a discrete dynamical system. The asymptotic behaviour of the system is studied with the use of classical tools of dynamical systems. The number, location and stability of fixed points of the system depend on parameters of a fitness function and the parameters of the evolutionary process itself. The influence of evolutionary process parameters...