This paper examines the problem of combining a set of ordinal rankings to form an acceptable consensus ranking. The objective of traditional group decision making problem is to determine the Minimum Violation Ranking. Motived by the applications of adjusted consensus in recent years, we study this problem from a new perspective, for obtaining an acceptable consensus ranking for group decision making. In this paper, every voter ranks a set of alternatives respectively, and we know the acceptability index, which represents the minimum adjustments that are allowed for each voter. The problem is to find the Minimum Acceptable Violation Ranking (MAVR) which minimizes the sum of voter’s unacceptable violations. Besides, we develop a branch and bound ranking algorithm to solve this problem. The suggested improvement include: (1) analysing the ranking preference by two ways: pairwise preference and ranking-based preference; (2) constructing the lower bound and upper bound, which exclude at most half of the feasible solutions in each iteration process. Furthermore, the effectiveness and efficiency of this algorithm are verified with an example and numerical experiments. Finally, we discuss two extensions of the basic MAVR problem: the Minimum Weighted Acceptable Violation problem, whose voters are accompanied with a set of weights or multiples, and the Minimum Hierarchy Acceptable Violation problem, which uses hierarchical acceptability indexes. In addition, our results can be applied to other ranking and subset selection problems in which provide consensus rankings over the alternatives.
Journal of Combinatorial Optimization – Springer Journals
Published: Oct 8, 2016
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera