The memory indexing evolutionary algorithm for dynamic environments

Lecture Notes in Computer Science

Volumn 3449, Issue , 2005, Pages 563-573

  Karaman, Aydin ^a   Uyar, Şima ^a   Eryiǧit, Gülşen ^a  

^a ISTANBUL TECHNICAL UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; RESEARCH AND DEVELOPMENT MANAGEMENT;

DYNAMIC ENVIRONMENTS; EDA-LIKE APPROACH; KNAPSACK PROBLEM;

EVOLUTIONARY ALGORITHMS;

EID: 24644470074     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32003-6_59     Document Type: Conference Paper

References (18)

1. Baluja S., Caruana R., "Removing the Genetics from the Standard Genetic Algorithm", in Proc. of the Intl. Conf. on Machine Learning, Morgan Kaufmann, pp. 38-46, 1995.
2. Branke J., "Memory Enhanced Evolutionary Algorithms for Changing Optimization Problems", in Proc. of Gong. On Evolutionary Computation, pp 1875-1882, IEEE, 1999.
3. Branke J., Kaussler T., Schmidt C., and Schmeck H., "A Multi-Population Approach to Dynamic Optimization Problems", Adaptive Computing in Design and Manufacturing, pp. 299-308, Springer, 2000.
4. Branke J., Evolutionary Optimization in Dynamic Environments, Kluwer, 2002.
5. Cobb H. G., "An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms having Continuous, Time-Dependent Non-stationary Environments", NCARAI Report: AIC-90-001, 1990.
6. Gottlieb J., "Evolutionary Algorithms for Constrained Optimization Problems", PhD Thesis, Tech. Univ. of Clausthal, Germany, 1999.
7. Grefenstette J. J., "Genetic Algorithms for changing environments", in Proc. of Parallel Problem Solving from Nature, pp. 137-144, Elsevier, 1992.
8. Karaman, Uyar S., "A Novel Change Severity Detection Mechanism for the Dynamic 0/1 Knapsack Problem", in Proceedings of Mendel 2004'. 10th Intl. Conf. on Soft Computing, 2004.
9. Larranaga P., Lozano J. A., Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, Kluwer, 2001.
10. Lewis J., Hart E., Graeme R., "A Comparison of Dominance Mechanisms and Simple Mutation on Non-Stationary Problems", in Proc. of Parallel Problem Solving from Nature, Springer, 1998.
11. Mori N., Kita H., and Nishikawa Y., "Adaptation to a Changing Environment by Means of the Feedback Thermodynamical Genetic Algorithm", in Proc. of Parallel Problem Solving from Nature, pp. 149-158, 1998.
12. Morrison R. W., De Jong K. A., "Triggered Hypermutation Revisited", in Proceedings of Cong. On Evolutionary Computation, pp 1025-1032, IEEE, 2000.
13. Morrison R. W., Designing Evolutionary Algorithms for Dynamic Environments, Springer, 2004.
14. Ng K. P., Wong K. C., "A New Diploid Scheme and Dominance Change Mechanism for Non-Stationary Function Optimization", in Proc. of the Sixth Intl. Conf. on Genetic Algorithms, 1995.
15. Ramsey C. L., Grefenstette J. J., "Case-Based Initialization of Genetic Algorithms", in Genetic Algorithms: Proceedings of Fifth International Conference, pp. 84-91, San Mateo: Morgan Kaufmann, 1993.
16. Ryan C., "The Degree of Oneness", in Proc. of the 1994 ECAI Workshop on Genetic Algorithms, Springer, 1994.
17. Vavak F., Jukes K. A., Fogarty T. C., "Performance of a Genetic Algorithm with Variable Local Search Range Relative to Frequency of the Environment Change", in Genetic-Programming 1998: Proc. of the Third Annual Conf., pp. 602-608, Morgan Kaufmann, 1998.
18. Weicker K., Evolutionary Algorithms and Dynamic Optimization Problems, Der Andere Verlag, 2003.