Accelerated label setting algorithms for the elementary resource constrained shortest path problem

Authors:
Natashia Boland;John Dethridge;Irina Dumitrescu
Affiliations:
Department of Mathematics and Statistics, The University of Melbourne, Australia;Department of Mathematics and Statistics, The University of Melbourne, Australia;Canada Research Chair in Distribution Management, HEC Montréal, CRT, C.P. 6128, Succursale Centre-ville, Canada H3C 3J7
Venue:
Operations Research Letters
Year:
2006

Citing 5
Cited 9

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

Operations Research
Flight crew scheduling

Management Science
Flight String Models for Aircraft Fleeting and Routing

Transportation Science
2-Path Cuts for the Vehicle Routing Problem with Time Windows

Transportation Science
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

Networks

Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming

Computers and Operations Research
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows

Transportation Science
Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows

Operations Research
Online impairments-aware routing within a path computation element

Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem

INFORMS Journal on Computing
Solving shortest path problems with a weight constraint and replenishment arcs

Computers and Operations Research
Cyclic transfers in school timetabling

OR Spectrum
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

Discrete Optimization
Solving elementary shortest-path problems as mixed-integer programs

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

A label setting algorithm for solving the Elementary Resource Constrained Shortest Path Problem, using node resources to forbid repetition of nodes on the path, is implemented. A state-space augmenting approach for accelerating run times is considered. Several augmentation strategies are suggested and compared numerically.