A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problems.
Abir ChaabaniSlim BechikhLamjed Ben SaidPublished in: Soft Comput. (2020)
Keyphrases
- bi level
- combinatorial optimization problems
- knapsack problem
- combinatorial optimization
- computational complexity
- learning algorithm
- ant colony optimization
- cost function
- dynamic programming
- np hard
- gray scale
- decomposition algorithm
- optimal solution
- worst case
- particle swarm optimization
- shortest path problem
- pricing model
- continuous optimization problems
- benchmark problems
- k means
- search space
- image processing
- computer vision