A Reference Point Approach for the Resource Constrained Shortest Path Problems

The Resource Constrained Shortest Path Problem ((R-script) (C-script) (S-script) (P-script) (P-script)) is a variant of the classical shortest path problem and is of great practical importance. The aim is to find the shortest path between a given pair of nodes under additional constraints representing upper bounds on the consumption of resources along the path. In the scientific literature, different approaches have been defined to solve the (R-script) (C-script) (S-script) (P-script) (P-script). In this work we propose an innovative interactive method to address the (R-script) (C-script) (S-script) (P-script) (P-script), based on a novel search strategy of the criteria space. The performance of the proposed approach is evaluated on the basis of an extensive computational study by considering benchmark instances. A comparison with the state-of-the-art approaches developed for the (R-script) (C-script) (S-script) (P-script) (P-script) is also carried out. The computational results have shown that the developed solution strategy is competitive with the most efficient strategies known thus far.