Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem.
Kokila PereraAneta NeumannPublished in: CoRR (2024)
Keyphrases
- knapsack problem
- chance constrained
- sliding window
- test problems
- multi objective evolutionary algorithms
- nsga ii
- data streams
- combinatorial optimization problems
- optimal solution
- dynamic programming
- optimization problems
- bi objective
- exact algorithms
- np hard
- greedy algorithm
- multi objective
- multi objective optimization
- multistage
- multiple objectives
- evolutionary algorithm
- data sets
- genetic programming
- robust optimization
- decision variables
- genetic algorithm
- data mining