工业工程 ›› 2020, Vol. 23 ›› Issue (2): 100-104,123.doi: 10.3969/j.issn.1007-7375.2020.02.013

• 专题论述 • 上一篇    下一篇

有能力限制的轴辐网络关键枢纽识别模型

李婷婷   

  1. 北京大学 城市规划与设计学院,广东 深圳 518055
  • 收稿日期:2019-04-17 发布日期:2020-04-22
  • 作者简介:李婷婷(1985-),女,广东省人,博士后,主要研究方向为交通运输规划与管理
  • 基金资助:
    国家自然科学基金资助项目(51678004)

A Model for Identifying Critical Hubs in Capacitated Hub-and-spoke Networks

LI Tingting   

  1. School of Urban Planning and Design, Peking University, Shenzhen 518055, China
  • Received:2019-04-17 Published:2020-04-22

摘要: 为识别轴辐网络的关键枢纽,考虑枢纽能力限制构建双层规划模型,基于下层模型的对偶问题将双层规划模型转化为单层规划并线性化,通过算例验证了模型的有效性。结果表明:能力限制下,模型的约束和变量数增多、求解时间变长、关键枢纽识别结果有差异;随着折扣系数或关键枢纽数量减小或惩罚成本增大,计算时间增加;惩罚成本影响关键枢纽识别结果;通过比较不同参数下的关键枢纽,可识别相对固定的关键枢纽并加强设防。

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

Abstract: 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.

Key words: hub-and-spoke network, identification of critical hubs, bilevel programming model, capacity constraints

中图分类号: