Tree search algorithms for the Sequential Ordering Problem
Algorithmes de recherche arborescente pour le Sequential Ordering Problem
Résumé
We present a study of several generic tree search techniques applied to the Sequential Ordering Problem. This study enables us to propose a simple and competitive tree search algorithm. It consists of an iterative Beam Search algorithm that favors search over inference and integrates dynamic programming inspired cuts. It proves optimality on half of the SOPLIB instances and finds new best known solutions on 6 among 7 open instances of the benchmark in a small amount of time.
Fichier principal
ECAI_Tree_search_algorithms_for_the_Sequential_Ordering_Problem.pdf (239.24 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...