期刊文献+

航线网络区间鲁棒优化设计 被引量:5

Interval Robust Optimization of Airline Network Designing
在线阅读 下载PDF
导出
摘要 为解决航空公司航线网络中枢纽机场具体位置及OD流路径设计问题,根据航线网络设计参数OD流量和单位流成本的不确定性,定义了区间型情景集,建立了区间型绝对鲁棒优化模型,设计了将修正最短路算法与人工智能算法相结合进行求解的有效算法,并利用航线网络设计经典数据及中国航空网络OD数据对模型进行了验证.研究结果表明:该模型的最优鲁棒解具有全局最优性,确定型优化模型为本文模型在悲观准则下,当OD流量和单位流成本确定时的特例;在不同情景的悲观准则和乐观准则下的模型目标值之间的相关系数达到0.99以上;在悲观准则下,用本文模型计算出标准算例的归一化后的最优目标值为784.47,比确定型模型最优目标值减少了16.65%,比相对鲁棒优化模型最优目标值减少了29.07%. In order to determine the specific locations of hubs and optimize the path design of origin- destination (OD) flows of airline network, an interval scenario set was defined and a new absolute interval robust optimization model was established, taking into account the uncertainty of design parameters OD flows and unit flow cost of the hub-and-spoke network. The model was solved by combination of the modified shortest path algorithm with artificial intelligence algorithms, and then verified in two numerical cases using the classic data for airline network design and the OD data of Chinese airline network, respectively. The results show that the optimal solutions obtained from the absolute interval robust optimization model have global optimality, and the deterministic robust optimization model is a special case of the proposed model under pessimistic rules when the values of the OD flows and cost of unit flow are determined; the correlation coefficient of the two groups of objective values obtained from pessimistic and optimistic rules is more than 0.99 in different scenarios. In the standard example under the pessimistic rule, the optimal objective value calculated from the proposed model, after normalized, is 784.47, which is 15.65% less than the optimal objective value of the deterministic optimization model and 29.07% less than the optimal objective value of the relative interval robust optimization model.
出处 《西南交通大学学报》 EI CSCD 北大核心 2013年第3期559-564,共6页 Journal of Southwest Jiaotong University
基金 国家自然科学基金资助项目(70771046 71171111 71201081) 江苏省普通高校研究生科研创新计划资助项目(CXZll_0220)
关键词 航线网络 中枢辐射 绝对鲁棒优化 区间数 人工智能算法 airline network hub-and-spoke absolute robust optimization interval number artificialintelligence algorithms
  • 相关文献

参考文献21

  • 1SIBEL A, BAHAR Y K. Network hub location problems: the state of the art [ J]. European Journal of Operational Research, 2008, 190 ( 1 ) : 1-21.
  • 2O'KELLY M E. A quadratic integer program for the location of interacting hub facilities[ J]. European Journal of Operational Research, 1987, 32 ( 3 ) : 393- 404.
  • 3SKORIN-KAPOV D, SKORIN-KAPOV J. On tabu search for the location of interacting hub facilities[ J]. European Journal of Operational Research, 1994, 73(2) : 502-509.
  • 4SKORIN-KAPOV D, SKORIN-KAPOV J, O'KELLY M. Tight linear programming relaxations of uncapacitated p-hub median problems[ J]. European Journal of Operational Research, 1996, 94 ( 3 ) : 582- 593.
  • 5AYKIN T. The hub location and routing problem[ J]. European Journal of Operational Research, 1995, 83(1) : 200-219.
  • 6CHEN Jengfung. A hybrid heuristic for the uncapacitated single allocation hub location problem [J]. Omega, 2007, 35(2) : 211- 220.
  • 7ERNST 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( 1 ) : 100-112.
  • 8EBERY J, KRISHNAMOORTHY M, ERNST A, et al. The capaeitated multiple allocation hub location problem : Formulations and algorithms[ J]. European Journal of Operational Research, 2000, 120(3) : 614- 631.
  • 9柏明国,朱金福,姚韵.枢纽航线网络的构建方法及应用[J].系统工程,2006,24(5):29-34. 被引量:31
  • 10SIM T L, TIMOTHY J T, BARRETT W. The stochastic-hub center problem with service-level constraints [ J]. Computers and Operations Research, 2009, 36(12): 3166-3177.

二级参考文献52

  • 1张军,都业富.发展中枢辐射航线网络战略思考[J].中国民航学院学报,2004,22(B06):183-186. 被引量:11
  • 2金凤君,王成金.轴-辐侍服理念下的中国航空网络模式构筑[J].地理研究,2005,24(5):774-784. 被引量:169
  • 3柏明国,朱金福,姚韵.枢纽航线网络的构建方法及应用[J].系统工程,2006,24(5):29-34. 被引量:31
  • 4柏明国,朱金福.全连通航线网络和枢纽航线网络的比较研究[J].系统工程理论与实践,2006,26(9):113-117. 被引量:18
  • 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.
  • 6Ernst A T, Krishnamoorthy M. An exact solution approach based on shortest-paths for p-hub median problems[J]. Informs Journal on Computing,1998,10:149-161.
  • 7Kouvelis P, Yu G. Robust Discrete Optimization and Its Applications[M]. Kluwer Academic Publishers, Boston, 1997.
  • 8Yu G. Min-Max optimization of several classical discrete optimization problems [J]. Journal of Optimization Theory and Applications, 1998,98 : 221-242.
  • 9Igor Averbakh. Minmax regret solutions for minmax optimization problems with uncertainty[J], Operations Research Letters, 2000,27 : 57-65.
  • 10Genaro J Gutierrez, Panagiotis Kouvelis, Abbas A Kurawarwala. A robustness approach to uncapacitated network design problems[J]. European Journal of Operational Research. 1996,94 : 362-376.

共引文献50

同被引文献27

引证文献5

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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