首页> 外文期刊>OR Spectrum >Timetabling with passenger routing
【24h】

Timetabling with passenger routing

机译:安排乘客路线

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

摘要

Customer-oriented optimization of public transport needs data about the passengers in order to obtain realistic models. Current models take passengers' data into account by using the following two-phase approach: In a first phase, routes for the passengers are determined. In a second phase, the actual planning of lines, timetables, etc., takes place using the knowledge on which routes passengers want to travel from the results of the first phase. However, the actual route a passenger will take strongly depends on the timetable, which is not yet known in the first phase. Hence, the two-phase approach finds non-optimal solutions in many cases. In this paper we study the integrated problem of determining a timetable and the passengers' routes simultaneously. We investigate the computational complexity of the problem and present solution approaches which are tested on close-to-real-world data.
机译:面向客户的公共交通优化需要有关乘客的数据,以便获得逼真的模型。当前模型通过使用以下两个阶段的方法来考虑乘客的数据:在第一阶段,确定乘客的路线。在第二阶段,根据第一阶段的结果,利用对乘客想要搭乘的路线的了解来进行路线,时刻表等的实际计划。但是,乘客实际乘坐的路线很大程度上取决于时间表,而在第一阶段尚不清楚。因此,两阶段方法在许多情况下都发现非最优解。在本文中,我们研究了同时确定时间表和乘客路线的综合问题。我们调查了问题的计算复杂性,并提出了对接近真实世界的数据进行测试的解决方案方法。

著录项

  • 来源
    《OR Spectrum》 |2015年第1期|75-97|共23页
  • 作者

    Marie Schmidt; Anita Schoebel;

  • 作者单位

    Institute for Numerical and Applied Mathematics, Lotzestrasse 16, Goettingen, Germany;

    Institute for Numerical and Applied Mathematics, Lotzestrasse 16, Goettingen, Germany;

  • 收录信息 美国《科学引文索引》(SCI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Timetabling; Routing; Complexity; Integer programming;

    机译:时间表;路由;复杂;整数编程;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号