A Study of the Effectiveness of the Routing Decision Support Algorithm

Show simple item record

dc.contributor.author Sahai, Ashok
dc.contributor.author Nikov, Alexander
dc.contributor.author Goodridge, Wayne
dc.date.accessioned 2010-11-03T15:11:32Z
dc.date.available 2010-11-03T15:11:32Z
dc.date.issued 2010-11-03T15:11:32Z
dc.identifier.uri http://hdl.handle.net/2139/8497
dc.description.abstract Multi 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 en
dc.language.iso en en
dc.subject Analytic hierarchy process en
dc.subject Multi-criteria decision-making algorithm en
dc.subject Linear preference function en
dc.subject Decision support systems en
dc.title A Study of the Effectiveness of the Routing Decision Support Algorithm en
dc.type Article en

Files in this item

Files Size Format View
v31-60-decisionsupport.pdf 419.4Kb PDF Thumbnail

This item appears in the following Collection(s)

Show simple item record

Search UWISpace

Advanced Search


My Account