Autor:	Yossi Cohen, Roni Stern, Ariel Felner
Rok vydání:	2020
Zdroj:	Proceedings of the International Conference on Automated Planning and Scheduling. 30:75-79
ISSN:	2334-0843 2334-0835
DOI:	10.1609/icaps.v30i1.6647
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::adfae01a9e5ee5dec25529af202981ec https://doi.org/10.1609/icaps.v30i1.6647 Zobrazit plný text záznamu