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.
Download full text files
Additional Services
| Author: | Horst W. Hamacher, Stefan Ruzika, Stevanus A. Tjandra |
|---|---|
| URN: | urn:nbn:de:hbz:386-kluedo-15811 |
| Series (Serial Number): | Report in Wirtschaftsmathematik (WIMA Report) (89 rev.) |
| Document Type: | Preprint |
| Language of publication: | English |
| Year of Completion: | 2004 |
| Year of first Publication: | 2004 |
| Publishing Institution: | Technische Universität Kaiserslautern |
| Date of the Publication (Server): | 2004/10/28 |
| Tag: | Multiple criteria optimization; bicriteria shortest path problem; label setting algorithm; time-dependent shortest path problem |
| 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 |