Skip to main content

Investigating Fractal Decomposition Based Algorithm on Low-Dimensional Continuous Optimization Problems

  • Conference paper
  • First Online:
Metaheuristics (MIC 2022)

Abstract

This paper analyzes the performance of the Fractal Decomposition Algorithm (FDA) metaheuristic applied to low-dimensional continuous optimization problems. This algorithm was originally developed specifically to deal efficiently with high-dimensional continuous optimization problems by building a fractal-based search tree with a branching factor linearly proportional to the number of dimensions. Here, we aim to answer the question of whether FDA could be equally effective for low-dimensional problems. For this purpose, we evaluate the performance of FDA on the Black Box Optimization Benchmark (BBOB) for dimensions 2, 3, 5, 10, 20, and 40. The experimental results show that overall the FDA in its current form does not perform well enough. Among different function groups, FDA shows its best performance on Misc. moderate and Weak structure functions.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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

References

  1. Auger, A., Hansen, N.: Performance evaluation of an advanced local search evolutionary algorithm. In: 2005 IEEE Congress on Evolutionary Computation, vol. 2, pp. 1777–1784. IEEE (2005)

    Google Scholar 

  2. Bosman, P.A., Grahl, J., Thierens, D.: Amalgam ideas in noiseless black-box optimization benchmarking. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, pp. 2247–2254 (2009)

    Google Scholar 

  3. García-Martínez, C., Lozano, M.: A continuous variable neighbourhood search based on specialised EAs: application to the noiseless BBO-benchmark 2009. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, pp. 2287–2294 (2009)

    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. Optim. Methods Softw. 36, 114–144 (2021). https://doi.org/10.1080/10556788.2020.1808977

    Article  MathSciNet  MATH  Google Scholar 

  5. Hansen, N.: Benchmarking a bi-population CMA-ES on the BBOB-2009 function testbed. In: Proceedings of the 11th annual conference companion on genetic and evolutionary computation conference: late breaking papers, pp. 2389–2396 (2009)

    Google Scholar 

  6. Hansen, N., Finck, S., Ros, R., Auger, A.: Real-parameter black-box optimization benchmarking 2009: Noiseless functions definitions. Ph.D. thesis, INRIA (2009)

    Google Scholar 

  7. Hornby, G.S.: Steady-state alps for real-valued problems. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 795–802 (2009)

    Google Scholar 

  8. Korošec, P., Šilc, J.: A stigmergy-based algorithm for black-box optimization: noiseless function testbed. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, pp. 2295–2302 (2009)

    Google Scholar 

  9. Kubalik, J.: Black-box optimization benchmarking of prototype optimization with evolved improvement steps for noiseless function testbed. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, pp. 2303–2308 (2009)

    Google Scholar 

  10. Molina, D., Lozano, M., Herrera, F.: A memetic algorithm using local search chaining for black-box optimization benchmarking 2009 for noisy functions. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, pp. 2359–2366 (2009)

    Google Scholar 

  11. Nakib, A., Ouchraa, S., Shvai, N., Souquet, L., Talbi, E.G.: Deterministic metaheuristic based on fractal decomposition for large-scale optimization. Appl. Soft Comput. 61, 468–485 (2017)

    Article  Google Scholar 

  12. Nakib, A., Souquet, L., Talbi, E.G.: Parallel fractal decomposition based algorithm for big continuous optimization problems. J. Parallel Distrib. Comput. 133, 297–306 (2019)

    Article  Google Scholar 

  13. Pošík, P.: Bbob-benchmarking a simple estimation of distribution algorithm with cauchy distribution. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, pp. 2309–2314 (2009)

    Google Scholar 

  14. Price, K.V.: Differential evolution vs. the functions of the 2/sup nd/ICEO. In: Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC’97), pp. 153–157. IEEE (1997)

    Google Scholar 

  15. Ros, R.: Benchmarking sep-CMA-ES on the BBOB-2009 function testbed. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, pp. 2435–2440 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arcadi Llanza .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 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

Llanza, A., Shvai, N., Nakib, A. (2023). Investigating Fractal Decomposition Based Algorithm on Low-Dimensional Continuous Optimization Problems. In: Di Gaspero, L., Festa, P., Nakib, A., Pavone, M. (eds) Metaheuristics. MIC 2022. Lecture Notes in Computer Science, vol 13838. Springer, Cham. https://doi.org/10.1007/978-3-031-26504-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-26504-4_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-26503-7

  • Online ISBN: 978-3-031-26504-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics