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

We present the results of a computational investigation of solution approaches for the resource constrained elementary shortest path problem ( $mathcal{RCESPP}$ ). 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 $mathcal{RCESPP}$ .