Filtern
Schlagworte
- Label setting algorithm (1) (entfernen)
-
Algorithms for Time Dependent Bicriteria Shortest Path Problems
(2003)
- We generalize the classical shortest path problem in two ways. We consider two - in general contradicting - objective functions and introduce a time dependency of the cost which is caused by a traversal time on each arc. The resulting problem, called time-dependent bicriteria shortest path problem (TdBiSP) has several interesting practical applications, but has not attained much attention in the literature.
