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

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
Vignette du fichier
ECAI_Tree_search_algorithms_for_the_Sequential_Ordering_Problem.pdf (239.24 Ko) Télécharger le fichier
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 2

Citer

Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard, Vincent Jost. Tree search algorithms for the Sequential Ordering Problem. 2019. ⟨hal-02374896v2⟩
191 Consultations
404 Téléchargements

Partager

Gmail Facebook X LinkedIn More