The Obnoxious Competitive Facility Location Model
In this paper we propose a new competitive location model that considers the possible negative impact generated by competing facilities (such as cannabis dispensaries) on surrounding communities. The facilities cannot be located too close to the communities. Therefore, when distances are Euclidean,...
Gespeichert in:
| Veröffentlicht in: | Networks and spatial economics 2023-12, Vol.23 (4), p.885-903 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 903 |
|---|---|
| container_issue | 4 |
| container_start_page | 885 |
| container_title | Networks and spatial economics |
| container_volume | 23 |
| creator | Drezner, Tammy Drezner, Zvi Zerom, Dawit |
| description | In this paper we propose a new competitive location model that considers the possible negative impact generated by competing facilities (such as cannabis dispensaries) on surrounding communities. The facilities cannot be located too close to the communities. Therefore, when distances are Euclidean, the facilities must be located at a point outside a set of circles centered at the communities. After formulating the model, a specially designed efficient algorithm that solves the single facility location problem within a given relative accuracy of optimality is constructed. A total of 128 instances are solved in a relatively short time. The largest instance of 10 existing competing facilities and 20,000 demand points was solved in less than 15 min of computer time. This new model opens avenues for future research by designing similar new models. Also, the algorithm designed in this paper can be applied to solving other location problems with outside of a set of circles constraints. |
| doi_str_mv | 10.1007/s11067-023-09603-1 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2891360916</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2891360916</sourcerecordid><originalsourceid>FETCH-LOGICAL-c409t-abe8808d670185231d8d9fbd73b626d2244369be9da62dcd54509f5c53f0db453</originalsourceid><addsrcrecordid>eNp9kMFKAzEQhoMoWKsv4GnBc3Qm2SSboxSrQqWXCt7C7iarKe2mbnbFvr2pK_TmaQbm-_-Bj5BrhFsEUHcREaSiwDgFLYFTPCETFIpRnTN1etilpIj87ZxcxLgGQCmYmBBcfbhsWbXh24chZrOw3bne9_7LZfOy9hvf77NFqMvehzZ7CdZtLslZU26iu_qbU_I6f1jNnuhi-fg8u1_QOgfd07JyRQGFlQqwEIyjLaxuKqt4JZm0jOU5l7py2paS2dqKXIBuRC14A7bKBZ-Sm7F314XPwcXerMPQtemlYYVGLkGjTBQbqboLMXauMbvOb8tubxDMQY0Z1ZikxvyqMZhC2RhydWh9PEYKxfPUzFVC-IjEdGzfXXf8_k_xD9evb3M</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2891360916</pqid></control><display><type>article</type><title>The Obnoxious Competitive Facility Location Model</title><source>SpringerLink Journals - AutoHoldings</source><source>EBSCOhost Business Source Complete</source><creator>Drezner, Tammy ; Drezner, Zvi ; Zerom, Dawit</creator><creatorcontrib>Drezner, Tammy ; Drezner, Zvi ; Zerom, Dawit</creatorcontrib><description>In this paper we propose a new competitive location model that considers the possible negative impact generated by competing facilities (such as cannabis dispensaries) on surrounding communities. The facilities cannot be located too close to the communities. Therefore, when distances are Euclidean, the facilities must be located at a point outside a set of circles centered at the communities. After formulating the model, a specially designed efficient algorithm that solves the single facility location problem within a given relative accuracy of optimality is constructed. A total of 128 instances are solved in a relatively short time. The largest instance of 10 existing competing facilities and 20,000 demand points was solved in less than 15 min of computer time. This new model opens avenues for future research by designing similar new models. Also, the algorithm designed in this paper can be applied to solving other location problems with outside of a set of circles constraints.</description><identifier>ISSN: 1566-113X</identifier><identifier>EISSN: 1572-9427</identifier><identifier>DOI: 10.1007/s11067-023-09603-1</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Cannabis ; Civil Engineering ; Competition ; Customers ; Economic activity ; Economics ; Economics and Finance ; Fire stations ; Grocery stores ; Market shares ; Operations research ; Operations Research/Decision Theory ; Regional/Spatial Science ; Shopping centers ; Site selection</subject><ispartof>Networks and spatial economics, 2023-12, Vol.23 (4), p.885-903</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c409t-abe8808d670185231d8d9fbd73b626d2244369be9da62dcd54509f5c53f0db453</citedby><cites>FETCH-LOGICAL-c409t-abe8808d670185231d8d9fbd73b626d2244369be9da62dcd54509f5c53f0db453</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11067-023-09603-1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11067-023-09603-1$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Drezner, Tammy</creatorcontrib><creatorcontrib>Drezner, Zvi</creatorcontrib><creatorcontrib>Zerom, Dawit</creatorcontrib><title>The Obnoxious Competitive Facility Location Model</title><title>Networks and spatial economics</title><addtitle>Netw Spat Econ</addtitle><description>In this paper we propose a new competitive location model that considers the possible negative impact generated by competing facilities (such as cannabis dispensaries) on surrounding communities. The facilities cannot be located too close to the communities. Therefore, when distances are Euclidean, the facilities must be located at a point outside a set of circles centered at the communities. After formulating the model, a specially designed efficient algorithm that solves the single facility location problem within a given relative accuracy of optimality is constructed. A total of 128 instances are solved in a relatively short time. The largest instance of 10 existing competing facilities and 20,000 demand points was solved in less than 15 min of computer time. This new model opens avenues for future research by designing similar new models. Also, the algorithm designed in this paper can be applied to solving other location problems with outside of a set of circles constraints.</description><subject>Algorithms</subject><subject>Cannabis</subject><subject>Civil Engineering</subject><subject>Competition</subject><subject>Customers</subject><subject>Economic activity</subject><subject>Economics</subject><subject>Economics and Finance</subject><subject>Fire stations</subject><subject>Grocery stores</subject><subject>Market shares</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Regional/Spatial Science</subject><subject>Shopping centers</subject><subject>Site selection</subject><issn>1566-113X</issn><issn>1572-9427</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp9kMFKAzEQhoMoWKsv4GnBc3Qm2SSboxSrQqWXCt7C7iarKe2mbnbFvr2pK_TmaQbm-_-Bj5BrhFsEUHcREaSiwDgFLYFTPCETFIpRnTN1etilpIj87ZxcxLgGQCmYmBBcfbhsWbXh24chZrOw3bne9_7LZfOy9hvf77NFqMvehzZ7CdZtLslZU26iu_qbU_I6f1jNnuhi-fg8u1_QOgfd07JyRQGFlQqwEIyjLaxuKqt4JZm0jOU5l7py2paS2dqKXIBuRC14A7bKBZ-Sm7F314XPwcXerMPQtemlYYVGLkGjTBQbqboLMXauMbvOb8tubxDMQY0Z1ZikxvyqMZhC2RhydWh9PEYKxfPUzFVC-IjEdGzfXXf8_k_xD9evb3M</recordid><startdate>20231201</startdate><enddate>20231201</enddate><creator>Drezner, Tammy</creator><creator>Drezner, Zvi</creator><creator>Zerom, Dawit</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>OQ6</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20231201</creationdate><title>The Obnoxious Competitive Facility Location Model</title><author>Drezner, Tammy ; Drezner, Zvi ; Zerom, Dawit</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c409t-abe8808d670185231d8d9fbd73b626d2244369be9da62dcd54509f5c53f0db453</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Cannabis</topic><topic>Civil Engineering</topic><topic>Competition</topic><topic>Customers</topic><topic>Economic activity</topic><topic>Economics</topic><topic>Economics and Finance</topic><topic>Fire stations</topic><topic>Grocery stores</topic><topic>Market shares</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Regional/Spatial Science</topic><topic>Shopping centers</topic><topic>Site selection</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Drezner, Tammy</creatorcontrib><creatorcontrib>Drezner, Zvi</creatorcontrib><creatorcontrib>Zerom, Dawit</creatorcontrib><collection>ECONIS</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>Networks and spatial economics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Drezner, Tammy</au><au>Drezner, Zvi</au><au>Zerom, Dawit</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Obnoxious Competitive Facility Location Model</atitle><jtitle>Networks and spatial economics</jtitle><stitle>Netw Spat Econ</stitle><date>2023-12-01</date><risdate>2023</risdate><volume>23</volume><issue>4</issue><spage>885</spage><epage>903</epage><pages>885-903</pages><issn>1566-113X</issn><eissn>1572-9427</eissn><abstract>In this paper we propose a new competitive location model that considers the possible negative impact generated by competing facilities (such as cannabis dispensaries) on surrounding communities. The facilities cannot be located too close to the communities. Therefore, when distances are Euclidean, the facilities must be located at a point outside a set of circles centered at the communities. After formulating the model, a specially designed efficient algorithm that solves the single facility location problem within a given relative accuracy of optimality is constructed. A total of 128 instances are solved in a relatively short time. The largest instance of 10 existing competing facilities and 20,000 demand points was solved in less than 15 min of computer time. This new model opens avenues for future research by designing similar new models. Also, the algorithm designed in this paper can be applied to solving other location problems with outside of a set of circles constraints.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11067-023-09603-1</doi><tpages>19</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1566-113X |
| ispartof | Networks and spatial economics, 2023-12, Vol.23 (4), p.885-903 |
| issn | 1566-113X 1572-9427 |
| language | eng |
| recordid | cdi_proquest_journals_2891360916 |
| source | SpringerLink Journals - AutoHoldings; EBSCOhost Business Source Complete |
| subjects | Algorithms Cannabis Civil Engineering Competition Customers Economic activity Economics Economics and Finance Fire stations Grocery stores Market shares Operations research Operations Research/Decision Theory Regional/Spatial Science Shopping centers Site selection |
| title | The Obnoxious Competitive Facility Location Model |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T16%3A26%3A40IST&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%20Obnoxious%20Competitive%20Facility%20Location%20Model&rft.jtitle=Networks%20and%20spatial%20economics&rft.au=Drezner,%20Tammy&rft.date=2023-12-01&rft.volume=23&rft.issue=4&rft.spage=885&rft.epage=903&rft.pages=885-903&rft.issn=1566-113X&rft.eissn=1572-9427&rft_id=info:doi/10.1007/s11067-023-09603-1&rft_dat=%3Cproquest_cross%3E2891360916%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=2891360916&rft_id=info:pmid/&rfr_iscdi=true |