Parallel Hybrid Best-First Search - ANITI - Artificial and Natural Intelligence Toulouse Institute Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Parallel Hybrid Best-First Search

Résumé

While processor frequency has stagnated over the past two decades, the number of available cores in servers or clusters is still growing, offering the opportunity for significant speed-up in combinatorial optimization. Parallelization of exact methods remains a difficult challenge. We revisit the concept of parallel Branch-and-Bound in the framework of Cost Function Networks. We show how to adapt the anytime Hybrid Best-First Search algorithm in a Master-Worker protocol. The resulting parallel algorithm achieves good load-balancing without introducing new parameters to be tuned as is the case, for example, in Embarrassingly Parallel Search (EPS). It has also a small overhead due to its light communication messages. We performed an experimental evaluation on several benchmarks, comparing our parallel algorithm to its sequential version. We observed linear speed-up in some cases. Our approach compared favourably to the EPS approach and also to a state-of-the-art parallel exact integer programming solver.
Fichier principal
Vignette du fichier
Beldjilali22a.pdf (717.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03674127 , version 1 (20-05-2022)

Identifiants

Citer

Abdelkader Beldjilali, Pierre Montalbano, David Allouche, George Katsirelos, Simon De Givry. Parallel Hybrid Best-First Search. The 28th International Conference on Principles and Practice of Constraint Programming, Jul 2022, Haifa, Israel. ⟨10.4230/LIPIcs.CP.2022.36⟩. ⟨hal-03674127⟩
115 Consultations
56 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More