A fuzzy tri-level decision making algorithm and its application in supply chain

In this paper, we develop a fuzzy tri-level decision making (FTLDM) model to deal with decentralized decision making problems with three levels of decision makers. Based on the -cut of fuzzy set, we transform an FTLDM problem into a multiobjective tri-level decision making problem. Based on the linear tri-level Kth-best algorithm, the global optimal solution can be obtained. A case study for third-party logistics decision making in supply chain is utilized to illustrate the effectiveness of the proposed algorithm. © 2013. The authors-Published by Atlantis Press

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

Multi crteria decision making and its applications : a literature review

This paper presents current techniques used in Multi Criteria Decision Making (MCDM) and their applications. Two basic approaches for MCDM, namely Artificial Intelligence MCDM (AIMCDM) and Classical MCDM (CMCDM) are discussed and investigated. Recent articles from international journals related to MCDM are collected and analyzed to find which approach is more common than the other in MCDM. Also, which area these techniques are applied to. Those articles are appearing in journals for the year 2008 only. This paper provides evidence that currently, both AIMCDM and CMCDM are equally common in MCDM

Tri-level decision-making with multiple followers: Model, algorithm and case study

© 2015 Elsevier Inc. Tri-level decision-making arises to address compromises among interacting decision entities distributed throughout a three-level hierarchy; these entities are respectively termed the top-level leader, the middle-level follower and the bottom-level follower. This study considers an uncooperative situation where multiple followers at the same (middle or bottom) level make their individual decisions independently but consider the decision results of their counterparts as references through information exchanged among themselves. This situation is called a reference-based uncooperative multi-follower tri-level (MFTL) decision problem which appears in many real-world applications. To solve this problem, we need to find an optimal solution achieving both the Stackelberg equilibrium in the three-level vertical structure and the Nash equilibrium among multiple followers at the same horizontal level. In this paper, we first propose a general linear MFTL decision model for this situation. We then develop a MFTL Kth-Best algorithm to find an optimal solution to the model. Since the optimal solution means a compromised result in the uncooperative situation and it is often imprecise or ambiguous for decision entities to identify their related satisfaction, we use a fuzzy programming approach to characterize and evaluate the solution obtained. Lastly, a real-world case study on production-inventory planning illustrates the effectiveness of the proposed MFTL decision techniques

Uncertainty Models in Reverse Supply Chain: A Review

Reverse logistic has become an important topic for the organization due to growing environmental concern, government regulation, economic value, and sustainable competitiveness. Uncertainty is one of the key factors in the reverse supply chain that must be controlled; thus, the company could optimize the reverse supply chain function. This paper discusses progress in reverse logistic research. A total of 72 published articles were selected, analyzed, categorized and the research gaps were found among them. The study began by analyzed previous research articles in reverse logistic. In this stage, we also collected and reviewed journals discussing about the reverse supply chain. Meanwhile, the result of this stage shows that uncertainty factor has not been reviewed in detail. The most common theme as the background research in reverse logistic is environmental and economic aspect. Uncertainty in Close Loop Supply Chain is the most widely used approach, followed by the usage on reverse logistics, reverse supply chain and reverse Model. The most used approach and method on uncertainty are Mixed Integer Linear Programing, mixed integer nonlinear Programing, Robust Fuzzy Stochastic Programming, and Improved kriging-assisted robust optimization method. Customer demand, total cost, product returns are the most widely researched aspects. This paper may be useful for academicians, researchers and practitioners in learning on reverse logistic and reverse supply chain; therefore, close loop supply chain can be guidance for upcoming researches. Research opportunity based on this research combines total cost, quality return product, truck capacity, delivery route, remanufacturing capacity, and facility location got optimum function in uncertainty. The research method and approach for MINLP, IK-MRO and RSFP provide many opportunities for research. For theme and area in reverse logistic, close loop supply chain is the theme that provides the most research opportunities

Solving tri-level programming problems using a particle swarm optimization algorithm

© 2015 IEEE. Tri-level programming, a special case of multilevel programming, arises to deal with decentralized decision-making problems that feature interacting decision entities distributed throughout three hierarchical levels. As tri-level programming problems are strongly NP-hard and the existing solution approaches lack universality in solving such problems, the purpose of this study is to propose an intelligence-based heuristic algorithm to solve tri-level programming problems involving linear and nonlinear versions. In this paper, we first propose a general tri-level programming problem and discuss related theoretical properties. A particle swarm optimization (PSO) algorithm is then developed to solve the tri-level programming problem. Lastly, a numerical example is adopted to illustrate the effectiveness of the proposed PSO algorithm

Multiobjective strategies for New Product Development in the pharmaceutical industry

New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline. Formally, the NPD problem can be stated as follows: select a set of R&D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while coping with the uncertain nature of the projects. More precisely, the recurrent key issues are to determine the projects to develop once target molecules have been identified, their order and the level of resources to assign. In this context, the proposed approach combines discrete event stochastic simulation (Monte Carlo approach) with multiobjective genetic algorithms (NSGAII type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management problem. In that context, Genetic Algorithms (GAs) are particularly attractive for treating this kind of problem, due to their ability to directly lead to the so-called Pareto front and to account for the combinatorial aspect. This work is illustrated with a study case involving nine interdependent new product candidates targeting three diseases. An analysis is performed for this test bench on the different pairs of criteria both for the bi- and tricriteria optimization: large portfolios cause resource queues and delays time to launch and are eliminated by the bi- and tricriteria optimization strategy. The optimization strategy is thus interesting to detect the sequence candidates. Time is an important criterion to consider simultaneously with NPV and risk criteria. The order in which drugs are released in the pipeline is of great importance as with scheduling problems

Multiobjective strategies for New Product Development in the pharmaceutical industry

New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline. Formally, the NPD problem can be stated as follows: select a set of R&D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while coping with the uncertain nature of the projects. More precisely, the recurrent key issues are to determine the projects to develop once target molecules have been identified, their order and the level of resources to assign. In this context, the proposed approach combines discrete event stochastic simulation (Monte Carlo approach) with multiobjective genetic algorithms (NSGAII type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management problem. In that context, Genetic Algorithms (GAs) are particularly attractive for treating this kind of problem, due to their ability to directly lead to the so-called Pareto front and to account for the combinatorial aspect. This work is illustrated with a study case involving nine interdependent new product candidates targeting three diseases. An analysis is performed for this test bench on the different pairs of criteria both for the bi- and tricriteria optimization: large portfolios cause resource queues and delays time to launch and are eliminated by the bi- and tricriteria optimization strategy. The optimization strategy is thus interesting to detect the sequence candidates. Time is an important criterion to consider simultaneously with NPV and risk criteria. The order in which drugs are released in the pipeline is of great importance as with scheduling problems