A Study of the Effectiveness of the Routing Decision Support Algorithm

dc.creatorSahai, Ashok
dc.creatorNikov, Alexander
dc.creatorGoodridge, Wayne
dc.date.accessioned2010-11-03T15:11:32Z
dc.date.accessioned2019-08-05T18:18:01Z
dc.date.available2010-11-03T15:11:32Z
dc.date.available2019-08-05T18:18:01Z
dc.date.created2010-11-03T15:11:32Z
dc.date.issued2010-11-03T15:11:32Z
dc.identifierhttp://hdl.handle.net/2139/8497
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3018546
dc.description.abstractMulti criteria decision making (MCDM) methods like analytic hierarchy process, ELECTRE and multi-attribute utility theory are critically studied. They have irregularities in terms of the reliability of ranking of the best alternatives. The Routing Decision Support (RDS) algorithm is trying to improve some of their deficiencies. This paper gives a mathematical verification that the RDS algorithm conforms to the test criteria for an effective MCDM method when a linear preference function is considered
dc.languageen
dc.subjectAnalytic hierarchy process
dc.subjectMulti-criteria decision-making algorithm
dc.subjectLinear preference function
dc.subjectDecision support systems
dc.titleA Study of the Effectiveness of the Routing Decision Support Algorithm
dc.typeArticle


Este ítem pertenece a la siguiente institución