Extensions of TOPSIS for large scale multi-objective non-linear programming problems with block angular structure

This paper focuses on multi-objective large-scale non-linear programming (MOLSNLP) problems with block angular structure. We extend the technique for order preference by similarity ideal solution (TOPSIS) to solve them. Compromise (TOPSIS) control minimizes the measure of distance, provided that the closest solution should have the shortest distance from the positive ideal solution (PIS) as well as the longest distance from the negative ideal solution (NIS). As the measure of “closeness” L_P-metric is used. Thus, we reduce a q-dimensional objective space to a two-dimensional space by a first-order compromise procedure. The concept of a membership function of fuzzy set theory is used to represent the satisfaction level for both criteria. Moreover, we derive a single objective large-scale non-linear programming (LSNLP) problem using the max–min operator for the second-order compromise operation. Finally, a numerical illustrative example is given to clarify the main results developed in this paper.     

A method for group decision-making based on determining weights of decision makers using TOPSIS

In general, weights of decision makers (DMs) play a very important role in multiple attribute group decision-making (MAGDM), how to measure the weights of DMs is an interesting research topic. This paper presents a new approach for determining weights of DMs in group decision environment based on an extended TOPSIS (Technique for Order Preference by Similarity to an Ideal Solution) method. We define the positive ideal solution as the average of group decision. The negative ideal solution includes two parts: left and right negative ideal solution, which are the minimum and maximum matrixes of group decision, respectively. We give an example to illustrate the developed approach. Finally, the advantages and disadvantages of this study are also compared.     

A fuzzy closeness approach to fuzzy multi-attribute decision making

The aim of this paper is to develop a new fuzzy closeness (FC) methodology for multi-attribute decision making (MADM) in fuzzy environments, which is an important research field in decision science and operations research. The TOPSIS method based on an aggregating function representing “closeness to the ideal solution” is one of the well-known MADM methods. However, while the highest ranked alternative by the TOPSIS method is the best in terms of its ranking index, this does not mean that it is always the closest to the ideal solution. Furthermore, the TOPSIS method presumes crisp data while fuzziness is inherent in decision data and decision making processes, so that fuzzy ratings using linguistic variables are better suited for assessing decision alternatives. In this paper, a new FC method for MADM under fuzzy environments is developed by introducing a multi-attribute ranking index based on the particular measure of closeness to the ideal solution, which is developed from the fuzzy weighted Minkowski distance used as an aggregating function in a compromise programming method. The FC method of compromise ranking determines a compromise solution, providing a maximum “group utility” for the “majority” and a minimum individual regret for the “opponent”. A real example of a personnel selection problem is examined to demonstrate the implementation process of the method proposed in this paper.     

TOPSIS for bi-level MODM problems

TOPSIS (technique for order preference by similarity to ideal solution) is a multiple criteria method to identify solutions from a finite set of alternatives based upon simultaneous minimization of distance from an ideal point and maximization of distance from a nadir point. This paper proposes a fuzzy TOPSIS algorithm to solve bi-level multi-objective decision-making (BL-MODM) problems, and in which the objective function at each level are non-linear functions which are to be maximized. The proposed model for getting the satisfactory solution of the BL-MODM problems includes the membership functions for the upper level decision variables vector with possible tolerances, the membership function of the distance function from the positive ideal solution (PIS) and the membership function of the distance function from the negative ideal solution (NIS). A numerical illustrative example is given to clarify the proposed TOPSIS approach of this paper.     

模糊多属性决策的投影折衷方法

基于矢量投影的思想,导出了分量为L-R型梯形模糊数的模糊矢量投影的计算公式。通过将加权后的方案矢量投影到理想解上,再将负理想解投影到方案矢量上,进而在两个投影的基础上构建方案与理想解的相对贴近度,用以确定多属性决策方案的优劣次序。同时,本文以实例对这一决策方法进行了说明。     

基于TOPSIS的模糊群体多属性决策方法

