Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints.
Vahid RoostapourAneta NeumannFrank NeumannPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- knapsack problem
- dynamically changing
- test problems
- multi objective evolutionary algorithms
- nsga ii
- decision variables
- combinatorial optimization problems
- optimal solution
- optimization problems
- dynamic programming
- bi objective
- exact algorithms
- multi objective
- np hard
- implicit enumeration
- integer variables
- search algorithm
- linear programming
- evolutionary algorithm
- multidimensional knapsack problem
- neural network
- multiple objectives
- greedy algorithm
- linear constraints
- linear program
- metaheuristic
- machine learning