Solving the Longest Simple Path Problem with Heuristic Search

Authors

  • Yossi Cohen Ben-Gurion University of the Negev
  • Roni Stern Ben-Gurion University of the Negev
  • Ariel Felner Ben Gurion University of the Negev

Abstract

Prior approaches for finding the longest simple path (LSP) in a graph used constraints solvers and genetic algorithms. In this work, we solve the LSP problem with heuristic search. We first introduce several methods for pruning dominated path prefixes. Then, we propose several admissible heuristic functions for this problem. Experimental results demonstrate the large impact of the proposed heuristics and pruning rules.

Downloads

Published

2020-06-01

How to Cite

Cohen, Y., Stern, R., & Felner, A. (2020). Solving the Longest Simple Path Problem with Heuristic Search. Proceedings of the International Conference on Automated Planning and Scheduling, 30(1), 75-79. Retrieved from https://ojs.aaai.org/index.php/ICAPS/article/view/6647