Algorithms for time-dependent bicriteria shortest path problems

Authors:
Horst W. Hamacher;Stefan Ruzika;Stevanus A. Tjandra
Affiliations:
Fachbereich Mathematik, Universität Kaiserslautern, Kaiserslautern, Germany;Fachbereich Mathematik, Universität Kaiserslautern, Kaiserslautern, Germany;School of Business, University of Alberta, Edmonton, Canada
Venue:
Discrete Optimization
Year:
2006

Citing 6
Cited 0

Linear network optimization: algorithms and codes

Linear network optimization: algorithms and codes
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Continuous-Time Shortest Path Problems and Linear Programming

SIAM Journal on Control and Optimization
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
Shortest Path Algorithms in Transportation models: classical and innovative aspects

Shortest Path Algorithms in Transportation models: classical and innovative aspects
Finding all attractive train connections by multi-criteria Pareto search

ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. After reviewing relevant literature we develop a new algorithm for the TdBiSP with non-negative data. Numerical tests show the superiority of our algorithm compared with an existing algorithm in the literature. Furthermore, we discuss algorithms for the TdBiSP with negative travel times and costs.