An Efficient Ranking Technique for Intuitionistic Fuzzy Numbers with Its Application in Chance Constrained Bilevel Programming

The aim of this paper is to develop a new ranking technique for intuitionistic fuzzy numbers using the method of defuzzification based on probability density function of the corresponding membership function, as well as the complement of nonmembership function. Using the proposed ranking technique a methodology for solving linear bilevel fuzzy stochastic programming problem involving normal intuitionistic fuzzy numbers is developed. In the solution process each objective is solved independently to set the individual goal value of the objectives of the decision makers and thereby constructing fuzzy membership goal of the objectives of each decision maker. Finally, a fuzzy goal programming approach is considered to achieve the highest membership degree to the extent possible of each of the membership goals of the decision makers in the decision making context. Illustrative numerical examples are provided to demonstrate the applicability of the proposed methodology and the achieved results are compared with existing techniques

Stochastic Multilevel Programming with a Hybrid Intelligent Algorithm

A framework of stochastic multilevel programming is proposed for modelling decentralized decision-making problem in stochastic environment. According to different decision criteria, the stochastic decentralized decision-making problem is formulated as expected value multilevel programming, and chanceconstrained multilevel programming. In order to solve the proposed stochastic multilevel programming models for the Stackelberg-Nash equilibriums, genetic algorithms, neural networks and stochastic simulation are integrated to produce a hybrid intelligent algorithm. Finally, two numerical examples are provided to illustrate the effectiveness of the hybrid intelligent algorithm

Fuzzy Random Noncooperative Two-level Linear Programming through Absolute Deviation Minimization Using Possibility and Necessity

This paper considers fuzzy random two-level linear programming problems under noncooperative behaviorof the decision makers. Having introduced fuzzy goals of decision makers together with the possibiliy and necessity measure, following absolute deviation minimization, fuzzy random two-level programin problems are transformed into deterministic ones. Extended Stackelberg solutions are introduced andcomputational methods are also presented

Fuzzy multilevel programming with a hybrid intelligent algorithm

AbstractIn order to model fuzzy decentralized decision-making problem, fuzzy expected value multilevel programming and chance-constrained multilevel programming are introduced. Furthermore, fuzzy simulation, neural network, and genetic algorithm are integrated to produce a hybrid intelligent algorithm for finding the Stackelberg-Nash equilibrium. Finally, two numerical examples are provided to illustrate the effectiveness of the hybrid intelligent algorithm

Modeling Decision Systems via Uncertain Programming

By uncertain programming we mean the optimization theory in generally uncertain (random, fuzzy, rough, fuzzy random, etc.) environments. The main purpose of this paper is to present a brief review on uncertain programming models, and classify them into three broad classes: expected value model, chanceconstrained programming and dependent-chance programming. This presentation is based on the book: B. Liu, Theory and Practice of Uncertain Programming, PhisicaVerlag, Heidelberg, 200

An analytics-based heuristic decomposition of a bilevel multiple-follower cutting stock problem

This paper presents a new class of multiple-follower bilevel problems and a heuristic approach to solving them. In this new class of problems, the followers may be nonlinear, do not share constraints or variables, and are at most weakly constrained. This allows the leader variables to be partitioned among the followers. We show that current approaches for solving multiple-follower problems are unsuitable for our new class of problems and instead we propose a novel analytics-based heuristic decomposition approach. This approach uses Monte Carlo simulation and k-medoids clustering to reduce the bilevel problem to a single level, which can then be solved using integer programming techniques. The examples presented show that our approach produces better solutions and scales up better than the other approaches in the literature. Furthermore, for large problems, we combine our approach with the use of self-organising maps in place of k-medoids clustering, which significantly reduces the clustering times. Finally, we apply our approach to a real-life cutting stock problem. Here a forest harvesting problem is reformulated as a multiple-follower bilevel problem and solved using our approachThis publication has emanated from research conducted with the financial support of Science Foundation Ireland (SFI) under Grant Number SFI/12/RC/228

Fuzzy Bi-level Decision-Making Techniques: A Survey

© 2016 the authors. Bi-level decision-making techniques aim to deal with decentralized management problems that feature interactive decision entities distributed throughout a bi-level hierarchy. A challenge in handling bi-level decision problems is that various uncertainties naturally appear in decision-making process. Significant efforts have been devoted that fuzzy set techniques can be used to effectively deal with uncertain issues in bi-level decision-making, known as fuzzy bi-level decision-making techniques, and researchers have successfully gained experience in this area. It is thus vital that an instructive review of current trends in this area should be conducted, not only of the theoretical research but also the practical developments. This paper systematically reviews up-to-date fuzzy bi-level decisionmaking techniques, including models, approaches, algorithms and systems. It also clusters related technique developments into four main categories: basic fuzzy bi-level decision-making, fuzzy bi-level decision-making with multiple optima, fuzzy random bi-level decision-making, and the applications of bi-level decision-making techniques in different domains. By providing state-of-the-art knowledge, this survey paper will directly support researchers and practitioners in their understanding of developments in theoretical research results and applications in relation to fuzzy bi-level decision-making techniques

Bi-level optimization based on fuzzy if-then rule

A bi-level programming problem has been developed where the functional relationship linking decision variables and the objective functions of leader and follower are not utterly well known to us. Because of the uncertainty in practical life decision-making situation most of the time it is inconvenient to find the veracious relationship between the objective functions of leader, follower and the decision variables. It is expected that the source of information which gives some command about the objective functions of leader and follower, is composed by a block of fuzzy if-then rules. In order to analyze the model, A dynamic programming approach with a suitable fuzzy reasoning scheme is applied to calculate the deterministic functional relationship linking the decision variables and the objective functions of leader as well as follower. Thus a bi-level programming problem is constructed from the actual fuzzy rule-based to the conventional bi-level programming problem. To solve the final problem, we use the lingo software to find the optimal of objective function of follower first and using its solution we optimize the objective function of leader. A numerical example has been solved to signify the computational procedure.</p

An Evolutionary Algorithm Using Duality-Base-Enumerating Scheme for Interval Linear Bilevel Programming Problems

Interval bilevel programming problem is hard to solve due to its hierarchical structure as well as the uncertainty of coefficients. This paper is focused on a class of interval linear bilevel programming problems, and an evolutionary algorithm based on duality bases is proposed. Firstly, the objective coefficients of the lower level and the right-hand-side vector are uniformly encoded as individuals, and the relative intervals are taken as the search space. Secondly, for each encoded individual, based on the duality theorem, the original problem is transformed into a single level program simply involving one nonlinear equality constraint. Further, by enumerating duality bases, this nonlinear equality is deleted, and the single level program is converted into several linear programs. Finally, each individual can be evaluated by solving these linear programs. The computational results of 7 examples show that the algorithm is feasible and robust