Abstract
Bilevel optimization problems are characterized by a hierarchical leader-follower structure, in which the leader desires to optimize her own strategy taking the response of the follower into account. These problems are referred to as Stackelberg problems in the domain of game theory, and as bilevel problems in the domain of mathematical programming. In a number of practical scenarios, a bilevel problem is solved by a leader who needs to take multiple objectives into account and simultaneously deal with the decision uncertainty involved in modeling the follower's behavior. Such problems are often encountered in strategic product design, homeland security applications, and taxation policy. However, the hierarchical nature makes the problem difficult to solve and they are commonly simplified by assuming a deterministic setup with smooth objective functions. In this paper, we focus our attention on the development of a flexible evolutionary algorithm for solving multicriterion bilevel problems with lower level (follower) decision uncertainty. The performance of the algorithm is evaluated in a comparative study on a number of test problems. In addition to the numerical experiments, we consider two real-world examples from the field of environmental economics and management to illustrate how the framework can be used to obtain optimal strategies.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.