Parallel Local Search

Local Search metaheuristics are a recognized means of solving hard combinatorial problems. Over the last couple of decades, significant advances have been made in terms of the formalization, applicability and performance of these methods. Key to the performance aspect is the increased availability of parallel hardware, which turns out to be largely exploitable by this class of procedures. As the real-life cases of combinatorial optimisation easily degrade into intractable territory for exact or approximation algorithms, local search metaheuristics hold undeniable interest. This situation is further compounded by the good adequacy exhibited by this class of search procedures for large-scale parallel operation. In this chapter we explore and discuss ways which lead to parallelization in Local Search.

[1]  El-Ghazali Talbi,et al.  COSEARCH: A Parallel Cooperative Metaheuristic , 2006, J. Math. Model. Algorithms.

[2]  Tang,et al.  Self-Organized Criticality: An Explanation of 1/f Noise , 2011 .

[3]  Philippe Codognet,et al.  Estimating parallel runtimes for randomized algorithms in constraint solving , 2015, Journal of Heuristics.

[4]  Ben Paechter,et al.  A Framework for Distributed Evolutionary Algorithms , 2002, PPSN.

[5]  Stefan Boettcher,et al.  Extremal Optimization: an Evolutionary Local-Search Algorithm , 2002, ArXiv.

[6]  C.J.H. Mann,et al.  Handbook of Approximation: Algorithms and Metaheuristics , 2008 .

[7]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

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

[9]  Patrick Siarry,et al.  A survey on optimization metaheuristics , 2013, Inf. Sci..

[10]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[11]  Daniel Diaz,et al.  Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization , 2016, EvoCOP.

[12]  Agostino Poggi,et al.  Developing Multi-agent Systems with JADE , 2007, ATAL.

[13]  Angel A. Juan,et al.  A multi-agent based cooperative approach to scheduling and routing , 2016, Eur. J. Oper. Res..

[14]  Zoltán Király.  Linear Time Local Approximation Algorithm for Maximum Stable Marriage , 2013, Algorithms.

[15]  Daniel Mack,et al.  A parallel tabu search algorithm for solving the container loading problem , 2003, Parallel Comput..

[16]  Magnús M. Halldórsson,et al.  Improved approximation results for the stable marriage problem , 2007, TALG.

[17]  David Manlove,et al.  Stable Marriage with Incomplete Lists and Ties , 1999, ICALP.

[18]  El-Ghazali Talbi,et al.  ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics , 2004, J. Heuristics.

[19]  Francesca Guerriero,et al.  A cooperative parallel rollout algorithm for the sequential ordering problem , 2003, Parallel Comput..

[20]  Daniel Diaz,et al.  Parallel Local Search: Experiments with a PGAS-based programming model , 2013, ArXiv.

[21]  Philippe Codognet,et al.  Massively Parallel Local Search for SAT , 2012, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence.

[22]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[23]  Y. Ogita,et al.  A parallel tabu search based method for reconfigurations of distribution systems , 2000, 2000 Power Engineering Society Summer Meeting (Cat. No.00CH37134).

[24]  Eric McDermid.  A 3/2-Approximation Algorithm for General Stable Marriage , 2009, ICALP.

[25]  Catherine Roucairol,et al.  A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .

[26]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[27]  Francesca Rossi,et al.  A Local Search Algorithm for SMTI and its extension to HRT Problems , 2015 .

[28]  Gintaras Palubeckis,et al.  An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem , 2000, Informatica.

[29]  Teodor Gabriel Crainic,et al.  Communication Issues in Designing Cooperative Multi-Thread Parallel Searches , 1996 .

[30]  Celso C. Ribeiro,et al.  Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms , 2012, J. Glob. Optim..

[31]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[32]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[33]  Mostafa Zandieh,et al.  Flexible job-shop scheduling with parallel variable neighborhood search algorithm , 2010, Expert Syst. Appl..

[34]  Thomas Stützle,et al.  Evaluating Las Vegas Algorithms: Pitfalls and Remedies , 1998, UAI.

[35]  Clayton W. Commander,et al.  A Survey of the Quadratic Assignment Problem, with Applications , 2003 .

