Variable Neighborhood Search with Permutation Distance for QAP.
Chong ZhangZhangang LinZuoquan LinPublished in: KES (4) (2005)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- quadratic assignment problem
- traveling salesman problem
- minimum spanning tree
- vehicle routing problem
- single machine scheduling problem
- heuristic methods
- routing problem
- search procedure
- path relinking
- search space
- branch and bound algorithm
- geodesic distance
- feasible solution
- combinatorial optimization
- ant colony optimization
- scheduling problem
- evolutionary algorithm