Horváth, Markó and Kis, Tamás (2016) Solving resource constrained shortest path problems with LP-based methods. COMPUTERS & OPERATIONS RESEARCH, 73. pp. 150-164. ISSN 0305-0548 10.1016/j.cor.2016.04.013

Preview	Text Horvath_150_3079200_ny.pdf Download (423kB) | Preview
	Text Horvath_150_3079200_z.pdf Restricted to Registered users only Download (782kB) | Request a copy

Abstract

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. © 2016 Elsevier Ltd. All rights reserved.

Update Item