A GPU Implementation of Large Neighborhood Search for Solving Constraint Optimization Problems

Constraint programming has gained prominence as an effective and declarative paradigm for modeling and solving complex combinatorial problems. Techniques based on local search have proved practical to solve real-world problems, providing a good compromise between optimality and efficiency. In spite of the natural presence of concurrency, there has been relatively limited effort to use novel massively parallel architectures, such as those found in modern Graphical Processing Units (GPUs), to speedup local search techniques in constraint programming. This paper describes a novel framework which exploits parallelism from a popular local search method (the Large Neighborhood Search method), using GPUs.

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

[2]  Matteo Fischetti,et al.  Algorithms for railway crew management , 1997, Math. Program..

[3]  Agostino Dovier,et al.  Protein Structure Prediction on GPU: A Declarative Approach in a Multi-agent Framework , 2013, 2013 42nd International Conference on Parallel Processing.

[4]  Peter J. Stuckey,et al.  MiniZinc: Towards a Standard CP Modelling Language , 2007, CP.

[5]  Peter J. Stuckey,et al.  Efficient constraint propagation engines , 2006, TOPL.

[6]  Panagiotis Manolios,et al.  Implementing Survey Propagation on Graphics Processing Units , 2006, SAT.

[7]  Krzysztof Kuchcinski,et al.  JaCoP Library User's Guide , 2010 .

[8]  Patrick Prosser,et al.  A Preliminary Review of Literature on Parallel Constraint Solving , 2011 .

[9]  Federico Campeotto.  Exploring the use of GPGPUs in constraint solving , 2014 .

[10]  Mats Carlsson,et al.  Integrating Rule-Based Modelling and Constraint Programming for Solving Industrial Packing Problems , 2010, ERCIM News.

[11]  Jason Sanders,et al.  CUDA by example: an introduction to general purpose GPU programming , 2010 .

[12]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[13]  Carlos A. Bana e Costa.  Parallelization of SAT Algorithms on GPUs , 2013 .

[14]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[15]  Christopher M. Bishop,et al.  Pattern Recognition and Machine Learning (Information Science and Statistics) , 2006 .

[16]  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.

[17]  Nasser M. Nasrabadi,et al.  Pattern Recognition and Machine Learning , 2006, Technometrics.

[18]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[19]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[20]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[21]  Andrea Lodi,et al.  Local Search and Constraint Programming , 2003, Handbook of Metaheuristics.

[22]  Alessandro Dal Palù,et al.  Exploiting Unexploited Computing Resources for Computational Logics , 2012, CILC.

[23]  Helmut Simonis,et al.  Building Industrial Applications with Constraint Programming , 2001, CCL.

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