Skip to main content

Objective Space Partitioning with a Novel Conflict Information Measure for Many-Objective Optimization

  • Conference paper
  • First Online:
  • 1698 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9712))

Abstract

In this paper, we present a novel conflict information measure used for objective space partitioning in solving many-objective optimization problems. Obtained from the current Pareto front approximation to estimate the degree of conflict between objectives, the conflict information is simply evaluated by counting the occurrence of conflict (improvement vs deterioration) out of all decision making sample pairs. The proposed method is compared with the latest objective space partitioning based on Pearson correlation coefficient conflict information. The results show that the proposed method outperforms the comparison method on identifying the conflicting objectives.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Schaffer, J.D.: Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of the 1st international Conference on Genetic Algorithms. pp. 93–100. L. Erlbaum Associates Inc. (1985)

    Google Scholar 

  2. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182–197 (2002)

    Article  Google Scholar 

  3. Coello, C.A.C., Pulido, G.T., Lechuga, M.S.: Handling multiple objectives with particle swarm optimization. IEEE Trans. Evol. Comput. 8, 256–279 (2004)

    Article  Google Scholar 

  4. Xiaohong, C., Xia, L., Na, W.: Objective reduction with sparse feature selection for many objectve optimization problem. Chin. J. Electron. 43, 1300–1307 (2015)

    Google Scholar 

  5. Li, B., Li, J., Tang, K., Yao, X.: Many-objective evolutionary algorithms: a survey. ACM Comput. Surv. (CSUR) 48, 1–35 (2015). Article no. 13

    Article  Google Scholar 

  6. Chand, S., Wagner, M.: Evolutionary many-objective optimization: a quick-start guide. Surv. Oper. Res. Manag. Sci. 20, 35–42 (2015)

    MathSciNet  Google Scholar 

  7. Schutze, O., Lara, A., Coello, C.A.C.: On the influence of the number of objectives on the hardness of a multi-objective optimization problem. IEEE Trans. Evol. Comput. 15, 444–455 (2011)

    Article  Google Scholar 

  8. Corne, D.W., Knowles, J.D.: Techniques for highly multi-objective optimization: some non-dominated points are better than others. In: Proceedings of the 9th annual conference on Genetic and evolutionary computation. pp. 773–780. ACM (2007)

    Google Scholar 

  9. von Lücken, C., Barán, B., Brizuela, C.: A survey on multi-objective evolutionary algorithms for many-objective problems. Comput. Optim. Appl. 58, 1–50 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. Aguirre, H., Tanaka, K.: Many-objective optimization by space partitioning and adaptive ε-ranking on MNK-landscapes. In: Ehrgott, M., Fonseca, C.M., Gandibleux, X., Hao, J.-K., Sevaux, M. (eds.) EMO 2009. LNCS, vol. 5467, pp. 407–422. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. Jaimes, L., Jaimes, L., Coello, C.A.C., Aguirre, H., anaka, K.: Objective space partitioning using conflict information for solving many-objective problems. Inf. Sci. 268, 305–327 (2014)

    Article  MathSciNet  Google Scholar 

  12. Carlsson, C., Fullér, R.: Multiple criteria decision making: the case for interdependence. Comput. Oper. Res. 22, 251–260 (1995)

    Article  MATH  Google Scholar 

  13. Deb, K., Saxena, D.: Searching for pareto-optimal solutions through dimensionality reduction for certain large-dimensional multi-objective optimization problems. In: Proceedings of the World Congress on Computational Intelligence (WCCI-2006). pp. 3352–3360 (2006)

    Google Scholar 

Download references

Acknowledgments

This work is supported by the National Natural Science Foundation of China (Grant No. 61171124, 61301298) and Shenzhen Key project for Foundation Research (JC201105170613A).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xia Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Luo, N., Luo, J., Li, X. (2016). Objective Space Partitioning with a Novel Conflict Information Measure for Many-Objective Optimization. In: Tan, Y., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2016. Lecture Notes in Computer Science(), vol 9712. Springer, Cham. https://doi.org/10.1007/978-3-319-41000-5_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-41000-5_60

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40999-3

  • Online ISBN: 978-3-319-41000-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics