## Algorithms for Time-Dependent Bicriteria Shortest Path Problems (revised version)

• In this paper we generalize the classical shortest path problem in two ways. We consider two objective functions and time-dependent data. The resulting problem, called the time-dependent bicriteria shortest path problem (TdBiSP), has several interesting practical applications, but has not gained much attention in the literature.

$Rev: 13581$