A -Cut and Goal-Programming-Based Algorithm for Fuzzy-Linear Multiple-Objective Bilevel Optimization

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 bi...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on fuzzy systems Ročník 18; číslo 1; s. 1 - 13
Hlavní autori: Gao, Ya, Zhang, Guangquan, Ma, Jun, Lu, Jie
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.02.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithm design and analysis
Australia Council
Bilevel programming
Civil engineering
Decision making
Energy management
Fuzzy sets
goal programming
Information technology
Linear programming
Logistics
multiple-objective linear programming
optimization
Performance analysis
ISSN:1063-6706, 1941-0034
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1063-6706
1941-0034
DOI:10.1109/TFUZZ.2009.2030329