An Experimental Study on Ant Colony Optimization Hyper-Heuristics for Solving the Knapsack Problem.
Bronson DuhartFernando CamarenaJosé Carlos Ortiz-BaylissIván AmayaHugo Terashima-MarínPublished in: MCPR (2018)
Keyphrases
- knapsack problem
- ant colony optimization
- hyper heuristics
- metaheuristic
- combinatorial optimization problems
- optimization problems
- examination timetabling
- optimal solution
- search heuristics
- combinatorial optimization
- graph coloring
- timetabling problem
- randomly generated test instances
- tabu search
- evolutionary algorithm
- implicit enumeration
- swarm intelligence
- ant colony
- traveling salesman problem
- memetic algorithm
- test problems
- lp relaxation
- exact algorithms
- np hard
- linear programming relaxation
- aco algorithm
- combinatorial problems
- vehicle routing problem
- dynamic programming
- aco algorithms
- particle swarm optimization
- artificial ants
- genetic algorithm
- search methods
- benchmark problems
- feasible solution
- particle swarm optimization pso
- ant colonies
- heuristic methods
- multiple objectives
- simulated annealing
- genetic programming
- cost function
- lower bound
- machine learning
- evolutionary computation
- heuristic search
- np complete
- worst case