针对模糊群体多属性决策问题,给出一种基于理想点法(TOPSIS)的多属性决策方法.方法先用三角模糊数的形式表示专家评价值的模糊性和不确定性,而后考虑了专家在不同评价属性中的重要程度和意见的相似度,并将专家意见进行集结得到专家群体关于方案集的模糊决策矩阵,最后定义了三角模糊数形式的正负理想方案,通过计算各方案与正负理想方案的距离以及各方案与理想点的相对接近度,最终确定最优方案.通过实例分析说明了该方法的可行性和有效性.     

基于区间直觉梯形模糊数的改进TOPSIS多属性决策方法

研究了属性权重完全未知的区间直觉梯形模糊数的多属性决策问题,结合TOPSIS方法定义了相对贴近度及总贴近度公式.首先由区间直觉梯形模糊数的Hamming距离给出了每个方案的属性与正负理想解的距离,基于此,给出了相对贴近度矩阵,根据所有决策方案的综合贴近度最小化建立多目标规划模型,从而确定属性的权重值,然后根据区间直觉梯形模糊数的加权算数平均算子求出各决策方案的总贴近度,根据总贴近度的大小对方案进行排序;最后,通过实例分析说明该方法的可行性和有效性.     

半群的模糊拟对称理想和它的根

本文定义了半群的模糊拟对称理想,研究了它和模糊素理想、模糊完全素理想之间的关系,并研究了它的根的特征     

基于理想灰关联距离的课程评估方法

综合灰色系统理论、理想解法和欧氏距离,提出了一种新的基于理想关联距离度的课程评估方法,给出了建立评估模型的基本步骤.定量处理的指标,经过理想化、标准化后,定义关联数,由此计算关联距离度.通过灰色关联距离度,建立了一种接近最优方案远离最差方案的评估模型.并通过学院近期的课程评估实例分析,验证了该方法的准确性和可行性.     

基于综合权重的理想模糊物元多属性决策法及应用

研究了属性指标具有不相容性和模糊性及其指标的权重完全未知的模糊多属性决策问题.分析了目前广泛采用的模糊物元分析法以及仅有主观赋权法或客观赋权法确定其指标权重的缺点.根据物元可拓理论和理想解法的思想,定义了理想模糊物元和负理想模糊物元的概念.利用兼顾主观偏好和客观信息的综合权重赋值法,提出了基于综合权重的理想模糊物元多属性决策方法.该法既能充分利用指标本身所包含的客观信息,又能充分发挥决策者的主观能动性.实例研究结果表明该法能反映出决策方案间的细微差别,能对决策方案的优劣做出更准确有效的评价.     

A type of fuzzy ring

In this study, by the use of Yuan and Lee’s definition of the fuzzy group based on fuzzy binary operation we give a new kind of fuzzy ring. The concept of fuzzy subring, fuzzy ideal and fuzzy ring homomorphism are introduced, and we make a theoretical study their basic properties analogous to those of ordinary rings.      

Interactive fuzzy programming approach to Bi-level quadratic fractional programming problems

In this paper we propose an interactive fuzzy programming method for obtaining a satisfactory solution to a “bi-level quadratic fractional programming problem” with two decision makers (DMs) interacting with their optimal solutions. After determining the fuzzy goals of the DMs at both levels, a satisfactory solution is efficiently derived by updating the satisfactory level of the DM at the upper level with consideration of overall satisfactory balance between both levels. Optimal solutions to the formulated programming problems are obtained by combined use of some of the proper methods. Theoretical results are illustrated with the help of a numerical example.     

Fuzzy理想和Fuzzy幂零根

本文给出了Ｆ—准素（ＦＷ—准素）理想的有限交是Ｆ－准素理想（ＦＷ－准素理想）的几个充分条件。此外，证明了［５］中定义的一个交换环Ｒ的Ｆｕｚｚｙ幂零根是Ｒ的幂零根Ｋ的特征函数Ｘ＿Ｋ。     

模糊多属性决策的直觉模糊集方法

基于直觉模糊集理论,提出了一种新的TOPSIS方法来研究模糊多属性决策问题。首先,根据直觉模糊集的几何意义,定义了两个直觉模糊集之间的距离,且每个备选方案的评价值用直觉模糊值表示;然后,根据TOPSIS原理,通过计算备选方案到直觉模糊正理想解和负理想解的距离,来确定备选方案的综合评价指数,以此判断方案的优劣次序。最后,通过一个具体实例说明该方法的有效性和具体应用过程。     

