Sequential and parallel hybrid approaches of augmented neural networks and GRASP for the 0-1 multidimensional knapsack problem

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

There are a lot of problems, whose solutions are based on 0-1 multidimensional problem. Since this combinatorial optimization problem is NP-hard, one of the approaches to solve it is the use of metaheuristics. For this problem, even heuristics consume a lot of time to find a solution, which motivates the search for alternatives capable of making the use of such techniques less time-consuming. Among these alternatives, the use of parallelization strategies deserves to be highlighted, once it may lead to reduced execution times and/or better quality results. In this work we propose a hybrid approach of augmented neural networks and GRASP for the 0-1 multidimensional knapsack problem, we describe a sequential and a GPGPU implementation and measure the achieved speedups. We also compare our results with the ones obtained by other metaheuristics. The obtained results show that the proposed approach can achieve better quality solutions than some of the other algorithms found in the literature. These solutions can lead to better solutions to real problems that can be modeled with the 0-1 MKP.

Cite

CITATION STYLE

APA

de Almeida Dantas, B., & Cáceres, E. N. (2016). Sequential and parallel hybrid approaches of augmented neural networks and GRASP for the 0-1 multidimensional knapsack problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9787, pp. 207–222). Springer Verlag. https://doi.org/10.1007/978-3-319-42108-7_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free