skip to main content
10.1145/3396474.3396483acmotherconferencesArticle/Chapter ViewAbstractPublication PagesismsiConference Proceedingsconference-collections
research-article

Empirical Analysis of A Partial Dominance Approach to Many-Objective Optimisation

Authors Info & Claims
Published:30 May 2020Publication History

ABSTRACT

Studies on standard many-objective optimisation problems have indicated that multi-objective optimisation algorithms struggle to solve optimisation problems with more than three objectives, because many solutions become dominated. Therefore, the Paretodominance relation is no longer efficient in guiding the search to find an optimal Pareto front for many-objective optimisation problems. Recently, a partial dominance approach has been proposed to address the problem experienced with application of the dominance relation on many objectives. Preliminary results have illustrated that this partial dominance relation has promise, and scales well with an increase in the number of objectives. This paper conducts a more extensive empirical analysis of the partial dominance relation on a larger benchmark of difficult many-objective optimisation problems, in comparison to state-of-the-art algorithms. The results further illustrate that partial dominance is an efficient approach to solve many-objective optimisation problems.

References

  1. H. Aquirre and K. Tanaka. 2007. Working Principles, Behavior, and Performance of MOEAs on MNK-Landscapes. European Journal of Operational Research 181, 3 (2007), 1670--1690.Google ScholarGoogle ScholarCross RefCross Ref
  2. D. Brockhoff, T. Wagner, and H. Trautmann. 2012. On the properties of the R2 indicator. In Proceedings of the Genetic and Evolutionary Computation Conference.Google ScholarGoogle Scholar
  3. Ran Cheng et al. 2016. A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Transactions on Evolutionary Computation 20, 5 (October 2016), 773--791.Google ScholarGoogle Scholar
  4. K. Deb, S. Agarwal, A. Pratap, and T. Meyarivan. 2000. A fast and elitist multiobjective genetic algorithm: NSGA-II. Technical Report 200001. Kanpur, India.Google ScholarGoogle Scholar
  5. K. Deb and R.B. Agrawal. 1995. Simulated binary crossover for continuous search space. Complex Systems 9 (1995), 115--148.Google ScholarGoogle Scholar
  6. K. Deb and D. Saxena. 2006. Searching for Pareto-optimal solutions through dimensionality reduction for certain large-dimensional multi-objective optimization problems. In In Proceedings of World Congress on Computational Intelligence. 3352--3360.Google ScholarGoogle Scholar
  7. Z. Fan, K. Hu, and H. Yin. 2015. Decomposing a multiobjective optimization problem into a number of reduced-dimension multiobjective subproblems using tomographic scanning. In Proceedings of the International Conference on industrial Informatics-Computing Technology, Intelligent Technology, Industrial Information Integration. 71--75.Google ScholarGoogle Scholar
  8. R.H. Gómez and C.A.C. Coello Coello. 2013. MOMBI: A new metaheuristic for many-objective optimization based on the R2 indicator. In Proceedings of IEEE Congress on Evolutionary Computation. Cancú, Mexico, 2488--2495.Google ScholarGoogle ScholarCross RefCross Ref
  9. M. Helbig and A.P. Engelbrecht. 2020. Partial Dominance for Many-Objective Optimization. In Proceedings of the 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence. Under review.Google ScholarGoogle Scholar
  10. H. Li, K. Deb, Q. Zhang, and P. Suganthan. 2017. Challenging novel many and multi-objective bound constrained benchmark problems. Technical Report.Google ScholarGoogle Scholar
  11. M. Sierra and C. Coello Coello. 2005. Improving PSO-Based Multi-objective Optimization Using Crowding, Mutation and &epsis;-Dominance. In Evolutionary multi-criterion optimization, Carlos Coello Coello, Arturo HernÃąndez Aguirre, and Eckart Zitzler (Eds.). Lecture Notes in Computer Science, Vol. 3410. Springer Berlin Heidelberg, 505--519. http://dx.doi.org/10.1007/978-3-540-31880-4_35Google ScholarGoogle Scholar
  12. D.A. van Veldhuizen and G.B. Lamont. 1998. Multiobjective evolutionary algorithm research: a history and analysis. Technical Report TR- 98--03. Department of Electrical and Computer Engineering, Air force Institution of Technology.Google ScholarGoogle Scholar
  13. Fangqing Gu Yiu-ming Cheung and Hai-Lin Liu. 2016. A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Transactions on Evolutionary Computation 20, 5 (October 2016), 755--772.Google ScholarGoogle ScholarCross RefCross Ref
  14. E. Zitzler and S. Künzli. 2004. Indicator-Based Selection in Multiobjective Search. In Proceedings of International Conference on Parallel Problem Solving from Nature - PPSN VIII, Xin Yao, Edmund K. Burke, José A. Lozano, Jim Smith, Juan Julián Merelo-Guervós, John A. Bullinaria, Jonathan E. Rowe, Peter Tiňo, Ata Kabán, and Hans-Paul Schwefel (Eds.). Springer Berlin Heidelberg, Birmingham, UK, 832--842.Google ScholarGoogle Scholar
  15. E. Zitzler, M. Laumanns, and L. Thiele. 2001. SPEA2: Improving the strength Pareto evolutionary algorithm. TIK Report 103. Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Zurich, Switzerland.Google ScholarGoogle Scholar

Index Terms

  1. Empirical Analysis of A Partial Dominance Approach to Many-Objective Optimisation

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Other conferences
          ISMSI '20: Proceedings of the 2020 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence
          March 2020
          142 pages
          ISBN:9781450377614
          DOI:10.1145/3396474

          Copyright © 2020 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 30 May 2020

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed limited

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader