Temat: bilevel programming

Skocz do pozycji: 1.

Tytuł:: A new genetic approach for transport network design and optimization
Autorzy:: Dinu, S.
Bordea, G.
Tematy:: genetic algorithm
bilevel programming
Network Design Problem
complex-encoding; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Powiązania:: https://bibliotekanauki.pl/articles/200177.pdf Link otwiera się w nowym oknie
Opis:: This paper presents an improved Genetic Algorithm to solve the Transportation Network Design Problem (CTNDP) with interactions among different links. The CTNDP is formulated in an optimal design as a bi-level programming model. A key factor in the present approach is the combination of diploid based complex-encoding with meiosis specific features. The novel mutation operator proposed is another improvement that leads to a better robustness and convergence stability. The computational results obtained by comparing the performance of the proposed algorithm and other Genetic Algorithms for a test network demonstrates its better local searching ability, as well as its high efficiency. Finally, suggestions for further research and extensions are given.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 2.

Tytuł:: Fuzzy programming for multi-choice bilevel transportation problem
Autorzy:: Arora, Ritu
Gupta, Kavita
Tematy:: bilevel programming
transportation problem
fuzzy programming
goal programming
tolerance limit
satisfactory solution; Pokaż więcej
Wydawca:: Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Powiązania:: https://bibliotekanauki.pl/articles/2100292.pdf Link otwiera się w nowym oknie
Opis:: Multi-choice programming problems arise due to the diverse needs of people. In this paper, multichoice optimization has been applied to the bilevel transportation problem. This problem deals with transportation at both the levels, upper as well as lower. There are multiple choices for demand and supply parameters. The multi-choice parameters at the respective levels are converted into polynomials which transmute the defined problem into a mixed integer programming problem. The objective of the paper is to determine a solution methodology for the transformed problem. The significance of the formulated model is exhibited through an example by applying it to the hotel industry. The fuzzy programming approach is employed to obtain a satisfactory solution for the decision-makers at the two levels. A comparative analysis is presented in the paper by solving the bilevel multi-choice transportation problem with goal programming mode as well as by the linear transformation technique. The example is solved using computing software.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 3.

Tytuł:: Combined Reformulation of Bilevel Programming Problems
Autorzy:: Pilecka, Maria
Tematy:: bilevel programming
value function reformulation
KKT reformulation
constraint qualifications
optimality conditions; Pokaż więcej
Wydawca:: Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Powiązania:: https://bibliotekanauki.pl/articles/1373548.pdf Link otwiera się w nowym oknie
Opis:: In J. J. Ye and D. L. Zhu proposed a new reformulation of a bilevel programming problem which compounds the value function and KKT approaches. In partial calmness condition was also adapted to this new reformulation and optimality conditions using partial calmness were introduced. In this paper we investigate above all local equivalence of the combined reformulation and the initial problem and how constraint qualifications and optimality conditions could be defined for this reformulation without using partial calmness. Since the optimal value function is in general nondifferentiable and KKT constraints have MPEC-structure, the combined reformulation is a nonsmooth MPEC. This special structure allows us to adapt some constraint qualifications and necessary optimality conditions from MPEC theory using disjunctive form of the combined reformulation. An example shows, that some of the proposed constraint qualifications can be fulfilled.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 4.

Tytuł:: Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem
Autorzy:: Arora, R.
Gupta, K.
Tematy:: bilevel programming
indefinite quadratic programming
multi-objective programming
pay-off matrix
Taylor series approximation
LINGO 17.0; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Powiązania:: https://bibliotekanauki.pl/articles/1403683.pdf Link otwiera się w nowym oknie
Opis:: Bilevel programming problem is a non-convex two stage decision making process in which the constraint region of upper level is determined by the lower level problem. In this paper, a multi-objective indefinite quadratic bilevel programming problem (MOIQBP) is presented. The defined problem (MOIQBP) has multi-objective functions at both the levels. The followers are independent at the lower level. A fuzzy goal programming methodology is employed which minimizes the sum of the negative deviational variables of both the levels to obtain highest membership value of each of the fuzzy goal. The membership function for the objective functions at each level is defined. As these membership functions are quadratic they are linearized by Taylor series approximation. The membership function for the decision variables at both levels is also determined. The individual optimal solution of objective functions at each level is used for formulating an integrated pay-off matrix. The aspiration levels for the decision makers are ascertained from this matrix. An algorithm is developed to obtain a compromise optimal solution for (MOIQBP). A numerical example is exhibited to evince the algorithm. The computing software LINGO 17.0 has been used for solving this problem.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 5.

Tytuł:: Branch and bound algorithm for discrete multi- level linear fractional programming problem
Autorzy:: Arora, R.
Gupta, K.
Tematy:: linear fractional programming problem
bilevel programming
multilevel programming
discrete variables
integer solution
branch and bound cut
programowanie dwustopniowe
programowanie wielopoziomowe
zmienne dyskretne; Pokaż więcej
Wydawca:: Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Powiązania:: https://bibliotekanauki.pl/articles/406478.pdf Link otwiera się w nowym oknie
Opis:: An algorithm is proposed to find an integer solution for bilevel linear fractional programming problem with discrete variables. The method develops a cut that removes the integer solutions which are not bilevel feasible. The proposed method is extended from bilevel to multilevel linear fractional programming problems with discrete variables. The solution procedure for both the algorithms is elucidated in the paper.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 6.

Tytuł:: Robust bi-level optimization for an opportunistic supply chain network design problem in an uncertain and risky environment
Autorzy:: Golpîra, H.
Tematy:: supply chain management
production-distribution planning
conditional value at risk
bilevel programming
robust optimization
KKT conditions
zarządzanie łańcuchem dostaw
planowanie produkcji
planowanie dystrybucji
optymalizacja
warunki KKT; Pokaż więcej
Wydawca:: Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Powiązania:: https://bibliotekanauki.pl/articles/406601.pdf Link otwiera się w nowym oknie
Opis:: This paper introduces the problem of designing a single-product supply chain network in an agile manufacturing setting under a vendor managed inventory (VMI) strategy to seize a new market oppor-tunity. The problem addresses the level of risk aversion of the retailer when dealing with the uncertainty of market related information through a conditional value at risk (CVaR) approach. This approach leads to a bilevel programming problem. The Karush–Kuhn–Tucker (KKT) conditions are employed to trans-form the model into a single-level, mixed-integer linear programming problem by considering some relaxations. Since realizations of imprecisely known parameters are the only information available, a data-driven approach is employed as a suitable, more practical, methodology of avoiding distribu-tional assumptions. Finally, the effectiveness of the proposed model is demonstrated through a numer-ical example
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Informacja

Wyszukujesz frazę "bilevel programming" wg kryterium: Temat