HUB NETWORK DESIGN MODEL IN A COMPETITIVE ENVIRONMENT WITH FLOW THRESHOLD

• Sasaki Mihiro

  Nanzan University

抄録

We consider a hub network design model based on the Stackelberg hub location model, where two firms compete with each other to maximize their own profit. The firm as a leader first locates p hubs and decides which OD pairs should be in services on the condition that the other firm as a follower locates q hubs and decides its strategies in a similar way after that. To avoid the possibility of unprofitable services, we incorporate flow threshold constraints into the model. We formulate the leader's problem as a bilevel programming problem with the follower's problem as a lower level problem. We solve the problem with the complete enumeration method and a greedy heuristic. The main objective is to make it clear how the network structure can be affected by the flow threshold constraints and the competitor's strategies.

収録刊行物

• 日本オペレーションズ・リサーチ学会論文誌

  日本オペレーションズ・リサーチ学会論文誌 48 (2), 158-171, 2005

  公益社団法人 日本オペレーションズ・リサーチ学会

キーワード

• Facility planning
• hub location
• network design

詳細情報

• CRID: 1390282679086419200
• NII論文ID: 110001266501
• NII書誌ID: AA00703935
• DOI: 10.15807/jorsj.48.158
• ISSN: 21888299
• ISSN: 04534514
• NDL書誌ID: 7344239
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I7344239
• Web Site: https://www.jstage.jst.go.jp/article/jorsj/48/2/48_KJ00002683127/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
  • KAKEN
• 抄録ライセンスフラグ: 使用不可