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

Decision making
Scheduling
Personnel

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

Algorithm of maximizing the set of common solutions for several MCDM problems and it's application for security personnel scheduling. / Dadelo, Stanislav; Krylovas, Aleksandras; Kosareva, Natalja; Zavadskas, Edmundas Kazimieras; Dadeliene, Ruta.

In: International Journal of Computers, Communications and Control, Vol. 9, No. 2, 2014, p. 151-159.

Research output: Contribution to journalArticle

@article{1baa2acb10594ade99146891fe5cfd5e,
title = "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 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.",
keywords = "Heuristics, Multiple criteria decision making, Optimizing algorithm, Preference feature",
author = "Stanislav Dadelo and Aleksandras Krylovas and Natalja Kosareva and Zavadskas, {Edmundas Kazimieras} and Ruta Dadeliene",
year = "2014",
language = "English",
volume = "9",
pages = "151--159",
journal = "International Journal of Computers, Communications and Control",
issn = "1841-9836",
publisher = "CCC Publications, R & D Agora",
number = "2",

}

TY - JOUR

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

AU - Dadelo, Stanislav

AU - Krylovas, Aleksandras

AU - Kosareva, Natalja

AU - Zavadskas, Edmundas Kazimieras

AU - Dadeliene, Ruta

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Heuristics

KW - Multiple criteria decision making

KW - Optimizing algorithm

KW - Preference feature

UR - http://www.scopus.com/inward/record.url?scp=84902295874&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84902295874&partnerID=8YFLogxK

M3 - Article

VL - 9

SP - 151

EP - 159

JO - International Journal of Computers, Communications and Control

JF - International Journal of Computers, Communications and Control

SN - 1841-9836

IS - 2

ER -