Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
ŠEDA, M.; ŠEDA, P.
Originální název
Coverage Optimization with Balanced Capacitated Fragmentation
Anglický název
Druh
Článek WoS
Originální abstrakt
This paper investigates a specialized variant of the set covering problem, addressing the optimal allocation of service centers to ensure that all customers (or larger entities, such as urban areas) have access to specialized services within a predefined acceptable distance, referred to as the threshold. In addition to minimizing the number of service centers required or their total cost, this study emphasizes the critical importance of balancing capacity fragmentation—defined as the uneven distribution of service demand across facilities—to enhance accessibility and ensure equitable service delivery for customers. We propose an innovative mathematical model with additional practical constraints related to service deployment and designed to optimize both coverage and capacity fragmentation within a defined region. The model is validated through simulations implemented in GAMS, which document that this software tool is capable of solving even large problem instances in a reasonable amount of time. The results demonstrate the model’s effectiveness in addressing real-world challenges associated with equitable and efficient service allocation.
Anglický abstrakt
Klíčová slova
set covering; threshold; reachability matrix; GAMS
Klíčová slova v angličtině
Autoři
Vydáno
28.02.2025
Nakladatel
MDPI
ISSN
2227-7390
Periodikum
Mathematics
Svazek
13
Číslo
5
Stát
Švýcarská konfederace
Strany od
1
Strany do
24
Strany počet
URL
https://www.mdpi.com/2227-7390/13/5/808
BibTex
@article{BUT197184, author="Miloš {Šeda} and Pavel {Šeda}", title="Coverage Optimization with Balanced Capacitated Fragmentation", journal="Mathematics", year="2025", volume="13", number="5", pages="1--24", doi="10.3390/math13050808", url="https://www.mdpi.com/2227-7390/13/5/808" }