A λ-cut and goal-programming-based algorithm for fuzzy-linear multiple-objective bilevel optimization

Publication Type:
Journal Article
Citation:
IEEE Transactions on Fuzzy Systems, 2010, 18 (1), pp. 1 - 13
Issue Date:
2010-02-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2009008589_Gao.pdf315.46 kB
Adobe PDF
Bilevel-programming techniques are developed to handle decentralized problems with two-level decision makers, which are leaders and followers, who may have more than one objective to achieve. This paper proposes a λ-cut and goal-programming-based algorithm to solve fuzzy-linear multiple-objective bilevel (FLMOB) decision problems. First, based on the definition of a distance measure between two fuzzy vectors using λ-cut, a fuzzy-linear bilevel goal (FLBG) model is formatted, and related theorems are proved. Then, using a λ-cut for fuzzy coefficients and a goal-programming strategy for multiple objectives, a λ-cut and goal-programming-based algorithm to solve FLMOB decision problems is presented. A case study for a newsboy problem is adopted to illustrate the application and executing procedure of this algorithm. Finally, experiments are carried out to discuss and analyze the performance of this algorithm. © 2006 IEEE.
Please use this identifier to cite or link to this item: