{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T00:17:18Z","timestamp":1772497038648,"version":"3.50.1"},"reference-count":41,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Education and Science of Ukraine"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>This paper considers the maximum coverage location problem (MCLP) in a continuous formulation. It is assumed that the coverage domain and the family of geometric objects of arbitrary shape are specified. It is necessary to find such a location of geometric objects to cover the greatest possible amount of the domain. A mathematical model of MCLP is proposed in the form of an unconstrained nonlinear optimization problem. Python computational geometry packages were used to calculate the area of partial coverage domain. Many experiments were carried out which made it possible to describe the statistical dependence of the area calculation time of coverage domain on the number of covering objects. To obtain a local solution, the BFGS method with first-order differences was used. An approach to the numerical estimation of the objective function gradient is proposed, which significantly reduces computational costs, which is confirmed experimentally. The proposed approach is shown to solve the maximum coverage problem of a rectangular area by a family of ellipses.<\/jats:p>","DOI":"10.3390\/computation10070119","type":"journal-article","created":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T21:57:53Z","timestamp":1657576673000},"page":"119","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Mathematical Models and Nonlinear Optimization in Continuous Maximum Coverage Location Problem"],"prefix":"10.3390","volume":"10","author":[{"given":"Sergiy","family":"Yakovlev","sequence":"first","affiliation":[{"name":"Mathematical Modelling and Artificial Intelligence Department, National Aerospace University \u201cKharkiv Aviation Institute\u201d, 61072 Kharkiv, Ukraine"},{"name":"Institute of Information Technology, Lodz University of Technology, 90-924 Lodz, Poland"}]},{"given":"Oleksii","family":"Kartashov","sequence":"additional","affiliation":[{"name":"Mathematical Modelling and Artificial Intelligence Department, National Aerospace University \u201cKharkiv Aviation Institute\u201d, 61072 Kharkiv, Ukraine"}]},{"given":"Dmytro","family":"Podzeha","sequence":"additional","affiliation":[{"name":"Mathematical Modelling and Artificial Intelligence Department, National Aerospace University \u201cKharkiv Aviation Institute\u201d, 61072 Kharkiv, Ukraine"}]}],"member":"1968","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/S0377-2217(98)00186-6","article-title":"Strategic Facility Location: A Review","volume":"111","author":"Owen","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"ref_2","unstructured":"Hamacher, H.W., and Drezner, Z. (2002). Facility Location: Applications and Theory, Springer."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Church, R.L., and Murray, A.T. (2009). Business Site Selection, Location Analysis, and GIS, Wiley.","DOI":"10.1002\/9780470432761"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10109-009-0105-9","article-title":"Advances in location modeling: GIS linkages and contributions","volume":"12","author":"Murray","year":"2010","journal-title":"J. Geogr. Syst."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Eiselt, H.A., and Marianov, V. (2011). Foundations of Location Analysis, Springer.","DOI":"10.1007\/978-1-4419-7572-0"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1177\/0160017615600222","article-title":"Maximal Coverage Location Problem: Impacts, Significance, and Evolution","volume":"39","author":"Murray","year":"2016","journal-title":"Int. Reg. Sci. Rev."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1111\/j.1435-5597.1974.tb00902.x","article-title":"The maximal covering location problem","volume":"32","author":"Church","year":"1974","journal-title":"Pap. Reg. Sci. Assoc."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1111\/j.1467-9787.1984.tb01031.x","article-title":"The planar maximal covering location problem","volume":"24","author":"Church","year":"1984","journal-title":"J. Reg. Sci."},{"key":"ref_9","unstructured":"Hochbaum, D.S. (1996). Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems. Approximation Algorithms for NP-Hard Problems, PWS Publishing Co."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1287\/ijoc.2016.0722","article-title":"Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones","volume":"29","author":"Bansal","year":"2017","journal-title":"INFORMS J. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1111\/j.1467-9671.2008.01125.x","article-title":"A Geocomputational Heuristic for Coverage Maximization in Service Facility Siting","volume":"12","author":"Murray","year":"2008","journal-title":"Trans. GIS"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.cor.2014.04.010","article-title":"Continuous space maximal coverage: Insights, advances and challenges","volume":"62","author":"Wei","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"14535","DOI":"10.1016\/j.eswa.2011.05.031","article-title":"Maximal covering location problem (MCLP) with fuzzy travel times","volume":"38","author":"Davari","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.eswa.2017.07.049","article-title":"Mathematical modeling and multi-start search simulated annealing for unequal-area facility layout problem","volume":"91","author":"Allahyari","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"105310","DOI":"10.1016\/j.cor.2021.105310","article-title":"Continuous maximal covering location problems with interconnected facilities","volume":"132","author":"Blanco","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1080\/13658810601169857","article-title":"Coverage optimization in continuous space facility siting","volume":"21","author":"Murray","year":"2007","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.cor.2006.03.004","article-title":"Regional service coverage modeling","volume":"35","author":"Murray","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1111\/j.1435-5957.2008.00168.x","article-title":"Maximising coverage of spatial demand for service","volume":"88","author":"Tong","year":"2009","journal-title":"Pap. Reg. Sci."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.seps.2008.02.009","article-title":"Siting a facility in continuous space to maximize coverage of a region","volume":"43","author":"Matisziw","year":"2009","journal-title":"Socio-Econ. Plan. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.cor.2018.11.007","article-title":"On the overlap area of a disk and a piecewise circular domain","volume":"104","author":"Coll","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1006\/cviu.1996.0045","article-title":"On the Area of Overlap of Translated Polygons","volume":"64","author":"Mount","year":"1996","journal-title":"Comput. Vis. Image Underst."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Coll, N., Fort, M., and Saus, M. (2022). Coverage area maximization with parallel simulated annealing. Expert Syst. Appl., 202.","DOI":"10.1016\/j.eswa.2022.117185"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/j.comgeo.2013.01.002","article-title":"Shape matching under rigid motion","volume":"46","author":"Cheng","year":"2013","journal-title":"Comput. Geom. Theory Appl."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10589-008-9191-8","article-title":"Covering a compact polygonal set by identical circles","volume":"46","author":"Stoyan","year":"2010","journal-title":"Comput. Optim. Appl."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1111\/j.1467-9671.1997.tb00004.x","article-title":"Selecting conservation reserves using species-covering models: Adapting the ARC\/INFO GIS","volume":"2","author":"Church","year":"1997","journal-title":"Trans. GIS"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.apgeog.2012.07.002","article-title":"Optimizing the location of stations in bike-sharing programs: A GIS approach","volume":"35","author":"Latorre","year":"2012","journal-title":"Appl. Geogr."},{"key":"ref_27","unstructured":"Longley, P.A., Goodchild, M.F., Maguire, D.J., and Rhind, D.W. (2015). Geographic Information System and Science, John Wiley. [4th ed.]."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1007\/s10559-018-0073-5","article-title":"Configuration Space of Geometric Objects","volume":"54","author":"Stoyan","year":"2018","journal-title":"Cybern. Syst. Anal."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1615\/JAutomatInfScien.v50.i9.30","article-title":"On Some Classes of Spatial Configurations of Geometric Objects and their Formalization","volume":"50","author":"Yakovlev","year":"2018","journal-title":"J. Autom. Inf. Sci."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/s10559-019-00167-y","article-title":"Formalizing Spatial Configuration Optimization Problems with the Use of a Special Function Class","volume":"55","author":"Yakovlev","year":"2019","journal-title":"Cybern. Syst. Anal."},{"key":"ref_31","unstructured":"Rvachev, V.L. (1982). Theory of the R-Function and Some of Its Applications, Naukova Dumka."},{"key":"ref_32","first-page":"69","article-title":"\u03a6-functions for complex 2D-objects","volume":"2","author":"Stoyan","year":"2004","journal-title":"Q. J. Oper. Res."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10479-008-0456-5","article-title":"Tools of mathematical modeling of arbitrary object packing problems","volume":"179","author":"Bennell","year":"2010","journal-title":"Ann. Oper. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/s10589-009-9258-1","article-title":"Covering a polygonal region by rectangles","volume":"48","author":"Stoyan","year":"2011","journal-title":"Comput. Optim. Appl."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Pankratov, A., Romanova, T., Litvinchev, I., and Marmolejo-Saucedo, J.A. (2020). An Optimized Covering Spheroids by Spheres. Appl. Sci., 10.","DOI":"10.3390\/app10051846"},{"key":"ref_36","unstructured":"Gillies, S. (2022, April 29). The Shapely User Manual. Available online: https:\/\/shapely.readthedocs.io\/en\/stable\/manual.html."},{"key":"ref_37","unstructured":"Fletcher, R. (2013). Practical Methods of Optimization, John Wiley Sons. [2nd ed.]."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"6532","DOI":"10.4249\/scholarpedia.6532","article-title":"Metaheuristics","volume":"10","author":"Glover","year":"2015","journal-title":"Scholarpedia"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Salhi, S., and Boylan, J. (2022). An Overview of Heuristics and Metaheuristics. The Palgrave Handbook of Operations Research, Palgrave Macmillan.","DOI":"10.1007\/978-3-030-96935-6"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.jcp.2016.12.046","article-title":"Preconditioned steepest descent methods for some nonlinear elliptic equations involving p-Laplacian terms","volume":"334","author":"Feng","year":"2017","journal-title":"J. Comput. Phys."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"8115","DOI":"10.1016\/j.egyr.2021.07.004","article-title":"Deep learned recurrent type-3 fuzzy system: Application for renewable energy modeling\/prediction","volume":"7","author":"Cao","year":"2021","journal-title":"Energy Rep."}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/10\/7\/119\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:48:17Z","timestamp":1760140097000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/10\/7\/119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":41,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["computation10070119"],"URL":"https:\/\/doi.org\/10.3390\/computation10070119","relation":{},"ISSN":["2079-3197"],"issn-type":[{"value":"2079-3197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,11]]}}}