Abstract
Most real-world applications operate in dynamic environments. In such environments often it is necessary to modify the current solution due to various changes in the environment (e.g., machine breakdowns, sickness of employees, etc). Thus it is important to investigate properties of adaptive algorithms which do not require re-start every time a change is recorded. In this paper non-stationary problems (i.e., problems, which change in time) are discussed. We describe different types of changes in the environment. A new model for non-stationary problems and a classification of these problems by the type of changes is proposed. A brief review of existing applied measures of obtained results is also presented.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Angeline, P., “Tracking Extrema in Dynamic Environments”, Proceedings of the Sixth International Conference on Evolutionary Programming—EP’97, vol. 1213 in LNCS, Springer, 1997, pp 335–346.
Baeck, T., “On the Behavior of Evolutionary Algorithms in Dynamic Environments”, Proceedings of the 5nd IEEE International Conference on Evolutionary Computation—ICEC’98, IEEE Publishing, pp 446–451.
Baeck, T., Schutz, M., “Intelligent Mutation Rate Control in Canonical Genetic Algorithm”, Proceedings of the 9th International Symposium—ISMIS’96, vol. 1079 in LNAI, Springer, 1996, pp 158–167.
Cedeno, W., Vemuri, V., R., “On the Use of Niching for Dynamic Landscapes”, Proceedings of the 4th IEEE International Conference on Evolutionary Computation-ICEC’97, IEEE Publishing, Inc., pp 361–366.
Dasgupta, D., McGregor, D. R., “Nonstationary Function Optimization using the Structured Genetic Algorithm”, 2PPSN: Parallel Problem Solving from Nature, Elsevier Science Publishers B. V., 1992, pp 145–154
De Jong, K., A., “An Analysis of the Behavior of a Class of Genetic Adaptive systems”, (Doctoral Dissertation, University of Michigan), Dissertation Abstract International 36(10), 5140B. (University Microfilms No 76-9381).
Eiben, A. E., Hinterding R., Michalewicz, Z., “Parameter Control in Evolutionary Algorithms”, Technical Report TR98-07, Department of Computer Science, Leiden University, Netherlands, 1998.
Ghosh, A., Tsutsui, S., Tanaka, H., “Function Optimization in Nonstationary Environment using Steady-State Genetic Algorithms with Aging of Individuals”, Proceedings of the 5th IEEE International Conference on Evolutionary Computation ICEC’98, IEEE Publishing, Inc., pp 666–671.
Glover, F., Laguna, M., “Tabu Search” in Modern Heuristic Techniques for Combinatorial Problems, edited by Colin R. Reeves BSc. MPhil, Halsted Press: an Imprint of John Wiley & Sons Inc.
Goldberg, D., E., Smith, R., E., “Nonstationary Function Optimization Using Genetic Algorithms with Dominance and Diploidy”, Proceedings of the 2nd IEEE International Conference on Genetic Algorithms-II ICGA’87, Lawrence Erlbaum Associates, pp 59–68.
Goldberg, D., E., Richardson, J., “Genetic Algorithms with Sharing for Multimodal Function Optimization”, Proceedings of the 2nd IEEE International Conference on Genetic Algorithms—II ICGA’87, Lawrence Erlbaum Associates, pp 41–49.
Grefenstette, J., J., “Genetic algrithms for changing environments”, Parallel Problem Solving from Nature, Elsevier Science Publishers B. V., 1992, pp 137–144.
Kwasnicka H., “Redundancy of Genotypes as the Way for Some Advanced Operators in Evolutionary Algorithms—Simulation Study”, VIVEK A Quarterly in Artificial Intelligence, Vol. 10, No. 3, July 1997, National Centre for Software Technology, Mumbai, pp 2–11.
Michalewicz, Z., Genetic Algorithms+Data Structures=Evolution Programs, 3-rd edition, Springer-Verlag, New York, 1996.
Mori, N., Imanishi, S., Kita, H., Nishikawa, Y., “Adaptation to a Changing Environments by Means of the Memory Based Thermodynamical Genetic Algorithm”, Proceedings of the 7th IEEE International Conference on Genetic Algorithms-VII ICGA’97, Morgan Kauffman, pp 299–306.
Reynolds R., G., Chung C., J., “Knowledge-based Self-adaptation in Evolutionary Programming using Cultural Algorithms”, Proceedings of the 4th IEEE International Conference on Evolutionary Computation—ICEC’97, IEEE Publishing, Inc., pp 71–76.
Sebag, M., Schoenauer, M., Ravise, C., “Toward Civilized Evolution: Developing Inhibitions”, Proceedings of the 7th IEEE International Conference on Genetic Algorithms—VII ICGA’97, Morgan Kauffman, pp 291–298.
Sebag, M., Schoenauer, M., Ravise, C., “Inductive Learning of Mutation Step-Size in Evolutionary Parameter Optimization”, Proceedings of the Sixth International Conference on Evolutionary Programming—EP’97, vol. 1213 in LNCS, Springer, 1997, pp 247–261.
Vavak F., Fogarty T.C., Jukes K., “Learning the Local Search Range for Genetic Optimization in Nonstationary Environments”, Proceedings of the 4th IEEE International Conference on Evolutionary Computation—ICEC’97, IEEE Publishing, Inc., pp 355–360.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trojanowski, K., Michalewicz, Z. (1999). Evolutionary approach to non-stationary optimisation tasks. In: Raś, Z.W., Skowron, A. (eds) Foundations of Intelligent Systems. ISMIS 1999. Lecture Notes in Computer Science, vol 1609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0095142
Download citation
DOI: https://doi.org/10.1007/BFb0095142
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65965-5
Online ISBN: 978-3-540-48828-6
eBook Packages: Springer Book Archive