Shorter path constraints for the resource constrained shortest path problem

Authors:
Thorsten Gellermann;Meinolf Sellmann;Robert Wright
Affiliations:
Computer Science, University of Paderborn, Paderborn;Computer Science, Brown University, Providence, RI;Air Force Research Lab, Inform. Directorate, Rome, NY
Venue:
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2005

Citing 7
Cited 6

The vehicle routing problem

The vehicle routing problem
Constraint Programming Based Column Generation for Crew Assignment

Journal of Heuristics
Cost-Based Domain Filtering

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Resource Constrained Shortest Paths

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Coupling Variable Fixing Algorithms for the Automatic Recording Problem

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A Bundle type Dual-ascent Approach to Linear Multi-Commodity Min Cost Flow Problems

A Bundle type Dual-ascent Approach to Linear Multi-Commodity Min Cost Flow Problems
A New Pricing Scheme for Airline Crew Scheduling

INFORMS Journal on Computing

Cost-based Filtering for Shorter Path Constraints

Constraints
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation

Computers and Operations Research
A shortest path-based approach to the multileaf collimator sequencing problem

Discrete Applied Mathematics
Network Optimization Models for Resource Allocation in Developing Military Countermeasures

Operations Research
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.00

Visualization

Abstract

Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constraint filtering have been studied. We provide the first extensive experimental evaluation of the new algorithms in the context of the resource constrained shortest path problem. We show how reasoning about path-substructures in combination with CP-based Lagrangian relaxation can help to improve significantly over previously developed problem-tailored filtering algorithms and investigate the impact of required-edge detection, undirected versus directed filtering, and the choice of the algorithm optimizing the Lagrangian dual.