Some similarity measures of intuitionistic fuzzy sets and their applications to multiple attribute decision making

Atanassov (1986) defined the notion of intuitionistic fuzzy set, which is a generalization of the notion of Zadeh’ fuzzy set. In this paper, we first develop some similarity measures of intuitionistic fuzzy sets. Then, we define the notions of positive ideal intuitionistic fuzzy set and negative ideal intuitionistic fuzzy set. Finally, we apply the similarity measures to multiple attribute decision making under intuitionistic fuzzy environment.     

Fuzzy Ideal Based Computational Approach for Group Decision Making Problems

In this paper, we present a computational method to fuzzy group decision making problems. A function that satisfies the properties of fuzzy ideal of semiring of positive integers is also investigated in the present paper and is used for idealizing the group preference matrix obtained by different decision makers. The proposed method appears in form of simple computational algorithms to idealize the group preference matrix and calculating total order of preference relation. Finally, the suitability of the proposed method is shown by taking an example of a human resource development (HRD) event, where it is used to select the best possible candidate by different decision makers.     

On the use of divergence distance in fuzzy clustering

Clustering algorithms divide up a dataset into a set of classes/clusters, where similar data objects are assigned to the same cluster. When the boundary between clusters is ill defined, which yields situations where the same data object belongs to more than one class, the notion of fuzzy clustering becomes relevant. In this course, each datum belongs to a given class with some membership grade, between 0 and 1. The most prominent fuzzy clustering algorithm is the fuzzy c-means introduced by Bezdek (Pattern recognition with fuzzy objective function algorithms, 1981), a fuzzification of the k-means or ISODATA algorithm. On the other hand, several research issues have been raised regarding both the objective function to be minimized and the optimization constraints, which help to identify proper cluster shape (Jain et al., ACM Computing Survey 31(3):264–323, 1999). This paper addresses the issue of clustering by evaluating the distance of fuzzy sets in a feature space. Especially, the fuzzy clustering optimization problem is reformulated when the distance is rather given in terms of divergence distance, which builds a bridge to the notion of probabilistic distance. This leads to a modified fuzzy clustering, which implicitly involves the variance–covariance of input terms. The solution of the underlying optimization problem in terms of optimal solution is determined while the existence and uniqueness of the solution are demonstrated. The performances of the algorithm are assessed through two numerical applications. The former involves clustering of Gaussian membership functions and the latter tackles the well-known Iris dataset. Comparisons with standard fuzzy c-means (FCM) are evaluated and discussed.     

Fuzzy半群中的Fuzzy素理想

探讨Fuzzy半群中Fuzzy素理想,Fuzzy 完全理想与Fuzzy理想的根的一些代数性质,证明Fuzzy半群中每一个Fuzzy理想是Fuzzy完全半素理想当且仅当它可表为一族Fuzzy完全素理想之交。     

Fuzzy Strongly Implicative Ideals in BCI－Algebras(Ⅱ)

For the homomorphic image f(μ) and preimage f-1(υ) of fuzzy strongly implicative ideals μ and υ,respectively, we establish the chains of level strongly implicative ideals of f(μ) and f-1(υ),respectively. We construct a new fuzzy strongly implicative ideal from old. Finally,we consider the normality of a fuzzy strongly implicative ideal in a BCI-algebra.     

Comparison of first aggregation and last aggregation in fuzzy group TOPSIS

The Technique for Order Preference by Similarity to the Ideal Solution (TOPSIS), one of the major multi attribute decision making (MADM) techniques, ranks the alternatives according to their distances from the ideal and the negative ideal solution. In real evaluation and decision making problems, it is vital to involve several people and experts from different functional areas in decision making process. Also under many conditions, crisp data are inadequate to model real-life situations, since human judgments including preferences are often vague and cannot estimate his preference with an exact numerical value. Therefore aggregation of fuzzy concept, group decision making and TOPSIS methods that we denote “fuzzy group TOPSIS” is more practical than original TOPSIS.