Skip to main content
SpringerLink
Log in

On the Latent Structure of the bbob-biobj Test Suite

  • Conference paper
  • First Online:
Applications of Evolutionary Computation (EvoApplications 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14635))

  • 114 Accesses

Abstract

Landscape analysis is a popular method for the characterization of black-box optimization problems. It consists of a sequence of operations that, from a limited sample of solutions, approximate and describe the hypersurfaces formed by characteristic problem properties. The hypersurfaces, called problem landscapes, are described by sets of carefully crafted features that ought to capture their characteristic properties. In this way, arbitrary optimization problems with potentially very different technical parameters, such as search space dimensionality, are projected into specific feature spaces where they can be further studied. The representation of a problem in a feature space can be used, for example, to find similar problems and identify metaheuristic optimization algorithms that have the best track record on the same type of tasks. Because of that, the quality and properties of problem representation in the feature spaces gain importance. In this work, we study the representation properties of the popular bbob-biobj test suite in the space of bi-objective features, analyze the structure naturally emerging in the feature space, and analyze the high-level properties of the projection. The obtained results clearly demonstrate the discrepancies between the latent structure of the test suite and its expert perception.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Bandyopadhyay, S., Saha, S.: Unsupervised Classification: Similarity Measures, Classical and Metaheuristic Approaches, and Applications. Springer (2012). https://doi.org/10.1007/978-3-642-32451-2

    Article  Google Scholar 

  2. Brockhoff, D., Auger, A., Hansen, N., Tušar, T.: Using well-understood single-objective functions in multiobjective black-box optimization test suites. Evol. Comput. 30(2), 165–193 (2022). https://doi.org/10.1162/evco_a_00298

    Article  Google Scholar 

  3. Fonseca, C.M.: Multiobjective genetic algorithms with application to control engineering problems. Ph.D. thesis, University of Sheffield (1995)

    Google Scholar 

  4. Hansen, N., Auger, A., Ros, R., Mersmann, O., Tušar, T., Brockhoff, D.: COCO: a platform for comparing continuous optimizers in a black-box setting. Optimiz. Methods Softw. 36(1), 114–144 (2021). https://doi.org/10.1080/10556788.2020.1808977

    Article  MathSciNet  Google Scholar 

  5. Hansen, N., Finck, S., Ros, R., Auger, A.: Real-parameter black-box optimization benchmarking 2009: Noiseless functions definitions. Research Report RR-6829, INRIA (2009). https://hal.inria.fr/inria-00362633

  6. Kerschke, P., Trautmann, H.: The R-Package FLACCO for exploratory landscape analysis with applications to multi-objective optimization problems. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 5262–5269. IEEE (2016). https://doi.org/10.1109/CEC.2016.7748359

  7. Kerschke, P., Trautmann, H.: Automated algorithm selection on continuous black-box problems by combining exploratory landscape analysis and machine learning. Evol. Comput. 27(1), 99–127 (2019). https://doi.org/10.1162/evco_a_00236

    Article  Google Scholar 

  8. Lang, R.D., Engelbrecht, A.P.: An exploratory landscape analysis-based benchmark suite. Algorithms 14(3), 78 (2021). https://doi.org/10.3390/a14030078

    Article  MathSciNet  Google Scholar 

  9. Liang, J.J., Suganthan, P.N., Qu, B.Y., Gong, D.W., Yue, C.T.: Problem definitions and evaluation criteria for the CEC 2020 special session on multimodal multiobjective optimization. Technical Report 201912, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China and Nanyang Technological University, Singapore (2019)

    Google Scholar 

  10. Liefooghe, A., Verel, S., Lacroix, B., Zăvoianu, A.C., McCall, J.: Landscape features and automated algorithm selection for multi-objective interpolated continuous optimisation problems. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 421–429. ACM (2021). https://doi.org/10.1145/3449639.3459353

  11. Van der Maaten, L., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9(11), 2579–2605 (2008). https://jmlr.org/papers/v9/vandermaaten08a.html

  12. Malan, K.M., Moser, I.: Constraint handling guided by landscape analysis in combinatorial and continuous search spaces. Evol. Comput. 27(2), 267–289 (2019). https://doi.org/10.1162/evco_a_00222

    Article  Google Scholar 

  13. Malan, K.M.: A survey of advances in landscape analysis for optimisation. Algorithms 14(2), 40 (2021). https://doi.org/10.3390/a14020040

    Article  MathSciNet  Google Scholar 

  14. McKay, M.D., Beckman, R.J., Conover, W.J.: A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 42(1), 55–61 (2000). https://doi.org/10.2307/1271432

    Article  Google Scholar 

  15. Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., Rudolph, G.: Exploratory landscape analysis. In: Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference (GECCO), pp. 829–836. ACM (2011). https://doi.org/10.1145/2001576.2001690

  16. Pikalov, M., Mironovich, V.: Automated parameter choice with exploratory landscape analysis and machine learning. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) Companion, pp. 1982–1985. ACM (2021). https://doi.org/10.1145/3449726.3463213

  17. Pitzer, E., Affenzeller, M.: A comprehensive survey on fitness landscape analysis. In: Fodor, J.C., Klempous, R., Suárez Araujo, C.P. (eds.) Recent Advances in Intelligent Engineering Systems, Studies in Computational Intelligence, vol. 378, pp. 161–191. Springer (2012). https://doi.org/10.1007/978-3-642-23229-9_8

  18. Renau, Q., Doerr, C., Dreo, J., Doerr, B.: Exploratory landscape analysis is strongly sensitive to the sampling strategy. In: Bäck, T., et al. (eds.) Parallel Problem Solving from Nature - PPSN XVI, pp. 139–153. Springer (2020). https://doi.org/10.1007/978-3-030-58115-2_10

  19. Richter, H.: Fitness landscapes: From evolutionary biology to evolutionary computation. In: Richter, H., Engelbrecht, A. (eds.) Recent Advances in the Theory and Application of Fitness Landscapes, pp. 3–31. Springer (2014). https://doi.org/10.1007/978-3-642-41888-4_1

  20. Tanabe, R.: Benchmarking feature-based algorithm selection systems for black-box numerical optimization. IEEE Trans. Evolutionary Comput. 1321–1335 (2022). https://doi.org/10.1109/TEVC.2022.3169770

  21. Trajanov, R., Dimeski, S., Popovski, M., Korošec, P., Eftimov, T.: Explainable landscape analysis in automated algorithm performance prediction. In: Jiménez Laredo, J.L., Hidalgo, J.I., Babaagba, K.O. (eds.) Applications of Evolutionary Computation, EvoApplications 2022, pp. 207–222. Springer (2022). https://doi.org/10.1007/978-3-031-02462-7_14

