A new solution algorithm for solving rule-sets based bilevel decision problems
- Publication Type:
- Journal Article
- Concurrency Computation, 2015, 27 (4), pp. 830 - 854
- Issue Date:
Files in This Item:
|A New Solution Algorithm for Solving Rule-Sets based Bi-level Decision Problems 2015.pdf||630.14 kB|
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is open access.
Copyright © 2012 John Wiley & Sons, Ltd. Copyright © 2012 John Wiley & Sons, Ltd. Bilevel decision addresses compromises between two interacting decision entities within a given hierarchical complex system under distributed environments. Bilevel programming typically solves bilevel decision problems. However, formulation of objectives and constraints in mathematical functions is required, which are difficult, and sometimes impossible, in real-world situations because of various uncertainties. Our study develops a rule-set based bilevel decision approach, which models a bilevel decision problem by creating, transforming and reducing related rule sets. This study develops a new rule-sets based solution algorithm to obtain an optimal solution from the bilevel decision problem described by rule sets. A case study and a set of experiments illustrate both functions and the effectiveness of the developed algorithm in solving a bilevel decision problem.
Please use this identifier to cite or link to this item: