Label correcting methods to solve multicriteria shortest path problems

In this paper, we deal with the solution of the multicriteria shortest path problem. In particular, we present a class of labeling methods to generate the entire set of Pareto-optimal path-length vectors from an origin node s to all other nodes in a multicriteria network. The proposed methods are supported theoretically by the principle of optimality and they are defined on the basis of various innovative node and label selection strategies. Computational results comparing the proposed methods to state-of-the-art approaches to solve the problem considered are also reported. They indicate that our methods are competitive in general; in several cases, they outperform all the other codes.