Construction of Mixed Covering Arrays Using a Combination of Simulated Annealing and Variable Neighborhood Search.
Arturo Rodríguez-CristernaJosé Torres-JiménezWilfrido Gómez-FloresWagner Coelho A. PereiraPublished in: Electron. Notes Discret. Math. (2015)
Keyphrases
- variable neighborhood search
- simulated annealing
- tabu search
- metaheuristic
- neighborhood search
- covering arrays
- search procedure
- path relinking
- benchmark instances
- evolutionary algorithm
- heuristic methods
- genetic algorithm
- optimization problems
- combinatorial optimization
- hybrid algorithm
- feasible solution
- solution quality
- scatter search
- vehicle routing problem
- benchmark problems
- traveling salesman problem
- test cases
- solution space
- context free grammars
- ant colony optimization
- hybrid method
- search algorithm
- cost function
- search space
- scheduling problem
- job shop scheduling problem
- max sat
- minimum spanning tree
- optimal solution
- neural network
- computational complexity
- memetic algorithm
- branch and bound
- test set