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

Stanislav Dadelo, Aleksandras Krylovas, Natalja Kosareva, Edmundas Kazimieras Zavadskas, Ruta Dadeliene

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

The article deals with the task of elite selection of private security personnel 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 subjective 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.

Original languageEnglish
Pages (from-to)151-159
Number of pages9
JournalInternational Journal of Computers, Communications and Control
Volume9
Issue number2
Publication statusPublished - 2014
Externally publishedYes

    Fingerprint

Keywords

  • Heuristics
  • Multiple criteria decision making
  • Optimizing algorithm
  • Preference feature

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Computer Science Applications

Cite this