A simple decision method is proposed to solve the group decision making problems in which the weights of decision organizations are unknown and the preferences for alternatives are provided by double hesitant linguistic preference relations. First, double hesitant linguistic elements are defined as representing the uncertain assessment information in the process of group decision making accurately and comprehensively, and the double hesitant linguistic weighted averaging operator is developed based on the defined operational laws for double hesitant linguistic elements. Then, double hesitant linguistic preference relations are defined and a means to objectively determine the weights of decision organizations is put forward using the standard deviation of scores of preferences provided by the individual decision organization for altematives. Finally the correlation coefficient between the scores of preferences and the scores of preferences are provided by the other decision organizations. Accordingly, a group decision method based on double hesitant linguistic preference relations is proposed, and a practical example of the Jiudianxia reservoir operation alternative selection is used to illustrate the practicability and validity of the method. Finally, the proposed method is compared with the existing methods. Comparative results show that the proposed method can deal with the double hesitant linguistic preference information directly, does not need any information transformation, and can thus reduce the loss of original decision information.
Due to the limitation and hesitation in one＇s knowledge, the membership degree of an element to a given set usually has a few different values, in which the conventional fuzzy sets are invalid. Hesitant fuzzy sets are a powerful tool to treat this case. The present paper focuses on investigating the clustering technique for hesitant fuzzy sets based on the K-means clustering algorithm which takes the results of hierarchical clustering as the initial clusters. Finally, two examples demonstrate the validity of our algorithm.
