A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays.
Arturo Rodríguez-CristernaJose Torres-JimenezPublished in: Electron. Notes Discret. Math. (2012)
Keyphrases
- variable neighborhood search
- simulated annealing
- tabu search
- metaheuristic
- covering arrays
- neighborhood search
- search procedure
- benchmark instances
- combinatorial optimization
- path relinking
- genetic algorithm
- evolutionary algorithm
- solution space
- ant colony optimization
- solution quality
- heuristic methods
- hybrid algorithm
- vehicle routing problem
- feasible solution
- benchmark problems
- test cases
- memetic algorithm
- scatter search
- genetic algorithm ga
- hill climbing
- traveling salesman problem
- context free grammars
- optimization problems
- neural network
- job shop scheduling problem
- single machine scheduling problem
- minimum spanning tree
- hybrid method
- scheduling problem
- computational complexity