Fuzzy Preferences Graph Model to Study a Water Pollution Conflict
نویسندگان
چکیده
منابع مشابه
Fuzzy Preferences Graph Model to Study a Water Pollution Conflict
The fuzzy preference framework of Graph Model for Conflict Resolution (GMCR), handling both crisp and fuzzy preferences of decision makers (DMs), is capable of calculating and predicting different conflict resolutions (equilibria) according to DMs’ different satisficing criteria. Employing this methodology, a water contamination conflict occurs at the boundary of Jiangsu and Zhejiang provinces ...
متن کاملA conflict analysis framework considering fuzzy preferences
A conflict analysis framework with fuzzy preference can be utilized to model and analyze conflicts in which decision makers (DMs) hold unclear or ambiguous preferences. One important function of this framework is that it can predict different conflict resolutions based on DMs’ different fuzzy satisficing thresholds. The fuzzy preference conflict analysis framework extends the option prioritizat...
متن کاملFuzzy option prioritization for the graph model for conflict resolution
A fuzzy option prioritization technique is developed to efficiently model uncertain preferences of DMs in strategic conflicts as fuzzy preferences by using the decision makers’ (DMs’) fuzzy truth values of preference statements at feasible states within the framework of the Graph Model for Conflict Resolution. The preference statements of a DM express desirable combinations of options or course...
متن کاملA Time Dependent Pollution Routing Problem in Multi-graph
This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost. In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...
متن کاملLaplacian Energy of a Fuzzy Graph
A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Cybernetics & Systemics Journal
سال: 2015
ISSN: 1874-110X
DOI: 10.2174/1874110x01509012259