Article ID: | iaor20072040 |
Country: | Germany |
Volume: | 147 |
Issue: | 1 |
Start Page Number: | 269 |
End Page Number: | 286 |
Publication Date: | Oct 2006 |
Journal: | Annals of Operations Research |
Authors: | Weihe Karsten, Mller-Hannemann Matthias |
Keywords: | transportation: rail, programming: multiple criteria |
Computing shortest paths with two or more conflicting optimization criteria is a fundamental problem in transportation and logistics. We study the problem of finding all Pareto-optimal solutions for the multi-criteria single-source shortest-path problem with nonnegative edge lengths. The standard approaches are generalizations of label-setting (Dijkstra) and label-correcting algorithms, in which the distance labels are multi-dimensional and more than one distance label is maintained for each node. The crucial parameter for the run time and space consumption is the total number of Pareto optima. In general, this value can be exponentially large in the input size. However, in various practical applications one can observe that the input data have certain characteristics, which may lead to a much smaller number – small enough to make the problem efficiently tractable from a practical viewpoint. For typical characteristics which occur in various applications we study in this paper whether we can bound the size of the Pareto set to a polynomial size or not. These characteristics are also evaluated on a concrete application scenario (computing the set of best train connections in view of travel time, fare, and number of train changes) and on a simplified randomized model. It will turn out that the number of Pareto optima on each visited node is restricted by a small constant in our concrete application, and that the size of the Pareto set is much smaller than our worst case bounds in the randomized model.