Stochastic bilevel programming with multiple followers: a solution approach using the systematic sampling evolutionary method

Abstract

A stochastic bilevel programming problem with multiple followers is presented in this article. Such kinds of problem are computationally difficult and efficient algorithms are lacking thanks to the randomness properties in the problem setting, its hierarchical structure and the expected simultaneous decision at the followers' level for each strategy of the leader. This article proposes a systematic sampling evolutionary algorithm that is established on a sample average approximation, a systematic sampling technique and particle swarm optimization integrated with an iterated method. The solution procedure is implemented and its effectiveness is tested on a variety of illustrative examples from the literature and on carefully constructed problems. The simulation results show that the proposed method is promising and can be used to solve a variety of complex stochastic bilevel programming problems with multiple followers.

Keywords:

• Bilevel programming with multiple followers
• Stackelberg–Nash equilibrium
• sample average approximation
• systematic sampling

Disclosure statement

No potential conflict of interest was reported by the author(s).