Sub-structural niching in non-stationary environments

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3339, Issue , 2004, Pages 873-885

  Sastry, Kumara ^a   Abbass, Hussein A ^b   Goldberg, David ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMOSOMES; MATHEMATICAL OPERATORS; PERTURBATION TECHNIQUES; PROBABILITY; PROBLEM SOLVING; THERMODYNAMICS;

AUTOMATIC PROBLEM DECOMPOSITION; COMPRESSED POPULATION COMPLEXITY (CPC); GENETIC OPERATORS; NICHING METHOD;

GENETIC ALGORITHMS;

EID: 22944483461     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30549-1_75     Document Type: Conference Paper

References (38)

1. H.A. Abbass, K. Sastry, and D. Goldberg. Oiling the wheels of change: The role of adaptive automatic problem decomposition in non-stationary environments. Technical Report Illigal TR-2004029, University of Illinois, Urbana-Champaign, 2004.
2. D.H. Ackley. A connectionist machine for genetic hill climbing. Kluwer Academic publishers, 1987.
3. S. Baluja. 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, 1994.
4. C. Bierwirth and D.C. Mattfeld. Production scheduling and rescheduling with genetic algorithms. Evolutionary Computation, 7(1):1-18, 1999.
5. P. Bosman and D. Thierens. Linkage information processing in distribution estimation algorithms. Proceedings of the Genetic and Evolutionary Computation Conference, pages 60-67, 1999.
6. J. Branke. Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers, Boston, 2001.
7. Y.-p. Chen. Extending the Scalability of Linkage Learning Genetic Algorithms: Theory and Practice. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL, 2004.
8. (Also IlliGAL Report No. 2004018).
9. H.G. Cobb. 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, 1990.
10. P. Collard, C. Escazut, and E. Gaspar. An evolutionnary approach for time dependant optimization. International Journal on Artificial Intelligence Tools, 6(4):665-695, 1997.
11. D. Dasgupta. Incorporating redundancy and gene activation mechanisms in genetic search. In L. Chambers, editor, Practical Handbook of Genetic Algorithms, pages 303-316. CRC Press, 1995.
12. K. Deb and D.E. Goldberg. Analyzing deception in trap functions. Foundations of Genetic Algorithms, pages 93-108. Morgan Kaufmann, 1993.
13. A. Ghosh, S. Tstutsui, and H. Tanaka. Function optimisation in nonstationary environment using steady state genetic algorithms with aging of individuals. IEEE International Conference on Evolutionary Computation, pages 666-671. IEEE Publishing, 1998.
14. D. E. Goldberg, K. Deb, and J. Horn. Massive multimodality, deception, and genetic algorithms. Proceedings of parallel problem solving from nature II, pages 37-46. Elsevier Science Publishers, 1992.
15. D.E. Goldberg. The design of innovation: lessons from and for competent genetic algorithms. Kluwer Academic Publishers, Massachusetts, USA, 2002.
16. D.E. Goldberg, K. Deb, H. Kargupta, and G. Harik. Rapid, accurate optimization of difficult problems using fast messy genetic algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo, California, pages 56-530. Morgan Kauffman Publishers, 1993.
17. D.E. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: motivation, analysis, and first results. Complex Systems, 3(5):493-530, 1989.
18. D.E. Goldberg and R.E. Smith. Nonstationary function optimisation using genetic algorithms with dominance and diploidy. Second International Conference on Genetic Algorithms, pages 59-68. Lawrence Erlbaum Associates, 1987.
19. J.J. Grefenstette. Genetic algorithms for changing environments. Proceedings of Parallel Problem Solving from Nature, pages 137-144. Elsevier Science Publisher, 1992.
20. G. Harik. Linkage Learning via Probabilistic Modeling in the ECGA. PhD thesis, University of Illinois at Urbana-Champaign, 1999.
21. R. B. Heckendorn and A. H. Wright. Efficient linkage discovery by limited probing. Proceedings of the Genetic and Evolutionary Computation Conference, pages 1003-1014, 2003.
22. J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI, 1975.
23. H. Kargupta. The gene expression messy genetic algorithm. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 814-819, Piscataway, NJ, 1996. IEEE Service Centre.
24. S.C. Lin, E.D. Goodman, and W.F. Punch. A genetic algorithm approach to dynamic job shop scheduling problems. In Seventh International Conference on Genetic Algorithms, pages 139-148. Morgan Kaufmann, 1997.
25. S.W. Mahfoud. Bayesian. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL, 1995.
26. (Also IlliGAL Report No. 95001).
27. N. Mori, S. Imanishia, H. Kita, and Y. Nishikawa. Adaptation to changing environments by means of the memory based thermodynamical genetic algorithms. Proceedings of the Seventh International Conference on Genetic Algorithms, pages 299-306. Morgan Kaufmann, 1997.
28. N. Mori, H. Kita, and Y. Nishikawa. Adaptation to changing environments by means of the thermodynamical genetic algorithms. Proceedings of Parallel Problem Solving from Nature, volume 1411 of Lecture Notes in Computer Science, pages 513-522, Berlin, 1996. Elsevier Science Publisher.
29. M. Munetomo and D. Goldberg. Linkage identification by non-monotonicity detection for overlapping functions. Evolutionary Computation, 7(4):377-398, 1999.
30. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz. Linkage learning, estimation distribution, and Bayesian networks. Evolutionary Computation, 8(3):314-341, 2000.
31. (Also IlliGAL Report No. 98013).
32. M. Pelikan and H. Mühlenbein. The bivariate marginal distribution algorithm. In R. Roy, T. Furuhashi, and P. K. Chawdhry, editors, Advances in Soft Computing - Engineering Design and Manufacturing, pages 521-535, London, 1999. Springer-Verlag.
33. J. J. Rissanen. Modelling by shortest data description. Automatica, 14:465-471, 1978.
34. Claude E. Shannon. A mathematical theory of communication. The Bell System Technical Journal, 27(3):379-423, 1948.
35. D. Thierens and D.E. Goldberg. Mixing in genetic algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA-93), pages 38-45, San Mateo, CA, 1993. Morgan Kaufmann.
36. F. Vavak, K. Jukes, and T.C. Fogarty. Learning the local search range for genetic optimisation in nonstationary environments. In IEEE International Conference on Evolutionary Computation, pages 355-360. IEEE Publishing, 1997.
37. T.-L. Yu, D. E. Goldberg, A. Yassine, and Y.-P. Chen. A genetic algorithm design inspired by organizational theory: Pilot study of a dependency structure matrix driven genetic algorithm. Artificial Neural Networks in Engineering, pages 327-332, 2003.
38. (Also IlliGAL Report No. 2003007).