Hybrid of genetic algorithm and local search to solve MAX-SAT problem using nVidia CUDA framework

@article{Munawar2009HybridOG,
  title={Hybrid of genetic algorithm and local search to solve MAX-SAT problem using nVidia CUDA framework},
  author={Asim Munawar and Mohamed Wahib and Masaharu Munetomo and Kiyoshi Akama},
  journal={Genetic Programming and Evolvable Machines},
  year={2009},
  volume={10},
  pages={391-415}
}
General Purpose computing over Graphical Processing Units (GPGPUs) is a huge shift of paradigm in parallel computing that promises a dramatic increase in performance. But GPGPUs also bring an unprecedented level of complexity in algorithmic design and software development. In this paper we describe the challenges and design choices involved in parallelizing a hybrid of Genetic Algorithm (GA) and Local Search (LS) to solve MAXimum SATisfiability (MAX-SAT) problem on a state-of-the-art nVidia… 
Advanced genetic algorithm to solve MINLP problems over GPU
TLDR
This paper succeeds in implementation of a stochastic algorithm over GPU but show considerable speedups over CPU implementations and describes the challenges and design choices involved in parallelization of this algorithm to solve complex MINLPs over a commodity GPU using Compute Unified Device Architecture (CUDA) programming model.
Massively Parallel Evolutionary Computation on GPGPUs
TLDR
This book is a comprehensive introduction to the approach, explaining the characteristics of the hardware used, and presenting a representative project to develop a platform for automatic parallelization of evolutionary computing (EC) on GPGPUs.
Advances in Hybrid Genetic Algorithms with Learning and GPU for Scheduling Problems: Brief Survey and Case Study
TLDR
A parallel multiobjective GA (MoGA) acceleration with CUDA (Compute Unified Device Architecture) will be introduced and a parallel hybrid multiobjectives GA with learning is introduced through a real-world case study of the train scheduling problem.
arGA: Adaptive Resolution Micro-genetic Algorithm with Tabu Search to Solve MINLP Problems Using GPU
TLDR
The proposed algorithm is named the adaptive resolution Genetic Algorithm (arGA) as it exploits the concept of controlling the search space size and resolution in an adaptive manner and was able to find the best-known solutions to extremely difficult MINLP/NLP problems in fewer fitness evaluations and in a competitive time.
Optimization of parallel Genetic Algorithms for nVidia GPUs
TLDR
The paper demonstrates the performance of designed-for-GPGPU parallel GAs representing the entire spectrum of legacy parallel model of GAs over nVidia Tesla C1060 workstation showing a significant improvement in performance after optimizing and tuning the algorithms for GPU.
Nature-Inspired Meta-Heuristics on Modern GPUs: State of the Art and Brief Survey of Selected Algorithms
TLDR
A brief overview of the latest state-of-the-art research on the design, implementation, and applications of parallel GA, DE, PSO, and SA-based methods on the GPUs is provided.
Algorithms for Maximum Satisfiability using GPU
TLDR
Through testing, it is concluded that the current state of the art MaxSAT solvers are extremely advanced and hard to compete against on a level playing field, being difficult to achieve the same quality of results in the same span of time.
Pipelined Genetic Propagation
TLDR
A new hardware-oriented approach to GAs, called Pipelined Genetic Propagation (PGP), which is intrinsically distributed and pipelined, which allows the solution to be scaled to the available resources, and also to dynamically change topology at run-time to explore different solution strategies.
Collaborative Parallel Hybrid Metaheuristics on Graphics Processing Unit
TLDR
This paper presents highly efficient parallel implementations of the particle swarm optimization, the genetic algorithm and the simulated annealing algorithm on GPU using CUDA using an island model, and presents a strategy that uses the generalized island model to integrate multiple metaheuristics into a parallel hybrid solution adapted to the GPU.
Automated framework for FPGA-based parallel genetic algorithms
TLDR
This paper proposes a general-purpose framework, which takes in a high-level description of the optimisation target and automatically generates pGA designs for FPGAs, and exploits the two levels of parallelism found in GA instances and genetic operations, allowing users to tailor the architecture for resource constraints at compile-time.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 37 REFERENCES
Solving MAX-SAT problems using a memetic evolutionary meta-heuristic
TLDR
The evolutionary approach applies a search technique to further improve the fitness of individuals in the genetic population by combining local search heuristics with crossover operators and results show that memetic algorithm performs better than the classical genetic algorithms for most benchmark problems.
Scatter Search with Random Walk Strategy for SAT and MAX-W-SAT Problems
TLDR
A procedure to generate good scattered initial solutions, a combination operator and a technique for improving the solutions quality are presented and various experimental results show that SS-SAT performs better than or as well as GRASP for most benchmark problems.
Solving weighted Max-Sat optimization problems using a Taboo Scatter Search metaheuristic
TLDR
This work presents a metaheuristic based on Taboo search (TS) procedure that makes use of the Scatter search (SS) paradigm to support a TS by a SS add-on to explore the influence of a population and combination strategies on the ability of generating high quality solutions.
An Efficient Fine-grained Parallel Genetic Algorithm Based on GPU-Accelerated
TLDR
AFGPGA method based on GPU-acceleration, which maps parallel GA algorithm to texture-rendering on consumer-level graphics cards is proposed, which increases the population size, speeds up its execution and provides ordinary users with a feasible FGPGA solution.
Parallel Genetic Algorithms on Programmable Graphics Hardware
TLDR
This paper describes how fine-grained parallel genetic algorithms can be mapped to programmable graphics hardware found in commodity PC and demonstrates the effectiveness of the approach by comparing it with compatible software implementation.
MCUDA: An Efficient Implementation of CUDA Kernels on Multi-cores
TLDR
Multicore-CUDA (MCUDA), a system that efciently maps the CUDA programming model to a multicore CPU architecture, and is now possible to write data-parallel code in asingle programming model for efcient execution on CPU or GPU architectures.
Noise Strategies for Improving Local Search
TLDR
It is shown that mixed random walk is the superior strategy for solving MAX-SAT problems, and results demonstrating the effectiveness of local search with walk for solving circuit synthesis and circuit diagnosis problems are presented.
SATLIB: An Online Resource for Research on SAT
TLDR
An overview of SATLIB is given and its current set of benchmark problems are described, to encourage all members of the community to utilise it for their SAT-related research and to improve it by submitting new benchmark problems, SAT solvers, and bibliography entries.
Tabu Search for SAT
TLDR
TSAT, a basic tabu search algonthm for SAT, is introduced and compared with Selman et al.
MCUDA: An Efficient Implementation of CUDA Kernels for Multi-core CPUs
TLDR
A framework called MCUDA is described, which allows CUDA programs to be executed efficiently on shared memory, multi-core CPUs and argues that CUDA can be an effective data-parallel programming model for more than just GPU architectures.
...
1
2
3
4
...