arrow
返回

K-shortest simple paths using biobjective path search

delete2025-02-13
delete0
delete
OA
AI
P
Pedro Maristany de las Casas *
A
Antonio Sedeño‐Noda
R
Ralf Borndörfer
M
Max Huneshagen
DOI:10.1007/s12532-025-00276-0delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this paper we introduce a new algorithm for the k-Shortest Simple Paths (k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-SSP) problem with an asymptotic running time matching the state of the art from the literature. It is based on a black-box algorithm due to Roditty and Zwick [30] that solves at most 2k instances of the Second Shortest Simple Path (2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2$$\end{document}-SSP) problem without specifying how this is done. We fill this gap using a novel approach: we turn the scalar 2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2$$\end{document}-SSP into instances of the Biobjective Shortest Path problem. Our experiments on grid graphs and on road networks show that the new algorithm is very efficient in practice.
Keyword:
K-shortest simple path
Second shortest simple path
Biobjective path search

期刊

Mathematical Programming Computation 封面图
Mathematical Programming Computation
IF:
3.6
论文数:
202
被引数:
1.9K

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
Easy to say they are Hard, but Hard to see they are Easy- Towards a Categorization of Tractable Multiobjective Combinatorial Optimization Problems
err2016-09-26
err0
PREAI
errJosé Rui Figueira; Carlos M. Fonseca; Pascal Halffmann; Kathrin Klamroth; Luís Paquete; Stefan Ruzika; Britta Schulze; Michael Stiglmayr; David Willems
err分享
err收藏
学者 查看更多内容