Evolutionary Algorithms for Non { Stationary

  title={Evolutionary Algorithms for Non \{ Stationary},
  author={EnvironmentsKrzysztof Trojanowski and Zbigniew Michalewicz},
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 restart every time a change is recorded. In this paper non-stationary problems (i.e., problems, which change in time) are discussed. We describe diierent types of changes in… CONTINUE READING

From This Paper

Topics from this paper.
25 Citations
18 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 25 extracted citations


Publications referenced by this paper.
Showing 1-10 of 18 references

A Comparison of Dominance Mechanisms and Simple Mutation on Non{Stationary Problems", 5PPSN: Parallel Problem Solving from Nature, vol

  • J. Lewis, E. Hart, G. Ritche
  • 1998
1 Excerpt

Benchmarks for Testing Evolutionary Algorithms

  • W. Feng, T. Brune, L. Chan, M. Chowdhury, C. Kuek, Y. Li
  • The Third Asia-Paci c Conf. on Measurement…
  • 1998

Redundancy of Genotypes as the Way for Some Advanced Operators in Evolutionary Algorithms - Simulation Study

  • H. Kwasnicka
  • VIVEK A Quarterly in Arti cial Intelligence, Vol…
  • 1997
1 Excerpt

Critical Event Tabu Search for Multidimensional Knapsack Problems

  • F. Glover, G. Kochenberger
  • Proc. of the Int. Conf. on Metaheuristic for…
  • 1995

Similar Papers

Loading similar papers…