Volume 1, Number 50 (1-2012)                   cs 2012, 1(50): 377-404 | Back to browse issues page


XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Salimifard K, Jooybar S. Closeness Coefficient in Fuzzy TOPSIS Algorithms. cs. 2012; 1 (50) :377-404
URL: http://cs.shahed.ac.ir/article-1-906-en.html

, salimifard@pgu.ac.ir
Abstract:   (4837 Views)
Fuzzy TOPSIS algorithm is one of the common decision making techniques which is applied in many different decision situations. Because of its high-effectiveness under uncertainty conditions, management scientists always try to improve the algorithm. Based on fuzzy TOPSIS, many algorithms have been developed for different decision situations. In fact, the efficiency of the algorithm is an important issue which should be deeply considered. Through a massive literature review, this paper identifies different fuzzy TOPSIS algorithms and compares them on the basis of theoretical issues. Based on the findings, the algorithms are evaluated using a non-trivial numerical example. By comparing the results, the most efficient algorithm is identified.
Full-Text [PDF 740 kb]   (746 Downloads)    
Type of Study: Research | Subject: Special

Add your comments about this article : Your username or email:
Write the security code in the box

Send email to the article author


© 2015 All Rights Reserved | Business Strategies

Designed & Developed by : Yektaweb