Elsevier

Procedia Computer Science

Volume 51, 2015, Pages 2739-2743
Procedia Computer Science

Sequential and Parallel Implementation of GRASP for the 0-1 Multidimensional Knapsack Problem,

https://doi.org/10.1016/j.procs.2015.05.411Get rights and content
Under a Creative Commons license
open access

Abstract

The knapsack problem is a widely known problem in combinatorial optimization and has been object of many researches in the last decades. The problem has a great number of variants and obtaining an exact solution to any of these is not easily accomplished, which motivates the search for alternative techniques to solve the problem. Among these alternatives, metaheuristics seem to be suitable on the search for approximate solutions for the problem. In this work we propose a sequential and a parallel implementation for the multidimensional knapsack problem using GRASP metaheuristic. The obtained results show that GRASP can lead to good quality results, even optimal in some instances, and that CUDA may be used to expand the neighborhood search and as a result may lead to improved quality results.

Keywords

GRASP
0-1 multidimensional knapsack problem
CUDA

Cited by (0)

Partially supported by CNPq and CAPES.

Selection and peer-review under responsibility of the Scientific Programme Committee of ICCS 2015.