...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Transportation Science >Dispatching Buses in a Depot Using Block Patterns
【24h】

Dispatching Buses in a Depot Using Block Patterns

机译：使用块模式在仓库中调度总线

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this article we consider the problem of assigning parking slots to buses of different types so that the required buses can be dispatched easily in the morning. More precisely, if a bus of a certain type is needed at a given time, the buses that precede it in the lane must have departed already. Thus care must be taken to ensure that the buses arriving in the evening are parked in an order compatible with the types required for the morning departures. Maneuvers (i.e., rearrangements of buses within lanes) might be necessary to achieve this goal. Because the transit authorities need robust solutions to this problem (known as the dispatching problem in the literature), we formulate a model in which the depot lanes are filled according to specific patterns, called one-block or two-block patterns. We present two versions of this model, study their properties, and show that some real-life instances can be solved within reasonable times by a commercial MIP solver. We also demonstrate that the solutions of the model are very robust, and can thus be used by transit authorities.
机译：在本文中，我们考虑了为不同类型的公共汽车分配停车位的问题，以便可以在早上轻松地调度所需的公共汽车。更准确地说，如果在给定时间需要某种类型的公交车，则车道中位于其前面的公交车必须已经出发。因此，必须注意确保晚上抵达的公交车的停放顺序与早上出发所需的类型兼容。为了达到这个目标，可能需要进行演习（例如，对车道内的公交车进行重新布置）。由于运输当局需要针对此问题（在文献中称为调度问题）的可靠解决方案，因此我们制定了一个模型，在该模型中，根据一个或两个模块的特定模式填充了专用车道。我们提供了该模型的两个版本，研究了它们的特性，并显示了一些实际实例可以通过商业MIP求解器在合理的时间内求解。我们还证明了该模型的解决方案非常健壮，因此可以由公交当局使用。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号