Document detail
ID
oai:HAL:hal-02179193v1
Topic
Big Optimization Quadratic assignment problem Iterative tabu search [INFO.INFO-AI]Computer Science [cs... [INFO.INFO-DC]Computer Science [cs... [INFO.INFO-RO]Computer Science [cs...Author
Abdelkafi, Omar Derbel, Bilel Liefooghe, ArnaudLangue
enEditor
HAL CCSD
Category
CNRS - Centre national de la recherche scientifique
Year
2019
listing date
10/7/2023
Keywords
[info study [cs tabu science parallelAbstract
International audience; Parallelization is an important paradigm for solving massive optimization problems.
Understanding how to fully benefit form the aggregated computing power and what makes a parallel strategy successful is a difficult issue.
In this study, we propose a simple parallel iterative tabu search (PITS) and study its effectiveness with respect to different experimental settings.
Using the quadratic assignment problem (QAP) as a case study, we first consider different small-and medium-size instances from the literature and then tackle a large-size instance that was rarely considered due the its inherent solving difficulty.
In particular, we show that a balance between the number of function evaluations each parallel process is allowed to perform before resuming the search is a critical issue to obtain an improved quality.
Abdelkafi, Omar,Derbel, Bilel,Liefooghe, Arnaud, 2019, A Parallel Tabu Search for the Large-scale Quadratic Assignment Problem, HAL CCSD
Clinical Relevance of Plaque Distribution for Basilar Artery Stenosis
study endovascular imaging wall basilar complications plaque postoperative artery plaques stenosis
