A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets

被引:10
|
作者
Aytug, H
Bhattacharrya, S
Koehler, GJ
机构
[1] PURDUE UNIV, KRANNERT SCH MANAGEMENT, W LAFAYETTE, IN 47907 USA
[2] SO ILLINOIS UNIV, DEPT MANAGEMENT, CARBONDALE, IL 62901 USA
[3] MICHIGAN TECHNOL UNIV, SCH BUSINESS & ENGN ADM, HOUGHTON, MI 49931 USA
关键词
genetic algorithm; stopping criteria; higher cardinality;
D O I
10.1016/S0377-2217(96)00121-X
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we model the run time behavior of GAs using higher cardinality representations as Markov Chains, define the states of the Markov Chain and derive the transition probabilities of the corresponding transition matrix. We analyze the behavior of this chain and obtain bounds on its convergence rate and bounds on the runtime complexity of the GA. We further investigate the effects of using binary versus higher cardinality representation of a search space.
引用
收藏
页码:195 / 201
页数:7
相关论文
共 50 条
  • [21] Markov chain analysis of genetic algorithms applied to fitness functions perturbed concurrently by additive and multiplicative noise
    Takehiko Nakama
    Computational Optimization and Applications, 2012, 51 : 601 - 622
  • [22] Markov chain analysis of genetic algorithms applied to fitness functions perturbed concurrently by additive and multiplicative noise
    Nakama, Takehiko
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2012, 51 (02) : 601 - 622
  • [23] Markov Chain Analysis of Genetic Algorithms Applied to Fitness Functions Perturbed by Multiple Sources of Additive Noise
    Nakama, Takehiko
    SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING, 2008, 149 : 123 - 136
  • [24] Economic Design of the Special VSSI T2 Chart with Genetic Algorithms Based on Markov Chain
    Gu, Li-Jun
    Tang, Qing-Guo
    PROCEEDINGS OF THE 3RD ANNUAL INTERNATIONAL CONFERENCE ON MANAGEMENT, ECONOMICS AND SOCIAL DEVELOPMENT (ICMESD 17), 2017, 21 : 94 - 99
  • [25] Fitting genetic models using Markov chain Monte Carlo algorithms with BUGS
    van den Berg, Stephanie M.
    Beem, Leo
    Boomsma, Dorret I.
    TWIN RESEARCH AND HUMAN GENETICS, 2006, 9 (03) : 334 - 342
  • [26] Markov Chain Algorithms: A Template for Building Future Robust Low Power Systems
    Deka, Biplab
    Birklykke, Alex A.
    Duwe, Henry
    Mansinghka, Vikash K.
    Kumar, Rakesh
    2013 ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, 2013, : 118 - 125
  • [27] Markov Chain Analysis for Failure Prediction of Power Converters
    Giuntini, Lorenzo
    Brioschi, Massimiliano
    2015 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL TECHNOLOGY (ICIT), 2015, : 1336 - 1341
  • [28] PROBABILISTIC CELLULAR AUTOMATA WITH GENERAL ALPHABETS POSSESSING A MARKOV CHAIN AS AN INVARIANT DISTRIBUTION
    Casse, Jerome
    ADVANCES IN APPLIED PROBABILITY, 2016, 48 (02) : 369 - 391
  • [29] Markov chain Monte Carlo algorithms for the Bayesian analysis of phylogenetic trees
    Larget, B
    Simon, DL
    MOLECULAR BIOLOGY AND EVOLUTION, 1999, 16 (06) : 750 - 759
  • [30] Accelerated Genetic Algorithms with Markov Chains
    Wang, Guan
    Chen, Chen
    Szeto, K. Y.
    NICSO 2010: NATURE INSPIRED COOPERATIVE STRATEGIES FOR OPTIMIZATION, 2010, 284 : 245 - 254