A computational study of solution approaches for the resource constrained elementary shortest path problem

A computational study of solution approaches for the resource constrained elementary shortest path problem

0.00 Avg rating0 Votes
Article ID: iaor20128185
Volume: 201
Issue: 1
Start Page Number: 131
End Page Number: 157
Publication Date: Dec 2012
Journal: Annals of Operations Research
Authors: ,
Keywords: networks: path
Abstract:

We present the results of a computational investigation of solution approaches for the resource constrained elementary shortest path problem (ℛ𝒞ℰ𝒮𝒫𝒫). In particular, the best known algorithms are tested on several problem instances taken from literature. The main aims are to provide a detailed state of the art and to evaluate methods that turn out to be the most promising for solving the problem under investigation. This work represents the first attempt to computationally compare solution approaches for the ℛ𝒞ℰ𝒮𝒫𝒫.

Reviews

Required fields are marked *. Your email address will not be published.