Efficient solution generation for the bicriterion routing problem

The Bicriterion Shortest Path Problem is a well known combinatorial problem. An approach, for the generation of subsets of the set of efficient solutions (together with other potentially useful solutions if required), is put forward. For the first phase, in which only extreme efficient solutions are generated, an algorithmic scheme is developed. Numerical experience with the use of the algorithm is reported.