基于分配连接总数约束的枢纽网络模型  

R-Allocation Models of p-Hub Median Problem with Total Allocation Number Constraint

作　　者：韩烈[1] 张宁[1] 

机构地区：[1]北京航空航天大学经济管理学院,北京100191

出　　处：《工业工程》2013年第1期125-131,共7页Industrial Engineering Journal

基　　金：国家自然科学基金资助项目(70971003)

摘　　要：为了在枢纽网络规划中充分考虑建立分配连接的资源限制因素,引入基于分配连接总数约束的p-hub中位问题,建立两种不同形式的混和整数规划模型,分析表明在极端情况下本文模型等价于一般的单分配与多分配模型。应用经典数据包进行算例分析,结果表明:在连接数为60条件下,本文模型得到的枢纽网络全网成本比UrApHMP模型降低15%。当分配连接总数较少时,增大分配连接总数约束对枢纽选择和成本下降影响较大;分配连接总数达到45后,增加连接只能产生较小成本降低;分配连接总数达到60后,增加连接已不会带来任何改善效果。本文模型有效且实用,可为枢纽网络规划设计应用提供指导。With construction allocation resource constraint taking into account, the R-allocation p-hub me-dian problem is put forward. Then, two versions of mixed integer programming models are developed to de-scribe the problem. Based on the models, analysis is done and result shows that, for some special cases, these two models are equivalent to the classic single and multiple allocation formulations. Well-known datasets are used to test the proposed method. It indicates that, by the proposed method, when the permis-sive allocation number is 60, the total network traffic cost is 15% less than that by UrApHMP. When the permissive allocation number is small, the increase of total allocation number results in significant cost sav-ing. When this number is 45, the increase of this number can gain only a little cost saving. When the total allocation number reaches 60, the increase of this number has no effect on the traffic cost and hub loca-tion. The effectiveness and practicability of these models are demonstrated by numerical examples.

关 键 词：枢纽 p-hub中位 单分配 多分配 

分 类 号：F560[经济管理—产业经济]