期刊文献+

基于鲁棒性的竞争环境下枢纽航线网络优化设计 被引量:3

Optimal Design of Hub Network in Competitive Environment Based on Robust
下载PDF
导出
摘要 针对当前航空运输网络的逐步复杂化,通过对枢纽机场选址模式的分析,研究竞争环境下枢纽航线网络设计方案.首先,在一定的航线网络基础上,定义了旅客效用函数及捕获能力函数.然后在原有枢纽的基础上,以从竞争者那里获得的最大捕获流为目标,选址新的枢纽,建立竞争环境下枢纽逐步选择模型,并且设计了求解模型的高效算法.最后,通过随机产生的案例应用模型,分析模型中各参数变动的情形下,所得枢纽解的情况;同时,通过枢纽解对计划延误时间的敏感性分析,验证最优枢纽解的稳定性,进而验证模型的有效性.该模型可为航空公司的航线规划人员提供依据. According to the complexity of air transport network, the paper analyzes a hub airport site model and researches hub route network design competitive environment. First, it defines a passenger capacity utility function and capture function on the basis of certain route network. Then, on the basis of the existing hub, under the goals of that obtain maximum passenger capture flow from rivals, screening the new hub location, establishing stepwise hub selection model in competitive environment, and an efficient algorithm is proposed to solve the model. Finally, a random case is selected to test the model, analysis of Hub solution on variation of the parameters in model; by analyzing sensitivity of the projected delay time, verifying the stability solution of optimal hub and the effectiveness of the model. The model can provide a basis for the route planning personnel.
作者 高荣环 杨芳
出处 《交通运输系统工程与信息》 EI CSCD 北大核心 2014年第5期161-167,共7页 Journal of Transportation Systems Engineering and Information Technology
基金 中国民航大学航空运输经济与管理科学研究基地开放基金(JGKF201205)
关键词 航空运输 网络设计 启发式算法 中枢辐射 air transportation network design heuristic algorithm hub-and-spoke
  • 相关文献

参考文献12

  • 1Sibel Alumur, Bahar Y Kara .Network hub location problems:The state of the art[J], European Journal of Operational Research, 2008 (190):1 - 21.
  • 2Skorin-Kapov D, Skorin-Kapov J. On tabu search for the location of interacting hub facilities[J]. European Journal of Operational Research, 1994( 73):502 - 509.
  • 3Aykin T. The hub location and routing problem[J]. European Journal of Operational Research, 1995( 83):200 - 219.
  • 4Ernst A T, Krishnamoorthy M.Exact and heuristic algorithms for the uncapacitated multiple allocation p- hub median problem[J].European Journal of Operational Research, 1998(104): 100 - 112.
  • 5Sohn J, Park S. Efficient solution procedure and reduced size formulations for p-hub location problems[J]. European Journal of Operational Research , 1998(108): 118- 126.
  • 6Jeng- Fung Chen.A hybrid heuristic for the uncapaeitated single allocation hublocation problem[J]. Omega, 2007(35): 211 - 220.
  • 7James F Campbell. Integer programming formulations of discrete hub location problems[J]. European Journal of Operational Research ,2008(72):387-405.
  • 8Ebery J, Krishnamoorthy M, Ernst A, et al. The capacitated multiple allocation hub location problem: Formulations and algorithms[J]. European Journal of Operational Research, 2000(120):614 - 631.
  • 9Inmaculada R, Juan J. Solving a capacitated hub location problem[J]. European Journal of Operational Research ,2008(184):468 - 479.
  • 10Marianov V, Serra D, et al. Location of hubs in a competitive environment [J]. European Journal of Operational Research, 1999(114):363-371.

同被引文献19

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部