基于vague集投影及距离的模糊多指标决策

提出了两个vague值投影和距离的概念,并在此基础上给出了考虑指标权重影响的基于vague集投影和距离的多指标模糊决策方法.在这个方法中,利用候选方案在理想方案上的投影和距离来求出最佳方案.此方法与文献现有的应用vague集相似度度量进行决策的方法相比较,新方法更加合理且弥补了现有方法的不足之处.最后对实例进行分析计算,算例验证了该方法的有效性.     

Operation properties and -equalities of complex fuzzy sets

A complex fuzzy set is a fuzzy set whose membership function takes values in the unit circle in the complex plane. This paper investigates various operation properties and proposes a distance measure for complex fuzzy sets. The distance of two complex fuzzy sets measures the difference between the grades of two complex fuzzy sets as well as that between the phases of the two complex fuzzy sets. This distance measure is then used to define δ-equalities of complex fuzzy sets which coincide with those of fuzzy sets already defined in the literature if complex fuzzy sets reduce to real-valued fuzzy sets. Two complex fuzzy sets are said to be δ-equal if the distance between them is less than 1-δ. This paper shows how various operations between complex fuzzy sets affect given δ-equalities of complex fuzzy sets. An example application of signal detection demonstrates the utility of the concept of δ-equalities of complex fuzzy sets in practice.     

Vague集上的正规距离与正规相似度

距离与相似度是Vague集上的一对对偶概念,给出了Vague集上加强的距离的公理化定义,引入了正规距离与正规相似度的概念,提出了Vague集上距离的一个一般公式,通过对Vague值的探讨给出了该一般公式成为正规距离的充分条件,同时得到Vague集上的一个新的正规距离公式.最后通过数据分析得出由此正规距离公式生成的正规相似度是合理有效的.     

基于Vague集的群决策方法研究

首先介绍了Vague集的基本概念,将直觉模糊集的一些运算规则重新在Vague集上作了定义,提出用Vague值表示的九级语言术语集.接着指出衡量Vague集(值)相似度要考虑的三个因素,提出了新的度量方法.在同时考虑专家决策结果的一致性和专家权重的基础上,提出了汇总各专家Vague意见的方法.最后以一个案例说明了所提出的方法.     

基于Vague集的PROMETHEE-Ⅱ

PROMETHEE是应用广泛的多属性决策方法之一.研究了PROMETHEE-Ⅱ的Vague集方法,首先定义了Vague集的减法,然后提出了Vague集的PROMETHEE-Ⅱ,并给出具体的算例.     

Totally ordered uncertain sets

It is known that some uncertain sets have membership functions, and some do not. How do we judge whether an uncertain set has a membership function? In order to answer this question, this paper presents a concept of totally ordered uncertain set, and shows that totally ordered uncertain sets always have membership functions if they are defined on a continuous uncertainty space. In addition, some criteria for judging the existence of membership functions for uncertain sets are provided. Several inspiring examples and counterexamples are also documented in this paper.     

An interactive fuzzy satisficing method for structured multiobjective linear fractional programs with fuzzy numbers

In this paper, by considering the experts' vague or fuzzy understanding of the nature of the parameters in the problem formulation process, multiobjective linear fractional programming problems with block angular structure involving fuzzy numbers are formulated. Using the a-level sets of fuzzy numbers, the corresponding nonfuzzy a-multiobjective linear fractional programming problem is introduced. The fuzzy goals of the decision maker for the objective functions are quantified by eliciting the corresponding membership functions including nonlinear ones. Through the introduction of extended Pareto optimality concepts, if the decision maker specifies the degree a and the reference membership values, the corresponding extended Pareto optimal solution can be obtained by solving the minimax problems for which the Dantzig-Wolfe decomposition method and Ritter's partitioning procedure are applicable. Then a linear programming-based interactive fuzzy satisficing method with decomposition procedures for deriving a satisficing solution for the decision maker efficiently from an extended Pareto optimal solution set is presented. An illustrative numerical example is provided to demonstrate the feasibility of the proposed method.     

An interactive fuzzy satisficing method for multiobjective 0–1 programming problems with fuzzy numbers through genetic algorithms with double strings

In this paper, by considering the experts' vague or fuzzy understanding of the nature of the parameters in the problem-formulation process, multiobjective 0–1 programming problems involving fuzzy numbers are formulated. Using the a-level sets of fuzzy numbers, the corresponding nonfuzzy α-programming problem is introduced. The fuzzy goals of the decision maker (DM) for the objective functions are quantified by eliciting the corresponding linear membership functions. Through the introduction of an extended Pareto optimality concept, if the DM specifies the degree α and the reference membership values, the corresponding extended Pareto optimal solution can be obtained by solving the augmented minimax problems through genetic algorithms with double strings. Then an interactive fuzzy satisficing method for deriving a satisficing solution for the DM efficiently from an extended Pareto optimal solution set is presented. An illustrative numerical example is provided to demonstrate the feasibility and efficiency of the proposed method.     

An efficient and flexible mechanism for constructing membership functions

This paper introduces a Bézier curve-based mechanism for constructing membership functions of convex normal fuzzy sets. The mechanism can fit any given data set with a minimum level of discrepancy. In the absence of data, the mechanism can be intuitively manipulated by the user to construct membership functions with the desired shape. Some numerical experiments are included to compare the performance of the proposed mechanism with conventional methods.     

基于多Agent的车间任务招投标粗模糊集建模研究

首先通过相识集、招标集、投标集和任务集的概念 ,描述制造执行系统中的调度 Agent与资源 A-gent间任务招投标过程模型 ;基于任务的属性和资源 Agent完成任务的成本、质量、负荷和时间等属性 ,定义论域上的模糊集 ,将模糊集中的隶属度函数作为粗集的属性 ,在模糊集上作截集 ,从而获得系统的分类知识 ;收集样本数据 ,构造并分析决策表 ,进而获得调度 Agent调度决策知识 ;应用调度知识进行推理 ,从争取获得招标任务的若干个资源 Agent中 ,选出最适合招标任务的中标者 .     

New operations over hesitant fuzzy sets

Hesitant fuzzy sets are considered to be the way to characterize vague phenomenon. Their study has opened a new area of research and applications. Set operations on them lead to a number of properties of these sets which are not evident in classical (crisp) sets make the area mathematically also very productive. Since these sets are defined in terms of functions and set of functions, which is not the case when the sets are crisp, it is possible to define several set operations. Such a study enriches the use of these sets. In this paper, four new operations are envisaged, defined and taken up to study a score of new identities on hesitant fuzzy sets.     

粗糙Vague集及其相似度量

对粗糙V ague集的基本操作和性质进行了研究。另外,对粗糙V ague集的相似度量问题进行研究,首先构造一种粗糙V ague值的相似度函数并给出其基本性质,然后给出一种粗糙V ague集的相似度函数以及一种粗糙V ague集的加权相似度函数。     

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.     

Vague集TOPSIS方法在方案优选中的应用

指出Vague集理论中现有距离度量的不足之处以及Vague集距离度量的基本准则,建立新的距离公式,给出建立在该距离公式基础上的TOPSIS方法,并将其应用到方案选优的实例中,得到合理的结论.     

A new design of the elimination and choice translating reality method for multi-criteria group decision-making in an intuitionistic fuzzy environment

The purpose of this paper is to design a new extension of the ELECTRE, known as the elimination and choice translating reality method, for multi-criteria group decision-making problems based on intuitionistic fuzzy sets. This method is widely utilized when a set of alternatives should be identified and evaluated with respect to a set of conflicting criteria by reflecting decision makers’ (DMs’) preferences. However, handling the exact data and numerical measure is difficult to be precisely focused because the DMs’ judgments are often vague in real-life decision problems and applications. A more realistic and practical approach can be to use linguistic variables expressed in intuitionistic fuzzy numbers instead of numerical data to model DMs’ judgments and to describe the inputs in the ELECTRE method. The proposed intuitionsitic fuzzy ELECTRE utilizes the truth-membership function and non-truth-membership function to indicate the degrees of satisfiability and non-satisfiability of each alternative with respect to each criterion and the relative importance of each criterion, respectively. Then, a new discordance intuitionistic index is introduced, which is extended from the concept of the fuzzy distance measure. Outranking relations are defined by pairwise comparisons and a decision graph is depicted to determine which alternative is preferable, incomparable or indifferent in the intuitionistic fuzzy environment. Finally, a comprehensive sensitivity analysis is employed to further study regarding the impact of threshold values on the final evaluation, and a comparative analysis is demonstrated with an application example in flexible manufacturing systems between the proposed ELECTRE method and the existing intuitionistic fuzzy technique for order preference by similarity to ideal solution (IF-TOPSIS) method.     

Competitive algorithms for the clustering of noisy data

In this paper, we consider the issue of clustering when outliers exist. The outlier set is defined as the complement of the data set. Following this concept, a specially designed fuzzy membership weighted objective function is proposed and the corresponding optimal membership is derived. Unlike the membership of fuzzy c-means, the derived fuzzy membership does not reduce with the increase of the cluster number. With the suitable redefinition of the distance metric, we demonstrate that the objective function could be used to extract c spherical shells. A hard clustering algorithm alleviating the prototype under-utilization problem is also derived. Artificially generated data are used for comparisons.     

基于模糊语言的多属性联系数决策方法

针对属性权重已知,属性值以模糊语言给出的多属性决策问题,提出了一种基于模糊语言标度的区间数表示形式,并利用集对分析方法将区间数进行转化为联系数的表示方式,通过联系数中同、异、反的关系,给出相应集势值,由集势值的大小进行择优排序.最后,通过实例分析,验证了该方法的可行性和有效性.     

On the nearest parametric approximation of a fuzzy number

Many nearest parametric approximation methods of fuzzy sets are proposed in the literature. It is clear that the specific approximations may lead to the loss of information about fuzziness. To overcome this problem, most of these methods rely on the minimization of the distance between the original fuzzy set and its approximation. But these approximations mostly are not flexible to the decision maker's choice. Hence, in this paper, we offer a parametric fuzzy approximation method based on the decision maker's strategy as an extension of trapezoidal approximation of a fuzzy number. This method comprises the selection of the form of the parametric membership function and its evaluation.     

On agreement forests

Tree rearrangement operations are widely used to measure the dissimilarity between phylogenetic trees with identical leaf sets. The tree bisection and reconnection (tbr) distance for unrooted trees can be equivalently defined in terms of agreement forests. For both the tbr distance and the less general subtree prune and regraft (spr) distance, we use such forests to derive new upper and lower bounds on the maximal possible distance between two trees with n leaves.