Inproceedings,

Improving the Performance of Evolutionary Optimization by Dynamically Scaling the Evolution Function

, and .
1995 IEEE Conference on Evolutionary Computation, 1, page 182--187. Perth, Australia, IEEE Press, (29 November - 1 December 1995)

Abstract

Traditional evolutionary optimization algorithms assume a static environment in which solutions are evolved. Incremental evolution is an approach through which a dynamic evaluation function is scaled over time in order to improve the performance of evolutionary optimization. In this paper, we present empirical results that demonstrate the effectiveness of this approach for genetic programming. Using two domains, a two-agent pursuit-evasion game and the Tracker trail-following task, we demonstrate that incremental evolution is most successful when applied near the beginning of an evolutionary run. We also show that incremental evolution can be successful when the intermediate evaluation functions are more difficult than the target evaluation function, as well as they are easier than the target function.

Tags

Users

  • @brazovayeye

Comments and Reviews