Minimisation of Network Covering Services with Predefined Centres

Stať ve sborníku v databázi WoS či Scopus

en

In this paper, we deal with a special version of the set covering problem, which consists in finding the minimum number of service centres providing specialized services for all customers (or larger units, such as urban areas) within a reasonable distance given by a threshold. If a suitable threshold is found that makes it possible to determine a feasible solution of the task, the task is transformed into a general set covering problem. In order to reflect the importance of the centers, we assign weights to them and, if some centers must be contained in the result, we can either add columns in the reachability matrix with link to these centres or add special constraints in the mathematical model. However, this is of a combinatorial nature and, because it belongs to the class of NP-hard problems, for a large instance of the problem, it cannot be used to and the optimal solution in a reasonable amount of time. In the paper, we present a solution that uses two heuristic methods: genetic algorithm and tabu search.

Set covering, unicost problem, threshold, reachability matrix, genetic algorithm, repair operator

2018-05-22

European Council for Modelling and Simulation

Wilhelmshaven (Germany)

978-0-9932440-6-3

2522-2414

Proceedings of the 32nd European Conference on Modelling and Simulation ECMS 2018

2018

1

282–287

6