A self-organized criticality mutation operator for dynamic optimization problems

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 937-944

  Fernandes, Carlos M ^a,b   Merelo, J J ^b   Ramos, Vitorino ^a   Rosa, Agostinho C ^a  

^a UNIVERSITY OF LISBON   (Portugal)

^b UNIVERSITY OF GRANADA   (Spain)

Author keywords

Dynamic optimization problems; Genetic algorithms; Self organized criticality

Indexed keywords

CRITICAL CURRENT DENSITY (SUPERCONDUCTIVITY); CRITICALITY (NUCLEAR FISSION); SAND;

DYNAMIC ENVIRONMENTS; DYNAMIC OPTIMIZATION PROBLEM (DOP); FUNCTION OPTIMIZATION; MUTATION OPERATORS; OFF-LINE APPROACHES; POWER LAW RELATIONSHIP; SELF-ORGANIZED CRITICALITY; TWO-DIMENSIONAL GRIDS;

GENETIC ALGORITHMS;

EID: 57349156599     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1389095.1389275     Document Type: Conference Paper

References (32)

1. Abbass, H. A., Sastry K., and Goldberg, D. E. 2004. Oiling the wheels of change: The role of adaptive automatic problem decomposition in non-stationary environments. Technical Report 2004029, Illigal, University of Illinois at UrbanaChampaign, IL, USA
2. th International Conf. on Evolutionary Programming, Springer, 335-345.
3. Back, T. 1996.Evolutionary Algorithms in Theory and Practice. Oxford University Press.
4. Bak, P., Tang, C., K. Wiesenfeld, K. 1987. Self-organized criticality: an explanation of 1/f noise. Physical Review of Letters, 381-384.
5. Bak, P., Sneppen. K. 1993. Punctuated equilibrium and criticality in a simple model of evolution. Physical Review of Letters 71, 4083-4086.
6. Baluja, S. 1994. Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning. Technical Report CMU-CS-94-163, Carnegie Mellon University, USA.
7. Boettcher, S., Percus A.G. 2003. Optimization with extremal dynamics. Complexity 8(2), 57-62.
8. Bonabeau, E., Dorigo, M., Threraulaz, G. 1999. Swarm intelligence: from natural to artificial systems. Oxford University Press
9. Branke, J. 1999. Memory enhanced evolutionary algorithms for changing optimization problems. Proceedings of the 1999 Congress on Evolutionary Computation, 1875-1882
10. Branke, J., Schmeck, H. 2002. Designing evolutionary algorithms for dynamic optimization problems. Theory and Application of Evolutionary Computation: Recent Trends, 239-262
11. Cedeno, W., Vemuri. V.R. 1997. On the use of niching for dynamic landscapes. Proceedings of the 1997 Conference on Evolutionary Computation, IEEE, 361-367
12. Cobb H.G. 1990. An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Technical Report AIC-90-001, Naval Research Laboratory, Washington, USA
13. st European Conference on Artificial Life, MIT Press, 134-142
14. Eiben, A.E., Hinterding R., Michalewicz Z. 1999. Parameter Control in Evolutionary. IEEE Transaction on Evolutionary Computation 3(2), 124-141
15. Fernandes, C., Rosa A.C., and Ramos V. 2007. Binary Ant Algorithm. Proceedings of the 2007 Genetic and Evolutionary Computation Conference, ACM, 41-48
16. Goldberg, D.E, Deb, K., Horn, J. 1992. Massively multimodality, deception and genetic algorithms. Parallel Problem Solving from Nature II, North-Holland, 37-46
17. nd International Conference on Genetic Algorithms, ACM, 59-68
18. Grefenstette, J.J. 1992. Genetic algorithms for changing environments. Parallel Problem Solving from Nature II. North-Holland, 137-144,
19. rd International Workshop ANTS 2002, LNCS 2463, 111-122
20. Harik, G. R. 1999. Linkage learning via probabilistic modeling in the ECGA. IlliGAL Report No. 99010, Illigai, University of Illinois at Urbana-Champaign, IL, USA
21. Huang, C., Kaur, J., Maguitman, A., and Rocha, L. 2007 Agent-based model of genotype editing. Evolutionary Computation 15(3), 253-289.
22. Krink, T., Rickers P., René T. 2000. Applying self-organised criticality to evolutionary algorithms. Proceedings of the 6th International Conference on Parallel Problem Solving from Nature, 375-384
23. Krink, T., Thomsen, R. 2001. Self-Organized Criticality and Mass Extinction in Evolutionary Algorithms. Proceedings of the 2001 Congress on Evolutionary Computation, vol.2, 1155-1161
24. Lorrañga, P., Lozano J.A. 2002. Estimation of distribution algorithms: A new tool for evolutionary computation. Boston: Kluwer Academic Publishers, Boston
25. Mitchell, M. 1991. When will a GA outperform Hilclimbing? Advances in Neural Information Processing Systems 6, 51-58
26. Muehlenbein, H. 1998. The equation for response to selection and its use for prediction. Evolutionary Computation 5(3), 303-346
27. Ochoa, G., Madler-Kron C., Rodriguez R., Jaffe K. 2005. Assortative mating in genetic algorithms for dynamic problems. Proceedings of the 2005 EvoWorkshops, 617-622
28. Pelikan, M., Goldberg D., Lobo F. 1999. A Survey of Optimization by Building and Using Probabilistic Models, Computational Optimization and Applications 21(1), 5-20
29. Ramos, V., Fernandes C., and Rosa A.C. 2005. On self-regulated swarms, societal memory, speed and dynamics, Proceedings of ALifeX, MIT Press, 393-399
30. Tinos, R. and Yang, S. 2007. A self-organizing random immigrants genetic algorithm for dynamic optimization problems. Genetic Programming and Evolvable Machines 8, 255-286
31. Yang, S. 2005. Memory-enhanced univariate marginal distribution algorithms. Proceedings of the 2005 Congress on Evolutionary Computation, 2560-2567
32. Yang, S. and Yao, X. 2005. Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Computing 9(11), 815-834