Towards Faster Performance of Promethee Ii in A Lower Class of Complexity

Abstract—promethee ii is one of the most popular members of the well-known family of multi-criteria decisionmakingmethods. one of the main concerns in developing promethee-based systems is the rapid growth of theresponse time as the number of alternatives (n) and criteria (k) grow. promethee ii belongs to the computationalcomplexity class of o(n2). in this paper, a simplified version of promethee ii is proposed and a novel estimation ofthe simplified promethee ii is introduced. this simplified version reproduces the results of the original methodand requires fewer operations. the estimation belongs to the complexity class of o(n log n) and consequently has ashorter response time than that of the simplified version.the proposed simplification and estimation are tested and evaluated with real-world data. when compared to theoriginal promethee ii and even other similar mcdm methods, such as ahp, electra, and topsis, theexperiments reveal the satisfactory results with a considerably reduced computational complexity and response time.