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.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Horst W. Hamacher, Stefan Ruzika, Stevanus A. Tjandra
URN (permanent link):urn:nbn:de:hbz:386-kluedo-15811
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (89 rev.)
Document Type:Preprint
Language of publication:English
Year of Completion:2004
Year of Publication:2004
Publishing Institute:Technische Universität Kaiserslautern
Tag:Multiple criteria optimization; bicriteria shortest path problem; label setting algorithm; time-dependent shortest path problem
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:510 Mathematik

$Rev: 12793 $