A multi-objective extension of the net flow rule for exploiting a valued outranking relation
by Juan Carlos Leyva López; Mario Araoz Medina
International Journal of Multicriteria Decision Making (IJMCDM), Vol. 3, No. 1, 2013

Abstract: This paper presents a multiobjective extension of the net flow rule for solving multicriteria ranking problems: how to rank a set of alternatives when the aggregation model of preferences is a known valued outranking relation in a decreasing order of preference. When the aggregation model of preferences is based on the outranking approach, special treatment is required, but some non-consistent situations of the explicit global model of preferences could happen. In this case, the exploitation phase could then be treated as a multiobjective optimisation problem. In this way, a number of solutions can be found that provide the decision-maker with insight into the characteristics of the problem before a final solution is chosen. We present a multiobjective evolutionary algorithm for improving the quality of a recommendation when a valued outranking relation is exploited; the performance of the algorithm is evaluated on a set of test problems. Our computational results show that the multiobjective genetic algorithm-based heuristic is capable of producing high-quality recommendations.

Online publication date: Wed, 29-Jan-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Multicriteria Decision Making (IJMCDM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com