Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (12)
  • Open Access

    ARTICLE

    Inverse Solution of a Chromatography Model by means of Evolutionary Computation

    M. Irízar, L. D. Câmara, A. J. Silva Neto, O. Llanes

    CMES-Computer Modeling in Engineering & Sciences, Vol.54, No.1, pp. 1-14, 2009, DOI:10.3970/cmes.2009.054.001

    Abstract Modeling of Chromatography allows a better understanding and development of new techniques to be applied at industrial level, although it's relatively complex. The models of this process are represented by systems of partial differential equations with non linear parameters difficult to estimate generally, which constitutes an inverse problem. In general there aren't analytical solutions and therefore numerical methods should be used for their direct solutions. Frequently typical boundary conditions are considered, but it's convenient to study different approaches for those. Evolutionary Computation has been used successfully in many problems of diverse areas for searching in complex spaces. Considering previous works… More >

  • Open Access

    ARTICLE

    Convergence Properties of Genetic Algorithmsin a Wide Variety of Noisy Environments

    TakehikoNakama1

    CMC-Computers, Materials & Continua, Vol.14, No.1, pp. 35-60, 2009, DOI:10.3970/cmc.2009.014.035

    Abstract Random noise perturbs objective functions in practical optimization problems, and genetic algorithms (GAs) have been proposed as an effective optimization tool for dealing with noisy objective functions. In this paper, we investigate GAs in a variety of noisy environments where fitness perturbation can occur in any form-for example, fitness evaluations can be concurrently disturbed by additive and multiplicative noise. We reveal the convergence properties of GAs by constructing and analyzing a Markov chain that explicitly models the evolution of the algorithms in noisy environments. We compute the one-step transition probabilities of the Markov chain and show that the chain has… More >

Displaying 11-20 on page 2 of 12. Per Page