Coverage Optimization with Balanced Capacitated Fragmentation

článek v časopise ve Web of Science, Jimp

angličtina

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.

set covering; threshold; reachability matrix; GAMS

ŠEDA, M.; ŠEDA, P.

28. 2. 2025

MDPI

2227-7390

Mathematics

13

5

Švýcarská konfederace

1

24

24

https://www.mdpi.com/2227-7390/13/5/808