Solving the longest simple path problem with heuristic search

Yossi Cohen; Roni Stern; Ariel Felner

doi:10.1609/icaps.v30i1.6647

Solving the longest simple path problem with heuristic search

Yossi Cohen
, Roni Stern
, Ariel Felner

Ben-Gurion University of the Negev
Palo Alto Research Center

Research output: Contribution to journal › Conference article › peer-review

9 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 language	English
Pages (from-to)	75-79
Number of pages	5
Journal	Proceedings International Conference on Automated Planning and Scheduling, ICAPS
Volume	30
DOIs	https://doi.org/10.1609/icaps.v30i1.6647
State	Published - 29 May 2020
Externally published	Yes
Event	30th International Conference on Automated Planning and Scheduling, ICAPS 2020 - Nancy, France Duration: 26 Oct 2020 → 30 Oct 2020

Bibliographical note

Publisher Copyright:
Copyright © 2020, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Funding

This research was supported by the Israel Ministry of Science, the ISF grants #844/17 to Ariel Felner and #210/17 to Roni Stern.

Funders	Funder number
Israel Science Foundation	844/17, 210/17
Ministry of science and technology, Israel

Access to Document

10.1609/icaps.v30i1.6647

Cite this

@article{c5c6fb6f1b2c4f049a44f1e2ec5b4233,

title = "Solving the longest simple path problem with heuristic search",

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.",

author = "Yossi Cohen and Roni Stern and Ariel Felner",

note = "Publisher Copyright: Copyright {\textcopyright} 2020, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 30th International Conference on Automated Planning and Scheduling, ICAPS 2020 ; Conference date: 26-10-2020 Through 30-10-2020",

year = "2020",

month = may,

day = "29",

doi = "10.1609/icaps.v30i1.6647",

language = "אנגלית",

volume = "30",

pages = "75--79",

journal = "Proceedings International Conference on Automated Planning and Scheduling, ICAPS",

issn = "2334-0835",

publisher = "Association for the Advancement of Artificial Intelligence",

}

TY - JOUR

T1 - Solving the longest simple path problem with heuristic search

AU - Cohen, Yossi

AU - Stern, Roni

AU - Felner, Ariel

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 - https://www.scopus.com/pages/publications/85088506019

U2 - 10.1609/icaps.v30i1.6647

DO - 10.1609/icaps.v30i1.6647

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

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 -

Solving the longest simple path problem with heuristic search

Abstract

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this