Multiobjective optimization on a budget of 250 evaluations. In engineering and other `real-world’ applications, multiobjective optimization problems must frequently be tackled on a tight evaluation budget -- tens or hundreds of function evaluations, rather than thousands. In this paper, we investigate two algorithms that use advanced initialization and search strategies to operate better under these conditions. The first algorithm, Bin_MSOPS, uses a binary search tree to divide up the decision space, and tries to sample from the largest empty regions near `fit’ solutions. The second algorithm, ParEGO, begins with solutions in a latin hypercube and updates a Gaussian processes surrogate model of the search landscape after every function evaluation, which it uses to estimate the solution of largest expected improvement. The two algorithms are tested using a benchmark suite of nine functions of two and three objectives -- on a budget of only 250 function evaluations each, in total. Results indicate that the two algorithms search the space in very different ways and this can be used to understand performance differences. Both algorithms perform well but ParEGO comes out on top in seven of the nine test cases after 100 function evaluations, and on six after the first 250 evaluations.

References in zbMATH (referenced in 31 articles )

Showing results 1 to 20 of 31.
Sorted by year (citations)

1 2 next

  1. Bernd Bischl, Jakob Richter, Jakob Bossek, Daniel Horn, Janek Thomas, Michel Lang: mlrMBO: A Modular Framework for Model-Based Optimization of Expensive Black-Box Functions (2017) arXiv
  2. Davins-Valldaura, Joan; Moussaoui, Saïd; Pita-Gil, Guillermo; Plestan, Franck: ParEGO extensions for multi-objective optimization of expensive evaluation functions (2017)
  3. Feliot, Paul; Bect, Julien; Vazquez, Emmanuel: A Bayesian approach to constrained single- and multi-objective optimization (2017)
  4. Steponavičė, Ingrida; Hyndman, Rob J.; Smith-Miles, Kate; Villanova, Laura: Dynamic algorithm selection for Pareto optimal set approximation (2017)
  5. Akhtar, Taimoor; Shoemaker, Christine A.: Multi objective optimization of computationally expensive multi-modal functions with RBF surrogates and multi-rule selection (2016)
  6. Martínez-Frutos, Jesús; Herrero-Pérez, David: Kriging-based infill sampling criterion for constraint handling in multi-objective optimization (2016)
  7. Binois, M.; Ginsbourger, D.; Roustant, O.: Quantifying uncertainty on Pareto fronts with Gaussian process conditional simulations (2015)
  8. Mlakar, Miha; Petelin, Dejan; Tušar, Tea; Filipič, Bogdan: GP-DEMO: differential evolution for multiobjective optimization based on Gaussian process models (2015)
  9. Picheny, Victor: Multiobjective optimization using Gaussian process emulators via stepwise uncertainty reduction (2015)
  10. Rakshit, Pratyusha; Konar, Amit: Differential evolution for noisy multiobjective optimization (2015)
  11. Couckuyt, Ivo; Deschrijver, Dirk; Dhaene, Tom: Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization (2014)
  12. Kaliszewski, I.; Miroforidis, J.: Two-sided Pareto front approximations (2014)
  13. Kunakote, Tawatchai; Bureerat, Sujin: Surrogate-assisted multiobjective evolutionary algorithms for structural shape and sizing optimisation (2013)
  14. Lovison, Alberto: Global search perspectives for multiobjective optimization (2013)
  15. Auger, Anne; Bader, Johannes; Brockhoff, Dimo; Zitzler, Eckart: Hypervolume-based multiobjective optimization: theoretical foundations and practical implications (2012)
  16. Charalampakis, Aristotelis E.: Registrar: a complete-memory operator to enhance performance of genetic algorithms (2012)
  17. Gorissen, Dirk; Couckuyt, Ivo; Laermans, Eric; Dhaene, Tom: Multiobjective global surrogate modeling, dealing with the 5-percent problem (2010)
  18. Jakobsson, Stefan; Patriksson, Michael; Rudholm, Johan; Wojciechowski, Adam: A method for simulation based optimization using radial basis functions (2010)
  19. Klinkenberg, Jan-Willem; Emmerich, Michael T.M.; Deutz, André H.; Shir, Ofer M.; Bäck, Thomas: A reduced-cost SMS-EMOA using kriging, self-adaptation, and parallelization (2010)
  20. Eskandari, Hamidreza; Geiger, Christopher D.: Evolutionary multiobjective optimization in noisy problem environments (2009)

1 2 next