A ${\bm \lambda}$-Cut and Goal-Programming-Based Algorithm for Fuzzy-Linear Multiple-Objective Bilevel Optimization

Citation data:

IEEE Transactions on Fuzzy Systems, ISSN: 1063-6706, Vol: 18, Issue: 1, Page: 1-13

Publication Year:
2010
Usage 57
Abstract Views 50
Downloads 7
Captures 11
Readers 11
Citations 27
Citation Indexes 27
Repository URL:
http://ro.uow.edu.au/eispapers/6755
DOI:
10.1109/tfuzz.2009.2030329
Author(s):
Gao, Ya; Zhang, Guangquan; Ma, Jun; Lu, Jie
Publisher(s):
Institute of Electrical and Electronics Engineers (IEEE)
Tags:
Engineering; Computer Science; Mathematics; optimization; λ-cut; bilevel; algorithm; goal-programming-based; fuzzy-linear; multiple-objective; Science and Technology Studies
article description
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.