TY - JOUR
T1 - Solving the longest simple path problem with heuristic search
AU - Cohen, Yossi
AU - Stern, Roni
AU - Felner, Ariel
N1 - Funding Information:
This research was supported by the Israel Ministry of Science, the ISF grants #844/17 to Ariel Felner and #210/17 to Roni Stern.
Publisher Copyright:
Copyright © 2020, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2020/5/29
Y1 - 2020/5/29
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85088506019&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:85088506019
SN - 2334-0835
VL - 30
SP - 75
EP - 79
JO - Proceedings International Conference on Automated Planning and Scheduling, ICAPS
JF - Proceedings International Conference on Automated Planning and Scheduling, ICAPS
T2 - 30th International Conference on Automated Planning and Scheduling, ICAPS 2020
Y2 - 26 October 2020 through 30 October 2020
ER -