Download references

Acknowledgment

This work is part of the project “Constrained Multiobjective Optimization Based on Problem Landscape Analysis” co-funded by the Czech Science Foundation (grant no. GF22-34873K) and the Slovenian Research and Innovation Agency (project no. N2-0254). Furthermore, the Czech authors acknowledge support from the Student Grant System, grants no. SP2024/006 and SP2024/007, VSB – Technical University of Ostrava, and the Slovenian authors acknowledge additional financial support from the Slovenian Research and Innovation Agency (research core funding no. P2-0209). The publication is also based upon work from COST Action CA22137 “Randomised Optimisation Algorithms Research Network” (ROAR-NET), supported by European Cooperation in Science and Technology (COST).

Author information

Authors and Affiliations

  1. VSB - Technical University of Ostrava, Ostrava, Czech Republic

    Pavel Krömer & Vojtěch Uher

  2. Jožef Stefan Institute, Ljubljana, Slovenia

    Tea Tušar & Bogdan Filipič

  3. Jožef Stefan International Postgraduate School, Ljubljana, Slovenia

    Tea Tušar & Bogdan Filipič

Authors
  1. Pavel Krömer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vojtěch Uher
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tea Tušar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bogdan Filipič
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pavel Krömer .

Editor information

Editors and Affiliations

  1. University of York, York, UK

    Stephen Smith

  2. University of Coimbra, Coimbra, Portugal

    João Correia

  3. University of Málaga, Málaga, Spain

    Christian Cintrano

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Krömer, P., Uher, V., Tušar, T., Filipič, B. (2024). On the Latent Structure of the bbob-biobj Test Suite. In: Smith, S., Correia, J., Cintrano, C. (eds) Applications of Evolutionary Computation. EvoApplications 2024. Lecture Notes in Computer Science, vol 14635. Springer, Cham. https://doi.org/10.1007/978-3-031-56855-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-56855-8_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-56854-1

  • Online ISBN: 978-3-031-56855-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation