Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives.
Hirad AssimiOscar HarperYue XieAneta NeumannFrank NeumannPublished in: ECAI (2020)
Keyphrases
- knapsack problem
- chance constrained
- multiple objectives
- combinatorial optimization problems
- optimal solution
- test problems
- optimization problems
- dynamic programming
- chance constrained programming
- chance constraints
- stochastic programming
- np hard
- exact algorithms
- production planning
- greedy algorithm
- neural network
- evolutionary computation
- bi objective
- lower bound
- upper bound
- shortest path problem
- robust optimization
- computationally tractable
- genetic algorithm
- evolutionary algorithm
- maximum profit