Genetic Algorithm for the Knapsack Problem with Irregular Shaped Items.
Layane Rodrigues de Souza QueirozLeandro Resende MundimMarina AndrettaPublished in: CLEI (2018)
Keyphrases
- knapsack problem
- genetic algorithm
- multidimensional knapsack problem
- cutting stock problems
- multiple objectives
- combinatorial optimization problems
- dynamic programming
- test problems
- optimal solution
- optimization problems
- fitness function
- evolutionary algorithm
- np hard
- continuous relaxation
- multi objective
- np hard problems
- neural network
- exact algorithms
- bicriteria
- linear programming relaxation
- greedy heuristic
- nsga ii
- job shop scheduling problem
- decision variables
- greedy algorithm
- heuristic solution
- genetic algorithm ga
- metaheuristic
- ant colony optimization
- simulated annealing
- randomly generated test instances
- multi objective optimization
- approximation algorithms
- mutation operator
- differential evolution
- evolutionary computation
- genetic programming
- linear programming
- upper bound
- cost function
- bayesian networks