Coverage Optimization with Balanced Capacitated Fragmentation

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F25%3APU155889" target="_blank" >RIV/00216305:26210/25:PU155889 - isvavai.cz</a>

Result on the web

<a href="https://www.mdpi.com/2227-7390/13/5/808" target="_blank" >https://www.mdpi.com/2227-7390/13/5/808</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3390/math13050808" target="_blank" >10.3390/math13050808</a>

Result language

angličtina

Original language name

Coverage Optimization with Balanced Capacitated Fragmentation

Original language description

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.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10102 - Applied mathematics

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2025

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Mathematics

ISSN

2227-7390

e-ISSN

—

Volume of the periodical

13

Issue of the periodical within the volume

5

Country of publishing house

CH - SWITZERLAND

Number of pages

24

Pages from-to

1-24

UT code for WoS article

001442515800001

EID of the result in the Scopus database

2-s2.0-86000490605