Breakout local search for the quadratic assignment problem.
Una BenlicJin-Kao HaoPublished in: Appl. Math. Comput. (2013)
Keyphrases
- quadratic assignment problem
- tabu search
- combinatorial optimization
- stochastic local search
- aco algorithm
- aco algorithms
- simulated annealing
- memetic algorithm
- ant colony optimization
- metaheuristic
- lower bound
- scheduling problem
- integer linear programming formulation
- traveling salesman
- search algorithm
- global search
- feasible solution
- heuristic methods
- branch and bound algorithm
- test problems
- satisfiability problem
- branch and bound
- benchmark instances
- optimization problems
- genetic algorithm
- vehicle routing problem
- job shop scheduling problem
- mathematical programming
- neural network
- search strategies
- traveling salesman problem
- genetic algorithm ga