Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1389095.1389225acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

Effectiveness of scalability improvement attempts on the performance of NSGA-II for many-objective problems

Published: 12 July 2008 Publication History

Abstract

Recently a number of approaches have been proposed to improve the scalability of evolutionary multiobjective optimization (EMO) algorithms to many-objective problems. In this paper, we examine the effectiveness of those approaches through computational experiments on multiobjective knapsack problems with two, four, six, and eight objectives. First we briefly review related studies on evolutionary many-objective optimization. Next we explain why Pareto dominance-based EMO algorithms do not work well on many-objective optimization problems. Then we explain various scalability improvement approaches. We examine their effects on the performance of NSGA-II through computational experiments. Experimental results clearly show that the diversity of solutions is decreased by most scalability improvement approaches while the convergence of solutions to the Pareto front is improved. Finally we conclude this paper by pointing out future research directions.

References

[1]
Abraham, A., Jain, L. C., and Goldberg, R. (eds.) Evolutionary Multiobjective Optimization: Theoretical Advances and Applications. Springer, Berlin (2005).]]
[2]
Branke, J., Kaußler, T., and Schmeck, H. Guidance in evolutionary multi-objective optimization. Advances in Engineering Software 32, 6 (2001) 499--507.]]
[3]
Brockhoff, D., and Zitzler, E. Are all objectives necessary? On dimensionality reduction in evolutionary multiobjective optimization. Lecture Notes in Computer Science 4193: Parallel Problem Solving from Nature - PPSN IX, Springer, Berlin (2006) 533--542.]]
[4]
Brockhoff, D., and Zitzler, E. Improving hypervolume-based multiobjective evolutionary algorithms by using objective reduction methods. Proc. of 2007 IEEE Congress on Evolutionary Computation (2007) 2086--2093.]]
[5]
Coello, C. A. C., and Lamont, G. B. Applications of Multi-Objective Evolutionary Algorithms. World Scientific, Singapore (2004).]]
[6]
Coello, C. A. C., van Veldhuizen, D. A., and Lamont, G. B. Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer, Boston (2002).]]
[7]
Corne, D., and Knowles, J. Techniques for highly multiobjective optimization: Some non-dominated points are better than others. Proc. of 2007 Genetic and Evolutionary Computation Conference (2007) 773--780.]]
[8]
Deb, K. Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley & Sons, Chichester (2001).]]
[9]
Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. on Evolutionary Computation 6, 2 (2002) 182--197.]]
[10]
Deb, K., and Saxena, D. K. On finding Pareto-optimal solutions through dimensionality reduction for certain large-dimensional multi-objective optimization problems. KanGAL Report, No. 2005011, Kanpur Genetic Algorithms Laboratory (KanGAL), Indian Institute of Technology Kanpur (2005).]]
[11]
Deb, K., and Saxena, K. Searching for Pareto-optimal solutions through dimensionality reduction for certain large-dimensional multi-objective optimization problems. Proc. of 2006 IEEE Congress on Evolutionary Computation (2006) 3353--3360.]]
[12]
Deb, K., and Sundar, J. Preference point based multi-objective optimization using evolutionary algorithms. Proc. of 2006 Genetic and Evolutionary Computation Conference (2006) 635--642.]]
[13]
Drechsler, N., Drechsler, R., and Becker, B. Multi-objective optimization based on relation favour. Lecture Notes in Computer Science 1993: Evolutionary Multi-Criterion Optimization - EMO 2001, Springer, Berlin (2001) 154--166.]]
[14]
Fleming, P. J., Purshouse, R. C., and Lygoe, R. J. Many-objective optimization: An engineering design perspective. Lecture Notes in Computer Science 3410: Evolutionary Multi-Criterion Optimization - EMO 2005, Springer, Berlin (2005) 14--32.]]
[15]
Hughes, E. J. Evolutionary many-objective optimization: Many once or one many?. Proc. of 2005 IEEE Congress on Evolutionary Computation (2005) 222--227.]]
[16]
Hughes, E. J. MSOPS-II: A general-purpose many-objective optimizer. Proc. of 2007 IEEE Congress on Evolutionary Computation (2007) 3944--3951.]]
[17]
Ikeda, K., Kita, H., and Kobayashi, S. Failure of Pareto-based MOEAs: Does non-dominated really mean near to optimal?. Proc. of 2001 IEEE Congress on Evolutionary Computation (2001) 957--962.]]
[18]
Ishibuchi, H., Doi, T., and Nojima, Y. Incorporation of scalarizing fitness functions into evolutionary multiobjective optimization algorithms. Lecture Notes in Computer Science 4193: Parallel Problem Solving from Nature - PPSN IX, Springer, Berlin (2006) 493--502.]]
[19]
Ishibuchi, H., and Nojima, Y. Optimization of scalarizing functions through evolutionary multiobjective optimization. Lecture Notes in Computer Science 4403: Evolutionary Multi-Criterion Optimization - EMO 2007, Springer, Berlin (2007) 51--65.]]
[20]
Ishibuchi, H., Tsukamoto, N., and Nojima, Y. Iterative approach to indicator-based multiobjective optimization. Proc. of 2007 IEEE Congress on Evolutionary Computation (2007) 3697--3704.]]
[21]
Ishibuchi, H., Tsukamoto, N., and Nojima, Y. Evolutionary many-objective optimization: A short review. Proc. of 2008 IEEE Congress on Evolutionary Computation (in press).]]
[22]
Jaszkiewicz, A. On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - A comparative experiment. IEEE Trans. on Evolutionary Computation 6, 4 (2002) 402--412.]]
[23]
Jaszkiewicz, A. On the computational efficiency of multiple objective metaheuristics: The knapsack problem case study. European Journal of Operational Research 158, 2 (2004) 418--433.]]
[24]
Khara, V., Yao, X., and Deb, K. Performance scaling of multi-objective evolutionary algorithms. Lecture Notes in Computer Science 2632: Evolutionary Multi-Criterion Optimization - EMO 2003, Springer, Berlin (2004) 367--390.]]
[25]
Köppen, M. and Yoshida, K. Substitute distance assignments in NSGA-II for handling many-objective optimization problems. Lecture Notes in Computer Science 4403: Evolutionary Multi-Criterion Optimization - EMO 2007, Springer, Berlin (2007) 727--741.]]
[26]
Kukkonen, S., and Lampinen, J. Ranking-dominance and many-objective optimization. Proc. of 2007 IEEE Congress on Evolutionary Computation (2007) 3983--3990.]]
[27]
Purshouse, R. C., and Fleming, P. J. Evolutionary many-objective optimization: An exploratory analysis. Proc. of 2003 IEEE Congress on Evolutionary Computation (2003) 2066--2073.]]
[28]
Sato, H., Aguirre, H. E., and Tanaka, K. Controlling dominance area of solutions and its impact on the performance of MOEAs. Lecture Notes in Computer Science 4403: Evolutionary Multi-Criterion Optimization - EMO 2007, Springer, Berlin (2007) 5--20.]]
[29]
Sülflow, A., Drechsler, N., and Drechsler, R. Robust multi-objective optimization in high dimensional spaces. Lecture Notes in Computer Science 4403: Evolutionary Multi-Criterion Optimization - EMO 2007, Springer, Berlin (2007) 715--726.]]
[30]
Thiele, L., Miettinen, K., Korhonen, P. J., and Molina, J. A preference-based interactive evolutionary algorithm for multiobjective optimization. Helsinki School of Economics, Working Paper (2007) W-412.]]
[31]
Wagner, T., Beume, N., and Naujoks, B. Pareto-, aggregation-, and indicator-based methods in many-objective optimization. Lecture Notes in Computer Science 4403: Evolutionary Multi-Criterion Optimization - EMO 2007, Springer, Berlin (2007) 742--756.]]
[32]
Zhang, Q., and Li, H. MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. on Evolutionary Computation 11, 6 (2007) 712--731.]]
[33]
Zitzler, E., and Thiele, L. Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Trans. on Evolutionary Computation 3, 4 (1999) 257--271.]]

