On a special class of bicriterion path problems

In this paper we are concerned with a special class of bicriterion path problems. For the considered class of bicriterion problems at least one of the objectives is type MAXMIN. For the other one, besides an objective type MAXMIN also a MINSUM and a MINRATIO type objective are considered. Two algorithms are presented for the considered class of bicriterion path problems. The first one only determines the minimal complete set of nondominated paths and the second one determines the entire set of nondominated paths. Both algorithms can be used for any type of bicriterion path problems, since one of the objectives is type MAXMIN and an algorithm exists to determine the best path for the other objective. Computational statistics for the three types of considered bicriterion path problems are also presented.