Algorithms for time-dependent bicriteria shortest path problems

Algorithms for time-dependent bicriteria shortest path problems

0.00 Avg rating0 Votes
Article ID: iaor2007921
Country: Netherlands
Volume: 3
Issue: 3
Start Page Number: 238
End Page Number: 254
Publication Date: Sep 2006
Journal: Discrete Optimization
Authors: , ,
Keywords: programming: dynamic
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.

Reviews

Required fields are marked *. Your email address will not be published.