A label correcting approach for solving bicriterion shortest-path problems

This article contributes with a very fast algorithm for solving the bicriterion shortest-path problem. By imposing some simple domination conditions, we reduce the number of iterations needed to find all the efficient (Pareto optimal) paths in the network. We have implemented the algorithm and tested it with the Label Correcting algorithm. We have also made a theoretical argument of the performance of all the existing algorithms, in order to rank them by performance. Included is a discussion on the structure of random generated networks, generated with two different methods, and of the characteristics of these networks.