The roles of local search, model building and optimal mixing in evolutionary algorithms from a BBO perspective

Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication

Volumn , Issue , 2011, Pages 663-670

  Bosman, Peter A N ^a   Thierens, Dirk ^b  

^a CWI   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

estimation of distribution algorithms; evolutionary algorithms; genetic algorithms; local search; mixing

Indexed keywords

ADDED VALUES; BLACK-BOX OPTIMIZATION; ESTIMATION OF DISTRIBUTION ALGORITHMS; LOCAL SEARCH; OPTIMAL MIXING; OPTIMIZATION PROBLEMS; PARTIAL EVALUATION; REAL-WORLD OPTIMIZATION; VARIATION OPERATOR;

MATHEMATICAL OPERATORS; MODEL BUILDINGS; OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

EID: 80051931144     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001858.2002065     Document Type: Conference Paper

References (21)

1. E. Aarts and J. K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons Inc., New York, New York, 1997.
2. K. Deb and D. E. Goldberg. Sufficient conditions for arbitrary binary functions. Annals of Mathematics and Artificial Intelligence, 10(4):385-408, 1994.
3. F. Glover and M. Laguna. Tabu Search. Kluwer, Norwell, Massachusetts, 1997.
4. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learing. Addison Wesley, Reading, Massachusetts, 1989.
5. G. R. Harik, F. G. Lobo, and K. Sastry. Linkage learning via probabilistic modeling in the extended compact genetic algorithm (ecga). In M. Pelikan et al., editors, Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, pages 39-61. Springer-Verlag, Berlin, 2006.
6. H.H. Hoos and T. Stützle. Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco, California, 2005.
7. A. Juels and M. Wattenberg. Stochastic hillclimbing as a baseline method for evaluating genetic algorithms. UC Berkeley technical report CSD-94-834, 1994.
8. C. F. Lima, M. Pelikan, F. G. Lobo, and D. E. Goldberg. Loopy substructural local search for the Bayesian optimization algorithm. In T. Stützle et al., editors, Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms - SLS-2009, pages 61-75, Berlin, 2009. Springer-Verlag.
9. C. F. Lima, M. Pelikan, K. Sastry, M. Butz, D. E. Goldberg, and F. G. Lobo. Substructural neighborhoods for local search in the Bayesian optimization algorithm. In T. P. Runarsson et al., editors, Parallel Problem Solving from Nature - PPSN IX, pages 232-241, Berlin, 2006. Springer-Verlag.
10. J. A. Lozano, P. Larrañaga, I. Inza, and E. Bengoetxea. Towards a New Evolutionary Computation. Advances in Estimation of Distribution Algorithms. Springer-Verlag, Berlin, 2006.
11. P. Moscato. On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech concurrent comp. prog. technical report 826, 1989.
12. M. Pelikan, K. Sastry, and E. Cantú-Paz. Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications. Springer-Verlag, Berlin, 2006.
13. M. Pelikan, K. Sastry, D. E. Goldberg, M. V. Butz, and M. Hauschild. Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap. In G. Raidl et al., editors, Proc. of the Genetic and Evol. Comp. Conference - GECCO-2009, pages 851-858, New York, New York, 2009. ACM Press.
14. E. Radetic and M. Pelikan. Spurious dependencies and EDA scalability. In J. Branke et al., editors, Proc. of the Genetic and Evol. Comp. Conference - GECCO-2010, pages 303-310, New York, New York, 2010. ACM Press.
15. E. Radetic, M. Pelikan, and D. E. Goldberg. Effects of a deterministic hill climber on hBOA. In G. Raidl et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2009, pages 437-444, New York, New York, 2009. ACM Press.
16. S. Russell and P. Norvig. Artificial Intelligence - A Modern Approach. Prentice-Hall Int. Limited, London, 1995.
17. D. Thierens. Scalability problems of simple genetic algorithms. Evolutionary Computation, 7(4):331-352, 1999.
18. D. Thierens. The linkage tree genetic algorithm. In R. Schaefer et al., editors, Parallel Problem Solving from Nature - PPSN XI, pages 264-273, Berlin, 2010. Springer-Verlag.
19. D. Thierens and P. A. N. Bosman. Optimal mixing evolutionary algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2011, New York, New York, 2011. ACM Press.
20. D. Thierens and D. E. Goldberg. Mixing in genetic algorithms. In Proceedings of the 5th International Conference on Genetic Algorithms, pages 38-45, San Francisco, California, 1993. Morgan Kaufmann.
21. N. L. J. Ulder, E. H. L. Aarts, H.-J. Bandelt, P. J. M. van Laarhoven, and E. Pesch. Genetic local search algorithms for the traveling salesman problem. In H.-P. Schwefel and R. Männer, editors, Parallel Problem Solving from Nature - PPSN, pages 109-116, Berlin, 1991. Springer-Verlag.