Optimizing Locations and Qualities of Multiple Facilities With Competition via Intelligent Search
We study a new competitive multi-facility location and quality design problem in a continuous space. The facility location and quality design are considered together because of their interdependence. Especially, new entrant facilities compete for customer demands with existing ones and the latter...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on intelligent transportation systems 2022-06, Vol.23 (6), p.5092-5105 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 5105 |
---|---|
container_issue | 6 |
container_start_page | 5092 |
container_title | IEEE transactions on intelligent transportation systems |
container_volume | 23 |
creator | Wu, Peng Chu, Feng Saidani, Nasreddine Chen, Haoxun Zhou, MengChu |
description | We study a new competitive multi-facility location and quality design problem in a continuous space. The facility location and quality design are considered together because of their interdependence. Especially, new entrant facilities compete for customer demands with existing ones and the latter's reactions are taken into account. The goal is to maximize the profit of all new entrant facilities by optimally determining their locations and qualities. For this problem, a probabilistic Huff-like gravity model is adopted to analyze the market share to be captured by new and existing facilities, and then a mathematical programming model is provided based on the market share analysis. Since it is shown to be strongly NP-hard, a new iterative solution framework is first proposed to solve it, where at each iteration, new configurations of facility locations are firstly generated, and then the quality decisions of all facilities are modelled as a competitive decision process by a non-cooperative game. The best qualities for new and existing facilities are determined by their Nash equilibrium. Finally, optimal or near-optimal solutions are calculated. Then based on the proposed solution framework, a particle swarm optimization-based approach is developed. Computational results for randomly generated instances indicate that the devised algorithm is able to find suitable locations and qualities of newly entering facilities in a competitive environment and outperforms favorably a genetic algorithm-based approach. |
doi_str_mv | 10.1109/TITS.2020.3046885 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_9357484</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9357484</ieee_id><sourcerecordid>2672087992</sourcerecordid><originalsourceid>FETCH-LOGICAL-c327t-3c014e5d397d323b503c8bbc05d5e454a8df83725ab50e8f0c30bc000a0702b33</originalsourceid><addsrcrecordid>eNo9kFFLwzAUhYsoOKc_QHwJ-ORD503SrOnjGM4NKkM28TGkabpldE1t04H-elM69nQv537ncjhB8IhhgjEkr9vVdjMhQGBCIZpyzq6CEWaMhwB4et3vJAoTYHAb3LXtwasRw3gUyHXtzNH8mWqHUqukM7Zqkaxy9NnJ0jijW2QL9NGVztSlRgupzFn-Nm6P5vZYa2d6GzoZiVaV02VpdrpyaKNlo_b3wU0hy1Y_nOc4-Fq8befLMF2_r-azNFSUxC6kykfSLKdJnFNCMwZU8SxTwHKmIxZJnhecxoRJf9K8AEXBXwEkxEAySsfBy_B3L0tRN-Yom19hpRHLWSp6DShmlBB2wp59Hti6sT-dbp042K6pfDxBpjEBHicJ8RQeKNXYtm10cXmLQfSti7510bcuzq17z9PgMVrrC59QFkc8ov-GaX1q</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2672087992</pqid></control><display><type>article</type><title>Optimizing Locations and Qualities of Multiple Facilities With Competition via Intelligent Search</title><source>IEEE Electronic Library (IEL)</source><creator>Wu, Peng ; Chu, Feng ; Saidani, Nasreddine ; Chen, Haoxun ; Zhou, MengChu</creator><creatorcontrib>Wu, Peng ; Chu, Feng ; Saidani, Nasreddine ; Chen, Haoxun ; Zhou, MengChu</creatorcontrib><description>We study a new competitive multi-facility location and quality design problem in a continuous space. The facility location and quality design are considered together because of their interdependence. Especially, new entrant facilities compete for customer demands with existing ones and the latter's reactions are taken into account. The goal is to maximize the profit of all new entrant facilities by optimally determining their locations and qualities. For this problem, a probabilistic Huff-like gravity model is adopted to analyze the market share to be captured by new and existing facilities, and then a mathematical programming model is provided based on the market share analysis. Since it is shown to be strongly NP-hard, a new iterative solution framework is first proposed to solve it, where at each iteration, new configurations of facility locations are firstly generated, and then the quality decisions of all facilities are modelled as a competitive decision process by a non-cooperative game. The best qualities for new and existing facilities are determined by their Nash equilibrium. Finally, optimal or near-optimal solutions are calculated. Then based on the proposed solution framework, a particle swarm optimization-based approach is developed. Computational results for randomly generated instances indicate that the devised algorithm is able to find suitable locations and qualities of newly entering facilities in a competitive environment and outperforms favorably a genetic algorithm-based approach.</description><identifier>ISSN: 1524-9050</identifier><identifier>EISSN: 1558-0016</identifier><identifier>DOI: 10.1109/TITS.2020.3046885</identifier><identifier>CODEN: ITISFG</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Analytical models ; competition ; Computational modeling ; Computer Science ; Economics ; Facility location ; game theory ; Genetic algorithms ; Gravity ; Iterative methods ; iterative search ; Iterative solution ; machine learning ; Market shares ; Markets ; Mathematical model ; Mathematical programming ; Nash equilibrium ; Operations Research ; Particle swarm optimization ; Probabilistic logic ; quality design ; Search problems</subject><ispartof>IEEE transactions on intelligent transportation systems, 2022-06, Vol.23 (6), p.5092-5105</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c327t-3c014e5d397d323b503c8bbc05d5e454a8df83725ab50e8f0c30bc000a0702b33</citedby><cites>FETCH-LOGICAL-c327t-3c014e5d397d323b503c8bbc05d5e454a8df83725ab50e8f0c30bc000a0702b33</cites><orcidid>0000-0002-5408-8752 ; 0000-0003-0687-9565 ; 0000-0001-6259-4703 ; 0000-0003-1225-8319</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9357484$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>230,314,776,780,792,881,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9357484$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://hal.science/hal-03153225$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Wu, Peng</creatorcontrib><creatorcontrib>Chu, Feng</creatorcontrib><creatorcontrib>Saidani, Nasreddine</creatorcontrib><creatorcontrib>Chen, Haoxun</creatorcontrib><creatorcontrib>Zhou, MengChu</creatorcontrib><title>Optimizing Locations and Qualities of Multiple Facilities With Competition via Intelligent Search</title><title>IEEE transactions on intelligent transportation systems</title><addtitle>TITS</addtitle><description>We study a new competitive multi-facility location and quality design problem in a continuous space. The facility location and quality design are considered together because of their interdependence. Especially, new entrant facilities compete for customer demands with existing ones and the latter's reactions are taken into account. The goal is to maximize the profit of all new entrant facilities by optimally determining their locations and qualities. For this problem, a probabilistic Huff-like gravity model is adopted to analyze the market share to be captured by new and existing facilities, and then a mathematical programming model is provided based on the market share analysis. Since it is shown to be strongly NP-hard, a new iterative solution framework is first proposed to solve it, where at each iteration, new configurations of facility locations are firstly generated, and then the quality decisions of all facilities are modelled as a competitive decision process by a non-cooperative game. The best qualities for new and existing facilities are determined by their Nash equilibrium. Finally, optimal or near-optimal solutions are calculated. Then based on the proposed solution framework, a particle swarm optimization-based approach is developed. Computational results for randomly generated instances indicate that the devised algorithm is able to find suitable locations and qualities of newly entering facilities in a competitive environment and outperforms favorably a genetic algorithm-based approach.</description><subject>Analytical models</subject><subject>competition</subject><subject>Computational modeling</subject><subject>Computer Science</subject><subject>Economics</subject><subject>Facility location</subject><subject>game theory</subject><subject>Genetic algorithms</subject><subject>Gravity</subject><subject>Iterative methods</subject><subject>iterative search</subject><subject>Iterative solution</subject><subject>machine learning</subject><subject>Market shares</subject><subject>Markets</subject><subject>Mathematical model</subject><subject>Mathematical programming</subject><subject>Nash equilibrium</subject><subject>Operations Research</subject><subject>Particle swarm optimization</subject><subject>Probabilistic logic</subject><subject>quality design</subject><subject>Search problems</subject><issn>1524-9050</issn><issn>1558-0016</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kFFLwzAUhYsoOKc_QHwJ-ORD503SrOnjGM4NKkM28TGkabpldE1t04H-elM69nQv537ncjhB8IhhgjEkr9vVdjMhQGBCIZpyzq6CEWaMhwB4et3vJAoTYHAb3LXtwasRw3gUyHXtzNH8mWqHUqukM7Zqkaxy9NnJ0jijW2QL9NGVztSlRgupzFn-Nm6P5vZYa2d6GzoZiVaV02VpdrpyaKNlo_b3wU0hy1Y_nOc4-Fq8befLMF2_r-azNFSUxC6kykfSLKdJnFNCMwZU8SxTwHKmIxZJnhecxoRJf9K8AEXBXwEkxEAySsfBy_B3L0tRN-Yom19hpRHLWSp6DShmlBB2wp59Hti6sT-dbp042K6pfDxBpjEBHicJ8RQeKNXYtm10cXmLQfSti7510bcuzq17z9PgMVrrC59QFkc8ov-GaX1q</recordid><startdate>20220601</startdate><enddate>20220601</enddate><creator>Wu, Peng</creator><creator>Chu, Feng</creator><creator>Saidani, Nasreddine</creator><creator>Chen, Haoxun</creator><creator>Zhou, MengChu</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0002-5408-8752</orcidid><orcidid>https://orcid.org/0000-0003-0687-9565</orcidid><orcidid>https://orcid.org/0000-0001-6259-4703</orcidid><orcidid>https://orcid.org/0000-0003-1225-8319</orcidid></search><sort><creationdate>20220601</creationdate><title>Optimizing Locations and Qualities of Multiple Facilities With Competition via Intelligent Search</title><author>Wu, Peng ; Chu, Feng ; Saidani, Nasreddine ; Chen, Haoxun ; Zhou, MengChu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c327t-3c014e5d397d323b503c8bbc05d5e454a8df83725ab50e8f0c30bc000a0702b33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Analytical models</topic><topic>competition</topic><topic>Computational modeling</topic><topic>Computer Science</topic><topic>Economics</topic><topic>Facility location</topic><topic>game theory</topic><topic>Genetic algorithms</topic><topic>Gravity</topic><topic>Iterative methods</topic><topic>iterative search</topic><topic>Iterative solution</topic><topic>machine learning</topic><topic>Market shares</topic><topic>Markets</topic><topic>Mathematical model</topic><topic>Mathematical programming</topic><topic>Nash equilibrium</topic><topic>Operations Research</topic><topic>Particle swarm optimization</topic><topic>Probabilistic logic</topic><topic>quality design</topic><topic>Search problems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wu, Peng</creatorcontrib><creatorcontrib>Chu, Feng</creatorcontrib><creatorcontrib>Saidani, Nasreddine</creatorcontrib><creatorcontrib>Chen, Haoxun</creatorcontrib><creatorcontrib>Zhou, MengChu</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</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>Hyper Article en Ligne (HAL)</collection><jtitle>IEEE transactions on intelligent transportation systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Wu, Peng</au><au>Chu, Feng</au><au>Saidani, Nasreddine</au><au>Chen, Haoxun</au><au>Zhou, MengChu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimizing Locations and Qualities of Multiple Facilities With Competition via Intelligent Search</atitle><jtitle>IEEE transactions on intelligent transportation systems</jtitle><stitle>TITS</stitle><date>2022-06-01</date><risdate>2022</risdate><volume>23</volume><issue>6</issue><spage>5092</spage><epage>5105</epage><pages>5092-5105</pages><issn>1524-9050</issn><eissn>1558-0016</eissn><coden>ITISFG</coden><abstract>We study a new competitive multi-facility location and quality design problem in a continuous space. The facility location and quality design are considered together because of their interdependence. Especially, new entrant facilities compete for customer demands with existing ones and the latter's reactions are taken into account. The goal is to maximize the profit of all new entrant facilities by optimally determining their locations and qualities. For this problem, a probabilistic Huff-like gravity model is adopted to analyze the market share to be captured by new and existing facilities, and then a mathematical programming model is provided based on the market share analysis. Since it is shown to be strongly NP-hard, a new iterative solution framework is first proposed to solve it, where at each iteration, new configurations of facility locations are firstly generated, and then the quality decisions of all facilities are modelled as a competitive decision process by a non-cooperative game. The best qualities for new and existing facilities are determined by their Nash equilibrium. Finally, optimal or near-optimal solutions are calculated. Then based on the proposed solution framework, a particle swarm optimization-based approach is developed. Computational results for randomly generated instances indicate that the devised algorithm is able to find suitable locations and qualities of newly entering facilities in a competitive environment and outperforms favorably a genetic algorithm-based approach.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TITS.2020.3046885</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0002-5408-8752</orcidid><orcidid>https://orcid.org/0000-0003-0687-9565</orcidid><orcidid>https://orcid.org/0000-0001-6259-4703</orcidid><orcidid>https://orcid.org/0000-0003-1225-8319</orcidid></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1524-9050 |
ispartof | IEEE transactions on intelligent transportation systems, 2022-06, Vol.23 (6), p.5092-5105 |
issn | 1524-9050 1558-0016 |
language | eng |
recordid | cdi_ieee_primary_9357484 |
source | IEEE Electronic Library (IEL) |
subjects | Analytical models competition Computational modeling Computer Science Economics Facility location game theory Genetic algorithms Gravity Iterative methods iterative search Iterative solution machine learning Market shares Markets Mathematical model Mathematical programming Nash equilibrium Operations Research Particle swarm optimization Probabilistic logic quality design Search problems |
title | Optimizing Locations and Qualities of Multiple Facilities With Competition via Intelligent Search |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T16%3A15%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimizing%20Locations%20and%20Qualities%20of%20Multiple%20Facilities%20With%20Competition%20via%20Intelligent%20Search&rft.jtitle=IEEE%20transactions%20on%20intelligent%20transportation%20systems&rft.au=Wu,%20Peng&rft.date=2022-06-01&rft.volume=23&rft.issue=6&rft.spage=5092&rft.epage=5105&rft.pages=5092-5105&rft.issn=1524-9050&rft.eissn=1558-0016&rft.coden=ITISFG&rft_id=info:doi/10.1109/TITS.2020.3046885&rft_dat=%3Cproquest_RIE%3E2672087992%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2672087992&rft_id=info:pmid/&rft_ieee_id=9357484&rfr_iscdi=true |