A penalty-based Tabu search for constrained covering arrays.
Philippe GalinierSegla KpodjedoGiulio AntoniolPublished in: GECCO (2017)
Keyphrases
- tabu search
- covering arrays
- simulated annealing
- metaheuristic
- test cases
- scheduling problem
- memetic algorithm
- feasible solution
- path relinking
- context free grammars
- search procedure
- search algorithm
- hybrid algorithm
- iterated local search
- genetic algorithm
- vehicle routing problem
- heuristic methods
- benchmark instances
- job shop scheduling problem
- multi start
- initial solution
- quadratic assignment problem
- scatter search
- variable neighborhood search
- tabu search algorithm
- tabu list
- candidate list
- combinatorial optimization
- optimal solution
- objective function
- max sat
- solution quality
- pattern matching
- optimization problems
- relational databases