首页> 外文期刊>Transportation research >Bus schedule coordination for the last train service in an intermodal bus-and-train transport network
【24h】

Bus schedule coordination for the last train service in an intermodal bus-and-train transport network

机译:多式联运火车运输网络中末班车服务的公交时刻表协调

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

摘要

Only when a designated bus arrives at a particular bus stop (that connects to a rail station) earlier than the departure time of the associated last train by at least the necessary transfer walking time can passengers on the designated bus successfully access the rail network and finish the remainder of their trips by train. This paper first proposes an optimal bus schedule coordination problem for last train service in an intermodal bus-and-train transport network by offsetting and perturbing the original bus schedules to reduce transfer failures from bus service to train service based on the given last train schedules. The proposed problem is then formulated as a mixed integer nonlinear programming (MINLP) model. The MINLP model is equivalently transformed into a mixed integer linear programming (MILP) model that can be exactly solved by any optimization solvers, such as CPLEX. A case study based on eight real bus lines and the mass rapid transit (MRT) system in Singapore is conducted, and it shows that the bus schedule coordinated by the developed model is able to improve operational intermodal connectivity substantially. (C) 2015 Elsevier Ltd. All rights reserved.
机译:只有当指定的公共汽车比相关的末班车的出发时间早于相关的末班车的到达时间至少达到必要的步行路程时才到达特定的公共汽车站,才能乘坐指定公共汽车上的乘客成功进入铁路网并完成其余的乘火车旅行。本文首先通过对原始公交时刻表进行补偿和扰动,以根据给定的最新火车时刻表减少从公交服务到火车服务的转移故障,从而为多式联运的火车和火车网络中的末班车服务提出了最优的公交时刻表协调问题。然后将提出的问题公式化为混合整数非线性规划(MINLP)模型。 MINLP模型等效地转换为混合整数线性规划(MILP)模型,可由任何优化求解器(例如CPLEX)精确求解。以新加坡的8条实际公交线路和大众快速运输(MRT)系统为基础进行了案例研究,结果表明,通过开发的模型协调的公交时刻表能够显着改善运营的多式联运。 (C)2015 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号