The scale-up performance of genetic algorithms applied to group decision making problems

Abstract

The scale-up performance of genetic algorithms applied to group decision making problems is investigated. Ordinal intervals are used for expressing the individual preferences of the decision makers, as provided independently for each course of action. Genetic algorithms have been found capable of swiftly returning optimal ranking solutions, with computational complexity (the relationship between the number of available courses of action and the number of generations until convergence) expressed by a fourth order polynomial, but found practically independent of the number of decision makers. © 2013 Springer-Verlag Berlin Heidelberg.