A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces.
Andreas BortfeldtTobias WinterPublished in: Int. Trans. Oper. Res. (2009)
Keyphrases
- knapsack problem
- genetic algorithm
- multidimensional knapsack problem
- guillotine cutting
- packing problem
- combinatorial optimization problems
- optimal solution
- test problems
- optimization problems
- three dimensional
- dynamic programming
- np hard
- exact algorithms
- linear programming relaxation
- multi objective
- metaheuristic
- fitness function
- heuristic solution
- neural network
- bicriteria
- np hard problems
- continuous relaxation
- evolutionary computation
- nsga ii
- implicit enumeration
- evolutionary algorithm
- greedy heuristic
- maximum profit
- randomly generated test instances
- multi objective optimization
- simulated annealing
- multiple objectives
- genetic algorithm ga
- genetic programming
- linear programming
- worst case
- scheduling problem
- machine learning