Construction of Mixed Covering Arrays of strengths 2 through 6 Using a Tabu Search Approach.
Loreto Gonzalez-HernandezNelson Rangel-ValdezJose Torres-JimenezPublished in: Discret. Math. Algorithms Appl. (2012)
Keyphrases
- tabu search
- covering arrays
- simulated annealing
- metaheuristic
- scheduling problem
- search algorithm
- memetic algorithm
- feasible solution
- path relinking
- heuristic methods
- vehicle routing problem
- job shop scheduling problem
- search procedure
- genetic algorithm
- quadratic assignment problem
- test cases
- initial solution
- tabu list
- iterated local search
- context free grammars
- benchmark instances
- tabu search algorithm
- hybrid algorithm
- evolutionary algorithm
- candidate list
- variable neighborhood search
- scatter search
- multi start
- max sat
- search space
- solution quality