A hybrid ant colony optimization algorithm for the knapsack problem with a single continuous variable.
Xinhua YangYufan ZhouAiling ShenJuan LinYiwen ZhongPublished in: GECCO (2021)
Keyphrases
- knapsack problem
- ant colony optimization algorithm
- continuous variables
- optimal solution
- dynamic programming
- optimization problems
- ant colony optimization
- np hard
- integer variables
- greedy algorithm
- dynamic systems
- exact algorithms
- ant colony algorithm
- traveling salesman problem
- swarm intelligence
- hybrid algorithm
- implicit enumeration
- computationally expensive
- convergence speed
- structure learning
- graphical models
- probabilistic model