Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.disopt.2006.05.006 | Discrete Optimization |
Keywords | Field | DocType |
interesting practical application,multiple criteria optimization,resulting problem,bicriteria shortest path problem,new algorithm,non-negative data,time-dependent bicriteria shortest path,existing algorithm,classical shortest path problem,time-dependent data,negative travel time,relevant literature,label setting algorithm,time-dependent shortest path problem,objective function,shortest path problem | Canadian traveller problem,Mathematical optimization,Shortest path problem,Constrained Shortest Path First,Algorithm,Yen's algorithm,Shortest Path Faster Algorithm,Mathematics,Widest path problem,K shortest path routing,Euclidean shortest path | Journal |
Volume | Issue | ISSN |
3 | 3 | Discrete Optimization |
Citations | PageRank | References |
7 | 0.95 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Horst W. Hamacher | 1 | 562 | 57.39 |
| Stefan Ruzika | 2 | 174 | 21.91 |
| Stevanus A. Tjandra | 3 | 26 | 2.04 |