MAXIMUM RELIABILITY K-CENTER LOCATION PROBLEM

Abstract

This paper presents an approach for solving the maximum reliability k-center location problem. We are modifying the well-known p-center problem in order to determine the location of the observed objects and maximize the reliability of supply system coverage. The problem is defined as a stochastic problem of multi-center location on a graph. As a solution, two new algorithms have been proposed. The first is modified Dijkstra’s algorithm for determination of the most reliable paths between nodes in the graph. The output of this algorithm is used as an input for the second algorithm designed to find the reliability of node coverage from a predetermined number of nodes.