Tree searches for the Sequential Ordering Problem - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

Tree searches for the Sequential Ordering Problem

Recherches arborescentes pour le Sequential Ordering Problem

Résumé

We study several generic tree search techniques applied to the Sequential Ordering Problem. This study enables us to propose a simple yet competitive tree search. It consists of an iterative beam search that favors search over inference and integrates prunings that are inspired by dynamic programming. The resulting method proves optimality on half of the SOPLIB instances, 10 to 100 times faster than other existing methods. Furthermore, it finds new best-known solutions on 6 among 7 open instances of the benchmark in a small amount of time. These results highlight that there is a category of problems (containing at least SOP) where an anytime tree search is extremely efficient (compared to classical meta-heuristics) but was underestimated.
Fichier principal
Vignette du fichier
ECAI2_Tree_search_algorithms_for_the_Sequential_Ordering_Problem.pdf (240.52 Ko) Télécharger le fichier
main.pdf (231.3 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02374896 , version 1 (21-11-2019)
hal-02374896 , version 2 (22-11-2019)
hal-02374896 , version 3 (23-01-2020)

Identifiants

  • HAL Id : hal-02374896 , version 3

Citer

Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard, Vincent Jost. Tree searches for the Sequential Ordering Problem. 2020. ⟨hal-02374896v3⟩
191 Consultations
403 Téléchargements

Partager

Gmail Facebook X LinkedIn More