HUB NETWORK DESIGN MODEL IN A COMPETITIVE ENVIRONMENT WITH FLOW THRESHOLD
HUB NETWORK DESIGN MODEL IN A COMPETITIVE ENVIRONMENT WITH FLOW THRESHOLD
复制标题
DOI：
10.15807/jorsj.48.158
复制
发表时间：
2005-06
影响因子：
--
通讯作者：
Mihiro Sasaki
中科院分区：
文献类型：
--
作者：
Mihiro Sasaki
我们考虑基于 Stackelberg 枢纽位置模型的枢纽网络设计模型，其中两家公司相互竞争以最大化自己的利润。作为领导者的公司首先找到 p 个枢纽，并决定哪些 OD 对应该投入服务，条件是其他公司作为追随者找到 q 个枢纽，然后以类似的方式决定其策略。为了避免服务无利可图的可能性，我们将流量阈值约束纳入模型中。我们将领导者的问题表述为双层编程问题，将追随者的问题表述为较低级别的问题。我们用完全枚举法和贪心启发式来解决这个问题。主要目的是弄清楚网络结构如何受到流量阈值约束和竞争对手策略的影响。
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.