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.
Original language | English |
---|---|
Pages (from-to) | 75-79 |
Number of pages | 5 |
Journal | Proceedings International Conference on Automated Planning and Scheduling, ICAPS |
Volume | 30 |
DOIs | |
State | Published - 29 May 2020 |
Event | 30th International Conference on Automated Planning and Scheduling, ICAPS 2020 - Nancy, France Duration: 26 Oct 2020 → 30 Oct 2020 |
ASJC Scopus subject areas
- Artificial Intelligence
- Computer Science Applications
- Information Systems and Management