The Three-Dimensional Knapsack Packing Problem consists of finding the maximum profit for packing a subset of boxes in a larger box (packing box). The boxes to pack are rectangular but of different sizes. This problem is a variant of the Knapsack Problem and therefore its computational complexity is NP-Complete. This article shows a parallel genetic algorithm based on the Island Model and the Nash equilibrium theory for solving the 3D Knapsack Packing Problem assuming both, orthogonally packing and rotation prevention. Computational experiments comparing the developed algorithm with previous approach indicate that the results are very hopeful for three-dimensional problem.