Juergen Branke
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Juergen Branke has a total of 148 co-authors. Here are the top co-authors by number of shared publications:
- Danial Yazdani
School of Computing Technologies, RMIT University, Melbourne, Australia
12 shared publications - Xin Yao
Lingnan University
8 shared publications - Juan Ungredda
University of Warwick, Coventry, UK
7 shared publications - Ivo Couckuyt
Ghent University, Ghent, Belgium
5 shared publications - Sebastian Rojas Gonzalez
Ghent University, Ghent, Belgium
5 shared publications - Trung Thanh Nguyen
Liverpool John Moores University
5 shared publications
Latest Publications
- 23 August 2026
- Published by Springer Nature
- p. 350-366
Preference Guided Multiobjective Bayesian Optimization with Aspiration and Reservation Levels
- 23 August 2026
- Published by Springer Nature
- p. 350-366
Preference Guided Multiobjective Bayesian Optimization with Aspiration and Reservation Levels
- 1 August 2026
- Published by Elsevier in International Journal of Production Economics
- Vol. 301
Resilient supplier selection and order allocation under disruption risk over a Wasserstein ambiguity
- 1 August 2026
- Published by Elsevier in International Journal of Production Economics
- Vol. 301
Resilient supplier selection and order allocation under disruption risk over a Wasserstein ambiguity
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1669-1687
Bayesian Optimization
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1669-1687
Open AccessBayesian Optimization
- Open Access
- 15 June 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 337 (1) , 140-151
How much harder are indifference adjustments? An experiment on the cognitive effort in multi-criteria decisions
- 15 June 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 337 (1) , 140-151
Open AccessHow much harder are indifference adjustments? An experiment on the cognitive effort in multi-criteria decisions
- Open Access
- 17 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 52 (1) , 1-30
Algorithm 1060: EDOLAB, a Platform for Research and Education in Evolutionary Dynamic Optimization
Many real-world optimization problems exhibit dynamic characteristics, posing significant challenges for traditional optimization methods. Evolutionary Dynamic Optimization Algorithms (EDOAs) have been developed to address these challenges by adapting to changing environments over time. However, the reproducibility and consistency of experimental results in the literature remain limited due to the lack of publicly available source codes and the complexity of accurately re-implementing algorithms and performance evaluation protocols. To support the community, we introduce E volutionary D ynamic O ptimization LAB oratory (EDOLAB), an open source MATLAB platform designed for both research and educational purposes. EDOLAB includes 27 EDOAs, four highly configurable benchmark generators, and a growing suite of performance indicators. The platform supports full parameter tuning, batch experiment management, parallel execution, and automated statistical comparisons—including rankings, significance testing, box plots, and performance trend visualizations over time. An educational application allows users to observe: (a) dynamic changes in a 2D problem landscape, (b) the movement of individuals in response to these changes, and (c) the ability of an algorithm to track moving optima. By providing an integrated environment for experimentation, benchmarking, and instructional use, EDOLAB promotes reproducibility, comparative analysis, and a deeper understanding of EDOAs in dynamic environments.
- 17 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 52 (1) , 1-30
Open AccessAlgorithm 1060: EDOLAB, a Platform for Research and Education in Evolutionary Dynamic Optimization
Many real-world optimization problems exhibit dynamic characteristics, posing significant challenges for traditional optimization methods. Evolutionary Dynamic Optimization Algorithms (EDOAs) have been developed to address these challenges by adapting to changing environments over time. However, the reproducibility and consistency of experimental results in the literature remain limited due to the lack of publicly available source codes and the complexity of accurately re-implementing algorithms and performance evaluation protocols. To support the community, we introduce E volutionary D ynamic O ptimization LAB oratory (EDOLAB), an open source MATLAB platform designed for both research and educational purposes. EDOLAB includes 27 EDOAs, four highly configurable benchmark generators, and a growing suite of performance indicators. The platform supports full parameter tuning, batch experiment management, parallel execution, and automated statistical comparisons—including rankings, significance testing, box plots, and performance trend visualizations over time. An educational application allows users to observe: (a) dynamic changes in a 2D problem landscape, (b) the movement of individuals in response to these changes, and (c) the ability of an algorithm to track moving optima. By providing an integrated environment for experimentation, benchmarking, and instructional use, EDOLAB promotes reproducibility, comparative analysis, and a deeper understanding of EDOAs in dynamic environments.
- Open Access
Maximizing Reliability with Bayesian Optimization
Bayesian optimization (BO) is a popular, sample-efficient technique for expensive, black-box optimization. One such problem arising in manufacturing is that of maximizing the reliability, or equivalently minimizing the probability of a failure, of a design which is subject to random perturbations - a problem that can involve extremely rare failures ($P_\mathrm{fail} = 10^{-6}-10^{-8}$). In this work, we propose two BO methods based on Thompson sampling and knowledge gradient, the latter approximating the one-step Bayes-optimal policy for minimizing the logarithm of the failure probability. Both methods incorporate importance sampling to target extremely small failure probabilities. Empirical results show the proposed methods outperform existing methods in both extreme and non-extreme regimes.
Open AccessMaximizing Reliability with Bayesian Optimization
Bayesian optimization (BO) is a popular, sample-efficient technique for expensive, black-box optimization. One such problem arising in manufacturing is that of maximizing the reliability, or equivalently minimizing the probability of a failure, of a design which is subject to random perturbations - a problem that can involve extremely rare failures ($P_\mathrm{fail} = 10^{-6}-10^{-8}$). In this work, we propose two BO methods based on Thompson sampling and knowledge gradient, the latter approximating the one-step Bayes-optimal policy for minimizing the logarithm of the failure probability. Both methods incorporate importance sampling to target extremely small failure probabilities. Empirical results show the proposed methods outperform existing methods in both extreme and non-extreme regimes.
- Open Access
Bayesian Optimisation: Which Constraints Matter?
Bayesian optimisation has proven to be a powerful tool for expensive global black-box optimisation problems. In this paper, we propose new Bayesian optimisation variants of the popular Knowledge Gradient acquisition functions for problems with \emph{decoupled} black-box constraints, in which subsets of the objective and constraint functions may be evaluated independently. In particular, our methods aim to take into account that often only a handful of the constraints may be binding at the optimum, and hence we should evaluate only relevant constraints when trying to optimise a function. We empirically benchmark these methods against existing methods and demonstrate their superiority over the state-of-the-art.
Open AccessBayesian Optimisation: Which Constraints Matter?
Bayesian optimisation has proven to be a powerful tool for expensive global black-box optimisation problems. In this paper, we propose new Bayesian optimisation variants of the popular Knowledge Gradient acquisition functions for problems with \emph{decoupled} black-box constraints, in which subsets of the objective and constraint functions may be evaluated independently. In particular, our methods aim to take into account that often only a handful of the constraints may be binding at the optimum, and hence we should evaluate only relevant constraints when trying to optimise a function. We empirically benchmark these methods against existing methods and demonstrate their superiority over the state-of-the-art.
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1006-1024
Bayesian Optimization
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1006-1024
Open AccessBayesian Optimization
- Open Access
- 19 January 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 324 (1) , 308-323
Dynamic pharmaceutical product portfolio management with flexible resource profiles
- 19 January 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 324 (1) , 308-323
Open AccessDynamic pharmaceutical product portfolio management with flexible resource profiles