Report in Wirtschaftsmathematik (WIMA Report)
Refine
Year of publication
- 2003 (1) (remove)
Document Type
- Preprint (1)
Language
- English (1)
Has Fulltext
- yes (1)
Keywords
- Label setting algorithm (1) (remove)
Faculty / Organisational entity
89
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.