Algorithm of maximizing the set of common solutions for several MCDM problems and it’s application for security personnel scheduling

Abstract

The article deals with the task of elite selection of private security per- sonnel on the basis of objective and subjective criteria. One of the possible solutions of this multiple criteria decision making (MCDM) problem is creation of heuristics allowing to minimize discrepancy of ranks calculated for the objective and subjec- tive criteria on the basis of the best security staff. The proposed heuristic combines interval points re-selection and random points generation methods. Two optimizing algorithms are proposed. It is shown how this method is applied for solving specific task of elite selection from security personnel.