Solving Bilevel Multicriterion Optimization Problems With Lower Level Decision Uncertainty

doi:10.1109/TEVC.2015.2443057

Solving Bilevel Multicriterion Optimization Problems With Lower Level Decision Uncertainty

2016-04-01

47

PRE

AI

DOI：10.1109/TEVC.2015.2443057

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Bilevel optimization

decision uncertainty

evolutionary algorithms

Stackelberg programming

Solving Bilevel Multicriterion Optimization Problems With Lower Level Decision Uncertainty

Abstract

AI Summary

Journal

Organization