A Stackelberg hub arc location model for a competitive environment
In this paper, we consider the design of large-scale multiple allocation hub-and-spoke transportation networks in a competitive environment. We adopt a generic hub arc location model that locates arcs with discounted transport costs connecting pairs of hub facilities. Two firms compete for customers...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research 2014-07, Vol.47, p.27-41 |
|---|---|
| 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 | 41 |
|---|---|
| container_issue | |
| container_start_page | 27 |
| container_title | Computers & operations research |
| container_volume | 47 |
| creator | Sasaki, Mihiro Campbell, James F. Krishnamoorthy, Mohan Ernst, Andreas T. |
| description | In this paper, we consider the design of large-scale multiple allocation hub-and-spoke transportation networks in a competitive environment. We adopt a generic hub arc location model that locates arcs with discounted transport costs connecting pairs of hub facilities. Two firms compete for customers in a Stackelberg framework where the leader firm locates hub arcs to maximize its revenue, given that the follower firm will subsequently locate its own hub arcs to maximize its own revenue. We present an optimal solution algorithm that allocates traffic between the two firms based on the relative utility of travel via the competing hub networks. Results for each competing firm with up to three hub arcs show the important role of competition in designing hub-based transportation systems. |
| doi_str_mv | 10.1016/j.cor.2014.01.009 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1677926467</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305054814000227</els_id><sourcerecordid>1559701455</sourcerecordid><originalsourceid>FETCH-LOGICAL-c518t-a47f1dbaf6b286a09561a4ca59eb004aa5f1672124ce31557b50a176a4d5ffcb3</originalsourceid><addsrcrecordid>eNqFkUtv1TAQhS0EEpfCD2BnqULqJqkn8SMRq1LRh1SJBSCxsybOGHybxBc790r8-7q6FQsWZTaz-c48zmHsPYgaBOjzbe1iqhsBshZQC9G_YBvoTFsZrX68ZBvRClUJJbvX7E3OW1HKNLBhny741xXdPU0DpZ_8137gmByfosM1xIXPcaSJ-5g4chfnHa1hDQfitBxCistMy_qWvfI4ZXr31E_Y96vP3y5vqrsv17eXF3eVU9CtFUrjYRzQ66HpNIpeaUDpUPU0CCERlQddbmqkoxaUMoMSCEajHJX3bmhP2Nlx7i7F33vKq51DdjRNuFDcZ1vUpm-01Ob_qFK9KV4pVdDTf9Bt3KelPFIoAC36zshCwZFyKeacyNtdCjOmPxaEfQzAbm0JwD4GYAXYEkDRfHiajNnh5BMuLuS_wqZrjTYKCvfxyFEx7xAo2ewCLY7GkMitdozhmS0PxSeZKQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1511609874</pqid></control><display><type>article</type><title>A Stackelberg hub arc location model for a competitive environment</title><source>ScienceDirect Journals (5 years ago - present)</source><creator>Sasaki, Mihiro ; Campbell, James F. ; Krishnamoorthy, Mohan ; Ernst, Andreas T.</creator><creatorcontrib>Sasaki, Mihiro ; Campbell, James F. ; Krishnamoorthy, Mohan ; Ernst, Andreas T.</creatorcontrib><description>In this paper, we consider the design of large-scale multiple allocation hub-and-spoke transportation networks in a competitive environment. We adopt a generic hub arc location model that locates arcs with discounted transport costs connecting pairs of hub facilities. Two firms compete for customers in a Stackelberg framework where the leader firm locates hub arcs to maximize its revenue, given that the follower firm will subsequently locate its own hub arcs to maximize its own revenue. We present an optimal solution algorithm that allocates traffic between the two firms based on the relative utility of travel via the competing hub networks. Results for each competing firm with up to three hub arcs show the important role of competition in designing hub-based transportation systems.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 1873-765X</identifier><identifier>EISSN: 0305-0548</identifier><identifier>DOI: 10.1016/j.cor.2014.01.009</identifier><identifier>CODEN: CMORAP</identifier><language>eng</language><publisher>Kidlington: Elsevier Ltd</publisher><subject>Algorithms ; Applied sciences ; Competition ; Competitive location ; Computer simulation ; Exact sciences and technology ; Firm modelling ; Game theory ; Hub location ; Logistics ; Mathematical models ; Networks ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Optimization algorithms ; Position (location) ; Revenues ; Stackelberg competition ; Studies ; Traffic flow ; Transportation terminals</subject><ispartof>Computers & operations research, 2014-07, Vol.47, p.27-41</ispartof><rights>2014 Elsevier Ltd</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Pergamon Press Inc. Jul 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c518t-a47f1dbaf6b286a09561a4ca59eb004aa5f1672124ce31557b50a176a4d5ffcb3</citedby><cites>FETCH-LOGICAL-c518t-a47f1dbaf6b286a09561a4ca59eb004aa5f1672124ce31557b50a176a4d5ffcb3</cites><orcidid>0000-0002-3805-4819</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.cor.2014.01.009$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28376751$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Sasaki, Mihiro</creatorcontrib><creatorcontrib>Campbell, James F.</creatorcontrib><creatorcontrib>Krishnamoorthy, Mohan</creatorcontrib><creatorcontrib>Ernst, Andreas T.</creatorcontrib><title>A Stackelberg hub arc location model for a competitive environment</title><title>Computers & operations research</title><description>In this paper, we consider the design of large-scale multiple allocation hub-and-spoke transportation networks in a competitive environment. We adopt a generic hub arc location model that locates arcs with discounted transport costs connecting pairs of hub facilities. Two firms compete for customers in a Stackelberg framework where the leader firm locates hub arcs to maximize its revenue, given that the follower firm will subsequently locate its own hub arcs to maximize its own revenue. We present an optimal solution algorithm that allocates traffic between the two firms based on the relative utility of travel via the competing hub networks. Results for each competing firm with up to three hub arcs show the important role of competition in designing hub-based transportation systems.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Competition</subject><subject>Competitive location</subject><subject>Computer simulation</subject><subject>Exact sciences and technology</subject><subject>Firm modelling</subject><subject>Game theory</subject><subject>Hub location</subject><subject>Logistics</subject><subject>Mathematical models</subject><subject>Networks</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Optimization algorithms</subject><subject>Position (location)</subject><subject>Revenues</subject><subject>Stackelberg competition</subject><subject>Studies</subject><subject>Traffic flow</subject><subject>Transportation terminals</subject><issn>0305-0548</issn><issn>1873-765X</issn><issn>0305-0548</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNqFkUtv1TAQhS0EEpfCD2BnqULqJqkn8SMRq1LRh1SJBSCxsybOGHybxBc790r8-7q6FQsWZTaz-c48zmHsPYgaBOjzbe1iqhsBshZQC9G_YBvoTFsZrX68ZBvRClUJJbvX7E3OW1HKNLBhny741xXdPU0DpZ_8137gmByfosM1xIXPcaSJ-5g4chfnHa1hDQfitBxCistMy_qWvfI4ZXr31E_Y96vP3y5vqrsv17eXF3eVU9CtFUrjYRzQ66HpNIpeaUDpUPU0CCERlQddbmqkoxaUMoMSCEajHJX3bmhP2Nlx7i7F33vKq51DdjRNuFDcZ1vUpm-01Ob_qFK9KV4pVdDTf9Bt3KelPFIoAC36zshCwZFyKeacyNtdCjOmPxaEfQzAbm0JwD4GYAXYEkDRfHiajNnh5BMuLuS_wqZrjTYKCvfxyFEx7xAo2ewCLY7GkMitdozhmS0PxSeZKQ</recordid><startdate>20140701</startdate><enddate>20140701</enddate><creator>Sasaki, Mihiro</creator><creator>Campbell, James F.</creator><creator>Krishnamoorthy, Mohan</creator><creator>Ernst, Andreas T.</creator><general>Elsevier Ltd</general><general>Elsevier</general><general>Pergamon Press Inc</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-3805-4819</orcidid></search><sort><creationdate>20140701</creationdate><title>A Stackelberg hub arc location model for a competitive environment</title><author>Sasaki, Mihiro ; Campbell, James F. ; Krishnamoorthy, Mohan ; Ernst, Andreas T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c518t-a47f1dbaf6b286a09561a4ca59eb004aa5f1672124ce31557b50a176a4d5ffcb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Competition</topic><topic>Competitive location</topic><topic>Computer simulation</topic><topic>Exact sciences and technology</topic><topic>Firm modelling</topic><topic>Game theory</topic><topic>Hub location</topic><topic>Logistics</topic><topic>Mathematical models</topic><topic>Networks</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Optimization algorithms</topic><topic>Position (location)</topic><topic>Revenues</topic><topic>Stackelberg competition</topic><topic>Studies</topic><topic>Traffic flow</topic><topic>Transportation terminals</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sasaki, Mihiro</creatorcontrib><creatorcontrib>Campbell, James F.</creatorcontrib><creatorcontrib>Krishnamoorthy, Mohan</creatorcontrib><creatorcontrib>Ernst, Andreas T.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computers & operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sasaki, Mihiro</au><au>Campbell, James F.</au><au>Krishnamoorthy, Mohan</au><au>Ernst, Andreas T.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Stackelberg hub arc location model for a competitive environment</atitle><jtitle>Computers & operations research</jtitle><date>2014-07-01</date><risdate>2014</risdate><volume>47</volume><spage>27</spage><epage>41</epage><pages>27-41</pages><issn>0305-0548</issn><eissn>1873-765X</eissn><eissn>0305-0548</eissn><coden>CMORAP</coden><abstract>In this paper, we consider the design of large-scale multiple allocation hub-and-spoke transportation networks in a competitive environment. We adopt a generic hub arc location model that locates arcs with discounted transport costs connecting pairs of hub facilities. Two firms compete for customers in a Stackelberg framework where the leader firm locates hub arcs to maximize its revenue, given that the follower firm will subsequently locate its own hub arcs to maximize its own revenue. We present an optimal solution algorithm that allocates traffic between the two firms based on the relative utility of travel via the competing hub networks. Results for each competing firm with up to three hub arcs show the important role of competition in designing hub-based transportation systems.</abstract><cop>Kidlington</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2014.01.009</doi><tpages>15</tpages><orcidid>https://orcid.org/0000-0002-3805-4819</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0305-0548 |
| ispartof | Computers & operations research, 2014-07, Vol.47, p.27-41 |
| issn | 0305-0548 1873-765X 0305-0548 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1677926467 |
| source | ScienceDirect Journals (5 years ago - present) |
| subjects | Algorithms Applied sciences Competition Competitive location Computer simulation Exact sciences and technology Firm modelling Game theory Hub location Logistics Mathematical models Networks Operational research and scientific management Operational research. Management science Operations research Optimization algorithms Position (location) Revenues Stackelberg competition Studies Traffic flow Transportation terminals |
| title | A Stackelberg hub arc location model for a competitive environment |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T23%3A26%3A44IST&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=A%20Stackelberg%20hub%20arc%20location%20model%20for%20a%20competitive%20environment&rft.jtitle=Computers%20&%20operations%20research&rft.au=Sasaki,%20Mihiro&rft.date=2014-07-01&rft.volume=47&rft.spage=27&rft.epage=41&rft.pages=27-41&rft.issn=0305-0548&rft.eissn=1873-765X&rft.coden=CMORAP&rft_id=info:doi/10.1016/j.cor.2014.01.009&rft_dat=%3Cproquest_cross%3E1559701455%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=1511609874&rft_id=info:pmid/&rft_els_id=S0305054814000227&rfr_iscdi=true |