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

      ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems

      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 references30

          • 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
            • Record: found
            • Abstract: not found
            • Book: not found

            Evolutionary Algorithms for Solving Multi-Objective Problems

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

              A comprehensive survey of fitness approximation in evolutionary computation

              Y. Jin (2005)
                Bookmark

                Author and article information

                Journal
                IEEE Transactions on Evolutionary Computation
                IEEE Trans. Evol. Computat.
                Institute of Electrical and Electronics Engineers (IEEE)
                1089-778X
                February 2006
                February 2006
                : 10
                : 1
                : 50-66
                Article
                10.1109/TEVC.2005.851274
                7df6683f-228c-46e1-81f8-001a4766e025
                © 2006
                History

                Comments

                Comment on this article