A Novel Approach to Solve Multi-objective Fuzzy Stochastic Bilevel Programming Using Genetic Algorithm

A bilevel programming is a two-level optimization problem, namely, the upper level (leaders) and the lower level (followers). The two level’s decision variables are entwined with each other which increases the complexity to obtain the global solution for both the optimization problems. Each level ai...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operations Research Forum Ročník 5; číslo 1; s. 11
Hlavní autoři: Dutta, S., Acharya, S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cham Springer International Publishing 01.03.2024
Springer Nature B.V
Témata:
ISSN:2662-2556, 2662-2556
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A bilevel programming is a two-level optimization problem, namely, the upper level (leaders) and the lower level (followers). The two level’s decision variables are entwined with each other which increases the complexity to obtain the global solution for both the optimization problems. Each level aims to optimize their own objective function under the given constraints at both the levels. To reduce the complexity partial cooperation between the two levels has been exploited in obtaining the Pareto solution. A novel solution procedure is proposed for a multi-objective fuzzy stochastic bilevel programming (MOFSBLP) problem is studied and solved using genetic algorithm. In this paper, previous information of the lower level is used as a fuzzy stochastic constraints in the upper level along with its constraints. Then with the solution of the combine constraints, the lower level solution is evaluated. The proposed solution procedure is illustrated by a numerical example taken from Zheng et al., and results are compared. A simpler version is solved using GAMs software to analyze the result of the numerical example. The proposed method highlights the importance of partial cooperation in solving bilevel programming problem. The advantage of the proposed solution method is that it creates common constraint space which helps in convergence of the algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2662-2556
2662-2556
DOI:10.1007/s43069-024-00294-z