期刊
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH
卷 11, 期 4, 页码 323-348出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s10288-013-0232-5
关键词
Multiobjective shortest path problem; Labeling algorithm; Stop condition; Bidirectional routing; Pareto optimal set
The latest transportation systems require the best routes in a large network with respect to multiple objectives simultaneously to be calculated in a very short time. The label setting algorithm of Martins efficiently finds this set of Pareto optimal paths, but sometimes tends to be slow, especially for large networks such as transportation networks. In this article we investigate a number of speedup measures, resulting in new algorithms. It is shown that the calculation time to find the Pareto optimal set can be reduced considerably. Moreover, it is mathematically proven that these algorithms still produce the Pareto optimal set of paths.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据