作　　者： (）;

机构地区： 北京大学深圳研究生院

出　　处： 《工业工程》 2020年第2期100-104,123,共6页

摘　　要： 为识别轴辐网络的关键枢纽,考虑枢纽能力限制构建双层规划模型,基于下层模型的对偶问题将双层规划模型转化为单层规划并线性化,通过算例验证了模型的有效性。结果表明:能力限制下,模型的约束和变量数增多、求解时间变长、关键枢纽识别结果有差异;随着折扣系数或关键枢纽数量减小或惩罚成本增大,计算时间增加;惩罚成本影响关键枢纽识别结果;通过比较不同参数下的关键枢纽,可识别相对固定的关键枢纽并加强设防。 In order to identify the critical hubs in hub-and-spoke networks,a bilevel programming model is constructed considering the capacity limitation of hubs.Based on the dual problem of the lower level model,the bilevel programming model is transformed into single-level programming and linearized.The validity of the model is verified by a numerical example.The results show that the model has larger numbers of constraints and variables,longer solution time and different results of critical hub identification under the capacitated constraints.With the reductions of discount coefficients or the number of critical hubs or the increase of penalty cost,the calculation time generally increases.Penalty cost affects the results of critical hub identification.By comparing the critical hubs with different parameters,the relatively fixed critical hubs can be identified and fortification strengthened.

关 键 词： 轴辐网络 关键枢纽识别 双层规划模型 能力限制

领　　域： []