Algorithms for Time Dependent Bicriteria Shortest Path Problems
- 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.
Author: | Horst W. Hamacher, Stevanus A. Tjandra |
---|---|
URN: | urn:nbn:de:hbz:386-kluedo-12719 |
Series (Serial Number): | Report in Wirtschaftsmathematik (WIMA Report) (89) |
Document Type: | Preprint |
Language of publication: | English |
Year of Completion: | 2003 |
Year of first Publication: | 2003 |
Publishing Institution: | Technische Universität Kaiserslautern |
Date of the Publication (Server): | 2003/11/12 |
Tag: | Label correcting algorithm; Label setting algorithm; Multiple criteria analysis |
Faculties / Organisational entities: | Kaiserslautern - Fachbereich Mathematik |
DDC-Cassification: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
Licence (German): | Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |