By Topic

A New Model for Complete Ranking Problems in MCDA Based on Multi-graded Dominance Relations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhang Rong ; Coll. of & Manage. Sci., Henan Agric. Univ., Zhengzhou, China ; Liu Bin ; Liu Sifeng

After Greco et al. introduce PCT (Pairwise Comparison Table) into rough sets, with this extension rough sets method can resolve ranking and choice problems in MCDA. But there are still two problems: one is how to change decision table into PCT, meanwhile to avoid losing information; the other is how to get complete ranking of alternatives, as different alternatives have the same net flow value in some new instances. Due to both PROMETHEE II and dominance-based rough sets based on binary preference relations between objects on particular attribute, this paper introduces PROMETHEE II into dominance-based rough sets to get a new synergic P2DRS model. The new model can easily obtain PCT and resolve the problem of some alternatives having indistinguishable ranking for getting the complete ranking of all alternatives. Finally an example illustrates the model is scientific and validity.

Published in:

Fuzzy Systems and Knowledge Discovery, 2009. FSKD '09. Sixth International Conference on  (Volume:1 )

Date of Conference:

14-16 Aug. 2009