Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem.
Zhi-Gang RenZu-ren FengAimin ZhangPublished in: Inf. Sci. (2012)
Keyphrases
- multidimensional knapsack problem
- ant colony optimization
- multiple choice
- lagrangian relaxation
- metaheuristic
- integer programming
- evolutionary strategy
- swarm intelligence
- feasible solution
- lower bound
- dynamic programming
- combinatorial optimization problems
- open ended
- traveling salesman problem
- branch and bound algorithm
- particle swarm optimization
- np hard
- tabu search
- column generation
- genetic algorithm
- linear programming
- shortest path
- lower and upper bounds
- particle swarm optimization pso
- knapsack problem
- optimization problems
- simulated annealing
- artificial immune system
- learning process
- optimal solution
- e learning