A Fully Bayesian Approach to Bilevel Problems

The mathematical models of many real-world decision-making problems contain two levels of optimization. In these models, one of the optimization problems appears as a constraint of the other one, called follower and leader, respectively. These problems are known as bilevel optimization problems (BOPs) in mathematical programming and are widely studied by both classical and evolutionary optimization communities. The nested nature of these problems causes many difficulties such as non-convexity and disconnectedness for traditional methods, and requires a huge number of function evaluations for evolutionary algorithms. This paper proposes a fully Bayesian optimization approach, called FB-BLO. We aim to reduce the necessary function evaluations for both upper and lower level problems by iteratively approximating promising solutions with Gaussian process surrogate models at both levels. The proposed FB-BLO algorithm uses the other decision-makers’ observations in its Gaussian process model to leverage the correlation between decisions and objective values. This allows us to extract knowledge from previous decisions for each level. The algorithm has been evaluated on numerous benchmark problems and compared with existing state-of-the-art algorithms. Our evaluation demonstrates the success of our proposed FB-BLO algorithm in terms of both effectiveness and efficiency.