[36]  M. M. Flood.  The Traveling-Salesman Problem , 1956 .

[37]  Philippe Codognet,et al.  A Parametric Framework for Cooperative Parallel Local Search , 2014, EvoCOP.

[38]  Celso C. Ribeiro,et al.  TTT plots: a perl program to create time-to-target plots , 2007, Optim. Lett..

[39]  Mehmet Emin Aydin.  Metaheuristic Agent Teams for Job Shop Scheduling Problems , 2007, HoloMAS.

[40]  A. Percus,et al.  Nature's Way of Optimizing , 1999, Artif. Intell..

[41]  David Manlove,et al.  Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems , 2008, J. Comb. Optim..

[42]  Sébastien Vérel,et al.  ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms , 2013, Journal of Heuristics.

[43]  Celso C. Ribeiro,et al.  Probability Distribution of Solution Time in GRASP: An Experimental Investigation , 2002, J. Heuristics.

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

[45]  Pascal Van Hentenryck,et al.  Constraint-based local search , 2018, Handbook of Heuristics.

[46]  Andrea Roli,et al.  MAGMA: a multiagent architecture for metaheuristics , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[47]  Stefan Boettcher,et al.  Extremal Optimization for the Sherrington-Kirkpatrick Spin Glass , 2004 .

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

[49]  Michel Gendreau,et al.  Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

[50]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[51]  El-Ghazali Talbi,et al.  GPU Computing for Parallel Local Search Metaheuristic Algorithms , 2013, IEEE Transactions on Computers.

[52]  Magnús M. Halldórsson,et al.  Improved Approximation of the Stable Marriage Problem , 2003, ESA.

[53]  Pascal Van Hentenryck,et al.  Parallel and distributed local search in COMET , 2009, Comput. Oper. Res..

[54]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

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

[56]  Thomas Stützle,et al.  Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT , 1999, Artif. Intell..

[57]  G. Amdhal,et al.  Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).

[58]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[59]  Katarzyna E. Paluch.  Faster and Simpler Approximation of Stable Matchings , 2014, Algorithms.

[60]  Francesca Rossi,et al.  Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization , 2015, AAAI.

[61]  M. Carmen Garrido,et al.  Using machine learning in a cooperative hybrid parallel strategy of metaheuristics , 2009, Inf. Sci..

[62]  Jean-Yves Potvin,et al.  A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints , 1994, Comput. Oper. Res..

[63]  Zvi Drezner,et al.  Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem , 2008, Comput. Oper. Res..

[64]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[65]  Celso C. Ribeiro,et al.  Cooperative Mult-thread Parallel Tabu Search with an Application to Circuit Partitioning , 1998, IRREGULAR.

[66]  Philippe Codognet,et al.  Performance analysis of parallel constraint-based local search , 2012, PPoPP '12.

[68]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

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

[70]  El-Ghazali Talbi,et al.  Designing cellular networks using a parallel hybrid metaheuristic on the computational grid , 2007, Comput. Commun..

[71]  Per Bak,et al.  Complexity and Criticality , 1996 .

[72]  Philippe Codognet,et al.  From Sequential to Parallel Local Search for SAT , 2013, EvoCOP.

[73]  Dariusz Barbucha,et al.  A cooperative population learning algorithm for vehicle routing problem with time windows , 2014, Neurocomputing.

[74]  L. Dagum,et al.  OpenMP: an industry standard API for shared-memory programming , 1998 .

[75]  Bart Selman,et al.  Algorithm portfolios , 2001, Artif. Intell..

[76]  Bak,et al.  Punctuated equilibrium and criticality in a simple model of evolution. , 1993, Physical review letters.

[77]  Belén Melián-Batista,et al.  The Parallel Variable Neighborhood Search for the p-Median Problem , 2002, J. Heuristics.

[78]  Philippe Codognet,et al.  A GPU Implementation of Parallel Constraint-Based Local Search , 2014, 2014 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing.

[79]  Sanja Petrovic,et al.  A cooperative hyper-heuristic search framework , 2010, J. Heuristics.

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

[81]  L. Babai.  Monte-Carlo algorithms in graph isomorphism testing , 2006 .

