首页> 外文OA文献 >Decomposition methods for solving dynamic programming problems in hotel revenue management
【2h】

Decomposition methods for solving dynamic programming problems in hotel revenue management

机译:解决酒店收益管理中动态规划问题的分解方法

摘要

Long-term stays are common in the hotel business. Therefore, it is crucial to consider the allocation of the available rooms to a stream of customers requesting to stay multiple days. This requirement leads to solving large-scale dynamic network revenue management problems, which are computationally challenging. A remedy is to apply decomposition approaches so that an approximate solution can be obtained by solving many single-day problems. In this study, we investigate optimal room allocation policies in hotel revenue management. We work on various decomposition methods to find reservation policies for advance bookings and stay-over customers. We also devise solution algorithms to solve large problems efficiently.
机译:长期住宿在酒店业务中很常见。因此,至关重要的是要考虑将可用房间分配给要求停留多天的客户流。此要求导致解决大规模的动态网络收入管理问题,这些问题在计算上具有挑战性。一种解决方法是应用分解方法,以便可以通过解决许多单日问题来获得近似解。在这项研究中,我们调查了酒店收益管理中的最佳客房分配政策。我们致力于各种分解方法,以查找提前预订和留宿客户的预订政策。我们还设计了解决方案算法来有效解决大问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号