Volume 2, Issue 4 (12-2010)                   IJICTR 2010, 2(4): 9-18 | Back to browse issues page

XML Print


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

Niknafs A, Moghaddam Charkari N, Niknafs A A. Towards Faster Performance of PROMETHEE II in a Lower Class of Complexity. IJICTR. 2010; 2 (4) :9-18
URL: http://ijict.itrc.ac.ir/article-1-246-en.html
1- Department of Information Technology Engineering Tarbiat Modares University Tehran, Iran
2- Faculty of Electrical and Computer Engineering Tarbiat Modares University Tehran, Iran
3- Department of Computer Engineering Shahid Bahonar University of Kerman Kerman, Iran
Abstract:   (1903 Views)
PROMETHEE II is one of the most popular members of the well-known family of multi-criteria decision making methods. One of the main concerns in developing PROMETHEE-based systems is the rapid growth of the response time as the number of alternatives (n) and criteria (k) grow. PROMETHEE II belongs to the computational complexity class of O(n توان 2). In this paper, a simplified version of PROMETHEE II is proposed and a novel estimation of the simplified PROMETHEE II is introduced. This simplified version reproduces the results of the original method and requires fewer operations. The estimation belongs to the complexity class of O(n log n) and consequently has a shorter response time than that of the simplified version. The proposed simplification and estimation are tested and evaluated with real-world data. When compared to the original PROMETHEE II and even other similar MCDM methods, such as AHP, ELECTRA, and TOPSIS, the experiments reveal the satisfactory results with a considerably reduced computational complexity and response time.
Full-Text [PDF 1461 kb]   (947 Downloads)    
Type of Study: Research | Subject: Information Technology

Add your comments about this article : Your username or Email:
CAPTCHA code