GPU Computing for Parallel Local Search Metaheuristic Algorithms

DOI10.1109/TC.2011.206MaRDI QIDQ5274281zbMATH OpenFDO

Authors Thé van Luong, El-Ghazali Talbi, Nouredine Melab

Publication date 12 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2011.206

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10) Approximation methods and heuristics in mathematical programming (90C59)

Cited in

(8)

• Solving the examination timetabling problem in GPUs
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
• Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
• Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
• A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems
• IBEA-SVM: an indicator-based evolutionary algorithm based on pre-selection with classification guided by SVM
• Solving the uncapacitated single allocation p-hub Median problem on GPU
• Accelerating the Clarke-Wright algorithm using GPUs

This page was built for publication: GPU Computing for Parallel Local Search Metaheuristic Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5274281)