A Study of the Effectiveness of the Routing Decision Support Algorithm

dc.contributor.authorSahai, Ashok
dc.contributor.authorNikov, Alexander
dc.contributor.authorGoodridge, Wayne
dc.date.accessioned2010-11-03T15:11:32Z
dc.date.available2010-11-03T15:11:32Z
dc.date.issued2010-11-03T15:11:32Z
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 considereden
dc.identifier.urihttps://hdl.handle.net/2139/8497
dc.language.isoenen
dc.subjectAnalytic hierarchy processen
dc.subjectMulti-criteria decision-making algorithmen
dc.subjectLinear preference functionen
dc.subjectDecision support systemsen
dc.titleA Study of the Effectiveness of the Routing Decision Support Algorithmen
dc.typeArticleen

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
v31-60-decisionsupport.pdf
Size:
419.4 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.74 KB
Format:
Item-specific license agreed upon to submission
Description: