Solving 0-1 knapsack problem by continuous ACO algorithm.
Chiranjit ChangdarG. S. MahapatraRajat Kumar PalPublished in: Int. J. Comput. Intell. Stud. (2013)
Keyphrases
- knapsack problem
- aco algorithm
- ant colony optimization
- randomly generated test instances
- combinatorial optimization problems
- implicit enumeration
- optimization problems
- metaheuristic
- optimal solution
- multidimensional knapsack problem
- dynamic programming
- aco algorithms
- combinatorial optimization
- exact algorithms
- lp relaxation
- linear programming relaxation
- np hard
- test problems
- integer variables
- continuous relaxation
- greedy algorithm
- parameter settings
- continuous domains
- solution quality
- maximum profit
- traveling salesman problem
- lower bound
- vehicle routing problem
- genetic algorithm
- tabu search
- special case
- evolutionary algorithm
- objective function
- reinforcement learning