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

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.

[1]  Pierre Sens,et al.  Stream Processing of Healthcare Sensor Data: Studying User Traces to Identify Challenges from a Big Data Perspective , 2015, ANT/SEIT.

[2]  Anurag Agarwal,et al.  Neural, Genetic, And Neurogenetic Approaches For Solving The 0-1 Multidimensional Knapsack Problem , 2012, BIOINFORMATICS 2012.

[3]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part Ii: Applications , 2022 .

[4]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[5]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[6]  Edson Cáceres,et al.  A CUDA based Solution to the Multidimensional Knapsack Problem Using the Ant Colony Optimization , 2014, ICCS.

[7]  Edson Cáceres,et al.  A parallel implementation to the multidimensional knapsack problem using augmented neural networks , 2014, 2014 XL Latin American Computing Conference (CLEI).

[8]  Rolf Dach,et al.  Technical Report 2012 , 2013 .

[9]  Jack Dongarra,et al.  2014 International Conference on Computational Science , 2014 .

[10]  M. Jalali Varnamkhasti,et al.  Overview of the Algorithms for Solving the Multidimensional Knapsack Problems , 2012 .

[11]  John E. Beasley,et al.  A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.

[12]  Dalessandro Soares Vianna,et al.  Local search-based heuristics for the multiobjective multidimensional knapsack problem , 2012 .

[13]  Jason Deane,et al.  Neural metaheuristics for the multidimensional knapsack problem , 2005 .