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.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Horst W. Hamacher, Stevanus A. Tjandra
URN (permanent link):urn:nbn:de:hbz:386-kluedo-12719
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (89)
Document Type:Preprint
Language of publication:English
Year of Completion:2003
Year of Publication:2003
Publishing Institute:Technische Universität Kaiserslautern
Tag:Label correcting algorithm; Label setting algorithm; Multiple criteria analysis
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:510 Mathematik

$Rev: 12793 $