Paper Info
Title
A Parallel Nash Genetic Algorithm For The 3d Orthogonal Knapsack Problem
Abstract
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.
Year
Venue
Keywords
2013
INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS
Genetic Algorithms, Island Model, Knapsack Problem, Nash Equilibrium theory
Field
DocType
Volume
Mathematical optimization,Packing problems,Change-making problem,Generalized assignment problem,Continuous knapsack problem,Cutting stock problem,Set packing,Knapsack problem,Mathematics,Bin packing problem
Journal
4
Issue
ISSN
Citations 
3
2007-1558
0
PageRank 
References 
Authors
0.34
3
3
Name
Order
Citations
PageRank
Daniel Soto1255.69
Wilson Soto201.69
Yoan J. Pinzon315816.81