论文信息 - Performance analysis of parallel constraint-based local search

Performance analysis of parallel constraint-based local search

We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results for hard combinatorial optimization problems on two different platforms up to several hundreds of cores. On a variety of classical CSPs benchmarks, speedups are very good for a few tens of cores, and good up to a hundred cores. More challenging problems derived from reallife applications (Costas array) shows even better speedups, nearly optimal up to 256 cores.

Philippe Codognet | Daniel Diaz | Florian Richoux | Salvador Abreu | Yves Caniou

[1] Teofilo F. Gonzalez,et al. Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall/Crc Computer & Information Science Series) , 2007 .

[2] Serdar Kadioglu,et al. Dialectic Search , 2009, CP.

[3] Jakub Marecek,et al. Handbook of Approximation Algorithms and Metaheuristics , 2010, Comput. J..

[4] Philippe Codognet,et al. An Efficient Library for Solving CSP with Local Search , 2003 .

[5] Philippe Codognet,et al. Experiments in Parallel Constraint-Based Local Search , 2011, EvoCOP.

[6] Teodor Gabriel Crainic,et al. Introduction to the Special Issue on Parallel Meta-Heuristics , 2002, J. Heuristics.

[7] K. Drakakis,et al. A review of Costas arrays , 2006 .

[8] Philippe Codognet,et al. Yet Another Local Search Method for Constraint Solving , 2001, SAGA.

[9] Emile H. L. Aarts,et al. Parallel local search , 1995, J. Heuristics.

[10] Evripidis Bampis,et al. Handbook of Approximation Algorithms and Metaheuristics , 2007 .

[11] Toby Walsh,et al. CSPLIB: A Benchmark Library for Constraints , 1999, CP.

[12] Toshihide Ibaraki,et al. Metaheuristics : progress as real problem solvers , 2005 .