首页> 外文期刊>Discrete optimization >Metric inequalities for routings on direct connections with application to line planning
【24h】

Metric inequalities for routings on direct connections with application to line planning

机译:与应用程序到线路规划的直接连接上的路由度量的不等式

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

摘要

We consider multi-commodity flow problems in which capacities are installed on paths. In this setting, it is often important to distinguish between flows on direct connection routes, using single paths, and flows that include path switching. We derive a feasibility condition for path capacities supporting such direct connection flows similar to the well-known feasibility condition for arc capacities in ordinary multi-commodity flows. The condition can be expressed in terms of a class of metric inequalities for routings on direct connections. We illustrate the concept on the example of the line planning problem in public transport and present an application to large-scale real-world problems. (C) 2015 Elsevier B.V. All rights reserved.
机译:我们考虑在路径上安装了容量的多商品流问题。在此设置下,区分使用单路径的直接连接路由上的流和包含路径切换的流之间通常很重要。我们推导了支持这种直接连接流的路径容量的可行性条件,类似于普通的多商品流中电弧容量的众所周知的可行性条件。可以用一类度量不等式表示条件,以用于直接连接上的路由。我们以公共交通中的线路规划问题为例说明概念,并将其应用于大规模的实际问题。 (C)2015 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号