Přístupnostní navigace
E-application
Search Search Close
Publication detail
ŠEDA, M. ŠEDA, P.
Original Title
Minimised Weighted Covering of Service Networks
Type
conference paper
Language
English
Original Abstract
In this paper, we deal with the set covering problem, which consists in finding the minimum number of service centres providing specialized services within a reasonable distance given by a threshold. However, we consider not only the threshold, but also weights of service centres so that the most important ones would not be omitted from the final solution. Since even the basic task without weights belongs to the class of NP-hard problems, stochastic heuristic methods must be used for large instances of the problem.
Keywords
set covering, threshold, reachability matrix, genetic algorithm, repair operator, weight
Authors
ŠEDA, M.; ŠEDA, P.
Released
20. 5. 2016
Publisher
Technical University Košice
Location
Košice
ISBN
978-1-4673-8605-0
Book
Proceedings of the 17th International Carpathian Control Conference ICCC 2016
Pages from
645
Pages to
650
Pages count
6
BibTex
@inproceedings{BUT128470, author="Miloš {Šeda} and Pavel {Šeda}", title="Minimised Weighted Covering of Service Networks", booktitle="Proceedings of the 17th International Carpathian Control Conference ICCC 2016", year="2016", pages="645--650", publisher="Technical University Košice", address="Košice", isbn="978-1-4673-8605-0" }