A greedy-metaheuristic 3-stage approach to construct covering arrays.
Idelfonso Izquierdo-MarquezJose Torres-JimenezBrenda Acevedo-JuárezHimer Avila-GeorgePublished in: Inf. Sci. (2018)
Keyphrases
- metaheuristic
- covering arrays
- search space
- tabu search
- greedy search
- optimization problems
- simulated annealing
- ant colony optimization
- scatter search
- combinatorial optimization
- path relinking
- optimal solution
- genetic algorithm
- test cases
- hill climbing
- vehicle routing problem
- suboptimal solutions
- iterated local search
- greedy algorithm
- particle swarm optimization
- search algorithm
- greedy randomized adaptive search procedure
- benchmark instances
- ant colony optimization metaheuristic
- hybrid metaheuristic
- neural network
- context free grammars
- job shop scheduling problem
- traveling salesman problem
- dynamic programming
- evolutionary algorithm
- branch and bound algorithm
- branch and bound
- vehicle routing problem with time windows
- multi start
- genetic programming
- fuzzy logic
- cost function
- decision trees