An intelligent multi-colony multi-objective ant colony optimization (ACO) for the 0-1 knapsack problem.
Seyed Kamal ChaharsooghiAmir Hosein Meimand KermaniPublished in: IEEE Congress on Evolutionary Computation (2008)
Keyphrases
- ant colony optimization
- knapsack problem
- multi objective
- combinatorial optimization problems
- particle swarm optimization
- metaheuristic
- optimization problems
- evolutionary algorithm
- bi objective
- ant colony
- multiple objectives
- swarm intelligence
- aco algorithm
- genetic algorithm
- optimal solution
- objective function
- nsga ii
- artificial ants
- traveling salesman problem
- multi objective optimization
- ant colony optimization algorithm
- dynamic programming
- test problems
- aco algorithms
- exact algorithms
- ant colonies
- optimization algorithm
- pheromone trails
- particle swarm optimization pso
- nature inspired
- greedy algorithm
- ant colony algorithm
- np hard
- metaheuristic algorithms
- tabu search
- differential evolution
- simulated annealing
- shortest path problem
- foraging behavior
- linear programming relaxation
- optimisation algorithm
- nature inspired algorithms
- evolutionary strategy
- neural network
- artificial immune system
- lower bound
- search space
- global optimization
- combinatorial optimization
- evolutionary computation
- fitness function
- upper bound
- genetic programming