首页> 外文期刊>Computers & operations research >Solving resource constrained shortest path problems with LP-based methods
【24h】

Solving resource constrained shortest path problems with LP-based methods

机译:使用基于LP的方法解决资源受限的最短路径问题

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

摘要

In the resource constrained shortest path problem (RCSPP) there is a directed, graph along with a source node and a destination node, and each arc has a cost and a vector of weights specifying its requirements from a set of resource types with finite capacities. A minimum cost source-destination directed path is sought such that the total consumption of the arcs from each resource type does not exceed the capacity of the resource. In this paper we investigate LP-based branch-and-bound methods and introduce new cutting planes, separation procedures, variable fixing, and primal heuristic methods for solving RCSPP to optimality. We provide detailed computational experiments, and a comparison to other methods in the literature. (C) 2016 Elsevier Ltd. All rights reserved.
机译:在资源受限的最短路径问题(RCSPP)中,有向图以及源节点和目标节点,并且每个弧都有成本和权重向量,这些资源从具有有限容量的一组资源类型中指定其要求。寻找最小成本源-目的地定向路径,以使每种资源类型的电弧总消耗不超过资源的容量。在本文中,我们研究了基于LP的分支定界方法,并介绍了用于解决RCSPP最优问题的新切平面,分离程序,变量固定和原始启发式方法。我们提供了详细的计算实验,并与文献中的其他方法进行了比较。 (C)2016 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号