The maximal covering location problem with accessibility indicators

Maximal covering location problems have been widely studied, due to the practical applications of their solutions in real-life scenarios where it is not possible to fulfill the total demand. For example, these solutions can be used to provide humanitarian relief or to allocate fire stations, hospita...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Socio-economic planning sciences 2020-09, Vol.71, p.100758, Article 100758
Hauptverfasser: Ibarra-Rojas, O.J., Ozuna, L., López-Piñón, D.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page 100758
container_title Socio-economic planning sciences
container_volume 71
creator Ibarra-Rojas, O.J.
Ozuna, L.
López-Piñón, D.
description Maximal covering location problems have been widely studied, due to the practical applications of their solutions in real-life scenarios where it is not possible to fulfill the total demand. For example, these solutions can be used to provide humanitarian relief or to allocate fire stations, hospitals, and commercial services. However, coverage is commonly based on the ability of clients to reach the facilities or on the ability of facilities to serve clients within a reasonable area (or radius) or in a limited service time. In this study, we assume that facilities have a limited service area, while people in demand centroids have a degree of mobility encompassing a reasonable travel distance to look for their demand. Based on the latter assumption, we define a maximum covering location problem that optimizes an accessibility measure. This is a weighted sum of accessibility indicators based on the coverage of demand centroids, the number of demand centroids with access to opportunities within their mobility radius, the number and location of opportunities, a travel cost function, and spatial disaggregation. We formulate our optimization problem through a mixed-integer linear program; an experimental stage on randomly-generated instances shows that a commercial solver is capable of obtaining near-optimal solutions in reasonable computational times for large instances. In addition, we use data from an economically-deprived region in Mexico to perform a sensitivity analysis for different service and mobility radii. Finally, we implement the Linear Best Worst Method to obtain the value of weights parameters representing subjective preferences for different indicators of accessibility. •we define a maximum covering location problem that optimizes an accessibility measure.•We formulate our optimization problem through a mixed-integer linear program.•optimal solutions can be obtained by the CPLEX solver in less than 5 min.•our optimization approach can be complemented by multi-attribute decision-making methods.
doi_str_mv 10.1016/j.seps.2019.100758
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2440490769</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0038012119300059</els_id><sourcerecordid>2440490769</sourcerecordid><originalsourceid>FETCH-LOGICAL-c393t-3cf72046004b79a84c278a45dcd861b2c3245e423b8e66027fa065407abd21693</originalsourceid><addsrcrecordid>eNp9kEtPwzAQhC0EEuXxBzhZ4pyyfsROJC6o4iVV4lLOluNsqKM0LnZa6L8nJZw5rbSa2Z35CLlhMGfA1F07T7hNcw6sHBeg8-KEzFihRaZAslMyAxBFBoyzc3KRUgsAXPJ8RharNdKN_fYb21EX9hh9_0G74OzgQ0-3MVQdbuiXH9bUOocp-cp3fjhQ39d-VIWYrshZY7uE13_zkrw_Pa4WL9ny7fl18bDMnCjFkAnXaA5SAchKl7aQjuvCyrx2daFYxZ3gMkfJRVWgUsB1Y0HlErStas5UKS7J7XR3TPW5wzSYNuxiP740XEqQJehfFZ9ULoaUIjZmG8d28WAYmCMs05ojLHOEZSZYo-l-MuGYf-8xmuQ89g5rH9ENpg7-P_sP7Pxx6w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2440490769</pqid></control><display><type>article</type><title>The maximal covering location problem with accessibility indicators</title><source>Elsevier ScienceDirect Journals</source><creator>Ibarra-Rojas, O.J. ; Ozuna, L. ; López-Piñón, D.</creator><creatorcontrib>Ibarra-Rojas, O.J. ; Ozuna, L. ; López-Piñón, D.</creatorcontrib><description>Maximal covering location problems have been widely studied, due to the practical applications of their solutions in real-life scenarios where it is not possible to fulfill the total demand. For example, these solutions can be used to provide humanitarian relief or to allocate fire stations, hospitals, and commercial services. However, coverage is commonly based on the ability of clients to reach the facilities or on the ability of facilities to serve clients within a reasonable area (or radius) or in a limited service time. In this study, we assume that facilities have a limited service area, while people in demand centroids have a degree of mobility encompassing a reasonable travel distance to look for their demand. Based on the latter assumption, we define a maximum covering location problem that optimizes an accessibility measure. This is a weighted sum of accessibility indicators based on the coverage of demand centroids, the number of demand centroids with access to opportunities within their mobility radius, the number and location of opportunities, a travel cost function, and spatial disaggregation. We formulate our optimization problem through a mixed-integer linear program; an experimental stage on randomly-generated instances shows that a commercial solver is capable of obtaining near-optimal solutions in reasonable computational times for large instances. In addition, we use data from an economically-deprived region in Mexico to perform a sensitivity analysis for different service and mobility radii. Finally, we implement the Linear Best Worst Method to obtain the value of weights parameters representing subjective preferences for different indicators of accessibility. •we define a maximum covering location problem that optimizes an accessibility measure.•We formulate our optimization problem through a mixed-integer linear program.•optimal solutions can be obtained by the CPLEX solver in less than 5 min.•our optimization approach can be complemented by multi-attribute decision-making methods.</description><identifier>ISSN: 0038-0121</identifier><identifier>EISSN: 1873-6041</identifier><identifier>DOI: 10.1016/j.seps.2019.100758</identifier><language>eng</language><publisher>Oxford: Elsevier Ltd</publisher><subject>Access ; Accessibility ; Coverage location problem ; Demand ; Handicapped accessibility ; Hospitals ; Integer programming ; Linear best-worst method ; Linear programming ; Mixed-integer linear program ; Mobility ; Optimization ; Sensitivity analysis</subject><ispartof>Socio-economic planning sciences, 2020-09, Vol.71, p.100758, Article 100758</ispartof><rights>2019 Elsevier Ltd</rights><rights>Copyright Elsevier Science Ltd. Sep 2020</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c393t-3cf72046004b79a84c278a45dcd861b2c3245e423b8e66027fa065407abd21693</citedby><cites>FETCH-LOGICAL-c393t-3cf72046004b79a84c278a45dcd861b2c3245e423b8e66027fa065407abd21693</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0038012119300059$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3536,27903,27904,65309</link.rule.ids></links><search><creatorcontrib>Ibarra-Rojas, O.J.</creatorcontrib><creatorcontrib>Ozuna, L.</creatorcontrib><creatorcontrib>López-Piñón, D.</creatorcontrib><title>The maximal covering location problem with accessibility indicators</title><title>Socio-economic planning sciences</title><description>Maximal covering location problems have been widely studied, due to the practical applications of their solutions in real-life scenarios where it is not possible to fulfill the total demand. For example, these solutions can be used to provide humanitarian relief or to allocate fire stations, hospitals, and commercial services. However, coverage is commonly based on the ability of clients to reach the facilities or on the ability of facilities to serve clients within a reasonable area (or radius) or in a limited service time. In this study, we assume that facilities have a limited service area, while people in demand centroids have a degree of mobility encompassing a reasonable travel distance to look for their demand. Based on the latter assumption, we define a maximum covering location problem that optimizes an accessibility measure. This is a weighted sum of accessibility indicators based on the coverage of demand centroids, the number of demand centroids with access to opportunities within their mobility radius, the number and location of opportunities, a travel cost function, and spatial disaggregation. We formulate our optimization problem through a mixed-integer linear program; an experimental stage on randomly-generated instances shows that a commercial solver is capable of obtaining near-optimal solutions in reasonable computational times for large instances. In addition, we use data from an economically-deprived region in Mexico to perform a sensitivity analysis for different service and mobility radii. Finally, we implement the Linear Best Worst Method to obtain the value of weights parameters representing subjective preferences for different indicators of accessibility. •we define a maximum covering location problem that optimizes an accessibility measure.•We formulate our optimization problem through a mixed-integer linear program.•optimal solutions can be obtained by the CPLEX solver in less than 5 min.•our optimization approach can be complemented by multi-attribute decision-making methods.</description><subject>Access</subject><subject>Accessibility</subject><subject>Coverage location problem</subject><subject>Demand</subject><subject>Handicapped accessibility</subject><subject>Hospitals</subject><subject>Integer programming</subject><subject>Linear best-worst method</subject><subject>Linear programming</subject><subject>Mixed-integer linear program</subject><subject>Mobility</subject><subject>Optimization</subject><subject>Sensitivity analysis</subject><issn>0038-0121</issn><issn>1873-6041</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp9kEtPwzAQhC0EEuXxBzhZ4pyyfsROJC6o4iVV4lLOluNsqKM0LnZa6L8nJZw5rbSa2Z35CLlhMGfA1F07T7hNcw6sHBeg8-KEzFihRaZAslMyAxBFBoyzc3KRUgsAXPJ8RharNdKN_fYb21EX9hh9_0G74OzgQ0-3MVQdbuiXH9bUOocp-cp3fjhQ39d-VIWYrshZY7uE13_zkrw_Pa4WL9ny7fl18bDMnCjFkAnXaA5SAchKl7aQjuvCyrx2daFYxZ3gMkfJRVWgUsB1Y0HlErStas5UKS7J7XR3TPW5wzSYNuxiP740XEqQJehfFZ9ULoaUIjZmG8d28WAYmCMs05ojLHOEZSZYo-l-MuGYf-8xmuQ89g5rH9ENpg7-P_sP7Pxx6w</recordid><startdate>20200901</startdate><enddate>20200901</enddate><creator>Ibarra-Rojas, O.J.</creator><creator>Ozuna, L.</creator><creator>López-Piñón, D.</creator><general>Elsevier Ltd</general><general>Elsevier Science Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8BJ</scope><scope>FQK</scope><scope>JBE</scope></search><sort><creationdate>20200901</creationdate><title>The maximal covering location problem with accessibility indicators</title><author>Ibarra-Rojas, O.J. ; Ozuna, L. ; López-Piñón, D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c393t-3cf72046004b79a84c278a45dcd861b2c3245e423b8e66027fa065407abd21693</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Access</topic><topic>Accessibility</topic><topic>Coverage location problem</topic><topic>Demand</topic><topic>Handicapped accessibility</topic><topic>Hospitals</topic><topic>Integer programming</topic><topic>Linear best-worst method</topic><topic>Linear programming</topic><topic>Mixed-integer linear program</topic><topic>Mobility</topic><topic>Optimization</topic><topic>Sensitivity analysis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ibarra-Rojas, O.J.</creatorcontrib><creatorcontrib>Ozuna, L.</creatorcontrib><creatorcontrib>López-Piñón, D.</creatorcontrib><collection>CrossRef</collection><collection>International Bibliography of the Social Sciences (IBSS)</collection><collection>International Bibliography of the Social Sciences</collection><collection>International Bibliography of the Social Sciences</collection><jtitle>Socio-economic planning sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ibarra-Rojas, O.J.</au><au>Ozuna, L.</au><au>López-Piñón, D.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The maximal covering location problem with accessibility indicators</atitle><jtitle>Socio-economic planning sciences</jtitle><date>2020-09-01</date><risdate>2020</risdate><volume>71</volume><spage>100758</spage><pages>100758-</pages><artnum>100758</artnum><issn>0038-0121</issn><eissn>1873-6041</eissn><abstract>Maximal covering location problems have been widely studied, due to the practical applications of their solutions in real-life scenarios where it is not possible to fulfill the total demand. For example, these solutions can be used to provide humanitarian relief or to allocate fire stations, hospitals, and commercial services. However, coverage is commonly based on the ability of clients to reach the facilities or on the ability of facilities to serve clients within a reasonable area (or radius) or in a limited service time. In this study, we assume that facilities have a limited service area, while people in demand centroids have a degree of mobility encompassing a reasonable travel distance to look for their demand. Based on the latter assumption, we define a maximum covering location problem that optimizes an accessibility measure. This is a weighted sum of accessibility indicators based on the coverage of demand centroids, the number of demand centroids with access to opportunities within their mobility radius, the number and location of opportunities, a travel cost function, and spatial disaggregation. We formulate our optimization problem through a mixed-integer linear program; an experimental stage on randomly-generated instances shows that a commercial solver is capable of obtaining near-optimal solutions in reasonable computational times for large instances. In addition, we use data from an economically-deprived region in Mexico to perform a sensitivity analysis for different service and mobility radii. Finally, we implement the Linear Best Worst Method to obtain the value of weights parameters representing subjective preferences for different indicators of accessibility. •we define a maximum covering location problem that optimizes an accessibility measure.•We formulate our optimization problem through a mixed-integer linear program.•optimal solutions can be obtained by the CPLEX solver in less than 5 min.•our optimization approach can be complemented by multi-attribute decision-making methods.</abstract><cop>Oxford</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.seps.2019.100758</doi></addata></record>
fulltext fulltext
identifier ISSN: 0038-0121
ispartof Socio-economic planning sciences, 2020-09, Vol.71, p.100758, Article 100758
issn 0038-0121
1873-6041
language eng
recordid cdi_proquest_journals_2440490769
source Elsevier ScienceDirect Journals
subjects Access
Accessibility
Coverage location problem
Demand
Handicapped accessibility
Hospitals
Integer programming
Linear best-worst method
Linear programming
Mixed-integer linear program
Mobility
Optimization
Sensitivity analysis
title The maximal covering location problem with accessibility indicators
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T01%3A28%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20maximal%20covering%20location%20problem%20with%20accessibility%20indicators&rft.jtitle=Socio-economic%20planning%20sciences&rft.au=Ibarra-Rojas,%20O.J.&rft.date=2020-09-01&rft.volume=71&rft.spage=100758&rft.pages=100758-&rft.artnum=100758&rft.issn=0038-0121&rft.eissn=1873-6041&rft_id=info:doi/10.1016/j.seps.2019.100758&rft_dat=%3Cproquest_cross%3E2440490769%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2440490769&rft_id=info:pmid/&rft_els_id=S0038012119300059&rfr_iscdi=true