A parallel implementation to the multidimensional knapsack problem using augmented neural networks

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, augmented neural networks seem to be suitable on the search for approximate solutions for the problem. In this work we propose a parallel implementation for the multidimensional knapsack problem using augmented neural networks. The obtained results show that augmented neural networks allow efficient parallelization using CUDA: even smaller numbers of epoques resulted on equal or even better solutions than the sequential implementation. Differently, MPI implementation did not achieve satisfactory results.

[1]  W S McCulloch,et al.  A logical calculus of the ideas immanent in nervous activity , 1990, The Philosophy of Artificial Intelligence.

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

[3]  Smaïl Niar,et al.  A parallel Tabu search algorithm for the 0-1 multidimensional knapsack problem , 1997, Proceedings 11th International Parallel Processing Symposium.

[4]  Peter S. Pacheco Parallel programming with MPI , 1996 .

[5]  Varghese S. Jacob,et al.  An Improved Augmented Neural-Network Approach for Scheduling Problems , 2006, INFORMS J. Comput..

[6]  Edson Cáceres,et al.  0-1 Knapsack Problem: BSP/CGM Algorithm and Implementation , 2005, IASTED PDCS.

[7]  Varghese S. Jacob,et al.  Augmented neural networks for task scheduling , 2003, Eur. J. Oper. Res..

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

[9]  Christine Solnon,et al.  An Ant Colony Optimization Meta-Heuristic for Subset Selection Problems , 2006 .

[10]  Rui Tao Liu,et al.  MapReduce-Based Ant Colony Optimization Algorithm for Multi-Dimensional Knapsack Problem , 2013 .

[11]  László Béla Kovács Combinatorial Methods of Discrete Programming , 1998 .

[12]  S. Senju,et al.  An Approach to Linear Programming with 0--1 Variables , 1968 .

[13]  Roger Fletcher,et al.  Combinatorial Methods of Discrete Programming , 1982 .

[14]  Fernando Gustavo Tinetti,et al.  Parallel programming: techniques and applications using networked workstations and parallel computers. Barry Wilkinson, C. Michael Allen , 2000 .

[15]  Darnes Vilariño Ayala,et al.  A Solution to Multidimensional Knapsack Problem Using a Parallel Genetic Algorithm , 2010, Int. J. Intell. Inf. Process..

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

[17]  Jens H. Krüger,et al.  A Survey of General‐Purpose Computation on Graphics Hardware , 2007, Eurographics.

[18]  Ronald H. Perrott,et al.  Parallel programming , 1988, International computer science series.

[19]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[20]  Bruce A. McCarl,et al.  A HEURISTIC FOR GENERAL INTEGER PROGRAMMING , 1974 .