12
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      A Systematic Literature Review of Adaptive Parameter Control Methods for Evolutionary Algorithms

      1 , 2
      ACM Computing Surveys
      Association for Computing Machinery (ACM)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Evolutionary algorithms (EAs) are robust stochastic optimisers that perform well over a wide range of problems. Their robustness, however, may be affected by several adjustable parameters, such as mutation rate, crossover rate, and population size. Algorithm parameters are usually problem-specific, and often have to be tuned not only to the problem but even the problem instance at hand to achieve ideal performance. In addition, research has shown that different parameter values may be optimal at different stages of the optimisation process. To address these issues, researchers have shifted their focus to adaptive parameter control, in which parameter values are adjusted during the optimisation process based on the performance of the algorithm. These methods redefine parameter values repeatedly based on implicit or explicit rules that decide how to make the best use of feedback from the optimisation algorithm.

          In this survey, we systematically investigate the state of the art in adaptive parameter control. The approaches are classified using a new conceptual model that subdivides the process of adapting parameter values into four steps that are present explicitly or implicitly in all existing approaches that tune parameters dynamically during the optimisation process. The analysis reveals the major focus areas of adaptive parameter control research as well as gaps and potential directions for further development in this area.

          Related collections

          Most cited references191

          • Record: found
          • Abstract: not found
          • Book: not found

          Adaptation in Natural and Artificial Systems

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Optimization of Control Parameters for Genetic Algorithms

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Completely derandomized self-adaptation in evolution strategies.

              This paper puts forward two useful methods for self-adaptation of the mutation distribution - the concepts of derandomization and cumulation. Principle shortcomings of the concept of mutative strategy parameter control and two levels of derandomization are reviewed. Basic demands on the self-adaptation of arbitrary (normal) mutation distributions are developed. Applying arbitrary, normal mutation distributions is equivalent to applying a general, linear problem encoding. The underlying objective of mutative strategy parameter control is roughly to favor previously selected mutation steps in the future. If this objective is pursued rigorously, a completely derandomized self-adaptation scheme results, which adapts arbitrary normal mutation distributions. This scheme, called covariance matrix adaptation (CMA), meets the previously stated demands. It can still be considerably improved by cumulation - utilizing an evolution path rather than single search steps. Simulations on various test functions reveal local and global search properties of the evolution strategy with and without covariance matrix adaptation. Their performances are comparable only on perfectly scaled functions. On badly scaled, non-separable functions usually a speed up factor of several orders of magnitude is observed. On moderately mis-scaled functions a speed up factor of three to ten can be expected.
                Bookmark

                Author and article information

                Contributors
                (View ORCID Profile)
                Journal
                ACM Computing Surveys
                ACM Comput. Surv.
                Association for Computing Machinery (ACM)
                0360-0300
                1557-7341
                September 30 2017
                September 30 2017
                : 49
                : 3
                : 1-35
                Affiliations
                [1 ]Faculty of Information Technology, Monash University, VIC, Australia
                [2 ]Faculty of Science, Engineering 8 Technology, Swinburne University of Technology, Victoria, Australia
                Article
                10.1145/2996355
                9ac3f80e-46c2-4fe7-b1e6-04efbad9237c
                © 2017

                http://www.acm.org/publications/policies/copyright_policy#Background

                History

                Comments

                Comment on this article