Non-additive Shortest Paths
The non-additive shortest path (NASP) problem asks for finding an optimal path that minimizes a certain multi-attribute non-linear cost function. In this paper, we consider the case of a non-linear convex and non-decreasing function on two attributes. We present an efficient polynomial algorithm for solving a Lagrangian relaxation of NASP. We also present an exact algorithm that is based on new heuristics we introduce here, and conduct a comparative experimental study with synthetic and real-world data that demonstrates the quality of our approach.
KeywordsShort Path Optimal Path Exact Algorithm Lagrangian Relaxation Short Path Problem
Unable to display preview. Download preview PDF.
- 1.Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)Google Scholar
- 5.Gabriel, S., Bernstein, D.: Nonadditive Shortest Paths: Subproblems in Multi- Agent Competitive Network Models. Comp. & Math. Organiz. Theory 6 (2000)Google Scholar
- 8.Hensen, D., Truong, T.: Valuation of Travel Times Savings. Journal of Transport Economics and Policy, 237–260 (1985)Google Scholar
- 11.Papadimitriou, C., Yannakakis, M.: On the Approximability of Trade-offs and Optimal Access of Web Sources. In: Proc. 41st FOCS 2000, pp. 86–92 (2000)Google Scholar
- 12.Scott, K., Bernstein, D.: Solving a Best Path Problem when the Value of Time Function is Nonlinear, preprint 980976 of the Transport. Research Board (1997)Google Scholar
- 13.Tsaggouris, G., Zaroliagis, C.: Non-Additive Shortest Paths, Tech. Report TR-2004/03/01, Computer Technology Institute, Patras (March 2004)Google Scholar