Generating Hard Test Instances with Known Optimal Solution for the Rectilinear Quadratic Assignment Problem.
Gintaras PalubeckisPublished in: J. Glob. Optim. (1999)
Keyphrases
- quadratic assignment problem
- test instances
- solution quality
- optimal solution
- test problems
- lower bound
- knn
- simulated annealing
- vehicle routing problem
- feasible solution
- knapsack problem
- computational efficiency
- naive bayes
- np hard
- benchmark instances
- metaheuristic
- branch and bound algorithm
- tabu search
- k nearest neighbor
- objective function
- branch and bound
- base classifiers
- search space
- neural network
- combinatorial optimization
- evolutionary algorithm