This paper is devoted to research of a selection problem of mechanisms for management of information risks. We propose to use a heuristic algorithm of a selection, which relates to the class "greedyalgorithms&qu...
详细信息
This paper is devoted to research of a selection problem of mechanisms for management of information risks. We propose to use a heuristic algorithm of a selection, which relates to the class "greedyalgorithms". This algorithm allows to consider incompatibility of control mechanisms and use of integrated mechanisms. We compared the modified greedyalgorithm, the genetic algorithm, and algorithm of full search. Model testing showed the advantage of the modified greedyalgorithm. The algorithm can be used for the solution of other tasks, for example, for creation of information systems. (C) 2014 Published by Elsevier B.V. Open access under CC BY-NC-ND license.
The paper considers the vehicle routing problem for several agents among the objects of two types. It is necessary to move all objects of the first type to objects of the second type. That is, it is necessary to creat...
详细信息
ISBN:
(纸本)9781728167015
The paper considers the vehicle routing problem for several agents among the objects of two types. It is necessary to move all objects of the first type to objects of the second type. That is, it is necessary to create routes for agents so that all objects of the first type are to be visited, objects of different types should be alternated in the route and the total cost of moving is to be minimal. The mathematical model of the problem in the form of a mathematical programming problem is proposed. The paper describes the developed "greedy" and genetic solution algorithms. Special crossover and mutation operators have been developed for this problem to implement the genetic algorithm. The paper presents the computational experiment conducted on the basis of the developed software.
暂无评论