Solving resource constrained shortest path problems with LP-based methods

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

[img] Text
Horvath_150_3079200_ny.pdf

Download (423kB)
[img] Text
Horvath_150_3079200_z.pdf

Download (782kB)

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.

Item Type: Article
Uncontrolled Keywords: Graph theory; Variable fixing; Finite capacity; Destination nodes; Cutting planes; Constrained shortest path; Computational experiment; Branch and cut; Optimization; Heuristic methods; Directed graphs; Constrained optimization; Branch and bound method; Resource constrained shortest path; Primal heuristics; Integer programming; Combinatorial optimization; Branch-and-cut
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Research Laboratory on Engineering & Management Intelligence
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 13 Jan 2017 15:14
Last Modified: 13 Jan 2017 15:14
URI: http://eprints.sztaki.hu/id/eprint/8915

Update Item Update Item