Skip to main content
SpringerLink
Log in

A Fast Incremental BSP Tree Archive for Non-dominated Points

  • Conference paper
  • First Online:
Evolutionary Multi-Criterion Optimization (EMO 2017)

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

Included in the following conference series:

Abstract

Maintaining an archive of all non-dominated points is a standard task in multi-objective optimization. Sometimes it is sufficient to store all evaluated points and to obtain the non-dominated subset in a post-processing step. Alternatively the non-dominated set can be updated on the fly. While keeping track of many non-dominated points efficiently is easy for two objectives, we propose an efficient algorithm based on a binary space partitioning (BSP) tree for the general case of three or more objectives. Our analysis and our empirical results demonstrate the superiority of the method over the brute-force baseline method, as well as graceful scaling to large numbers of objectives.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Notes

  1. 1.

    http://www.ini.rub.de/PEOPLE/glasmtbl/code/ParetoArchive/.

  2. 2.

    http://bbcomp.ini.rub.de.

  3. 3.

    This is usually sufficient for the needs of evolutionary optimization. In data base query problems larger sets must be processed. Hence in some applications memory consumption is still a concern.

  4. 4.

    For \(a>0\) the values \(a=0.1\), \(a=0.2\), \(a=0.5\), and \(a=1\) were used with \(m=2\), \(m=3\), \(m=5\), and \(m=10\) objectives, respectively.

  5. 5.

    http://shark-ml.org.

References

  1. De Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.C.: Computational Geometry. Springer, Heidelberg (2000)

    Book  MATH  Google Scholar 

  2. Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: Congress on Evolutionary Computation (CEC 2002), pp. 825–830. IEEE (2002)

    Google Scholar 

  3. Fieldsend, J.E., Everson, R.M., Singh, S.: Using unconstrained elite archives for multi-objective optimization. IEEE Trans. Evol. Comput. 7(3), 305–323 (2003)

    Article  Google Scholar 

  4. Fortin, F.A., Grenier, S., Parizeau, M.: Generalizing the improved run-time complexity algorithm for non-dominated sorting. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) (2013)

    Google Scholar 

  5. Igel, C., Hansen, N., Roth, S.: Covariance matrix adaptation for multi-objective optimization. Evol. Comput. 15(1), 1–28 (2007)

    Article  Google Scholar 

  6. Igel, C., Heidrich-Meisner, V., Glasmachers, T.: Shark. J. Mach. Learn. Res. 9, 993–996 (2008)

    MATH  Google Scholar 

  7. Jensen, M.T.: Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms. IEEE Trans. Evol. Comput. 7(5), 503–515 (2003)

    Article  Google Scholar 

  8. Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: an online algorithm for skyline queries. In: Proceedings of the 28th International Conference on Very Large Data Bases, VLDB Endowment, pp. 275–286 (2002)

    Google Scholar 

  9. Krause, O., Glasmachers, T., Hansen, N., Igel, C.: Unbounded population MO-CMA-ES for the bi-objective BBOB test suite. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) (2016)

    Google Scholar 

  10. Kung, H.-T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. J. ACM (JACM) 22(4), 469–476 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  11. López-Ibáñez, M., Knowles, J., Laumanns, M.: On sequential online archiving of objective vectors. In: Takahashi, R.H.C., Deb, K., Wanner, E.F., Greco, S. (eds.) EMO 2011. LNCS, vol. 6576, pp. 46–60. Springer, Heidelberg (2011). doi:10.1007/978-3-642-19893-9_4

    Chapter  Google Scholar 

  12. Lukasiewycz, M., Glaß, M., Haubelt, C., Teich, J.: Symbolic archive representation for a fast nondominance test. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 111–125. Springer, Heidelberg (2007). doi:10.1007/978-3-540-70928-2_12

    Chapter  Google Scholar 

  13. Mostaghim, S., Teich, J., Tyagi, A.: Comparison of data structures for storing pareto-sets in MOEAs. In: Proceedings of the 2002 Congress on Evolutionary Computation (CEC), vol. 1, pp. 843–848. IEEE (2002)

    Google Scholar 

  14. Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 467–478. ACM (2003)

    Google Scholar 

  15. Robson, J.M.: The height of binary search trees. Aust. Comput. J. 11, 151–153 (1979)

    MathSciNet  Google Scholar 

  16. Schütze, O.: A new data structure for the nondominance problem in multi-objective optimization. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds.) EMO 2003. LNCS, vol. 2632, pp. 509–518. Springer, Heidelberg (2003). doi:10.1007/3-540-36970-8_36

    Chapter  Google Scholar 

  17. Voß, T., Hansen, N., Igel, C.: Improved step size adaptation for the MO-CMA-ES. In: 12th Annual Conference on Genetic and Evolutionary Computation (GECCO), pp. 487–494. ACM (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Neural Computation, Ruhr-University Bochum, Bochum, Germany

    Tobias Glasmachers

Authors
  1. Tobias Glasmachers
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tobias Glasmachers .

Editor information

Editors and Affiliations

  1. University of Münster, Münster, Germany

    Heike Trautmann

  2. TU Dortmund University, Dortmund, Germany

    Günter Rudolph

  3. University of Wuppertal, Wuppertal, Germany

    Kathrin Klamroth

  4. CINVESTAV-IPN, Mexico City, Mexico

    Oliver Schütze

  5. Clemson University, Clemson, South Carolina, USA

    Margaret Wiecek

  6. University of Surrey, Guildford, United Kingdom

    Yaochu Jin

  7. University of Münster, Münster, Germany

    Christian Grimme

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Glasmachers, T. (2017). A Fast Incremental BSP Tree Archive for Non-dominated Points. In: Trautmann, H., et al. Evolutionary Multi-Criterion Optimization. EMO 2017. Lecture Notes in Computer Science(), vol 10173. Springer, Cham. https://doi.org/10.1007/978-3-319-54157-0_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-54157-0_18

  • Published:

  • Publisher Name: Springer, Cham

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

  • Online ISBN: 978-3-319-54157-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation