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

      A review of multiobjective test problems and a scalable test problem toolkit

      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.

          Related collections

          Most cited references34

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

          Comparison of multiobjective evolutionary algorithms: empirical results.

          In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function involves a particular feature that is known to cause difficulty in the evolutionary optimization process, mainly in converging to the Pareto-optimal front (e.g., multimodality and deception). By investigating these different problem features separately, it is possible to predict the kind of problems to which a certain technique is or is not well suited. However, in contrast to what was suspected beforehand, the experimental results indicate a hierarchy of the algorithms under consideration. Furthermore, the emerging effects are evidence that the suggested test functions provide sufficient complexity to compare multiobjective optimizers. Finally, elitism is shown to be an important factor for improving evolutionary multiobjective search.
            Bookmark
            • Record: found
            • Abstract: not found
            • Book: not found

            Randomization and Monte Carlo Methods in Biology

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

              Approximating the nondominated front using the Pareto Archived Evolution Strategy.

              We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its simplest form, is a (1 + 1) evolution strategy employing local search but using a reference archive of previously found solutions in order to identify the approximate dominance ranking of the current and candidate solution vectors. (1 + 1)-PAES is intended to be a baseline approach against which more involved methods may be compared. It may also serve well in some real-world applications when local search seems superior to or competitive with population-based methods. We introduce (1 + lambda) and (mu + lambda) variants of PAES as extensions to the basic algorithm. Six variants of PAES are compared to variants of the Niched Pareto Genetic Algorithm and the Nondominated Sorting Genetic Algorithm over a diverse suite of six test functions. Results are analyzed and presented using techniques that reduce the attainment surfaces generated from several optimization runs into a set of univariate distributions. This allows standard statistical analysis to be carried out for comparative purposes. Our results provide strong evidence that PAES performs consistently well on a range of multiobjective optimization tasks.
                Bookmark

                Author and article information

                Journal
                IEEE Transactions on Evolutionary Computation
                IEEE Trans. Evol. Computat.
                Institute of Electrical and Electronics Engineers (IEEE)
                1089-778X
                October 2006
                October 2006
                : 10
                : 5
                : 477-506
                Article
                10.1109/TEVC.2005.861417
                87c9e4ec-6201-458e-bf5f-f5d1b2251fb6
                © 2006
                History

                Comments

                Comment on this article