Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Continuous Maximum Coverage Location Problem with Arbitrary Shape of Service Areas and Regional Demand

Continuous Maximum Coverage Location Problem with Arbitrary Shape of Service Areas and Regional Demand

Thumbnail Image
Download
Name

symmetry-17-00676.pdf

Size

4.35 MB

Format

Adobe PDF

Checksum (MD5)

4f00658cbd56468f2157fbe46035d2ef

Download all files submitted through automated deposit
packager-6835b5e5.zip (4.22 MB)
Author(s)
Yakovlev, Sergiy
•
Shekhovtsov, Sergiy
•
Kirichenko, Lyudmyla
•
Matsyi, Olha
•
Podzeha, Dmytro
•
Chumachenko, Dmytro
Date Issued
April 29, 2025
Journal
Symmetry
Publisher
Multidisciplinary Digital Publishing Institute
Citation
Yakovlev, S.; Shekhovtsov, S.; Kirichenko, L.; Matsyi, O.; Podzeha, D.; Chumachenko, D. Continuous Maximum Coverage Location Problem with Arbitrary Shape of Service Areas and Regional Demand. Symmetry 2025, 17, 676.
Version
Final published version
Abstract
This paper addresses the maximum coverage location problem in a generalized setting, where both facilities (service areas) and regional demand are modeled as continuous entities. Unlike traditional formulations, our approach allows for arbitrary shapes for both service areas and demand regions, with additional constraints on facility placement. The key novelty of this work is its ability to handle complex, irregularly shaped service areas, including approximating them as unions of centrally symmetric shapes. This enables the use of an analytical approach based on spatial symmetry, which allows for efficient estimation of the covered area. The problem is formulated as a nonlinear optimization task. We analyze the properties of the objective function and leverage the Shapely library in Python 3.13.3 for efficient geometric computations. To improve computational efficiency, we develop an extended elastic model that significantly reduces processing time. This model generalizes the well-known quasi-physical, quasi-human algorithm for circle packing, extending its applicability to more complex spatial configurations. The effectiveness of the proposed approach is validated through test cases in which service areas take the form of circles, ellipses, and irregular polygons. Our method provides a robust and adaptable solution for various settings of practically interesting continuous maximum coverage location problems involving irregular regional demand and service areas.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/159355
DOI of Published Version
https://doi.org/10.3390/sym17050676
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.