On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems.
Jens GottliebPublished in: EvoWorkshops (2001)
Keyphrases
- knapsack problem
- evolutionary algorithm
- optimization problems
- evolutionary computation
- combinatorial optimization problems
- multi objective
- test problems
- fitness function
- multi objective optimization
- nsga ii
- metaheuristic
- differential evolution
- optimal solution
- dynamic programming
- production planning
- exact algorithms
- cutting plane
- linear programming relaxation
- penalty function
- genetic algorithm
- genetic programming
- simulated annealing
- implicit enumeration
- evolution strategy
- benchmark problems
- maximum profit
- traveling salesman problem
- np hard
- bicriteria
- differential evolution algorithm
- np hard problems
- cost function
- greedy algorithm
- machine learning
- hyper heuristics
- evolutionary process
- combinatorial optimization