...
首页> 外文期刊>Transportation research >Multi-stage airline scheduling problem with stochastic passenger demand and non-cruise times
【24h】

Multi-stage airline scheduling problem with stochastic passenger demand and non-cruise times

机译:具有随机乘客需求和非巡航时间的多阶段航空公司调度问题

获取原文
获取原文并翻译 | 示例

摘要

We propose a three-stage stochastic programming model which determines flight timing, fleeting and routing decisions while considering the randomness of demand and non cruise times. Our model differs from the existing two-stage stochastic models by considering not only flight timing and potential passenger demand, but also expected operational expenses, such as fuel burn and carbon emission costs. We include aircraft cruise speed decisions to compensate for non-cruise time variability so as to satisfy the time requirements of the passenger connections. We handle nonlinear functions of fuel and emission costs associated with cruise speed adjustments by utilizing mixed integer second order cone programming. Because the three-stage stochastic model leads to a large decision tree and can be very time-consuming to solve optimally, we suggest a scenario group-wise decomposition algorithm to obtain lower and upper bounds for the optimal value of the proposed model. The lower and upper bounds are obtained by solving a number of group subproblems, which are similar to proposed multi-stage stochastic model defined over a reduced number of scenarios. We suggest a cutting plane algorithm, along with improvements, to efficiently solve each group subproblem. In the numerical experiments, we provide a significant cost savings over two-stage stochastic programming and deterministic approaches. (C) 2018 Elsevier Ltd. All rights reserved.
机译:我们提出了一个三阶段随机规划模型,该模型在考虑需求和非巡航时间的随机性的同时确定飞行时间,转机和航线决策。我们的模型与现有的两阶段随机模型不同,它不仅考虑飞行时间和潜在的乘客需求,还考虑了预期的运营支出,例如燃料消耗和碳排放成本。我们包括飞机巡航速度决策,以补偿非巡航时间的可变性,从而满足乘客连接的时间要求。我们通过使用混合整数二阶锥规划来处理与巡航速度调整相关的燃料和排放成本的非线性函数。由于三阶段随机模型会导致决策树很大,而且要进行最优求解非常耗时,因此我们建议采用一种场景分组分解算法,以获取所提出模型的最优值的上下限。下界和上限是通过解决许多子问题而获得的,这些子问题与在减少的情况下定义的提议的多阶段随机模型相似。我们建议采用切平面算法以及改进方法,以有效地解决每个组子问题。在数值实验中,与两阶段随机规划和确定性方法相比,我们可以节省大量成本。 (C)2018 Elsevier Ltd.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号