Designing Algorithms for the Shortest Path Reconfiguration Problem Using Decision Diagram Operations

Shou Ooba, Jun Kawahara, Shin-ichi Minato

2024

Abstract

This paper proposes decision diagram (DD)-based algorithms for the (edge-unweighted) shortest s-t path reconfiguration problem. In the problem, given a graph and two shortest s-t paths, the task is to decide whether one shortest path can be transformed into the other one by repeatedly applying the reconfiguration rule to the path, where the reconfiguration rule is to change one vertex of the path at a time while maintaining shortest s-t paths. We propose several DD-based algorithms for the problem and confirm their performance by computer experiments. We succeeded in finding a shortest reconfiguration sequence with length 961,012 in 629.0 seconds for some instance.

Download


Paper Citation


in Harvard Style

Ooba S., Kawahara J. and Minato S. (2024). Designing Algorithms for the Shortest Path Reconfiguration Problem Using Decision Diagram Operations. In Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART; ISBN 978-989-758-680-4, SciTePress, pages 641-648. DOI: 10.5220/0012379900003636


in Bibtex Style

@conference{icaart24,
author={Shou Ooba and Jun Kawahara and Shin-ichi Minato},
title={Designing Algorithms for the Shortest Path Reconfiguration Problem Using Decision Diagram Operations},
booktitle={Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART},
year={2024},
pages={641-648},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012379900003636},
isbn={978-989-758-680-4},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART
TI - Designing Algorithms for the Shortest Path Reconfiguration Problem Using Decision Diagram Operations
SN - 978-989-758-680-4
AU - Ooba S.
AU - Kawahara J.
AU - Minato S.
PY - 2024
SP - 641
EP - 648
DO - 10.5220/0012379900003636
PB - SciTePress