Solving the longest simple path problem with heuristic search

Yossi Cohen, Roni Stern, Ariel Felner

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations

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 languageEnglish
Pages (from-to)75-79
Number of pages5
JournalProceedings International Conference on Automated Planning and Scheduling, ICAPS
Volume30
StatePublished - 29 May 2020
Event30th International Conference on Automated Planning and Scheduling, ICAPS 2020 - Nancy, France
Duration: 26 Oct 202030 Oct 2020

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'Solving the longest simple path problem with heuristic search'. Together they form a unique fingerprint.

Cite this