메뉴 건너뛰기




Volumn 1, Issue 3, 2011, Pages 111-128

An introduction and survey of estimation of distribution algorithms

Author keywords

Decomposable problems; Estimation of distribution algorithms; Evolutionary computation; Model building; Probabilistic models; Stochastic optimization

Indexed keywords

DECOMPOSABLE PROBLEMS; ESTIMATION OF DISTRIBUTION ALGORITHMS; EVOLUTIONARY COMPUTATIONS; PROBABILISTIC MODELS; STOCHASTIC OPTIMIZATIONS;

EID: 80053974840     PISSN: 22106502     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.swevo.2011.08.003     Document Type: Article
Times cited : (420)

References (164)
  • 1
    • 0003984832 scopus 로고
    • Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning
    • Carnegie Mellon University, Pittsburgh, PA
    • S. Baluja, Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning, Tech. Rep. No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, PA, 1994.
    • (1994) Tech. Rep. No. CMU-CS-94-163
    • Baluja, S.1
  • 2
    • 84958959530 scopus 로고    scopus 로고
    • From Recombination of Genes to the Estimation of Distributions: I. Binary Parameters
    • Parallel Problem Solving from Nature - PPSN IV
    • H. Mhlenbein, and G. Paaß From recombination of genes to the estimation of distributions I. Binary parameters Parallel Problem Solving from Nature 1996 178 187 (Pubitemid 126128306)
    • (1996) Lecture Notes in Computer Science , Issue.1141 , pp. 178-187
    • Muehlenbein, H.1    Paass, G.2
  • 4
    • 0036180213 scopus 로고    scopus 로고
    • A survey of optimization by building and using probabilistic models
    • DOI 10.1023/A:1013500812258
    • M. Pelikan, D.E. Goldberg, and F. Lobo A survey of optimization by building and using probabilistic models Computational Optimization and Applications 21 2002 5 20 (Pubitemid 34172679)
    • (2002) Computational Optimization and Applications , vol.21 , Issue.1 , pp. 5-20
    • Pelikan, M.1    Goldberg, D.E.2    Lobo, F.G.3
  • 5
    • 34147103523 scopus 로고    scopus 로고
    • Searching for ground states of Ising spin glasses with hierarchical BOA and cluster exact approximation
    • M. Pelikan, K. Sastry, E. Cant-Paz, Springer
    • M. Pelikan, and A.K. Hartmann Searching for ground states of Ising spin glasses with hierarchical BOA and cluster exact approximation M. Pelikan, K. Sastry, E. Cant-Paz, Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications 2006 Springer 333 349
    • (2006) Scalable Optimization Via Probabilistic Modeling: From Algorithms to Applications , pp. 333-349
    • Pelikan, M.1    Hartmann, A.K.2
  • 7
    • 79952195180 scopus 로고    scopus 로고
    • Comparative analysis of multiobjective evolutionary algorithms for random and correlated instances of multiobjective d-dimensional knapsack problems
    • R. Shah, and P. Reed Comparative analysis of multiobjective evolutionary algorithms for random and correlated instances of multiobjective d-dimensional knapsack problems European Journal of Operational Research 211 3 2011 466 479
    • (2011) European Journal of Operational Research , vol.211 , Issue.3 , pp. 466-479
    • Shah, R.1    Reed, P.2
  • 11
    • 8444244894 scopus 로고    scopus 로고
    • Unsupervised learning of Bayesian networks via estimation of distribution algorithms: An application to gene expression data clustering
    • J. Pea, J. Lozano, and P. Larraaga Unsupervised learning of Bayesian networks via estimation of distribution algorithms: an application to gene expression data clustering International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 12 2004 63 82
    • (2004) International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems , vol.12 , pp. 63-82
    • Pea, J.1    Lozano, J.2    Larraaga, P.3
  • 14
    • 34548098140 scopus 로고    scopus 로고
    • ECGA vs. BOA in discovering stock market trading experts
    • DOI 10.1145/1276958.1277071, Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference
    • P. Lipinski, ECGA vs. BOA in discovering stock market trading experts, in: Genetic and Evolutionary Computation Conference, GECCO-2007, 2007, pp. 531538. (Pubitemid 47291575)
    • (2007) Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference , pp. 531-538
    • Lipinski, P.1
  • 15
    • 33750272949 scopus 로고    scopus 로고
    • Optimising cancer chemotherapy using an estimation of distribution algorithm and genetic algorithms
    • GECCO 2006 - Genetic and Evolutionary Computation Conference
    • A. Petrovski, S. Shakya, J. Mccall, Optimising cancer chemotherapy using an estimation of distribution algorithm and genetic algorithms, in: Genetic and Evolutionary Computation Conference, GECCO-2006, 2006, pp. 413418. (Pubitemid 44611351)
    • (2006) GECCO 2006 - Genetic and Evolutionary Computation Conference , vol.1 , pp. 413-418
    • Petrovski, A.1    Shakya, S.2    McCall, J.3
  • 16
    • 41749088671 scopus 로고    scopus 로고
    • A new epsilon-dominance hierarchical Bayesian optimization algorithm for large multi-objective monitoring network design problems
    • J.B. Kollat, P.M. Reed, and J.R. Kasprzyk A new epsilon-dominance hierarchical Bayesian optimization algorithm for large multi-objective monitoring network design problems Advances in Water Resources 31 2008 828 845
    • (2008) Advances in Water Resources , vol.31 , pp. 828-845
    • Kollat, J.B.1    Reed, P.M.2    Kasprzyk, J.R.3
  • 21
    • 0041822908 scopus 로고
    • Analyzing deception in trap functions
    • University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL
    • K. Deb, D.E. Goldberg, Analyzing deception in trap functions, IlliGAL, Report No. 91009, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 1991.
    • (1991) IlliGAL, Report No. 91009
    • Deb, K.1    Goldberg, D.E.2
  • 23
    • 0003738581 scopus 로고    scopus 로고
    • Linkage learning via probabilistic modeling in the ECGA
    • University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL
    • G. Harik, Linkage learning via probabilistic modeling in the ECGA, IlliGAL Report No. 99010, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 1999.
    • (1999) IlliGAL Report No. 99010
    • Harik, G.1
  • 24
    • 0033258156 scopus 로고    scopus 로고
    • FDAa scalable evolutionary algorithm for the optimization of additively decomposed functions
    • H. Mhlenbein, and T. Mahnig FDAa scalable evolutionary algorithm for the optimization of additively decomposed functions Evolutionary Computation 7 1999 353 376
    • (1999) Evolutionary Computation , vol.7 , pp. 353-376
    • Mhlenbein, H.1    Mahnig, T.2
  • 25
    • 84958959530 scopus 로고    scopus 로고
    • From Recombination of Genes to the Estimation of Distributions: I. Binary Parameters
    • Parallel Problem Solving from Nature - PPSN IV
    • H. Mhlenbein, and G. Paaß From recombination of genes to the estimation of distributions I. Binary parameters A. Eiben, T. Bck, M. Shoenauer, H. Schwefel, Parallel Problem Solving from Nature 1996 Springer Verlag Berlin 178 187 (Pubitemid 126128306)
    • (1996) Lecture Notes in Computer Science , Issue.1141 , pp. 178-187
    • Muehlenbein, H.1    Paass, G.2
  • 26
    • 0342461848 scopus 로고    scopus 로고
    • The compact genetic algorithm
    • University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL
    • G.R. Harik, F.G. Lobo, D.E. Goldberg, The compact genetic algorithm, IlliGAL Report No. 97006, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 1997.
    • (1997) IlliGAL Report No. 97006
    • Harik, G.R.1    Lobo, F.G.2    Goldberg, D.E.3
  • 27
    • 34548087908 scopus 로고    scopus 로고
    • Towards billion-bit optimization via a parallel estimation of distribution algorithm
    • DOI 10.1145/1276958.1277077, Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference
    • K. Sastry, D.E. Goldberg, X. Llor, Towards billion bit optimization via parallel estimation of distribution algorithm, in: Genetic and Evolutionary Computation Conference, GECCO-2007, 2007, pp. 577584. (Pubitemid 47291581)
    • (2007) Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference , pp. 577-584
    • Sastry, K.1    Goldberg, D.E.2    Llora, X.3
  • 29
    • 0001955592 scopus 로고    scopus 로고
    • Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space
    • S. Baluja, S. Davies, Using optimal dependency-trees for combinatorial optimization: learning the structure of the search space, in: Proceedings of the International Conference on Machine Learning, 1997, pp. 3038.
    • (1997) Proceedings of the International Conference on Machine Learning , pp. 30-38
    • Baluja, S.1    Davies, S.2
  • 30
    • 84933530882 scopus 로고
    • Approximating discrete probability distributions with dependence trees
    • C. Chow, and C. Liu Approximating discrete probability distributions with dependence trees IEEE Transactions on Information Theory 14 1968 462 467
    • (1968) IEEE Transactions on Information Theory , vol.14 , pp. 462-467
    • Chow, C.1    Liu, C.2
  • 35
    • 0034276591 scopus 로고    scopus 로고
    • Linkage problem, distribution estimation, and Bayesian networks
    • Also IlliGAL Report No. 98013
    • M. Pelikan, D.E. Goldberg, and E. Cant-Paz Linkage problem, distribution estimation, and Bayesian networks Evolutionary Computation 8 2000 311 341 Also IlliGAL Report No. 98013
    • (2000) Evolutionary Computation , vol.8 , pp. 311-341
    • Pelikan, M.1    Goldberg, D.E.2    Cant-Paz, E.3
  • 36
    • 34249761849 scopus 로고
    • Learning Bayesian networks: The combination of knowledge and statistical data
    • 10.1007/BF00994016
    • D. Heckerman, D. Geiger, and D.M. Chickering Learning Bayesian networks: the combination of knowledge and statistical data Machine Learning 20 1995 197 243 10.1007/BF00994016
    • (1995) Machine Learning , vol.20 , pp. 197-243
    • Heckerman, D.1    Geiger, D.2    Chickering, D.M.3
  • 37
    • 0003846045 scopus 로고
    • Learning Bayesian networks: The combination of knowledge and statistical data
    • Microsoft Research, Redmond, WA
    • D. Heckerman, D. Geiger, D.M. Chickering, Learning Bayesian networks: the combination of knowledge and statistical data, Technical Report MSR-TR-94-09, Microsoft Research, Redmond, WA, 1994.
    • (1994) Technical Report MSR-TR-94-09
    • Heckerman, D.1    Geiger, D.2    Chickering, D.M.3
  • 38
    • 85012775611 scopus 로고
    • Propagating uncertainty in Bayesian networks by probabilistic logic sampling
    • J.F. Lemmer, L.N. Kanal, Elsevier Amsterdam, London, New York
    • M. Henrion Propagating uncertainty in Bayesian networks by probabilistic logic sampling J.F. Lemmer, L.N. Kanal, Uncertainty in Artificial Intelligence 1988 Elsevier Amsterdam, London, New York 149 163
    • (1988) Uncertainty in Artificial Intelligence , pp. 149-163
    • Henrion, M.1
  • 39
    • 0002307386 scopus 로고    scopus 로고
    • Global optimization using Bayesian networks
    • A. Ochoa, M.R. Soto, R. Santana, CIMAF-99 Editorial Academia Havana, Cuba
    • R. Etxeberria, and P. Larraaga Global optimization using Bayesian networks A. Ochoa, M.R. Soto, R. Santana, Proceedings of the Second Symposium on Artificial Intelligence CIMAF-99 1999 Editorial Academia Havana, Cuba 151 173
    • (1999) Proceedings of the Second Symposium on Artificial Intelligence , pp. 151-173
    • Etxeberria, R.1    Larraaga, P.2
  • 40
    • 0000120766 scopus 로고
    • Estimating the dimension of a model
    • G. Schwarz Estimating the dimension of a model The Annals of Statistics 6 1978 461 464
    • (1978) The Annals of Statistics , vol.6 , pp. 461-464
    • Schwarz, G.1
  • 43
    • 0011843617 scopus 로고    scopus 로고
    • A Bayesian approach to learning Bayesian networks with local structure
    • Microsoft Research, Redmond, WA
    • D.M. Chickering, D. Heckerman, C. Meek, A Bayesian approach to learning Bayesian networks with local structure, Technical Report MSR-TR-97-07, Microsoft Research, Redmond, WA, 1997.
    • (1997) Technical Report MSR-TR-97-07
    • Chickering, D.M.1    Heckerman, D.2    Meek, C.3
  • 44
    • 0000220520 scopus 로고    scopus 로고
    • Learning Bayesian networks with local structure
    • M.I. Jordan, MIT Press
    • N. Friedman, and M. Goldszmidt Learning Bayesian networks with local structure M.I. Jordan, Graphical Models 1999 MIT Press 421 459
    • (1999) Graphical Models , pp. 421-459
    • Friedman, N.1    Goldszmidt, M.2
  • 49
    • 78649779395 scopus 로고    scopus 로고
    • Learning factorizations in estimation of distribution algorithms using affinity propagation
    • R. Santana, P. Larraaga, and J.A. Lozano Learning factorizations in estimation of distribution algorithms using affinity propagation Evolutionary Computation 18 2010 515 546
    • (2010) Evolutionary Computation , vol.18 , pp. 515-546
    • Santana, R.1    Larraaga, P.2    Lozano, J.A.3
  • 50
    • 0002384937 scopus 로고
    • Assignment problems and the location of economic activities
    • T.C. Koopmans, and M.J. Beckmann Assignment problems and the location of economic activities Econometrica 25 1957 53 76
    • (1957) Econometrica , vol.25 , pp. 53-76
    • Koopmans, T.C.1    Beckmann, M.J.2
  • 51
    • 0001096735 scopus 로고
    • Genetic algorithms and random keys for sequencing and optimization
    • J.C. Bean Genetic algorithms and random keys for sequencing and optimization ORSA Journal on Computing 6 1994 154 160
    • (1994) ORSA Journal on Computing , vol.6 , pp. 154-160
    • Bean, J.C.1
  • 54
    • 80053968891 scopus 로고    scopus 로고
    • Inexact graph matching using learning and simulation of Bayesian networks. An empirical comparison between different approaches with synthetic data
    • Berlin
    • E. Bengoetxea, P. Larraaga, I. Bloch, A. Perchant, C. Boeres, Inexact graph matching using learning and simulation of Bayesian networks. An empirical comparison between different approaches with synthetic data, in: Proceedings of CaNew Workshop, ECAI 2000 Conference, Berlin.
    • Proceedings of CaNew Workshop, ECAI 2000 Conference
    • Bengoetxea, E.1    Larraaga, P.2    Bloch, I.3    Perchant, A.4    Boeres, C.5
  • 57
    • 84944321757 scopus 로고    scopus 로고
    • Probabilistic model-building genetic algorithms in permutation representation domain using edge histogram
    • PPSN VII Springer-Velag
    • S. Tsutsui Probabilistic model-building genetic algorithms in permutation representation domain using edge histogram Proc. of the 7th Int. Conf. on Parallel Problem Solving from Nature PPSN VII 2002 Springer-Velag 224 233
    • (2002) Proc. of the 7th Int. Conf. on Parallel Problem Solving from Nature , pp. 224-233
    • Tsutsui, S.1
  • 58
    • 80051840000 scopus 로고    scopus 로고
    • Node histogram vs. edge fistogram: A comparison of PMBGAs in permutation domains
    • Missouri Estimation of Distribution Algorithms Laboratory, University of MissourSt. Louis, St. Louis, MO
    • S. Tsutsui, M. Pelikan, D.E. Goldberg, Node histogram vs. edge fistogram: a comparison of PMBGAs in permutation domains, MEDAL Report No. 2006009, Missouri Estimation of Distribution Algorithms Laboratory, University of MissourSt. Louis, St. Louis, MO, 2006.
    • (2006) MEDAL Report No. 2006009
    • Tsutsui, S.1    Pelikan, M.2    Goldberg, D.E.3
  • 60
    • 0141844529 scopus 로고    scopus 로고
    • Getting the best of both worlds: Discrete and continuous genetic and evolutionary algorithms in concert
    • Evolutionary Computation
    • M. Pelikan, D.E. Goldberg, and S. Tsutsui Getting the best of both worlds: discrete and continuous genetic and evolutionary algorithms in concert Information Sciences 156 2003 147 171 Evolutionary Computation
    • (2003) Information Sciences , vol.156 , pp. 147-171
    • Pelikan, M.1    Goldberg, D.E.2    Tsutsui, S.3
  • 61
    • 33750231326 scopus 로고    scopus 로고
    • Adaptive discretization for probabilistic model building genetic algorithms
    • GECCO 2006 - Genetic and Evolutionary Computation Conference
    • C. Chen, W. Liu, and Y. Chen Adaptive discretization for probabilistic model building genetic algorithms Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation GECCO'06 2006 ACM New York, NY, USA 1103 1110 (Pubitemid 44611440)
    • (2006) GECCO 2006 - Genetic and Evolutionary Computation Conference , vol.2 , pp. 1103-1110
    • Chen, C.-H.1    Liu, W.-N.2    Chen, Y.-P.3
  • 63
    • 77952912846 scopus 로고    scopus 로고
    • Enabling the extended compact genetic algorithm for real-parameter optimization by using adaptive discretization
    • Y. Chen, and C. Chen Enabling the extended compact genetic algorithm for real-parameter optimization by using adaptive discretization Evolutionary Computation 18 2010 199 228
    • (2010) Evolutionary Computation , vol.18 , pp. 199-228
    • Chen, Y.1    Chen, C.2
  • 64
    • 33845276056 scopus 로고    scopus 로고
    • Stochastic hill climbing with learning by vectors of normal distributions
    • Nagoya, Japan
    • S. Rudlof, M. Köppen, Stochastic hill climbing with learning by vectors of normal distributions, in: First on-line Workshop on Soft Computing, Nagoya, Japan, pp. 6070.
    • First On-line Workshop on Soft Computing , pp. 60-70
    • S. Rudlof1
  • 65
    • 84878615636 scopus 로고    scopus 로고
    • Extending Population-Based Incremental Learning to Continuous Search Spaces
    • Parallel Problems Solving from Nature - PPSN V
    • M. Sebag, and A. Ducoulombier Extending population-based incremental learning to continuous search spaces Parallel Problem Solving from Nature 1998 Springer Verlag Berlin, Heidelberg 418 427 (Pubitemid 128145972)
    • (1998) Lecture Notes in Computer Science , Issue.1498 , pp. 418-427
    • Sebag, M.1    Ducoulombier, A.2
  • 73
    • 0000120766 scopus 로고
    • Estimating the dimension of a model
    • G. Schwarz Estimating the dimension of a model Annals of Statistics 6 1978 461 464
    • (1978) Annals of Statistics , vol.6 , pp. 461-464
    • Schwarz, G.1
  • 76
    • 0004156740 scopus 로고    scopus 로고
    • Springer-Verlag New York, Inc. Secaucus, NJ, USA
    • R.B. Nelsen An Introduction to Copulas 1998 Springer-Verlag New York, Inc. Secaucus, NJ, USA
    • (1998) An Introduction to Copulas
    • Nelsen, R.B.1
  • 81
    • 84947902577 scopus 로고    scopus 로고
    • Probabilistic Incremental Program Evolution: Stochastic Search Through Program Space
    • Machine Learning: ECML-97
    • R.P. Salustowicz, J. Schmidhuber, Probabilistic incremental program evolution: stochastic search through program space, in: Proceedings of the European Conference of Machine Learning, ECML-97, vol. 1224, 1997, pp. 213220. (Pubitemid 127061929)
    • (1997) Lecture Notes in Computer Science , Issue.1224 , pp. 213-220
    • Salustowicz, R.1    Schmidhuber, J.2
  • 82
    • 32444437721 scopus 로고    scopus 로고
    • On extended compact genetic algorithm
    • University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL
    • K. Sastry, D.E. Goldberg, On extended compact genetic algorithm, IlliGAL Report No. 2000026, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 2000.
    • (2000) IlliGAL Report No. 2000026
    • Sastry, K.1    Goldberg, D.E.2
  • 83
    • 70449395337 scopus 로고    scopus 로고
    • Doctor of Science, Washington University, St. Louis, USA
    • M. Looks, Competent program evolution, Doctor of Science, Washington University, St. Louis, USA, 2006.
    • (2006) Competent Program Evolution
    • Looks, M.1
  • 84
    • 80053946358 scopus 로고    scopus 로고
    • Avoiding the bloat with stochastic grammar-based genetic programming
    • A. Ratle, M. Sebag, Avoiding the bloat with stochastic grammar-based genetic programming, 2006, CoRR.
    • (2006) CoRR
    • Ratle, A.1    Sebag, M.2
  • 85
    • 84901389359 scopus 로고    scopus 로고
    • Program evolution with explicit learning: A new framework for program automatic synthesis
    • IEEE Press
    • Y. Shan, R.I. Mckay, H.A. Abbass, and D. Essam Program evolution with explicit learning: a new framework for program automatic synthesis University College, University of New South 2003 IEEE Press 1639 1646
    • (2003) University College, University of New South , pp. 1639-1646
    • Shan, Y.1    McKay, R.I.2    Abbass, H.A.3    Essam, D.4
  • 87
    • 0000107517 scopus 로고
    • An information measure for classification
    • C.S. Wallace, and D.M. Boulton An information measure for classification Computer Journal 11 1968 185 194
    • (1968) Computer Journal , vol.11 , pp. 185-194
    • Wallace, C.S.1    Boulton, D.M.2
  • 91
    • 0036715683 scopus 로고    scopus 로고
    • Combining convergence and diversity in evolutionary multi-objective optimization
    • M. Laumanns, L. Thiele, K. Deb, and E. Zitzler Combining convergence and diversity in evolutionary multi-objective optimization Evolutionary Computation 10 2002 263 282
    • (2002) Evolutionary Computation , vol.10 , pp. 263-282
    • Laumanns, M.1    Thiele, L.2    Deb, K.3    Zitzler, E.4
  • 92
    • 2942547409 scopus 로고    scopus 로고
    • SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization
    • K. Giannakoglou, et al. (Eds.) International Center for Numerical Methods in Engineering, CIMNE
    • E. Zitzler, M. Laumanns, L. Thiele, SPEA2: improving the strength Pareto evolutionary algorithm for multiobjective optimization, in: K. Giannakoglou, et al. (Eds.), Evolutionary Methods for Design, Optimisation and Control with Application to Industrial Problems, EUROGEN 2001, International Center for Numerical Methods in Engineering, CIMNE, 2002, pp. 95100.
    • (2002) Evolutionary Methods for Design, Optimisation and Control with Application to Industrial Problems, EUROGEN 2001 , pp. 95-100
    • Zitzler, E.1    Laumanns, M.2    Thiele, L.3
  • 93
    • 33845276962 scopus 로고    scopus 로고
    • Multi-objective optimization with the naive MIDEA
    • DOI 10.1007/11007937-6, Towards a New Evolutionary Computation: Advances in the Estimation of Distribution Algorithms
    • P. Bosman, and D. Thierens Multi-objective optimization with the naive MIDEA J. Lozano, P. Larraaga, I. Inza, E. Bengoetxea, Towards a New Evolutionary Computation Studies in Fuzziness and Soft Computing vol. 192 2006 Springer Berlin, Heidelberg 123 157 (Pubitemid 44856939)
    • (2006) Studies in Fuzziness and Soft Computing , vol.192 , pp. 123-157
    • Bosman, P.A.N.1    Thierens, D.2
  • 95
    • 33845301808 scopus 로고    scopus 로고
    • Multi-objective Bayesian optimization algorithm
    • University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL
    • N. Khan, D.E. Goldberg, M. Pelikan, Multi-objective Bayesian optimization algorithm, IlliGAL Report No. 2002009, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 2002.
    • (2002) IlliGAL Report No. 2002009
    • Khan, N.1    Goldberg, D.E.2    Pelikan, M.3
  • 96
    • 0036530772 scopus 로고    scopus 로고
    • A fast and elitist multiobjective genetic algorithm: NSGA-II
    • DOI 10.1109/4235.996017, PII S1089778X02041012
    • K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Transactions on Evolutionary Computation 6 2002 182 197 (Pubitemid 34555372)
    • (2002) IEEE Transactions on Evolutionary Computation , vol.6 , Issue.2 , pp. 182-197
    • Deb, K.1    Pratap, A.2    Agarwal, S.3    Meyarivan, T.4
  • 97
    • 32444433272 scopus 로고    scopus 로고
    • Multiobjective hBOA, clustering, and scalability
    • DOI 10.1145/1068009.1068122, GECCO 2005 - Genetic and Evolutionary Computation Conference
    • M. Pelikan, K. Sastry, and D.E. Goldberg Multiobjective hBOA, clustering, and scalability Proceedings of the 2005 Conference on Genetic and Evolutionary Computation GECCO'05 2005 ACM New York, NY, USA 663 670 (Pubitemid 43226358)
    • (2005) GECCO 2005 - Genetic and Evolutionary Computation Conference , pp. 663-670
    • Pelikan, M.1    Sastry, K.2    Goldberg, D.E.3
  • 99
    • 79952195180 scopus 로고    scopus 로고
    • Comparative analysis of multiobjective evolutionary algorithms for random and correlated instances of multiobjective d-dimensional knapsack problems
    • R. Shah, and P. Reed Comparative analysis of multiobjective evolutionary algorithms for random and correlated instances of multiobjective d-dimensional knapsack problems European Journal of Operational Research 211 2011 466 479
    • (2011) European Journal of Operational Research , vol.211 , pp. 466-479
    • Shah, R.1    Reed, P.2
  • 100
    • 24344466415 scopus 로고    scopus 로고
    • The value of online adaptive search: A performance comparison of NSGAII, ε-NSGAII and εMOEA
    • Evolutionary Multi-Criterion Optimization - Third International Conference, EMO 2005
    • J.B. Kollat, and P.M. Reed The value of online adaptive search: a performance comparison of NSGA-II, -NSGAII, and -MOEA The Third International Conference on Evolutionary Multi-Criterion Optimization EMO 2005 Lecture Notes in Computer Science 2005 Springer-Verlag Guanajuato, Mexico 386 398 (Pubitemid 41251778)
    • (2005) Lecture Notes in Computer Science , vol.3410 , pp. 386-398
    • Kollat, J.B.1    Reed, P.M.2
  • 101
    • 0002472452 scopus 로고
    • Genetic algorithms and the optimal allocation of trials
    • J. Holland Genetic algorithms and the optimal allocation of trials SIAM Journal of Computing 2 1973 88 105
    • (1973) SIAM Journal of Computing , vol.2 , pp. 88-105
    • Holland, J.1
  • 105
    • 0031139210 scopus 로고    scopus 로고
    • Optimization of computer simulation models with rare events
    • R.Y. Rubinstein Optimization of computer simulation models with rare events European Journal of Operational Research 99 1996 89 112
    • (1996) European Journal of Operational Research , vol.99 , pp. 89-112
    • Rubinstein, R.Y.1
  • 106
    • 17644405107 scopus 로고    scopus 로고
    • An evolutionary algorithm with guided mutation for the maximum clique problem
    • DOI 10.1109/TEVC.2004.840835
    • Q. Zhang, J. Sun, and E. Tsang Evolutionary algorithm with the guided mutation for the maximum clique problem IEEE Transactions on Evolutionary Computation 9 2005 192 200 (Pubitemid 40564736)
    • (2005) IEEE Transactions on Evolutionary Computation , vol.9 , Issue.2 , pp. 192-200
    • Zhang, Q.1    Sun, J.2    Tsang, E.3
  • 107
    • 40249102027 scopus 로고    scopus 로고
    • RM-MEDA: A regularity model-based multiobjective estimation of distribution algorithm
    • DOI 10.1109/TEVC.2007.894202
    • Q. Zhang, A. Zhou, and Y. Jin RM-MEDA: a regularity model-based multiobjective estimation of distribution algorithm IEEE Transactions on Evolutionary Computation 12 2008 41 63 (Pubitemid 351330331)
    • (2008) IEEE Transactions on Evolutionary Computation , vol.12 , Issue.1 , pp. 41-63
    • Zhang, Q.1    Zhou, A.2    Jin, Y.3
  • 108
    • 45949089372 scopus 로고    scopus 로고
    • Adaptive estimation of distribution algorithms
    • C. Cotta, M. Sevaux, K. Srensen, Studies in Computational Intelligence Springer Berlin, Heidelberg
    • R. Santana, P. Larraaga, and J. Lozano Adaptive estimation of distribution algorithms C. Cotta, M. Sevaux, K. Srensen, Adaptive and Multilevel Metaheuristics Studies in Computational Intelligence vol. 136 2008 Springer Berlin, Heidelberg 177 197
    • (2008) Adaptive and Multilevel Metaheuristics , vol.136 , pp. 177-197
    • Santana, R.1    Larraaga, P.2    Lozano, J.3
  • 112
    • 34548089107 scopus 로고    scopus 로고
    • Incorporating a priori knowledge in probabilistic-model based optimization
    • M. Pelikan, K. Sastry, E. Cant-Paz, Springer
    • S. Baluja Incorporating a priori knowledge in probabilistic-model based optimization M. Pelikan, K. Sastry, E. Cant-Paz, Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications 2006 Springer 205 219
    • (2006) Scalable Optimization Via Probabilistic Modeling: From Algorithms to Applications , pp. 205-219
    • Baluja, S.1
  • 113
    • 80053996302 scopus 로고    scopus 로고
    • A problem-knowledge based evolutionary algorithm KBOA for hypergraph partitioning
    • J. Schwarz, J. Ocenasek, A problem-knowledge based evolutionary algorithm KBOA for hypergraph partitioning, Personal Communication, 2000.
    • (2000) Personal Communication
    • Schwarz, J.1    Ocenasek, J.2
  • 115
    • 10444289823 scopus 로고    scopus 로고
    • Efficient linkage discovery by limited probing
    • DOI 10.1162/1063656043138914
    • R.B. Heckendorn, and A.H. Wright Efficient linkage discovery by limited probing Evolution Computing 12 2004 517 545 (Pubitemid 39634698)
    • (2004) Evolutionary Computation , vol.12 , Issue.4 , pp. 517-545
    • Heckendorn, R.B.1    Wright, A.H.2
  • 116
    • 0033257616 scopus 로고    scopus 로고
    • Linkage identification by non-monotonicity detection for overlapping functions
    • M. Munetomo, and D.E. Goldberg Linkage identification by non-monotonicity detection for overlapping functions Evolutionary Computation 7 1999 377 398
    • (1999) Evolutionary Computation , vol.7 , pp. 377-398
    • Munetomo, M.1    Goldberg, D.E.2
  • 119
    • 7744230526 scopus 로고    scopus 로고
    • Ph.D. Thesis, Faculty of Information Technology, Brno University of Technology, Brno
    • J. Ocenasek, Parallel estimation of distribution algorithms, Ph.D. Thesis, Faculty of Information Technology, Brno University of Technology, Brno, 2002.
    • (2002) Parallel Estimation of Distribution Algorithms
    • Ocenasek, J.1
  • 121
    • 24144484772 scopus 로고    scopus 로고
    • Parallel implementation of EDAs based on probabilistic graphical models
    • DOI 10.1109/TEVC.2005.850299
    • A. Mendiburu, J. Lozano, and J. Miguel-Alonso Parallel implementation of EDAs based on probabilistic graphical models IEEE Transactions on Evolutionary Computation 9 2005 406 423 (Pubitemid 41226914)
    • (2005) IEEE Transactions on Evolutionary Computation , vol.9 , Issue.4 , pp. 406-423
    • Mendiburu, A.1    Lozano, J.A.2    Miguel-Alonso, J.3
  • 126
    • 4344572502 scopus 로고    scopus 로고
    • Master's Thesis, University of Illinois at Urbana-Champaign, Department of General Engineering, Urbana, IL
    • K. Sastry, Evaluation-relaxation schemes for genetic and evolutionary algorithms, Master's Thesis, University of Illinois at Urbana-Champaign, Department of General Engineering, Urbana, IL, 2001.
    • (2001) Evaluation-relaxation Schemes for Genetic and Evolutionary Algorithms
    • Sastry, K.1
  • 127
    • 25144476767 scopus 로고    scopus 로고
    • Master's Thesis, University of Illinois at Urbana-Champaign, Department of General Engineering, Urbana, IL
    • L.A. Albert, Efficient genetic algorithms using discretization scheduling, Master's Thesis, University of Illinois at Urbana-Champaign, Department of General Engineering, Urbana, IL, 2001.
    • (2001) Efficient Genetic Algorithms Using Discretization Scheduling
    • Albert, L.A.1
  • 128
    • 4344617090 scopus 로고    scopus 로고
    • Don't evaluate, inherit
    • L. Spector, E.D. Goodman, A. Wu, W.B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M.H. Garzon, E. Burke, GECCO-2001 Morgan Kaufmann San Francisco, CA
    • K. Sastry, D.E. Goldberg, and M. Pelikan Don't evaluate, inherit L. Spector, E.D. Goodman, A. Wu, W.B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M.H. Garzon, E. Burke, Genetic and Evolutionary Computation Conference GECCO-2001 2001 Morgan Kaufmann San Francisco, CA 551 558
    • (2001) Genetic and Evolutionary Computation Conference , pp. 551-558
    • Sastry, K.1    Goldberg, D.E.2    Pelikan, M.3
  • 130
    • 0041513687 scopus 로고    scopus 로고
    • Cluster-exact approximation of spin glass ground states
    • A.K. Hartmann Cluster-exact approximation of spin glass ground states Physica A 224 1996 480
    • (1996) Physica A , vol.224 , pp. 480
    • Hartmann, A.K.1
  • 133
    • 33846074445 scopus 로고    scopus 로고
    • The effectiveness of mutation operation in the case of Estimation of Distribution Algorithms
    • DOI 10.1016/j.biosystems.2006.09.019, PII S0303264706001717, Papers presented at the Sixth International Workshop on Information Processing in Cells and Tissues, York, UK, 2005 IPCAT 2005
    • H. Handa The effectiveness of mutation operation in the case of estimation of distribution algorithms BioSystems 87 2007 243 251 Papers Presented at the Sixth International Workshop on Information Processing in Cells and Tissues, York, UK, 2005IPCAT 2005, Information Processing in Cells and Tissues (Pubitemid 46073376)
    • (2007) BioSystems , vol.87 , Issue.2-3 , pp. 243-251
    • Handa, H.1
  • 136
    • 70350510104 scopus 로고    scopus 로고
    • Loopy substructural local search for the Bayesian optimization algorithm
    • T. Sttzle, M. Birattari, H.H. Hoos, Lecture Notes in Computer Science Springer
    • C.F. Lima, M. Pelikan, F.G. Lobo, and D.E. Goldberg Loopy substructural local search for the Bayesian optimization algorithm T. Sttzle, M. Birattari, H.H. Hoos, SLS Lecture Notes in Computer Science vol. 5752 2009 Springer 61 75
    • (2009) SLS , vol.5752 , pp. 61-75
    • Lima, C.F.1    Pelikan, M.2    Lobo, F.G.3    Goldberg, D.E.4
  • 141
    • 34548069626 scopus 로고    scopus 로고
    • Optimization by max-propagation using Kikuchi approximations
    • Department of Computer Science and Artificial Intelligence, University of the Basque Country, Urbana, IL
    • R. Höns, R. Santana, P. Larraaga, J.A. Lozano, Optimization by max-propagation using Kikuchi approximations, Tech. Rep. EHUKAT-IK-2-07, Department of Computer Science and Artificial Intelligence, University of the Basque Country, Urbana, IL, 2007.
    • (2007) Tech. Rep. EHUKAT-IK-2-07
    • R. Höns1
  • 142
    • 0005388921 scopus 로고    scopus 로고
    • Using time efficiently: Genetic-evolutionary algorithms and the continuation problem
    • Also IlliGAL Report No. 99002
    • D.E. Goldberg, Using time efficiently: genetic-evolutionary algorithms and the continuation problem, in: Genetic and Evolutionary Computation Conference, GECCO-99, 1999, pp. 212219. Also IlliGAL Report No. 99002.
    • (1999) Genetic and Evolutionary Computation Conference, GECCO-99 , pp. 212-219
    • Goldberg, D.E.1
  • 143
  • 147
    • 0141470715 scopus 로고    scopus 로고
    • Efficient atomic cluster optimization using a hybrid extended compact genetic algorithm with seeded population
    • University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL
    • K. Sastry, Efficient atomic cluster optimization using a hybrid extended compact genetic algorithm with seeded population, IlliGAL Report No. 2001018, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 2001.
    • (2001) IlliGAL Report No. 2001018
    • Sastry, K.1
  • 149
    • 0036859017 scopus 로고    scopus 로고
    • Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning
    • DOI 10.1016/S0888-613X(02)00093-2, PII S0888613X02000932
    • H. Mhlenbein, and T. Mahnig Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning International Journal of Approximate Reasoning 31 2002 157 192 (Pubitemid 35411830)
    • (2002) International Journal of Approximate Reasoning , vol.31 , Issue.3 , pp. 157-192
    • Muhlenbein, H.1    Mahnig, Th.2
  • 151
  • 152
    • 1542273606 scopus 로고    scopus 로고
    • On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm
    • Q. Zhang On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm IEEE Transactions on Evolutionary Computation 8 2004 80 93
    • (2004) IEEE Transactions on Evolutionary Computation , vol.8 , pp. 80-93
    • Zhang, Q.1
  • 153
    • 0000510934 scopus 로고
    • Genetic algorithms, noise, and the sizing of populations
    • D.E. Goldberg, K. Deb, and J.H. Clark Genetic algorithms, noise, and the sizing of populations Complex Systems 6 1992 333 362
    • (1992) Complex Systems , vol.6 , pp. 333-362
    • Goldberg, D.E.1    Deb, K.2    Clark, J.H.3
  • 154
    • 0011842825 scopus 로고    scopus 로고
    • On the supply of building blocks
    • L. Spector, GECCO-2001 Morgan Kaufmann San Francisco, CA Also IlliGAL Report No. 2001015
    • D.E. Goldberg, K. Sastry, and T. Latoza On the supply of building blocks L. Spector, Genetic and Evolutionary Computation Conference GECCO-2001 2001 Morgan Kaufmann San Francisco, CA 336 342 Also IlliGAL Report No. 2001015
    • (2001) Genetic and Evolutionary Computation Conference , pp. 336-342
    • Goldberg, D.E.1    Sastry, K.2    Latoza, T.3
  • 155
    • 0036856568 scopus 로고    scopus 로고
    • Scalability of the Bayesian optimization algorithm
    • DOI 10.1016/S0888-613X(02)00095-6, PII S0888613X02000956
    • M. Pelikan, K. Sastry, and D.E. Goldberg Scalability of the Bayesian optimization algorithm International Journal of Approximate Reasoning 31 2002 221 258 (Pubitemid 35411832)
    • (2002) International Journal of Approximate Reasoning , vol.31 , Issue.3 , pp. 221-258
    • Pelikan, M.1    Sastry, K.2    Goldberg, D.E.3
  • 156
    • 34548104671 scopus 로고    scopus 로고
    • Population sizing for entropy-based model building in discrete estimation of distribution algorithms
    • DOI 10.1145/1276958.1277080, Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference
    • T.-L. Yu, K. Sastry, D.E. Goldberg, and M. Pelikan Population sizing for entropy-based model building in discrete estimation of distribution algorithms Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation GECCO'07 2007 ACM New York, NY, USA 601 608 (Pubitemid 47291584)
    • (2007) Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference , pp. 601-608
    • Yu, T.-L.1    Sastry, K.2    Goldberg, D.E.3    Pelikan, M.4
  • 157
    • 15544377453 scopus 로고    scopus 로고
    • Drift and scaling in estimation of distribution algorithms
    • DOI 10.1162/1063656053583414
    • J.L. Shapiro Drift and scaling in estimation of distribution algorithms Evolution Computing 13 2005 99 123 (Pubitemid 40402992)
    • (2005) Evolutionary Computation , vol.13 , Issue.1 , pp. 99-123
    • Shapiro, J.L.1
  • 159
    • 15544388102 scopus 로고    scopus 로고
    • Space complexity of estimation of distribution algorithms
    • DOI 10.1162/1063656053583423
    • Y. Gao, and J. Culberson Space complexity of estimation of distribution algorithms Evolutionary Computation 13 2005 125 143 (Pubitemid 40402993)
    • (2005) Evolutionary Computation , vol.13 , Issue.1 , pp. 125-143
    • Gao, Y.1    Culberson, J.2
  • 164
    • 77955909871 scopus 로고    scopus 로고
    • Spurious dependencies and EDA scalability
    • E. Radetic, M. Pelikan, Spurious dependencies and EDA scalability, in: GECCO, pp. 303310.
    • GECCO , pp. 303-310
    • Radetic, E.1    Pelikan, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.