An Application of Erlang Mixture Distributions to modeling the reproduction mechanism in estimation of distribution algorithms

• Autorzy: Kołodziej J.
• Konferencja: Evolutionary Computation and Global Optimization 2006 / National Conference (9 ; 31.05-2.06.2006 ; Murzasichle, Poland)
• Języki publikacji: EN

Abstrakty

EN

We present the idea of an application of the mixtures of Erlang distributions in the construction of the recombination mechanism in estimation of distribution algorithms. We analyze main properties of Erlang mixtures and define a new Erlang Mixture Estimation of Distribution Algorithm. We try to compare the efficiencies of ErM-EDA and evolutionary strategy in case of large populations. Some experirnental results are presented after simple theoretical studies.

Słowa kluczowe

EN

evolutionary computation; evolutionary algorithm; EA; Erlang distribution; mixture of Erlang distribution; estimation of distribution algorithms; EDAs; Erlang Mixture Estimation of Distribution Algorithms; ErM-EDA

PL

obliczenia ewolucyjne; algorytm ewolucyjny; rozkład Erlanga; mieszanina rozkładów Erlanga

• Wydawca: Oficyna Wydawnicza Politechniki Warszawskiej
• Czasopismo: Prace Naukowe Politechniki Warszawskiej. Elektronika
• Rocznik: 2006
• Tom: z. 156
• Strony: 203--210
• Opis fizyczny: Bibliogr. 16 poz., tab.

Twórcy

autor

Kołodziej J.

• University of Bielsko-Biała, Department of Mathematics and Computer Science, Bielsko-Biała, Poland,

Bibliografia

• [1] L. Devroye. Non-Uniform Random Variate Generation. Springer Vlg., 1986.
• [2] Y. Fang. Teletraffic analysis and mobility modeling of pcs networks. EEE Transactions on Communication, 47:1062-1073, 1999.
• [3] J.D. Hamilton. A quasi-bayesian approach to estimating parameters for mixtures of normal distributions. Journal of Business and Economic Statistics, 9:27-39, 1991.
• [4] J. Arabas. Lectures on the Evolutionary Algorithms (in Polish). WNT, 2001.
• [5] F.P. Kelly. Reversibility and Stochastic Networks. Wiley & Sons, 1979.
• [6] P. Larra naga and J.A. Lozano. Estimation of Distribution Algorithms: A new Tool for Evolutionary Computation. Kluwer Academic Publishers, 2001.
• [7] J. Kołodziej and L. Ogiński. The estimation of the population distribution by the mixture of erlang distributions in evolutionary algorithms, 2005.
• [8] D. Thierens, P.A. Bosman. Expanding from discrete to continuous edas: The ieda. In Proc. of Parallel Problems Solving from Nature, PPSN-VI, pages 767-776, 2000.
• [9] D. Thierens, P.A. Bosman. Exploiting gradient information in continuous iterated density estimation evolutionary algorithms. In Working report, UU-CS-2001-53, Universiteit Utrecht, 2001.
• [10] M.J.D. Powell. Approximation Theory and Methods. Cambridge University Press, 1981.
• [11] Q. Zhang, Q.J. Sun, E. Tsang and J. Ford. Hybrid estimation of distribution algorithm for global optimization. Engineering Computations, 21, No. 1:91-107, 2004.
• [12] P. Wieczorkowski and R. Zieliński. Computer Random Numbers generators (in Polish). WNT, 1997.
• [13] S. Kotz, N. Balakrishnan and N.L. Johnson. Continous Multivariate Distributions, Volume 1: Models an Applications, 2nd ed. John Wiley Interscience Publication, 2001.
• [14] D.M. Titterington, A.F.M. Smith and U.E. Makov. Statistical Analysis of Finite Mixture Distributions. Wiley & Sons, 1985.
• [15] S. Tsutsui, M. Pelikan and D.E. Goldberg. Evolutionary algorithm using marginal histogram model in continuous domain. 2005.
• [16] D.C. Montgomery, W.W. Hines and D.M. Goldsman and C.M. Borror. Probability and Statistics in Engineering, 4th ed. Wiley & Sons, 2001.