Cited By

View all
  • (2024)DNA sequences design under many objective evolutionary algorithmCluster Computing10.1007/s10586-024-04675-127:10(14167-14183)Online publication date: 16-Jul-2024
  • (2023)Many-objective Optimization via Voting for ElitesProceedings of the Companion Conference on Genetic and Evolutionary Computation10.1145/3583133.3590693(131-134)Online publication date: 15-Jul-2023
  • (2022)Assessing effectiveness of many-objective evolutionary algorithms for selection of tag SNPsPLOS ONE10.1371/journal.pone.027856017:12(e0278560)Online publication date: 8-Dec-2022
  • Show More Cited By

Index Terms

  1. Effectiveness of scalability improvement attempts on the performance of NSGA-II for many-objective problems

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation
    July 2008
    1814 pages
    ISBN:9781605581309
    DOI:10.1145/1389095
    • Conference Chair:
    • Conor Ryan,
    • Editor:
    • Maarten Keijzer
    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]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 12 July 2008

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. balance between diversity and convergence
    2. crowding distance
    3. evolutionary multiobjective optimization
    4. knapsack problems
    5. many-objective optimization
    6. pareto dominance

    Qualifiers

    • Research-article

    Conference

    GECCO08
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)17
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 22 Sep 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)DNA sequences design under many objective evolutionary algorithmCluster Computing10.1007/s10586-024-04675-127:10(14167-14183)Online publication date: 16-Jul-2024
    • (2023)Many-objective Optimization via Voting for ElitesProceedings of the Companion Conference on Genetic and Evolutionary Computation10.1145/3583133.3590693(131-134)Online publication date: 15-Jul-2023
    • (2022)Assessing effectiveness of many-objective evolutionary algorithms for selection of tag SNPsPLOS ONE10.1371/journal.pone.027856017:12(e0278560)Online publication date: 8-Dec-2022
    • (2022)An enhanced adaptive geometry evolutionary algorithm using stochastic diversity mechanismProceedings of the Genetic and Evolutionary Computation Conference10.1145/3512290.3528820(476-483)Online publication date: 8-Jul-2022
    • (2022)A new reference-based algorithm based on non-euclidean geometry for multi-stakeholder media planningProceedings of the 37th ACM/SIGAPP Symposium on Applied Computing10.1145/3477314.3507320(1056-1065)Online publication date: 25-Apr-2022
    • (2022)Edge–Cloud Resource Scheduling in Space–Air–Ground-Integrated Networks for Internet of VehiclesIEEE Internet of Things Journal10.1109/JIOT.2021.30655839:8(5765-5772)Online publication date: 15-Apr-2022
    • (2022)A multiplicative maximin-based evaluation approach for evolutionary many-objective optimizationApplied Soft Computing10.1016/j.asoc.2022.108760121:COnline publication date: 1-May-2022
    • (2021)An Enhanced R-NSGA-II For Multiple Brands Advertising Campaign Allocation Problem2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI)10.1109/ICTAI52525.2021.00206(1306-1310)Online publication date: Nov-2021
    • (2020)Many-objective BAT algorithmPLOS ONE10.1371/journal.pone.023462515:6(e0234625)Online publication date: 11-Jun-2020
    • (2019)A Big Data Approach for the Extraction of Fuzzy Emerging PatternsCognitive Computation10.1007/s12559-018-9612-7Online publication date: 4-Jan-2019
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media