[82]  Jean-François Cordeau,et al.  A parallel iterated tabu search heuristic for vehicle routing problems , 2012, Comput. Oper. Res..

[83]  H. N. Nagaraja,et al.  Order Statistics, Third Edition , 2005, Wiley Series in Probability and Statistics.

[84]  Sebastián Lozano,et al.  Metaheuristic optimization frameworks: a survey and benchmarking , 2011, Soft Computing.

[85]  Pierre Hansen,et al.  Cooperative Parallel Variable Neighborhood Search for the p-Median , 2004, J. Heuristics.

[86]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[87]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[88]  Pierre Hansen,et al.  Variable neighborhood search , 1997, Eur. J. Oper. Res..

[89]  David Manlove,et al.  Approximability results for stable marriage problems with ties , 2003, Theor. Comput. Sci..

[90]  Stefan Voß,et al.  Meta-heuristics: The State of the Art , 2000, Local Search for Planning and Scheduling.

[91]  Pascal Van Hentenryck,et al.  Distributed Constraint-Based Local Search , 2006, CP.

[92]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[93]  El-Ghazali Talbi,et al.  ParadisEO-MO-GPU: a framework for parallel GPU-based local search metaheuristics , 2013, GECCO '13.

[94]  Akhtar Rasool,et al.  Quadratic Assignment Problem and its Relevance to the Real World: A Survey , 2014 .

[95]  Enrique Alba,et al.  Parallel Metaheuristics: A New Class of Algorithms , 2005 .

[96]  El-Ghazali Talbi,et al.  Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem , 2010, EvoCOP.

[97]  David,et al.  [Wiley Series in Probability and Statistics] Order Statistics (David/Order Statistics) || Basic Distribution Theory , 2003 .

[98]  Emile H. L. Aarts,et al.  Sequential and parallel local search algorithms for job shop scheduling , 1997 .

[99]  Zvi Drezner,et al.  The extended concentric tabu for the quadratic assignment problem , 2005, Eur. J. Oper. Res..

[100]  Panos M. Pardalos,et al.  Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP , 1995, IRREGULAR.

[101]  David Manlove,et al.  Hard variants of stable marriage , 2002, Theor. Comput. Sci..

[102]  Frédéric Gardi,et al.  Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application , 2011, EvoCOP.

[103]  Celso C. Ribeiro,et al.  Efficient parallel cooperative implementations of GRASP heuristics , 2007, Parallel Comput..

[104]  Philippe Codognet,et al.  Large-scale parallelism for constraint-based local search: the costas array case study , 2014, Constraints.

[105]  Carvalho,et al.  Microarray Layout and the Quadratic Assignment Problem , 2006 .

[106]  Franz Rendl,et al.  QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..

[107]  Daniel Diaz,et al.  Parallel Performance of Declarative Programming Using a PGAS Model , 2013, PADL.

[108]  David M. Raup,et al.  How Nature Works: The Science of Self-Organized Criticality , 1997 .

[109]  Daniel Diaz,et al.  Hybridization as Cooperative Parallelism for the Quadratic Assignment Problem , 2016, HM.

[110]  Tad Hogg,et al.  Solving the Really Hard Problems with Cooperative Search , 1993, AAAI.

[111]  Philippe Codognet,et al.  Constraint-Based Local Search for the Costas Array Problem , 2012, LION.

[112]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[113]  David Meignan,et al.  Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism , 2010, J. Heuristics.

[114]  Pedro S. de Souza,et al.  Asynchronous Teams: Cooperation Schemes for Autonomous Agents , 1998, J. Heuristics.

[115]  Kenneth Sörensen,et al.  A History of Metaheuristics , 2015 .

[116]  George Bosilca,et al.  Open MPI: Goals, Concept, and Design of a Next Generation MPI Implementation , 2004, PVM/MPI.

[117]  Philippe Codognet,et al.  Prediction of Parallel Speed-Ups for Las Vegas Algorithms , 2012, 2013 42nd International Conference on Parallel Processing.

[118]  Youssef Hamadi,et al.  Improving Parallel Local Search for SAT , 2011, LION.