Targeted multiobjective Dijkstra algorithm
Targeted multiobjective Dijkstra algorithm
复制标题
目标多目标Dijkstra算法
作者：
P. M. Casas;Luitgard Kraus;A. Sedeño;R. Borndörfer
我们介绍了目标多目标Dijkstra算法（T -MDA），这是一种标签设置算法，用于一对一的多目标最短路径（MOSP）问题。 *类似于任何探索的subpath的技术输出的一部分。在队列中不在队列中的管理时间。在本文中可以忽略不计，我们将T -MDA基于ART的改进版本Namoadr ∗ $$ {MATHRM {NAMOA}} _ {MATHRM {MATHRM {dr}}}^{ast来自标准测试床的文献中的MOSP算法。
We introduce the Targeted Multiobjective Dijkstra Algorithm (T‐MDA), a label setting algorithm for the One‐to‐One Multiobjective Shortest Path (MOSP) Problem. It is based on the recently published Multiobjective Dijkstra Algorithm (MDA) and equips it with A*‐like techniques. For any explored subpath, a label setting MOSP algorithm decides whether the subpath can be discarded or must be stored as part of the output. A major design choice is how to store subpaths from the moment they are first explored until the mentioned final decision can be made. The T‐MDA combines the polynomially bounded size of the priority queue used in the MDA and a lazy management of paths that are not in the queue. The running time bounds from the MDA remain valid. In practice, the T‐MDA outperforms known algorithms from the literature and the increased memory consumption is negligible. In this paper, we benchmark the T‐MDA against an improved version of the state of the art NAMOAdr∗$$ {mathrm{NAMOA}}_{mathrm{dr}}^{ast } $$ One‐to‐One MOSP algorithm from the literature on a standard testbed.
一种简单快速的双目标搜索算法
DOI：
--
发表时间：
2020
期刊：
Proceedings of the International Conference on Automated Planning and Scheduling
影响因子：
--
作者：
Hernandez, C.;Yeoh, W.;Baier, J.;Zhang, H.;Suazo, L.;Koenig, S.
通讯作者：
Koenig, S.
DOI：
10.1002/mcda.1603
发表时间：
2017
期刊：
ArXiv
影响因子：
--
作者：
F. Bökler;M. Ehrgott;C. Morris;P. Mutzel
通讯作者：
P. Mutzel
多目标不确定最短路径问题标记算法的扩展
影响因子：
2.1
作者：
Schmidt;Schöbel
通讯作者：
Schöbel