A Comparison of Discrete Algorithms for Fuzzy Weighted Average

Abstract

Fuzzy weighted average (FWA), which can be applied to various fields such as engineering design, decision analysis, etc., and as function of fuzzy numbers, is suitable for the problem of multiple occurrences of fuzzy parameters. Additional fuzziness may be introduced in the -cut arithmetic. This paper reviews and compares discrete algorithms for the FWAs in both theoretical comparison and numerical comparisons, as opposed to the linear programming algorithms that may be efficient but require the help of linear programming software. An alternative efficient algorithm is also proposed. The algorithm introduces an all-candidate (criteria ratings) weights-replaced benchmark adjusting procedure other than a binary (dichotomy) search in the existing methods. The theoretical worst-case comparison shows that the algorithms of Guu and Guh et al. and our alternative algorithm require the same order of calculation complexity ( ), where is the number of FWA terms. Yet, the Guh et al. algorithm always requires 2 ( 1) calculations to be performed. The algorithm of Guu requires the elemental comparison complexity ( ), and is superior to the other algorithms, in the worst case. On the other hand, our alternative algorithm and Lee and Park algorithm have the same comparison complexity ( log ). Yet, our alternative algorithm requires ( ) calculation complexity which is better than ( log ) of the Lee and Park algorithm. The numerical experiments show that the algorithm of Guu and our alternative algorithm generally perform and converge faster by requiring fewer calculations than that of Lee and Park's algorithm. The alternative algorithm requires a slightly smaller number of calculations than that of the Guu algorithm, due to the use of the convergent benchmark adjustment procedure rather than a somewhat fixed binary search. Conversely, in the number of element comparisons, Lee and Park's algorithm is shown numerically generally slightly better than the alternative algorithm due to the simple binary search scheme used. The alternative algorithm also requires fewer comparisons than that of the Guu algorithm. Furthermore, in comparison of the average CPU time requirements, the ranks of the results of these algorithms are consistent with those of the algorithms for the average numbers of calculations. In general, the alternative algorithm may provide an efficient alternative algorithm to the FWAs. In the worse-case situation, the Guu algorithm still may be considered as an efficient alternative.Index Terms--cut arithmetic, fuzzy arithmetic, fuzzy number, fuzzy weighted average (FWA).

A Fuzzy Query Method Based on Human-Readable Rules for Predicting Protein Stability Changes

“…(ii) Fuzzy numbers [21,22] are utilized to represent linguistic terms and (iii) fuzzy weighted average (FWA) [23][24][25] is applied to calculate the confidence level of a rule.…”

Simulation of discrete linear time-invariant fuzzy dynamic systems

“…Both algorithms require an additional routine to locate internal optimums, which can be done either analytically or numerically with an algorithm suited for global optimisation of non-linear functions. Another approach is based on fuzzy weighted average (FWA) method that provides a consistent way to consider only once the repeated fuzzy numbers in a given function expression by using combinatorial arithmetic analysis [14,18]. More recently, the transformation method was proposed by Hanss [28] as a practical approach to evaluate fuzzy-parameterised models without requiring an external optimisation routine.…”

Exact Membership Functions for the Fuzzy Weighted Average

“…The standard approach to the calculation of fuzzy weighted averages [1][2][3][4][5][6][7][8][9][10][11] is to apply the extension principle to the following weighted average function:…”

“…wa(x 1 , ..,x n ,w 1 Here x 1 ,..,x n are real numbers, called attributes, and w 1 ,..,w n are non-negative real numbers, called weights.…”