|
|
Digital
Library of the European Council for Modelling and Simulation |
|
Title: |
Minimisation Of Network Covering Services With Predefined Centres |
|
Authors: |
Milos Seda,
Pavel Seda |
|
Published in:
|
(2018). ECMS 2018
Proceedings Edited by: Lars Nolle, Alexandra
Burger, Christoph Tholen,
Jens Werner, Jens Wellhausen European Council for
Modeling and Simulation. doi:
10.7148/2018-0005 ISSN:
2522-2422 (ONLINE) ISSN:
2522-2414 (PRINT) ISSN:
2522-2430 (CD-ROM) 32nd European Conference on Modelling and Simulation, Wilhelmshaven, Germany, May 22nd
– May 265h, 2018 |
|
Citation
format: |
Milos Seda, Pavel
Seda (2018). Minimisation
Of Network Covering Services With Predefined Centres, ECMS 2018 Proceedings Edited by: Lars Nolle, Alexandra Burger, Christoph
Tholen, Jens Werner, Jens Wellhausen
European Council for Modeling and Simulation. doi: 10.7148/2018-0282 |
|
DOI: |
https://doi.org/10.7148/2018-0282 |
|
Abstract: |
In this paper, we deal with a special version of the
set covering problem, which consists in finding the
min-imum number of service centres providing
specialized services for all customers (or larger units, such as urban areas)
within a reasonable distance given by a thresh-old. If a suitable threshold
is found that makes it possi-ble 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 reach-ability 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 find the optimal so-lution in a
reasonable amount of time. In the paper, we present a solution that uses two
heuristic methods: genetic algorithm and tabu
search. |
|
Full
text: |
|
