On a special class of bicriterion path problems (Q793640)

The authors are concerned with a special class of bicriterion path problems. For the considered class of bicriterion problems at least one of the objective is of a maxmin type. The second objective is either of a minsum or of a minratio type. 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 of a maxmin type and an algorithm exists to determine the best path for the other objective. Computational experiments for the three types of considered bicriterion path problems is reported.