نتایج جستجو برای: compromise ranking
تعداد نتایج: 59323 فیلتر نتایج به سال:
Information and communication technology (ICT) enable information to be accessed processed through all kinds of visual, audio, printed written tools. This study aimed evaluate the ICT development G7 countries by using Multi Criteria Decision Making (MCDM) methods. Accordingly, Entropy method was used specify criteria weights, Proximity Indexed Value (PIV), Range (ROV), COmplex PRoportional ASse...
The current study set to extend a new VIKOR method as a compromise ranking approach to solve multiple criteria decision-making (MCDM) problems through intuitionistic fuzzy analysis. Using compromise method in MCDM problems contributes to the selection of an alternative as close as possible to the positive ideal solution and far away from the negative ideal solution, concurrently. Using Atanasso...
Ordinal consensus ranking problems have received much attention in the management science literature. A problem arises in situations where a group of k decision makers (DMs) is asked to rank order n alternatives. The question is how to combine the DM rankings into one consensus ranking. Several different approaches have been suggested to aggregate DM responses into a compromise or consensus ran...
A two-stage approach was presented to select woody biomass-based biofuel plants using GIS spatial analysis and the multi-criteria analysis ranking algorithm of compromise programming. Site suitability was evaluated to minimize the direct cost for investors and the potential negative environmental impacts. The first step was to create a site suitability index using a linear fuzzy logic predictio...
One of the main problems in eCommerce applications and all other systems handling confidential information in general, is the matter of security. This paper introduces the idea of an intrusion detection management system to support the security. Intrusion detection per se, is the act of detecting an unauthorized intrusion by a computer or a network from the inside or the outside of the affected...
This paper deals with preference representation and aggregation in combinatorial domains. We assume that the set of alternatives is defined as the cartesian product of finite domains and that agents’ preferences are represented by generalized additive decomposable (GAI) utility functions. GAI functions allow an efficient representation of interactions between attributes while preserving some de...
In order to solve the group decision making problems with ordinal interval preference information, a new decision method is proposed based on VIKOR method. The VIKOR method of compromise ranking determines a compromise solution, providing a maximum “group utility” for the “majority” and a minimum of an “individual regret” for the “opponent”, which is an effective tool in multi-attribute decisio...
This paper deals with preference representation and aggregation in the context of multiattribute utility theory. We consider a set of alternatives having a combinatorial structure. We assume that preferences are compactly represented by graphical utility models derived from generalized additive decomposable (GAI) utility functions. Such functions enable to model interactions between attributes ...
Mathematical theory of voting and social choice has attracted much attention. In the general setting one can view social choice as a method of aggregating individual, often conflicting preferences and making a choice that is the best compromise. How preferences are expressed and what is the “best compromise” varies and heavily depends on a particular situation. The method we propose in this pap...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید