A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation

Authors:
Xiaoyan Zhu;Wilbert E. Wilhelm
Affiliations:
Department of Industrial and Information Engineering, The University of Tennessee, Knoxville, TN 37996-2100, USA;Industrial and Systems Engineering Department, Texas A&M University, College Station, TX 77843-3131, USA
Venue:
Computers and Operations Research
Year:
2012

Citing 10
Cited 4

A new optimization algorithm for the vehicle routing problem with time windows

Operations Research
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
Constraint Programming Based Column Generation for Crew Assignment

Journal of Heuristics
Resource Constrained Shortest Paths

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
A Set Partitioning Approach to the Crew Scheduling Problem

Operations Research
A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation

INFORMS Journal on Computing
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

Networks
Cost-based Filtering for Shorter Path Constraints

Constraints
Shorter path constraints for the resource constrained shortest path problem

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A simple efficient approximation scheme for the restricted shortest path problem

Operations Research Letters

On an exact method for the constrained shortest path problem

Computers and Operations Research
Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price

Computers and Operations Research
Robust shortest path problem based on a confidence interval in fuzzy bicriteria decision making

Information Sciences: an International Journal
Resource constrained shortest paths with a super additive objective function

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper focuses on the common scenario in which the resource-constrained shortest path problem (RCSP) on an acyclic graph is a sub-problem in the context of column generation. It proposes a pseudo-polynomial time, three-stage solution approach. Stages 1 (preprocessing) and 2 (setup) are implemented one time to transform RCSP into a shortest path problem, which is solved by stage 3 (iterative solution) at each column generation iteration, each time with different arc costs. This paper analyzes certain properties related to each stage as well as algorithm complexity. Computational tests compare the performances of this method, a state-of-the-art label-setting algorithm, and CPLEX optimization software on four classes of instances, each of which involves either one or multiple resources, and show that the new method is effective. The new method outperforms the label-setting algorithm when resource limitations are tight-as can be expected in practice, and outperforms CPLEX for all tested instances. The label-setting algorithm outperforms CPLEX for all single-resource RCSP instances and almost all multiple-resource RCSP instances.