TY - INPR
A1 - Hamacher, Horst W.
A1 - Tjandra, Stevanus A.
T1 - Algorithms for Time Dependent Bicriteria Shortest Path Problems
N2 - 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.
T3 - Report in Wirtschaftsmathematik (WIMA Report) - 89
KW - Multiple criteria analysis
KW - Label setting algorithm
KW - Label correcting algorithm
Y1 - 2003
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1450
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-12719
ER -