Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning

International Journal of Approximate Reasoning

Volumn 31, Issue 3, 2002, Pages 157-192

  Muhlenbein H ^a   Mahnig, Th ^a  

^a FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

Author keywords

Adaptive annealing; Advanced mean field methods; Boltzmann distribution; Factorization of distributions; Genetic algorithms; Kullback Leibler divergence; Linkage equilibrium; Stochastic processes

Indexed keywords

GENETIC ALGORITHMS; GRAPH THEORY; OPTIMIZATION; PROBABILITY; RANDOM PROCESSES;

GRAPH BIPARTITIONING;

APPROXIMATION THEORY;

EID: 0036859017     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0888-613X(02)00093-2     Document Type: Article

References (34)

1. Bäck Th., Schwefel H.-P. An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation. 1:1993;1-24.
2. Cooper G.F., Herskovits E.A. A Bayesian method for the induction of probabilistic networks from data. Machine Learning. 9:1992;309-347.
3. Etxeberria R., Larrañaga P. Global optimization using Bayesian networks. Rodriguez A.A.O., Ortiz M.R.S., Hermida R.S. Proceedings of the Second Symposium on Artificial Intelligence Adaptive Systems. 1999;332-339 ICIMAF, La Habana, Cuba.
4. Fiduccia C.M., Mattheyses R.M. A linear-time heuristic for improving network partitions. Proceedings of the Nineteenth ACM/IEEE Design Automation Conference. 1982;175-181 IEEE Computer Society Press, Piscataway, NJ.
5. Geiringer H. On the probability theory of linkage in Mendelian heredity. Annals of Mathemathical Statistics. 15:1944;25-57.
6. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning. 1989;Addison-Wesley, Reading.
7. Goldberg D.E., Deb K. A comparative analysis of selection schemes used in genetic algorithms. Rawlins G. Foundations of Genetic Algorithms. 1991;69-93 Morgan Kaufmann, San Mateo.
8. Holland J.H. Adaptation in Natural and Artificial Systems. 1975/1992;University of Michigan Press, Ann Arbor.
9. Jordan M.I. Learning in Graphical Models. 1999;MIT Press, Cambrigde.
10. Jordan M.I., Ghahramani Z., Jaakkola T.S., Saul L.K. An introduction to variational methods for graphical models. Jordan M.I. Learning in Graphical Models. 1999;105-162 MIT Press, Cambridge.
11. Kernighan B.W., Lin S. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal. 2:1970;291-307.
12. Kim Y.-H., Moon B.-R. A hybrid genetic search for graph partitioning based on lock gain. Proceedings of the Genetic and Evolutionary Computation Conference GECCO-2000. 2000;167-174 Morgan Kaufmann, San Francisco.
13. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science. 220:1983;671-680.
14. Larrañaga P., Etxeberria R., Lozano J.A., Pen̈a J.M. Combinatorial optimization by learning and simulation of Bayesian networks. Boutilier C., Goldszmidt M. Proceedings of 16th Conference on Uncertainty in Artificial Intelligence. 2000;343-352 Morgan Kaufmann, Stanford.
15. Larrañaga R., Lozano J.A. Estimation of Distribution Algorithms: A New Tool for Evolutionary Optimization. 2001;Kluwer Academic Press, Boston.
16. Lauritzen St.L. Graphical Models. 1996;Clarendon Press, Oxford.
17. Mahnig Th., Mühlenbein H. A new adaptive Boltzmann selection schedule SDS. Proceedings of the 2001 Congress on Evolutionary Computation. 2001;183-190 IEEE Press.
18. Merz P., Freisleben B. Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning. Evolutionary Computation. 8(1):2000;61-91.
19. Mühlenbein H. The equation for response to selection and its use for prediction. Evolutionary Computation. 5(3):1998;303-346.
20. Mühlenbein H., Mahnig T. FDA - a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation. 7(4):1999;353-376.
21. Mühlenbein H., Mahnig Th. Evolutionary algorithms: From recombination to search distributions. Kallel L., Naudts B., Rogers A. Theoretical Aspects of Evolutionary Computing, Natural Computing. 2000;137-176 Springer Verlag, Berlin.
22. Mühlenbein H., Mahnig Th. Evolutionary computation and beyond. Uesaka Y., Kanerva P., Asoh H. Foundations of Real-World Intelligence. 2001;123-188 CSLI Publications, Stanford, California.
23. H. Mühlenbein, Th. Mahnig, Evolutionary computation and Wright's equation, Theoretical Computer Science 287 (1) 145-165.
24. Mühlenbein H., Mahnig Th., Rodriguez Ochoa A. Schemata, distributions and graphical models in evolutionary optimization. Journal of Heuristics. 5(2):1999;215-247.
25. Opper M., Saad D. Advanced Mean Field Methods. 2001;MIT Press, Cambridge.
26. Pearl J. Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference. 1988;Morgan Kaufmann, San Mateo.
27. Pelikan M., Goldberg D.E., Cantú-Paz E. BOA: The Bayesian optimization algorithm. Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99. 1999;525-532 Morgan Kaufmann, San Francisco.
28. Pelikan M., Goldberg D.E., Sastry K. Bayesian optimization algorithm, decision graphs, and Occam's razor. Spector L.et al. Proceedings of the Genetic and Evolutionary Computation Conference GECCO-2001. 2001;519-526 Morgan Kaufmann, San Francisco.
29. Peña J.M., Lozano J.A., Larrañaga P. Benefits of data clustering in multimodal function optimization via EDAs. Larrañaga P., Lozano J.A. Estimation of Distribution Algorithms: A New Tool for Evolutionary Optimization. 2001;99-124 Kluwer Academic Press, Boston.
30. Prügel-Bennet A., Shapiro J.L. An analysis of a genetic algorithm for simple random Ising systems. Physica D. 104:1997;75-114.
31. Schwarz G. Estimating the dimension of a model. Annals of Statistics. 6(2):1978;461-464.
32. van Kampen N.G. Stochastic Processes in Physics and Chemistry. 1992;Elsevier, Amsterdam.
33. von Laszewski G., Mühlenbein H. A parallel genetic algorithm for the graph partitioning problem. Maenner R., Schwefel H.-P. Parallel Problem Solving from Nature. Lecture Notes in Computer Science. vol. 496:1991;165-169 Springer-Verlag, Berlin.
34. von Neumann J. The general and logical theory of automata. The World of Mathematics. 1954;2070-2101 Simon and Schuster, New York.