Abstract

In multiple attribute decision analysis (MADA) problems, one often needs to deal with assessment information with uncertainty. The evidential reasoning approach is one of the most effective methods to deal with such MADA problems. As a kernel of the evidential reasoning approach, an original evidential reasoning (ER) algorithm was firstly proposed by Yang et al, and later they modified the ER algorithm in order to satisfy the proposed four synthesis axioms. However, up to the present, the essential difference of the two ER algorithms is still unclear. In this paper, we analyze the ER algorithms in the Dempster-Shafer theory framework and prove that the original ER algorithm follows the reliability discounting and combination scheme, whereas the modified one follows the importance discounting and combination scheme. Based on these new findings, an extended ER (E2R) algorithm is proposed to take into account both the reliability and importance of different attributes, which provides a more general attribute aggregation scheme for MADA with uncertainty. A motorcycle performance assessment problem is examined to illustrate the proposed algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call