ranking fuzzy numbers plays a very important role in decision making and some other fuzzy application systems. many different methods have been proposed to deal with ranking fuzzy numbers. constructing ranking indexes based on the centroid of fuzzy numbers is an important case. but some weaknesses are found in these indexes. the purpose of this paper is to give a new ranking index to rank vario...

in this paper, we propose a new approach for ranking all fuzzynumbers based on revising the ranking method proposed by ezzati et al. cite{ezzati}.to this end, we present and investigate some properties of the proposed approach indetails. finally, to illustrate the advantage of the proposed method, it is applied to several groups of fuzzy numbers and the results are compared with other related a...

in models of data envelopment analysis (dea), an optimal set of weights is generally assumed to represent the assessed decision making unit (dmu) in the best light in comparison to all the other dmus, and so there is an optimal set of weights corresponding to each dmu. the present paper, proposes a three stage method to determine one common set of weights for decision making units. then, we use...

ranking fuzzy numbers plays a very important role in linguistic decision making and other fuzzy application systems. in spite of many ranking methods, no one can rank fuzzy numbers with human intuition consistently in all cases. shortcoming are found in some of the convenient methods for ranking triangular fuzzy numbers such as the coefficient of variation (cv index), distance between fuzzy set...

one of the difficulties of data envelopment analysis(dea) is the problem of deciency discriminationamong efficient decision making units(dmus) and hence, yielding large number of dmus as efficientones. the main purpose of this paper is to overcome this inability. one of the methods for rankingefficient dmus is minimizing the coefficient of variation (cv) for inputs-outputs weights. in this pap...

we give an algorithm, called t*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.first the nodes of the graph are labeled according to the topologicalordering. then for node i an ordered list of simple s − i paths iscreated. the length of the list is at most k and it is created by usingtournament trees. we prove the correctness of t* and ...

This paper presents a bibliometric assessment of Canadian institutions in the discipline of Electrical and Computer Engineering (ECE) from 1996 to 2006. The paper is a first step in identifying the top institutions over a 10-year period in Canada. The rankings are calculated using three metrics: (1) simple count of papers, (2) journal impact factors, and (3) journal impact factor of each instit...

The purpose of this article is to introduce a new scheme for robust multivariate ranking by making use of a not so familiar notion called monotonicity. Under this scheme, as in the case of classical outward ranking, we get an increasing sequence of regions diverging away from a central region (may be a single point) as nucleus. The nuclear region may be deened as the median region.

Given the multidimensional nature of climate change issues, decision-making in adaptation is a complex process, and suitable decision support methods are needed. The aim this paper was to rank saltwater intrusion options for farmers two provinces central coastal region Vietnam using analytical hierarchy process method. Data analysis were obtained through literature review, field observations, f...